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-171640602300761.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-09, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640602300761
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 21:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 230K Apr 12 21:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 21:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 21:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 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 68K 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-09-CTLCardinality-2024-00
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-2024-01
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-2024-02
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-2024-03
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-2024-04
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-2024-05
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-2024-06
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-2024-07
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-2024-08
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-2024-09
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-2024-10
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-2024-11
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-2023-12
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-2023-13
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-2023-14
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716490733119

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-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 18:58:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 18:58:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 18:58:54] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-05-23 18:58:54] [INFO ] Transformed 157 places.
[2024-05-23 18:58:54] [INFO ] Transformed 327 transitions.
[2024-05-23 18:58:54] [INFO ] Found NUPN structural information;
[2024-05-23 18:58:54] [INFO ] Parsed PT model containing 157 places and 327 transitions and 859 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA HealthRecord-PT-09-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-09-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 77 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 301/301 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 117 transition count 226
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 117 transition count 226
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 115 transition count 222
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 115 transition count 222
Applied a total of 84 rules in 27 ms. Remains 115 /157 variables (removed 42) and now considering 222/301 (removed 79) transitions.
[2024-05-23 18:58:54] [INFO ] Flow matrix only has 215 transitions (discarded 7 similar events)
// Phase 1: matrix 215 rows 115 cols
[2024-05-23 18:58:54] [INFO ] Computed 13 invariants in 17 ms
[2024-05-23 18:58:54] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-23 18:58:54] [INFO ] Flow matrix only has 215 transitions (discarded 7 similar events)
[2024-05-23 18:58:54] [INFO ] Invariant cache hit.
[2024-05-23 18:58:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 18:58:55] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-05-23 18:58:55] [INFO ] Flow matrix only has 215 transitions (discarded 7 similar events)
[2024-05-23 18:58:55] [INFO ] Invariant cache hit.
[2024-05-23 18:58:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-23 18:58:56] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 13 ms to minimize.
[2024-05-23 18:58:56] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 2 ms to minimize.
[2024-05-23 18:58:56] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-23 18:58:56] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:58:56] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-23 18:58:56] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-23 18:58:56] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:58:56] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-23 18:58:57] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 0 ms to minimize.
[2024-05-23 18:58:57] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-23 18:58:57] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:58:57] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-23 18:58:57] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:58:57] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:58:57] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:58:57] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-23 18:58:57] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-23 18:58:57] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-23 18:58:57] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:58:57] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-23 18:58:58] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-23 18:58:58] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-23 18:58:58] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-23 18:58:58] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-23 18:58:58] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-23 18:58:58] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-23 18:58:58] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-23 18:58:58] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-23 18:58:58] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-23 18:58:58] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-23 18:58:58] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-23 18:58:58] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:58:58] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2024-05-23 18:58:59] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-23 18:58:59] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 15/48 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-23 18:58:59] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-23 18:58:59] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-23 18:58:59] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-23 18:58:59] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-23 18:58:59] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 2 ms to minimize.
[2024-05-23 18:58:59] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:58:59] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:58:59] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 0 ms to minimize.
[2024-05-23 18:58:59] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:58:59] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-23 18:58:59] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-23 18:59:00] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-23 18:59:00] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-23 18:59:00] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-23 18:59:00] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:59:00] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-05-23 18:59:00] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2024-05-23 18:59:00] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 0 ms to minimize.
[2024-05-23 18:59:00] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 0 ms to minimize.
[2024-05-23 18:59:00] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-23 18:59:00] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-23 18:59:00] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-23 18:59:00] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-23 18:59:00] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-23 18:59:00] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-23 18:59:00] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-23 18:59:01] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 7/75 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-23 18:59:02] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 4 ms to minimize.
[2024-05-23 18:59:02] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 2 ms to minimize.
[2024-05-23 18:59:02] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:59:02] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:59:02] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:59:02] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-23 18:59:02] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-23 18:59:02] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-23 18:59:02] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-23 18:59:02] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-05-23 18:59:02] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-05-23 18:59:02] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-23 18:59:02] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-23 18:59:03] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-23 18:59:03] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-23 18:59:03] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 16/91 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-23 18:59:03] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-23 18:59:03] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:59:03] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-23 18:59:03] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:59:03] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-23 18:59:03] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-23 18:59:03] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-23 18:59:03] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 8/99 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-23 18:59:04] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-23 18:59:04] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:59:04] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-23 18:59:04] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:59:04] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-23 18:59:04] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 6/105 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (OVERLAPS) 214/329 variables, 115/220 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-23 18:59:06] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2024-05-23 18:59:06] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-23 18:59:07] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-23 18:59:07] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/329 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/329 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 14 (OVERLAPS) 1/330 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-23 18:59:10] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-23 18:59:10] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-05-23 18:59:10] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/330 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/330 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 17 (OVERLAPS) 0/330 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 228 constraints, problems are : Problem set: 0 solved, 221 unsolved in 19408 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 99/99 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 99/112 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-23 18:59:15] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 214/329 variables, 115/228 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 221/449 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 1/330 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 450 constraints, problems are : Problem set: 0 solved, 221 unsolved in 21730 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 100/100 constraints]
After SMT, in 41293ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 41315ms
Starting structural reductions in LTL mode, iteration 1 : 115/157 places, 222/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41778 ms. Remains : 115/157 places, 222/301 transitions.
Support contains 77 out of 115 places after structural reductions.
[2024-05-23 18:59:36] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-23 18:59:36] [INFO ] Flatten gal took : 41 ms
FORMULA HealthRecord-PT-09-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 18:59:36] [INFO ] Flatten gal took : 15 ms
[2024-05-23 18:59:36] [INFO ] Input system was already deterministic with 222 transitions.
Support contains 65 out of 115 places (down from 77) after GAL structural reductions.
FORMULA HealthRecord-PT-09-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (2363 resets) in 2459 ms. (16 steps per ms) remains 22/50 properties
BEST_FIRST walk for 4002 steps (33 resets) in 31 ms. (125 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (36 resets) in 56 ms. (70 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (31 resets) in 58 ms. (67 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (35 resets) in 61 ms. (64 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (33 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (33 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (32 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (32 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (38 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (34 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (35 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (34 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (31 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (36 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (34 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (37 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (33 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (33 resets) in 25 ms. (154 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (32 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (35 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (31 resets) in 16 ms. (235 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4004 steps (34 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
[2024-05-23 18:59:37] [INFO ] Flow matrix only has 215 transitions (discarded 7 similar events)
[2024-05-23 18:59:37] [INFO ] Invariant cache hit.
[2024-05-23 18:59:37] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 34/65 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 50/115 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-23 18:59:37] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
Problem AtomicPropp21 is UNSAT
[2024-05-23 18:59:37] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 0 ms to minimize.
[2024-05-23 18:59:37] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:59:37] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 4/17 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-05-23 18:59:38] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-05-23 18:59:38] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-23 18:59:38] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:59:38] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 0 ms to minimize.
[2024-05-23 18:59:38] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-23 18:59:38] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 0 ms to minimize.
[2024-05-23 18:59:38] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 6/24 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-05-23 18:59:38] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-05-23 18:59:38] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 0 ms to minimize.
[2024-05-23 18:59:38] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:59:38] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:59:38] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-05-23 18:59:38] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:59:38] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:59:38] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-23 18:59:38] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-23 18:59:38] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-23 18:59:39] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:59:39] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-23 18:59:39] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 0 ms to minimize.
[2024-05-23 18:59:39] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-23 18:59:39] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 0 ms to minimize.
[2024-05-23 18:59:39] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2024-05-23 18:59:39] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
Problem AtomicPropp15 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 17/41 constraints. Problems are: Problem set: 2 solved, 19 unsolved
[2024-05-23 18:59:39] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 1/42 constraints. Problems are: Problem set: 2 solved, 19 unsolved
[2024-05-23 18:59:39] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2024-05-23 18:59:39] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:59:39] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:59:39] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:59:39] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-23 18:59:39] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2024-05-23 18:59:39] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-23 18:59:39] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:59:39] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-23 18:59:39] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-23 18:59:40] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 11/53 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 0/53 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 214/329 variables, 115/168 constraints. Problems are: Problem set: 2 solved, 19 unsolved
[2024-05-23 18:59:40] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-23 18:59:40] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-23 18:59:40] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-23 18:59:40] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/329 variables, 4/172 constraints. Problems are: Problem set: 2 solved, 19 unsolved
[2024-05-23 18:59:40] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/329 variables, 1/173 constraints. Problems are: Problem set: 2 solved, 19 unsolved
[2024-05-23 18:59:40] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-23 18:59:40] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 0 ms to minimize.
[2024-05-23 18:59:40] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:59:40] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-23 18:59:41] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 0 ms to minimize.
[2024-05-23 18:59:41] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/329 variables, 6/179 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/329 variables, 0/179 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 16 (OVERLAPS) 1/330 variables, 1/180 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/330 variables, 0/180 constraints. Problems are: Problem set: 2 solved, 19 unsolved
[2024-05-23 18:59:41] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/330 variables, 1/181 constraints. Problems are: Problem set: 2 solved, 19 unsolved
[2024-05-23 18:59:41] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/330 variables, 1/182 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/330 variables, 0/182 constraints. Problems are: Problem set: 2 solved, 19 unsolved
[2024-05-23 18:59:42] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:59:42] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/330 variables, 2/184 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/330 variables, 0/184 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 23 (OVERLAPS) 0/330 variables, 0/184 constraints. Problems are: Problem set: 2 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 184 constraints, problems are : Problem set: 2 solved, 19 unsolved in 4970 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 2 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 38/65 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 19 unsolved
Problem AtomicPropp24 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 2/7 constraints. Problems are: Problem set: 3 solved, 18 unsolved
[2024-05-23 18:59:42] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-23 18:59:42] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-23 18:59:42] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-05-23 18:59:42] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
[2024-05-23 18:59:42] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 5/12 constraints. Problems are: Problem set: 3 solved, 18 unsolved
[2024-05-23 18:59:42] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/13 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 50/115 variables, 8/21 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 53/74 constraints. Problems are: Problem set: 3 solved, 18 unsolved
[2024-05-23 18:59:43] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-23 18:59:43] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:59:43] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:59:43] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:59:43] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:59:43] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:59:43] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-23 18:59:43] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 0 ms to minimize.
[2024-05-23 18:59:43] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-23 18:59:43] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-23 18:59:43] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-23 18:59:43] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-23 18:59:43] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:59:43] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-23 18:59:43] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-23 18:59:43] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:59:43] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-23 18:59:44] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:59:44] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 19/93 constraints. Problems are: Problem set: 3 solved, 18 unsolved
[2024-05-23 18:59:44] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-05-23 18:59:44] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:59:44] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-05-23 18:59:44] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 4/97 constraints. Problems are: Problem set: 3 solved, 18 unsolved
[2024-05-23 18:59:44] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-23 18:59:44] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-23 18:59:44] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 3/100 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/115 variables, 0/100 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 214/329 variables, 115/215 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/329 variables, 18/233 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/329 variables, 0/233 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 1/330 variables, 1/234 constraints. Problems are: Problem set: 3 solved, 18 unsolved
[2024-05-23 18:59:45] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-23 18:59:45] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/330 variables, 2/236 constraints. Problems are: Problem set: 3 solved, 18 unsolved
[2024-05-23 18:59:45] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/330 variables, 1/237 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/330 variables, 0/237 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 19 (OVERLAPS) 0/330 variables, 0/237 constraints. Problems are: Problem set: 3 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 237 constraints, problems are : Problem set: 3 solved, 18 unsolved in 3622 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/21 constraints, Known Traps: 90/90 constraints]
After SMT, in 8600ms problems are : Problem set: 3 solved, 18 unsolved
Fused 18 Parikh solutions to 15 different solutions.
Parikh walk visited 17 properties in 771 ms.
Support contains 1 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 222/222 transitions.
Graph (trivial) has 162 edges and 115 vertex of which 12 / 115 are part of one of the 6 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 468 edges and 109 vertex of which 105 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 105 transition count 198
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 8 rules applied. Total rules applied 14 place count 101 transition count 194
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 100 transition count 193
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 16 place count 100 transition count 190
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 24 place count 95 transition count 190
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 72 place count 47 transition count 94
Iterating global reduction 3 with 48 rules applied. Total rules applied 120 place count 47 transition count 94
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 126 place count 41 transition count 81
Iterating global reduction 3 with 6 rules applied. Total rules applied 132 place count 41 transition count 81
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 141 place count 41 transition count 72
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 144 place count 38 transition count 64
Iterating global reduction 4 with 3 rules applied. Total rules applied 147 place count 38 transition count 64
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 150 place count 38 transition count 61
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 152 place count 36 transition count 57
Iterating global reduction 5 with 2 rules applied. Total rules applied 154 place count 36 transition count 57
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 160 place count 36 transition count 51
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 6 with 2 rules applied. Total rules applied 162 place count 35 transition count 50
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 174 place count 29 transition count 87
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 176 place count 29 transition count 85
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 178 place count 29 transition count 83
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 180 place count 27 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 183 place count 27 transition count 80
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 192 place count 27 transition count 80
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 200 place count 27 transition count 80
Applied a total of 200 rules in 54 ms. Remains 27 /115 variables (removed 88) and now considering 80/222 (removed 142) transitions.
Running 64 sub problems to find dead transitions.
[2024-05-23 18:59:47] [INFO ] Flow matrix only has 72 transitions (discarded 8 similar events)
// Phase 1: matrix 72 rows 27 cols
[2024-05-23 18:59:47] [INFO ] Computed 7 invariants in 4 ms
[2024-05-23 18:59:47] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 2/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
At refinement iteration 4 (OVERLAPS) 72/99 variables, 27/34 constraints. Problems are: Problem set: 9 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 25/59 constraints. Problems are: Problem set: 9 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/59 constraints. Problems are: Problem set: 9 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/99 variables, 0/59 constraints. Problems are: Problem set: 9 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 59 constraints, problems are : Problem set: 9 solved, 55 unsolved in 550 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 27/27 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 2/26 variables, 1/1 constraints. Problems are: Problem set: 9 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 9 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 1/27 variables, 6/7 constraints. Problems are: Problem set: 9 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 9 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 72/99 variables, 27/34 constraints. Problems are: Problem set: 9 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 25/59 constraints. Problems are: Problem set: 9 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 55/114 constraints. Problems are: Problem set: 9 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/114 constraints. Problems are: Problem set: 9 solved, 55 unsolved
At refinement iteration 9 (OVERLAPS) 0/99 variables, 0/114 constraints. Problems are: Problem set: 9 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 114 constraints, problems are : Problem set: 9 solved, 55 unsolved in 1002 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 27/27 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 55/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 1626ms problems are : Problem set: 9 solved, 55 unsolved
Search for dead transitions found 9 dead transitions in 1627ms
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 : 27/115 places, 71/222 transitions.
Graph (complete) has 102 edges and 27 vertex of which 26 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 26 transition count 71
Applied a total of 2 rules in 9 ms. Remains 26 /27 variables (removed 1) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1691 ms. Remains : 26/115 places, 71/222 transitions.
RANDOM walk for 40000 steps (12408 resets) in 1139 ms. (35 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1450 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1025 steps, run visited all 1 properties in 11 ms. (steps per millisecond=93 )
Probabilistic random walk after 1025 steps, saw 424 distinct states, run finished after 14 ms. (steps per millisecond=73 ) properties seen :1
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
FORMULA HealthRecord-PT-09-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 18:59:49] [INFO ] Flatten gal took : 10 ms
[2024-05-23 18:59:49] [INFO ] Flatten gal took : 11 ms
[2024-05-23 18:59:49] [INFO ] Input system was already deterministic with 222 transitions.
Computed a total of 12 stabilizing places and 20 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 222/222 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 69 transition count 133
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 69 transition count 133
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 97 place count 64 transition count 122
Iterating global reduction 0 with 5 rules applied. Total rules applied 102 place count 64 transition count 122
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 109 place count 64 transition count 115
Applied a total of 109 rules in 5 ms. Remains 64 /115 variables (removed 51) and now considering 115/222 (removed 107) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 64/115 places, 115/222 transitions.
[2024-05-23 18:59:49] [INFO ] Flatten gal took : 5 ms
[2024-05-23 18:59:49] [INFO ] Flatten gal took : 6 ms
[2024-05-23 18:59:49] [INFO ] Input system was already deterministic with 115 transitions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 222/222 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 62 transition count 120
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 62 transition count 120
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 111 place count 57 transition count 110
Iterating global reduction 0 with 5 rules applied. Total rules applied 116 place count 57 transition count 110
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 124 place count 57 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 55 transition count 96
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 55 transition count 96
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 130 place count 53 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 53 transition count 92
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 138 place count 53 transition count 86
Applied a total of 138 rules in 6 ms. Remains 53 /115 variables (removed 62) and now considering 86/222 (removed 136) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 53/115 places, 86/222 transitions.
[2024-05-23 18:59:49] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:59:49] [INFO ] Flatten gal took : 5 ms
[2024-05-23 18:59:49] [INFO ] Input system was already deterministic with 86 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 115/115 places, 222/222 transitions.
Graph (trivial) has 159 edges and 115 vertex of which 10 / 115 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 52 place count 58 transition count 118
Iterating global reduction 0 with 51 rules applied. Total rules applied 103 place count 58 transition count 118
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 109 place count 52 transition count 105
Iterating global reduction 0 with 6 rules applied. Total rules applied 115 place count 52 transition count 105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 124 place count 52 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 127 place count 49 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 130 place count 49 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 132 place count 49 transition count 86
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 134 place count 47 transition count 82
Iterating global reduction 2 with 2 rules applied. Total rules applied 136 place count 47 transition count 82
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 142 place count 47 transition count 76
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 145 place count 47 transition count 73
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 3 with 2 rules applied. Total rules applied 147 place count 46 transition count 72
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 149 place count 44 transition count 70
Applied a total of 149 rules in 22 ms. Remains 44 /115 variables (removed 71) and now considering 70/222 (removed 152) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 44/115 places, 70/222 transitions.
[2024-05-23 18:59:49] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:59:49] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:59:49] [INFO ] Input system was already deterministic with 70 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 115/115 places, 222/222 transitions.
Graph (trivial) has 153 edges and 115 vertex of which 10 / 115 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 50 place count 60 transition count 122
Iterating global reduction 0 with 49 rules applied. Total rules applied 99 place count 60 transition count 122
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 103 place count 56 transition count 114
Iterating global reduction 0 with 4 rules applied. Total rules applied 107 place count 56 transition count 114
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 112 place count 56 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 55 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 55 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 54 transition count 104
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 54 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 119 place count 54 transition count 101
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 123 place count 54 transition count 97
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 125 place count 53 transition count 96
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 127 place count 51 transition count 94
Applied a total of 127 rules in 21 ms. Remains 51 /115 variables (removed 64) and now considering 94/222 (removed 128) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 51/115 places, 94/222 transitions.
[2024-05-23 18:59:49] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:59:49] [INFO ] Flatten gal took : 5 ms
[2024-05-23 18:59:49] [INFO ] Input system was already deterministic with 94 transitions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 222/222 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 64 transition count 123
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 64 transition count 123
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 107 place count 59 transition count 113
Iterating global reduction 0 with 5 rules applied. Total rules applied 112 place count 59 transition count 113
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 120 place count 59 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 58 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 58 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 57 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 57 transition count 100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 127 place count 57 transition count 97
Applied a total of 127 rules in 5 ms. Remains 57 /115 variables (removed 58) and now considering 97/222 (removed 125) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 57/115 places, 97/222 transitions.
[2024-05-23 18:59:49] [INFO ] Flatten gal took : 5 ms
[2024-05-23 18:59:49] [INFO ] Flatten gal took : 6 ms
[2024-05-23 18:59:49] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 222/222 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 64 transition count 123
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 64 transition count 123
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 106 place count 60 transition count 115
Iterating global reduction 0 with 4 rules applied. Total rules applied 110 place count 60 transition count 115
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 116 place count 60 transition count 109
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 118 place count 58 transition count 103
Iterating global reduction 1 with 2 rules applied. Total rules applied 120 place count 58 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 122 place count 56 transition count 99
Iterating global reduction 1 with 2 rules applied. Total rules applied 124 place count 56 transition count 99
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 130 place count 56 transition count 93
Applied a total of 130 rules in 4 ms. Remains 56 /115 variables (removed 59) and now considering 93/222 (removed 129) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 56/115 places, 93/222 transitions.
[2024-05-23 18:59:49] [INFO ] Flatten gal took : 5 ms
[2024-05-23 18:59:49] [INFO ] Flatten gal took : 5 ms
[2024-05-23 18:59:49] [INFO ] Input system was already deterministic with 93 transitions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 222/222 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 72 transition count 139
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 72 transition count 139
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 91 place count 67 transition count 129
Iterating global reduction 0 with 5 rules applied. Total rules applied 96 place count 67 transition count 129
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 104 place count 67 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 66 transition count 118
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 66 transition count 118
Applied a total of 106 rules in 3 ms. Remains 66 /115 variables (removed 49) and now considering 118/222 (removed 104) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 66/115 places, 118/222 transitions.
[2024-05-23 18:59:49] [INFO ] Flatten gal took : 5 ms
[2024-05-23 18:59:49] [INFO ] Flatten gal took : 5 ms
[2024-05-23 18:59:49] [INFO ] Input system was already deterministic with 118 transitions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 222/222 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 62 transition count 120
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 62 transition count 120
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 111 place count 57 transition count 110
Iterating global reduction 0 with 5 rules applied. Total rules applied 116 place count 57 transition count 110
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 125 place count 57 transition count 101
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 127 place count 55 transition count 95
Iterating global reduction 1 with 2 rules applied. Total rules applied 129 place count 55 transition count 95
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 131 place count 53 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 133 place count 53 transition count 91
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 139 place count 53 transition count 85
Applied a total of 139 rules in 3 ms. Remains 53 /115 variables (removed 62) and now considering 85/222 (removed 137) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 53/115 places, 85/222 transitions.
[2024-05-23 18:59:49] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:59:49] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:59:49] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 115/115 places, 222/222 transitions.
Graph (trivial) has 159 edges and 115 vertex of which 12 / 115 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 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 52 place count 58 transition count 118
Iterating global reduction 0 with 51 rules applied. Total rules applied 103 place count 58 transition count 118
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 109 place count 52 transition count 105
Iterating global reduction 0 with 6 rules applied. Total rules applied 115 place count 52 transition count 105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 124 place count 52 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 127 place count 49 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 130 place count 49 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 133 place count 49 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 135 place count 47 transition count 81
Iterating global reduction 2 with 2 rules applied. Total rules applied 137 place count 47 transition count 81
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 143 place count 47 transition count 75
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 147 place count 47 transition count 71
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 153 place count 44 transition count 68
Applied a total of 153 rules in 14 ms. Remains 44 /115 variables (removed 71) and now considering 68/222 (removed 154) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 44/115 places, 68/222 transitions.
[2024-05-23 18:59:49] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:59:49] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:59:49] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 222/222 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 65 transition count 126
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 65 transition count 126
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 106 place count 59 transition count 113
Iterating global reduction 0 with 6 rules applied. Total rules applied 112 place count 59 transition count 113
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 119 place count 59 transition count 106
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 122 place count 56 transition count 98
Iterating global reduction 1 with 3 rules applied. Total rules applied 125 place count 56 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 128 place count 56 transition count 95
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 130 place count 54 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 54 transition count 91
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 137 place count 54 transition count 86
Applied a total of 137 rules in 3 ms. Remains 54 /115 variables (removed 61) and now considering 86/222 (removed 136) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 54/115 places, 86/222 transitions.
[2024-05-23 18:59:49] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:59:49] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:59:49] [INFO ] Input system was already deterministic with 86 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 115/115 places, 222/222 transitions.
Graph (trivial) has 157 edges and 115 vertex of which 12 / 115 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 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 51 place count 59 transition count 120
Iterating global reduction 0 with 50 rules applied. Total rules applied 101 place count 59 transition count 120
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 107 place count 53 transition count 107
Iterating global reduction 0 with 6 rules applied. Total rules applied 113 place count 53 transition count 107
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 122 place count 53 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 124 place count 51 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 126 place count 51 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 129 place count 51 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 130 place count 50 transition count 88
Iterating global reduction 2 with 1 rules applied. Total rules applied 131 place count 50 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 134 place count 50 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 138 place count 50 transition count 81
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 144 place count 47 transition count 78
Applied a total of 144 rules in 13 ms. Remains 47 /115 variables (removed 68) and now considering 78/222 (removed 144) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 47/115 places, 78/222 transitions.
[2024-05-23 18:59:49] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:59:49] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:59:49] [INFO ] Input system was already deterministic with 78 transitions.
[2024-05-23 18:59:49] [INFO ] Flatten gal took : 9 ms
[2024-05-23 18:59:49] [INFO ] Flatten gal took : 8 ms
[2024-05-23 18:59:49] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-23 18:59:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 115 places, 222 transitions and 631 arcs took 3 ms.
Total runtime 55105 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running HealthRecord-PT-09

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/399/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: 1122
MODEL NAME: /home/mcc/execution/399/model
115 places, 222 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-09-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-09-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-09-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-09-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-09-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-09-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-09-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-09-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-09-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-09-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-09-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716490823245

--------------------
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-09"
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-09, 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-171640602300761"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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