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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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 25K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 20:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 12 20:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 20:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 20:29 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 69K 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-10-CTLFireability-2024-00
FORMULA_NAME HealthRecord-PT-10-CTLFireability-2024-01
FORMULA_NAME HealthRecord-PT-10-CTLFireability-2024-02
FORMULA_NAME HealthRecord-PT-10-CTLFireability-2024-03
FORMULA_NAME HealthRecord-PT-10-CTLFireability-2024-04
FORMULA_NAME HealthRecord-PT-10-CTLFireability-2024-05
FORMULA_NAME HealthRecord-PT-10-CTLFireability-2024-06
FORMULA_NAME HealthRecord-PT-10-CTLFireability-2024-07
FORMULA_NAME HealthRecord-PT-10-CTLFireability-2024-08
FORMULA_NAME HealthRecord-PT-10-CTLFireability-2024-09
FORMULA_NAME HealthRecord-PT-10-CTLFireability-2024-10
FORMULA_NAME HealthRecord-PT-10-CTLFireability-2024-11
FORMULA_NAME HealthRecord-PT-10-CTLFireability-2023-12
FORMULA_NAME HealthRecord-PT-10-CTLFireability-2023-13
FORMULA_NAME HealthRecord-PT-10-CTLFireability-2023-14
FORMULA_NAME HealthRecord-PT-10-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716490838185

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-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 19:00:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 19:00:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 19:00:39] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-05-23 19:00:39] [INFO ] Transformed 158 places.
[2024-05-23 19:00:39] [INFO ] Transformed 333 transitions.
[2024-05-23 19:00:39] [INFO ] Found NUPN structural information;
[2024-05-23 19:00:39] [INFO ] Parsed PT model containing 158 places and 333 transitions and 875 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
Support contains 70 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 306/306 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 113 transition count 220
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 113 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 112 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 112 transition count 218
Applied a total of 92 rules in 25 ms. Remains 112 /158 variables (removed 46) and now considering 218/306 (removed 88) transitions.
[2024-05-23 19:00:39] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
// Phase 1: matrix 210 rows 112 cols
[2024-05-23 19:00:39] [INFO ] Computed 14 invariants in 16 ms
[2024-05-23 19:00:39] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-23 19:00:39] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2024-05-23 19:00:39] [INFO ] Invariant cache hit.
[2024-05-23 19:00:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 19:00:40] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-05-23 19:00:40] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2024-05-23 19:00:40] [INFO ] Invariant cache hit.
[2024-05-23 19:00:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-23 19:00:41] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 12 ms to minimize.
[2024-05-23 19:00:41] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:00:41] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:00:41] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:00:41] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:00:42] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-23 19:00:42] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-23 19:00:42] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-23 19:00:42] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:00:42] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-23 19:00:42] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
[2024-05-23 19:00:42] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-23 19:00:43] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2024-05-23 19:00:43] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-23 19:00:43] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-23 19:00:43] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 3 ms to minimize.
[2024-05-23 19:00:43] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
[2024-05-23 19:00:43] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-23 19:00:44] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-23 19:00:44] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-23 19:00:44] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:00:44] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 3 ms to minimize.
[2024-05-23 19:00:44] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-23 19:00:44] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-23 19:00:44] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 0 ms to minimize.
[2024-05-23 19:00:44] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:00:44] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:00:45] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:00:45] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:00:45] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 3 ms to minimize.
[2024-05-23 19:00:45] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:00:45] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:00:45] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:00:45] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:00:45] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 4 ms to minimize.
[2024-05-23 19:00:45] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-23 19:00:45] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:00:45] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-23 19:00:46] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:00:46] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 2 ms to minimize.
[2024-05-23 19:00:46] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:00:46] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:00:46] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-23 19:00:47] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:00:47] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:00:47] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:00:47] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:00:47] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-23 19:00:47] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-23 19:00:47] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 209/321 variables, 112/176 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-23 19:00:49] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:00:49] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/321 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-23 19:00:50] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:00:50] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/321 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-23 19:00:52] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/321 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/321 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 15 (OVERLAPS) 1/322 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/322 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 17 (OVERLAPS) 0/322 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 182 constraints, problems are : Problem set: 0 solved, 217 unsolved in 16637 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 55/69 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-23 19:00:58] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-23 19:00:58] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 3 ms to minimize.
[2024-05-23 19:00:58] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:00:58] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:00:58] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:00:58] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:00:58] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-23 19:00:58] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 7/77 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-23 19:00:59] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:00:59] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-05-23 19:00:59] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:00:59] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:00:59] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:00:59] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 209/321 variables, 112/195 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 217/412 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-23 19:01:01] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/321 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/321 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 12 (OVERLAPS) 1/322 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-23 19:01:08] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-23 19:01:08] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 0 ms to minimize.
[2024-05-23 19:01:08] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 3/417 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-23 19:01:11] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:01:11] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/322 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/322 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 16 (OVERLAPS) 0/322 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 419 constraints, problems are : Problem set: 0 solved, 217 unsolved in 25575 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 75/75 constraints]
After SMT, in 42438ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 42457ms
Starting structural reductions in LTL mode, iteration 1 : 112/158 places, 218/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42914 ms. Remains : 112/158 places, 218/306 transitions.
Support contains 70 out of 112 places after structural reductions.
[2024-05-23 19:01:22] [INFO ] Flatten gal took : 39 ms
[2024-05-23 19:01:22] [INFO ] Flatten gal took : 15 ms
[2024-05-23 19:01:22] [INFO ] Input system was already deterministic with 218 transitions.
RANDOM walk for 40000 steps (2539 resets) in 1765 ms. (22 steps per ms) remains 33/73 properties
BEST_FIRST walk for 4002 steps (29 resets) in 42 ms. (93 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (34 resets) in 41 ms. (95 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (30 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (31 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (30 resets) in 13 ms. (285 steps per ms) remains 29/33 properties
BEST_FIRST walk for 4004 steps (26 resets) in 36 ms. (108 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (23 resets) in 38 ms. (102 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (34 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (33 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (25 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (34 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (29 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (30 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (32 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (32 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (33 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (29 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (32 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (29 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (29 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (29 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (30 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (30 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (32 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (28 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (32 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (31 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (30 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (33 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (21 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
[2024-05-23 19:01:23] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2024-05-23 19:01:23] [INFO ] Invariant cache hit.
[2024-05-23 19:01:23] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp46 is UNSAT
At refinement iteration 1 (OVERLAPS) 37/78 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 27 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 3 (OVERLAPS) 34/112 variables, 8/14 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 209/321 variables, 112/126 constraints. Problems are: Problem set: 3 solved, 26 unsolved
[2024-05-23 19:01:24] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 1/127 constraints. Problems are: Problem set: 3 solved, 26 unsolved
[2024-05-23 19:01:24] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-23 19:01:24] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-05-23 19:01:24] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 3/130 constraints. Problems are: Problem set: 3 solved, 26 unsolved
[2024-05-23 19:01:24] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:01:24] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 2/132 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 0/132 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 1/322 variables, 1/133 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 0/133 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 12 (OVERLAPS) 0/322 variables, 0/133 constraints. Problems are: Problem set: 3 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 133 constraints, problems are : Problem set: 3 solved, 26 unsolved in 1492 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 3 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 42/77 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 26 unsolved
[2024-05-23 19:01:25] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:01:25] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-23 19:01:25] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-23 19:01:25] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:01:25] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 5/11 constraints. Problems are: Problem set: 3 solved, 26 unsolved
[2024-05-23 19:01:25] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:01:25] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 1 ms to minimize.
[2024-05-23 19:01:25] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 0 ms to minimize.
[2024-05-23 19:01:25] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 4/15 constraints. Problems are: Problem set: 3 solved, 26 unsolved
[2024-05-23 19:01:25] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 1/16 constraints. Problems are: Problem set: 3 solved, 26 unsolved
[2024-05-23 19:01:25] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 1/17 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/17 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 35/112 variables, 8/25 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 6/31 constraints. Problems are: Problem set: 3 solved, 26 unsolved
[2024-05-23 19:01:26] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-05-23 19:01:26] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-23 19:01:26] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:01:26] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:01:26] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2024-05-23 19:01:26] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-05-23 19:01:26] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:01:26] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-23 19:01:26] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2024-05-23 19:01:26] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:01:26] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:01:26] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:01:26] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:01:26] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2024-05-23 19:01:26] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:01:26] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:01:26] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-23 19:01:26] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:01:26] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:01:27] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 20/51 constraints. Problems are: Problem set: 3 solved, 26 unsolved
[2024-05-23 19:01:27] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:01:27] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-23 19:01:27] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:01:27] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-23 19:01:27] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:01:27] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-23 19:01:27] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-23 19:01:27] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:01:27] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:01:27] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-23 19:01:27] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:01:27] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:01:27] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-05-23 19:01:27] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:01:27] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-23 19:01:27] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-23 19:01:27] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 0 ms to minimize.
[2024-05-23 19:01:27] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:01:28] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:01:28] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 20/71 constraints. Problems are: Problem set: 3 solved, 26 unsolved
[2024-05-23 19:01:28] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:01:28] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:01:28] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-05-23 19:01:28] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-23 19:01:28] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-23 19:01:28] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-23 19:01:28] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2024-05-23 19:01:28] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/112 variables, 8/79 constraints. Problems are: Problem set: 3 solved, 26 unsolved
[2024-05-23 19:01:28] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:01:28] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:01:28] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:01:28] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:01:28] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/112 variables, 5/84 constraints. Problems are: Problem set: 3 solved, 26 unsolved
[2024-05-23 19:01:28] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/112 variables, 1/85 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/112 variables, 0/85 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 15 (OVERLAPS) 209/321 variables, 112/197 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/321 variables, 26/223 constraints. Problems are: Problem set: 3 solved, 26 unsolved
[2024-05-23 19:01:29] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/321 variables, 1/224 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/321 variables, 0/224 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 19 (OVERLAPS) 1/322 variables, 1/225 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/322 variables, 0/225 constraints. Problems are: Problem set: 3 solved, 26 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/322 variables, and 225 constraints, problems are : Problem set: 3 solved, 26 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 26/29 constraints, Known Traps: 72/72 constraints]
After SMT, in 6524ms problems are : Problem set: 3 solved, 26 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 218/218 transitions.
Graph (trivial) has 74 edges and 112 vertex of which 10 / 112 are part of one of the 5 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 477 edges and 107 vertex of which 103 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 103 transition count 197
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 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 11 place count 100 transition count 193
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 11 place count 100 transition count 191
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 16 place count 97 transition count 191
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 37 place count 76 transition count 150
Iterating global reduction 3 with 21 rules applied. Total rules applied 58 place count 76 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 59 place count 76 transition count 149
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 64 place count 71 transition count 139
Iterating global reduction 4 with 5 rules applied. Total rules applied 69 place count 71 transition count 139
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 76 place count 71 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 78 place count 70 transition count 131
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 82 place count 68 transition count 136
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 83 place count 68 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 84 place count 67 transition count 135
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 6 with 15 rules applied. Total rules applied 99 place count 67 transition count 135
Applied a total of 99 rules in 53 ms. Remains 67 /112 variables (removed 45) and now considering 135/218 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 67/112 places, 135/218 transitions.
RANDOM walk for 40000 steps (2644 resets) in 735 ms. (54 steps per ms) remains 19/26 properties
BEST_FIRST walk for 4003 steps (66 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (57 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (41 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (65 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (57 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (51 resets) in 21 ms. (182 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (61 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (55 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (54 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (59 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (57 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (53 resets) in 14 ms. (266 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4004 steps (59 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (56 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (52 resets) in 22 ms. (173 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (50 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (66 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (60 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (37 resets) in 9 ms. (400 steps per ms) remains 17/18 properties
[2024-05-23 19:01:30] [INFO ] Flow matrix only has 132 transitions (discarded 3 similar events)
// Phase 1: matrix 132 rows 67 cols
[2024-05-23 19:01:30] [INFO ] Computed 9 invariants in 3 ms
[2024-05-23 19:01:30] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 46/67 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 132/199 variables, 67/76 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/199 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 79 constraints, problems are : Problem set: 0 solved, 17 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 67/67 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 46/67 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-23 19:01:30] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
[2024-05-23 19:01:31] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-23 19:01:31] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-23 19:01:31] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:01:31] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2024-05-23 19:01:31] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-23 19:01:31] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-05-23 19:01:31] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:01:31] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-23 19:01:31] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:01:31] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-23 19:01:31] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-23 19:01:31] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-23 19:01:31] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-23 19:01:31] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-23 19:01:31] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:01:31] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-23 19:01:31] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-23 19:01:31] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-23 19:01:31] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-23 19:01:31] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-23 19:01:31] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-23 19:01:31] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-23 19:01:31] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-23 19:01:31] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-23 19:01:31] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-05-23 19:01:31] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-23 19:01:32] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-23 19:01:32] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:01:32] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-23 19:01:32] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-23 19:01:32] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-23 19:01:32] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:01:32] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-05-23 19:01:32] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-23 19:01:32] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 0 ms to minimize.
[2024-05-23 19:01:32] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2024-05-23 19:01:32] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-23 19:01:32] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 0 ms to minimize.
[2024-05-23 19:01:32] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-05-23 19:01:32] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-23 19:01:32] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-05-23 19:01:32] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2024-05-23 19:01:32] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-23 19:01:32] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:01:32] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-23 19:01:32] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2024-05-23 19:01:32] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-23 19:01:33] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:01:33] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2024-05-23 19:01:33] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-23 19:01:33] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-23 19:01:33] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 132/199 variables, 67/129 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 17/149 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-23 19:01:33] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-23 19:01:33] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-23 19:01:33] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-23 19:01:33] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-05-23 19:01:33] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/199 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 0/199 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 154 constraints, problems are : Problem set: 0 solved, 17 unsolved in 3197 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 67/67 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 58/58 constraints]
After SMT, in 3446ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 13 different solutions.
Parikh walk visited 13 properties in 1535 ms.
Support contains 9 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 135/135 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 51 transition count 103
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 51 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 51 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 50 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 50 transition count 100
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 48 transition count 111
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 48 transition count 109
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 48 transition count 107
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 45 place count 46 transition count 107
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 50 place count 46 transition count 107
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 44 transition count 103
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 44 transition count 103
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 42 transition count 97
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 42 transition count 97
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 41 transition count 95
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 41 transition count 95
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 64 place count 41 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
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 66 place count 40 transition count 102
Applied a total of 66 rules in 42 ms. Remains 40 /67 variables (removed 27) and now considering 102/135 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 40/67 places, 102/135 transitions.
RANDOM walk for 40000 steps (2577 resets) in 121 ms. (327 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (561 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (465 resets) in 30 ms. (1290 steps per ms) remains 1/2 properties
[2024-05-23 19:01:35] [INFO ] Flow matrix only has 91 transitions (discarded 11 similar events)
// Phase 1: matrix 91 rows 40 cols
[2024-05-23 19:01:35] [INFO ] Computed 9 invariants in 1 ms
[2024-05-23 19:01:35] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/39 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/40 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 19:01:35] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 91/131 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 28/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/131 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 40/40 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/39 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 91/131 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 28/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 79 constraints, problems are : Problem set: 0 solved, 1 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 40/40 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 175ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 65 steps, including 6 resets, run visited all 1 properties in 1 ms. (steps per millisecond=65 )
Parikh walk visited 1 properties in 5 ms.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
FORMULA HealthRecord-PT-10-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 19:01:35] [INFO ] Flatten gal took : 11 ms
[2024-05-23 19:01:35] [INFO ] Flatten gal took : 11 ms
[2024-05-23 19:01:35] [INFO ] Input system was already deterministic with 218 transitions.
Computed a total of 9 stabilizing places and 15 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 69 transition count 137
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 69 transition count 137
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 91 place count 64 transition count 127
Iterating global reduction 0 with 5 rules applied. Total rules applied 96 place count 64 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 98 place count 64 transition count 125
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 100 place count 62 transition count 119
Iterating global reduction 1 with 2 rules applied. Total rules applied 102 place count 62 transition count 119
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 60 transition count 115
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 60 transition count 115
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 111 place count 60 transition count 110
Applied a total of 111 rules in 8 ms. Remains 60 /112 variables (removed 52) and now considering 110/218 (removed 108) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 60/112 places, 110/218 transitions.
[2024-05-23 19:01:35] [INFO ] Flatten gal took : 6 ms
[2024-05-23 19:01:36] [INFO ] Flatten gal took : 6 ms
[2024-05-23 19:01:36] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 70 transition count 137
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 70 transition count 137
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 92 place count 62 transition count 121
Iterating global reduction 0 with 8 rules applied. Total rules applied 100 place count 62 transition count 121
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 109 place count 62 transition count 112
Applied a total of 109 rules in 5 ms. Remains 62 /112 variables (removed 50) and now considering 112/218 (removed 106) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 62/112 places, 112/218 transitions.
[2024-05-23 19:01:36] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:01:36] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:01:36] [INFO ] Input system was already deterministic with 112 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 62 transition count 123
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 62 transition count 123
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 109 place count 53 transition count 104
Iterating global reduction 0 with 9 rules applied. Total rules applied 118 place count 53 transition count 104
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 127 place count 53 transition count 95
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 130 place count 50 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 133 place count 50 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 136 place count 50 transition count 84
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 138 place count 48 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 140 place count 48 transition count 80
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 146 place count 48 transition count 74
Applied a total of 146 rules in 7 ms. Remains 48 /112 variables (removed 64) and now considering 74/218 (removed 144) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 48/112 places, 74/218 transitions.
[2024-05-23 19:01:36] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:01:36] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:01:36] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 67 transition count 132
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 67 transition count 132
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 99 place count 58 transition count 113
Iterating global reduction 0 with 9 rules applied. Total rules applied 108 place count 58 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 116 place count 58 transition count 105
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 118 place count 56 transition count 100
Iterating global reduction 1 with 2 rules applied. Total rules applied 120 place count 56 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 123 place count 56 transition count 97
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 124 place count 55 transition count 95
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 55 transition count 95
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 128 place count 55 transition count 92
Applied a total of 128 rules in 6 ms. Remains 55 /112 variables (removed 57) and now considering 92/218 (removed 126) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 55/112 places, 92/218 transitions.
[2024-05-23 19:01:36] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:01:36] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:01:36] [INFO ] Input system was already deterministic with 92 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 67 transition count 132
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 67 transition count 132
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 97 place count 60 transition count 118
Iterating global reduction 0 with 7 rules applied. Total rules applied 104 place count 60 transition count 118
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 109 place count 60 transition count 113
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 111 place count 58 transition count 107
Iterating global reduction 1 with 2 rules applied. Total rules applied 113 place count 58 transition count 107
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 115 place count 56 transition count 103
Iterating global reduction 1 with 2 rules applied. Total rules applied 117 place count 56 transition count 103
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 123 place count 56 transition count 97
Applied a total of 123 rules in 5 ms. Remains 56 /112 variables (removed 56) and now considering 97/218 (removed 121) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 56/112 places, 97/218 transitions.
[2024-05-23 19:01:36] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:01:36] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:01:36] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 68 transition count 135
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 68 transition count 135
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 96 place count 60 transition count 119
Iterating global reduction 0 with 8 rules applied. Total rules applied 104 place count 60 transition count 119
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 113 place count 60 transition count 110
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 115 place count 58 transition count 104
Iterating global reduction 1 with 2 rules applied. Total rules applied 117 place count 58 transition count 104
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 119 place count 56 transition count 100
Iterating global reduction 1 with 2 rules applied. Total rules applied 121 place count 56 transition count 100
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 127 place count 56 transition count 94
Applied a total of 127 rules in 5 ms. Remains 56 /112 variables (removed 56) and now considering 94/218 (removed 124) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 56/112 places, 94/218 transitions.
[2024-05-23 19:01:36] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:01:36] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:01:36] [INFO ] Input system was already deterministic with 94 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 69 transition count 137
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 69 transition count 137
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 91 place count 64 transition count 127
Iterating global reduction 0 with 5 rules applied. Total rules applied 96 place count 64 transition count 127
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 102 place count 64 transition count 121
Applied a total of 102 rules in 3 ms. Remains 64 /112 variables (removed 48) and now considering 121/218 (removed 97) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 64/112 places, 121/218 transitions.
[2024-05-23 19:01:36] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:01:36] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:01:36] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 72 transition count 142
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 72 transition count 142
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 87 place count 65 transition count 128
Iterating global reduction 0 with 7 rules applied. Total rules applied 94 place count 65 transition count 128
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 99 place count 65 transition count 123
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 64 transition count 120
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 64 transition count 120
Applied a total of 101 rules in 3 ms. Remains 64 /112 variables (removed 48) and now considering 120/218 (removed 98) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 64/112 places, 120/218 transitions.
[2024-05-23 19:01:36] [INFO ] Flatten gal took : 6 ms
[2024-05-23 19:01:36] [INFO ] Flatten gal took : 6 ms
[2024-05-23 19:01:36] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 63 transition count 125
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 63 transition count 125
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 107 place count 54 transition count 106
Iterating global reduction 0 with 9 rules applied. Total rules applied 116 place count 54 transition count 106
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 54 transition count 97
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 128 place count 51 transition count 89
Iterating global reduction 1 with 3 rules applied. Total rules applied 131 place count 51 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 134 place count 51 transition count 86
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 136 place count 49 transition count 82
Iterating global reduction 2 with 2 rules applied. Total rules applied 138 place count 49 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 144 place count 49 transition count 76
Applied a total of 144 rules in 4 ms. Remains 49 /112 variables (removed 63) and now considering 76/218 (removed 142) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 49/112 places, 76/218 transitions.
[2024-05-23 19:01:36] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:01:36] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:01:36] [INFO ] Input system was already deterministic with 76 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 63 transition count 125
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 63 transition count 125
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 106 place count 55 transition count 108
Iterating global reduction 0 with 8 rules applied. Total rules applied 114 place count 55 transition count 108
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 120 place count 55 transition count 102
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 123 place count 52 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 126 place count 52 transition count 94
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 52 transition count 91
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 131 place count 50 transition count 87
Iterating global reduction 2 with 2 rules applied. Total rules applied 133 place count 50 transition count 87
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 139 place count 50 transition count 81
Applied a total of 139 rules in 8 ms. Remains 50 /112 variables (removed 62) and now considering 81/218 (removed 137) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 50/112 places, 81/218 transitions.
[2024-05-23 19:01:36] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:01:36] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:01:36] [INFO ] Input system was already deterministic with 81 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 64 transition count 127
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 64 transition count 127
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 104 place count 56 transition count 111
Iterating global reduction 0 with 8 rules applied. Total rules applied 112 place count 56 transition count 111
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 121 place count 56 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 122 place count 55 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 123 place count 55 transition count 99
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 124 place count 54 transition count 97
Iterating global reduction 1 with 1 rules applied. Total rules applied 125 place count 54 transition count 97
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 54 transition count 94
Applied a total of 128 rules in 4 ms. Remains 54 /112 variables (removed 58) and now considering 94/218 (removed 124) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 54/112 places, 94/218 transitions.
[2024-05-23 19:01:36] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:01:36] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:01:36] [INFO ] Input system was already deterministic with 94 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Graph (trivial) has 145 edges and 112 vertex of which 10 / 112 are part of one of the 5 SCC in 1 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 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 49 place count 58 transition count 121
Iterating global reduction 0 with 48 rules applied. Total rules applied 97 place count 58 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 98 place count 58 transition count 120
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 106 place count 50 transition count 103
Iterating global reduction 1 with 8 rules applied. Total rules applied 114 place count 50 transition count 103
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 120 place count 50 transition count 97
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 122 place count 48 transition count 92
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 48 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 127 place count 48 transition count 89
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 47 transition count 87
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 47 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 132 place count 47 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 135 place count 47 transition count 81
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 4 with 2 rules applied. Total rules applied 137 place count 46 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 139 place count 44 transition count 78
Applied a total of 139 rules in 20 ms. Remains 44 /112 variables (removed 68) and now considering 78/218 (removed 140) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 44/112 places, 78/218 transitions.
[2024-05-23 19:01:36] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:01:36] [INFO ] Flatten gal took : 3 ms
[2024-05-23 19:01:36] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 68 transition count 135
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 68 transition count 135
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 94 place count 62 transition count 123
Iterating global reduction 0 with 6 rules applied. Total rules applied 100 place count 62 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 101 place count 62 transition count 122
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 103 place count 60 transition count 116
Iterating global reduction 1 with 2 rules applied. Total rules applied 105 place count 60 transition count 116
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 107 place count 58 transition count 112
Iterating global reduction 1 with 2 rules applied. Total rules applied 109 place count 58 transition count 112
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 115 place count 58 transition count 106
Applied a total of 115 rules in 4 ms. Remains 58 /112 variables (removed 54) and now considering 106/218 (removed 112) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 58/112 places, 106/218 transitions.
[2024-05-23 19:01:36] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:01:36] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:01:36] [INFO ] Input system was already deterministic with 106 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Graph (trivial) has 154 edges and 112 vertex of which 10 / 112 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 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 48 place count 59 transition count 123
Iterating global reduction 0 with 47 rules applied. Total rules applied 95 place count 59 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 96 place count 59 transition count 122
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 104 place count 51 transition count 105
Iterating global reduction 1 with 8 rules applied. Total rules applied 112 place count 51 transition count 105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 121 place count 51 transition count 96
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 123 place count 49 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 125 place count 49 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 128 place count 49 transition count 88
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 48 transition count 86
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 48 transition count 86
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 133 place count 48 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 136 place count 48 transition count 80
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 4 with 2 rules applied. Total rules applied 138 place count 47 transition count 79
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 140 place count 45 transition count 77
Applied a total of 140 rules in 16 ms. Remains 45 /112 variables (removed 67) and now considering 77/218 (removed 141) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 45/112 places, 77/218 transitions.
[2024-05-23 19:01:36] [INFO ] Flatten gal took : 3 ms
[2024-05-23 19:01:36] [INFO ] Flatten gal took : 3 ms
[2024-05-23 19:01:36] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Graph (trivial) has 128 edges and 112 vertex of which 10 / 112 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 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 61 transition count 126
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 61 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 92 place count 61 transition count 125
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 101 place count 52 transition count 106
Iterating global reduction 1 with 9 rules applied. Total rules applied 110 place count 52 transition count 106
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 119 place count 52 transition count 97
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 122 place count 49 transition count 89
Iterating global reduction 2 with 3 rules applied. Total rules applied 125 place count 49 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 128 place count 49 transition count 86
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 130 place count 47 transition count 82
Iterating global reduction 3 with 2 rules applied. Total rules applied 132 place count 47 transition count 82
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 137 place count 47 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 140 place count 47 transition count 74
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 4 with 2 rules applied. Total rules applied 142 place count 46 transition count 73
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 144 place count 44 transition count 71
Applied a total of 144 rules in 19 ms. Remains 44 /112 variables (removed 68) and now considering 71/218 (removed 147) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 44/112 places, 71/218 transitions.
[2024-05-23 19:01:36] [INFO ] Flatten gal took : 2 ms
[2024-05-23 19:01:36] [INFO ] Flatten gal took : 3 ms
[2024-05-23 19:01:36] [INFO ] Input system was already deterministic with 71 transitions.
[2024-05-23 19:01:36] [INFO ] Flatten gal took : 23 ms
[2024-05-23 19:01:36] [INFO ] Flatten gal took : 7 ms
[2024-05-23 19:01:36] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-05-23 19:01:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 112 places, 218 transitions and 632 arcs took 20 ms.
Total runtime 57115 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running HealthRecord-PT-10

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 1190
MODEL NAME: /home/mcc/execution/412/model
112 places, 218 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-10-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-10-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-10-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-10-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-10-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-10-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-10-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-10-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-10-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-10-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-10-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-10-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-10-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-10-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-10-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716490903348

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

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