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.r180-tall-171640604100746.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 itstools
Input is HealthRecord-PT-07, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640604100746
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 20:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 12 20:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 20:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 20:15 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 67K 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-07-CTLFireability-2024-00
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-01
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-02
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-03
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-04
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-05
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-06
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-07
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-08
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-09
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-10
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-11
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2023-12
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2023-13
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2023-14
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716519704164

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-24 03:01:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 03:01:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:01:45] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-05-24 03:01:45] [INFO ] Transformed 155 places.
[2024-05-24 03:01:45] [INFO ] Transformed 320 transitions.
[2024-05-24 03:01:45] [INFO ] Found NUPN structural information;
[2024-05-24 03:01:45] [INFO ] Parsed PT model containing 155 places and 320 transitions and 839 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
Support contains 99 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 295/295 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 130 transition count 248
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 130 transition count 248
Applied a total of 50 rules in 22 ms. Remains 130 /155 variables (removed 25) and now considering 248/295 (removed 47) transitions.
[2024-05-24 03:01:45] [INFO ] Flow matrix only has 239 transitions (discarded 9 similar events)
// Phase 1: matrix 239 rows 130 cols
[2024-05-24 03:01:45] [INFO ] Computed 15 invariants in 12 ms
[2024-05-24 03:01:45] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-24 03:01:45] [INFO ] Flow matrix only has 239 transitions (discarded 9 similar events)
[2024-05-24 03:01:45] [INFO ] Invariant cache hit.
[2024-05-24 03:01:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:01:45] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2024-05-24 03:01:45] [INFO ] Flow matrix only has 239 transitions (discarded 9 similar events)
[2024-05-24 03:01:45] [INFO ] Invariant cache hit.
[2024-05-24 03:01:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-24 03:01:47] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 121 ms to minimize.
[2024-05-24 03:01:47] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:01:47] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:01:48] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:01:48] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:01:48] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:01:48] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:01:48] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 2 ms to minimize.
[2024-05-24 03:01:48] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:01:48] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:01:48] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:01:48] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:01:48] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:01:48] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:01:48] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:01:48] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:01:49] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 17/32 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (OVERLAPS) 238/368 variables, 130/162 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (OVERLAPS) 1/369 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-24 03:01:53] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:01:53] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 0 ms to minimize.
[2024-05-24 03:01:53] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-24 03:01:56] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 0 ms to minimize.
[2024-05-24 03:01:56] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:01:56] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/369 variables, 3/169 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/369 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 12 (OVERLAPS) 0/369 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 169 constraints, problems are : Problem set: 0 solved, 247 unsolved in 15145 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 130/130 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-24 03:02:02] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:02:02] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:02:02] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 0 ms to minimize.
[2024-05-24 03:02:02] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-24 03:02:02] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:02:03] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:02:03] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:02:03] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:02:03] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:02:03] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:02:03] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 2 ms to minimize.
[2024-05-24 03:02:03] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 0 ms to minimize.
[2024-05-24 03:02:03] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:02:03] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:02:03] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:02:03] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 0 ms to minimize.
[2024-05-24 03:02:03] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:02:03] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:02:03] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:02:03] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:02:03] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:02:03] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:02:03] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:02:04] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-24 03:02:04] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-24 03:02:05] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:02:05] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:02:05] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:02:05] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:02:05] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-24 03:02:06] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 0 ms to minimize.
[2024-05-24 03:02:06] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:02:06] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:02:06] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:02:06] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-24 03:02:07] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 0 ms to minimize.
[2024-05-24 03:02:07] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:02:07] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:02:07] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:02:07] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:02:07] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 6/79 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-24 03:02:08] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:02:08] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:02:08] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:02:08] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:02:08] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:02:08] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:02:08] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:02:08] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:02:08] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:02:08] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 0 ms to minimize.
[2024-05-24 03:02:08] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:02:09] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:02:09] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:02:09] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:02:09] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:02:09] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:02:09] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:02:09] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:02:09] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 0 ms to minimize.
[2024-05-24 03:02:09] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 12 (OVERLAPS) 238/368 variables, 130/229 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/368 variables, 247/476 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-24 03:02:11] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:02:11] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:02:11] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 5 ms to minimize.
[2024-05-24 03:02:11] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:02:11] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:02:12] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:02:12] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:02:12] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:02:12] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:02:12] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2024-05-24 03:02:12] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:02:14] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/368 variables, 12/488 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-24 03:02:16] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:02:18] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/368 variables, 2/490 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-24 03:02:22] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:02:22] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:02:24] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/368 variables, 3/493 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-24 03:02:27] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/369 variables, and 494 constraints, problems are : Problem set: 0 solved, 247 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 130/130 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 102/102 constraints]
After SMT, in 45319ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 45337ms
Starting structural reductions in LTL mode, iteration 1 : 130/155 places, 248/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45740 ms. Remains : 130/155 places, 248/295 transitions.
Support contains 99 out of 130 places after structural reductions.
[2024-05-24 03:02:31] [INFO ] Flatten gal took : 40 ms
[2024-05-24 03:02:31] [INFO ] Flatten gal took : 16 ms
[2024-05-24 03:02:31] [INFO ] Input system was already deterministic with 248 transitions.
Reduction of identical properties reduced properties to check from 99 to 98
RANDOM walk for 40000 steps (2101 resets) in 1917 ms. (20 steps per ms) remains 46/98 properties
BEST_FIRST walk for 4002 steps (31 resets) in 32 ms. (121 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (18 resets) in 32 ms. (121 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (32 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (29 resets) in 25 ms. (154 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (30 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (32 resets) in 32 ms. (121 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (31 resets) in 13 ms. (285 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (34 resets) in 13 ms. (285 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (30 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (29 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (26 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (31 resets) in 12 ms. (308 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (31 resets) in 12 ms. (308 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (33 resets) in 12 ms. (307 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (30 resets) in 12 ms. (307 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (31 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (26 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (33 resets) in 10 ms. (363 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (30 resets) in 10 ms. (363 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (33 resets) in 12 ms. (308 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (30 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (31 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (30 resets) in 22 ms. (174 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (31 resets) in 10 ms. (363 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (30 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (29 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (29 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (31 resets) in 13 ms. (285 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (30 resets) in 13 ms. (285 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (33 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (29 resets) in 40 ms. (97 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (28 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (30 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (29 resets) in 12 ms. (307 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (60 resets) in 27 ms. (143 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (33 resets) in 13 ms. (286 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (31 resets) in 21 ms. (181 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (29 resets) in 9 ms. (400 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (30 resets) in 9 ms. (400 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (30 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (31 resets) in 10 ms. (364 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (30 resets) in 10 ms. (364 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (28 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (32 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (30 resets) in 9 ms. (400 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (31 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
[2024-05-24 03:02:32] [INFO ] Flow matrix only has 239 transitions (discarded 9 similar events)
[2024-05-24 03:02:32] [INFO ] Invariant cache hit.
[2024-05-24 03:02:32] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Problem AtomicPropp9 is UNSAT
At refinement iteration 1 (OVERLAPS) 38/95 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 3 (OVERLAPS) 35/130 variables, 8/15 constraints. Problems are: Problem set: 1 solved, 45 unsolved
[2024-05-24 03:02:33] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:02:33] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:02:33] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:02:33] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:02:33] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:02:33] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:02:33] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:02:33] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:02:33] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:02:33] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 0 ms to minimize.
[2024-05-24 03:02:33] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:02:33] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:02:33] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:02:33] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:02:33] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:02:33] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:02:33] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:02:33] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:02:34] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:02:34] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 20/35 constraints. Problems are: Problem set: 1 solved, 45 unsolved
[2024-05-24 03:02:34] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:02:34] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-24 03:02:34] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:02:34] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:02:34] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:02:34] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:02:34] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:02:34] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:02:34] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:02:34] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:02:34] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:02:34] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:02:34] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 0 ms to minimize.
[2024-05-24 03:02:34] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:02:34] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 0 ms to minimize.
[2024-05-24 03:02:34] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:02:34] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:02:34] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:02:35] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:02:35] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/55 constraints. Problems are: Problem set: 1 solved, 45 unsolved
[2024-05-24 03:02:35] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:02:35] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:02:35] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:02:35] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:02:35] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:02:35] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:02:35] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:02:35] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:02:35] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:02:35] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:02:35] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:02:35] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
Problem AtomicPropp41 is UNSAT
[2024-05-24 03:02:35] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:02:35] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:02:35] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:02:35] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:02:36] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 17/72 constraints. Problems are: Problem set: 2 solved, 44 unsolved
[2024-05-24 03:02:36] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:02:36] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:02:36] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:02:36] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:02:36] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 5/77 constraints. Problems are: Problem set: 2 solved, 44 unsolved
[2024-05-24 03:02:36] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
[2024-05-24 03:02:36] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:02:36] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:02:36] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:02:36] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:02:36] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:02:36] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:02:37] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 8/85 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/85 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 10 (OVERLAPS) 238/368 variables, 130/215 constraints. Problems are: Problem set: 2 solved, 44 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 368/369 variables, and 215 constraints, problems are : Problem set: 2 solved, 44 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 130/130 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 70/70 constraints]
Escalating to Integer solving :Problem set: 2 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 41/93 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 44 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 6/13 constraints. Problems are: Problem set: 3 solved, 43 unsolved
[2024-05-24 03:02:37] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 0 ms to minimize.
Problem AtomicPropp28 is UNSAT
[2024-05-24 03:02:37] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2024-05-24 03:02:37] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 3/16 constraints. Problems are: Problem set: 4 solved, 42 unsolved
[2024-05-24 03:02:38] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/17 constraints. Problems are: Problem set: 4 solved, 42 unsolved
[2024-05-24 03:02:38] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:02:38] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 2/19 constraints. Problems are: Problem set: 4 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/19 constraints. Problems are: Problem set: 4 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 37/130 variables, 8/27 constraints. Problems are: Problem set: 4 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 64/91 constraints. Problems are: Problem set: 4 solved, 42 unsolved
[2024-05-24 03:02:38] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:02:38] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:02:38] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:02:38] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:02:38] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:02:38] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:02:38] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:02:38] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
[2024-05-24 03:02:38] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:02:39] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
Problem AtomicPropp89 is UNSAT
[2024-05-24 03:02:39] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 11/102 constraints. Problems are: Problem set: 5 solved, 41 unsolved
[2024-05-24 03:02:39] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:02:39] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:02:39] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:02:39] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 4/106 constraints. Problems are: Problem set: 5 solved, 41 unsolved
[2024-05-24 03:02:39] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 0 ms to minimize.
[2024-05-24 03:02:39] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:02:39] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 3/109 constraints. Problems are: Problem set: 5 solved, 41 unsolved
[2024-05-24 03:02:39] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2024-05-24 03:02:40] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:02:40] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 0 ms to minimize.
[2024-05-24 03:02:40] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:02:40] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/130 variables, 5/114 constraints. Problems are: Problem set: 5 solved, 41 unsolved
[2024-05-24 03:02:40] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 0 ms to minimize.
[2024-05-24 03:02:40] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/130 variables, 2/116 constraints. Problems are: Problem set: 5 solved, 41 unsolved
[2024-05-24 03:02:40] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/130 variables, 1/117 constraints. Problems are: Problem set: 5 solved, 41 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/130 variables, 0/117 constraints. Problems are: Problem set: 5 solved, 41 unsolved
At refinement iteration 16 (OVERLAPS) 238/368 variables, 130/247 constraints. Problems are: Problem set: 5 solved, 41 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/368 variables, 41/288 constraints. Problems are: Problem set: 5 solved, 41 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/368 variables, 0/288 constraints. Problems are: Problem set: 5 solved, 41 unsolved
At refinement iteration 19 (OVERLAPS) 1/369 variables, 1/289 constraints. Problems are: Problem set: 5 solved, 41 unsolved
[2024-05-24 03:02:42] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 290 constraints, problems are : Problem set: 5 solved, 41 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 130/130 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 41/46 constraints, Known Traps: 103/103 constraints]
After SMT, in 10055ms problems are : Problem set: 5 solved, 41 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 47 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 248/248 transitions.
Graph (trivial) has 61 edges and 130 vertex of which 10 / 130 are part of one of the 5 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 543 edges and 125 vertex of which 123 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 123 transition count 227
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 122 transition count 226
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 33 place count 94 transition count 170
Iterating global reduction 2 with 28 rules applied. Total rules applied 61 place count 94 transition count 170
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 65 place count 90 transition count 162
Iterating global reduction 2 with 4 rules applied. Total rules applied 69 place count 90 transition count 162
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 74 place count 90 transition count 157
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 78 place count 88 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 79 place count 88 transition count 154
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 83 place count 88 transition count 150
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 83 place count 88 transition count 146
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 91 place count 84 transition count 146
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 93 place count 84 transition count 146
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 84 transition count 145
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 95 place count 83 transition count 144
Iterating global reduction 4 with 1 rules applied. Total rules applied 96 place count 83 transition count 144
Applied a total of 96 rules in 59 ms. Remains 83 /130 variables (removed 47) and now considering 144/248 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 83/130 places, 144/248 transitions.
RANDOM walk for 40000 steps (3560 resets) in 419 ms. (95 steps per ms) remains 34/41 properties
BEST_FIRST walk for 4003 steps (67 resets) in 25 ms. (153 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (65 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (72 resets) in 33 ms. (117 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (68 resets) in 31 ms. (125 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (66 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (61 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (69 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (61 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (64 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (66 resets) in 12 ms. (307 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (70 resets) in 11 ms. (333 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4003 steps (64 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (70 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (71 resets) in 12 ms. (307 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (61 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (64 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (64 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (64 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (68 resets) in 10 ms. (364 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (65 resets) in 10 ms. (363 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (61 resets) in 9 ms. (400 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (64 resets) in 9 ms. (400 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (66 resets) in 10 ms. (363 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (62 resets) in 10 ms. (363 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (66 resets) in 10 ms. (363 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (58 resets) in 8 ms. (444 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (61 resets) in 10 ms. (363 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (66 resets) in 12 ms. (307 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (65 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (63 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (71 resets) in 10 ms. (364 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (62 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (65 resets) in 9 ms. (400 steps per ms) remains 33/33 properties
// Phase 1: matrix 144 rows 83 cols
[2024-05-24 03:02:43] [INFO ] Computed 13 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 28/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 24/83 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 144/227 variables, 83/96 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-24 03:02:43] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-05-24 03:02:43] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-24 03:02:43] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 3 ms to minimize.
[2024-05-24 03:02:43] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:02:43] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:02:43] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-24 03:02:43] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:02:43] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:02:43] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:02:43] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 10/106 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-24 03:02:43] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:02:44] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:02:44] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-24 03:02:44] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:02:44] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:02:44] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:02:44] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:02:44] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:02:44] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:02:44] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 7/116 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-24 03:02:44] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 11 (OVERLAPS) 0/227 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 117 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1911 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 28/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-24 03:02:45] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:02:45] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:02:45] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:02:45] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:02:45] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 24/83 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-24 03:02:45] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:02:45] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:02:45] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:02:45] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-24 03:02:45] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:02:45] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-24 03:02:45] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:02:45] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-24 03:02:46] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:02:46] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/83 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/83 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 11 (OVERLAPS) 144/227 variables, 83/132 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 33/165 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-24 03:02:46] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-24 03:02:46] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:02:46] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:02:46] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:02:46] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/227 variables, 5/170 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-24 03:02:46] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/227 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/227 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 16 (OVERLAPS) 0/227 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 171 constraints, problems are : Problem set: 0 solved, 33 unsolved in 2885 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 42/42 constraints]
After SMT, in 4815ms problems are : Problem set: 0 solved, 33 unsolved
Fused 33 Parikh solutions to 29 different solutions.
Parikh walk visited 32 properties in 1710 ms.
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 144/144 transitions.
Graph (trivial) has 92 edges and 83 vertex of which 2 / 83 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 381 edges and 82 vertex of which 77 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 77 transition count 141
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 76 transition count 140
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 5 place count 76 transition count 136
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 16 place count 69 transition count 136
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 40 place count 45 transition count 88
Iterating global reduction 2 with 24 rules applied. Total rules applied 64 place count 45 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 45 transition count 87
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 69 place count 41 transition count 79
Iterating global reduction 3 with 4 rules applied. Total rules applied 73 place count 41 transition count 79
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 75 place count 39 transition count 73
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 39 transition count 73
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 79 place count 37 transition count 69
Iterating global reduction 3 with 2 rules applied. Total rules applied 81 place count 37 transition count 69
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 87 place count 37 transition count 63
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 4 with 2 rules applied. Total rules applied 89 place count 36 transition count 62
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 97 place count 32 transition count 92
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 99 place count 32 transition count 90
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 101 place count 32 transition count 88
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 103 place count 30 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 106 place count 30 transition count 85
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 120 place count 30 transition count 85
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 132 place count 30 transition count 85
Applied a total of 132 rules in 34 ms. Remains 30 /83 variables (removed 53) and now considering 85/144 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 30/83 places, 85/144 transitions.
RANDOM walk for 40000 steps (6667 resets) in 467 ms. (85 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1934 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2036 steps, run visited all 1 properties in 13 ms. (steps per millisecond=156 )
Probabilistic random walk after 2036 steps, saw 755 distinct states, run finished after 16 ms. (steps per millisecond=127 ) properties seen :1
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2024-05-24 03:02:49] [INFO ] Flatten gal took : 13 ms
[2024-05-24 03:02:49] [INFO ] Flatten gal took : 13 ms
[2024-05-24 03:02:49] [INFO ] Input system was already deterministic with 248 transitions.
Computed a total of 13 stabilizing places and 22 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 248/248 transitions.
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 65 place count 65 transition count 124
Iterating global reduction 0 with 65 rules applied. Total rules applied 130 place count 65 transition count 124
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 139 place count 56 transition count 106
Iterating global reduction 0 with 9 rules applied. Total rules applied 148 place count 56 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 157 place count 56 transition count 97
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 160 place count 53 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 163 place count 53 transition count 88
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 166 place count 50 transition count 82
Iterating global reduction 1 with 3 rules applied. Total rules applied 169 place count 50 transition count 82
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 178 place count 50 transition count 73
Applied a total of 178 rules in 10 ms. Remains 50 /130 variables (removed 80) and now considering 73/248 (removed 175) transitions.
[2024-05-24 03:02:49] [INFO ] Flow matrix only has 70 transitions (discarded 3 similar events)
// Phase 1: matrix 70 rows 50 cols
[2024-05-24 03:02:49] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:02:49] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-24 03:02:49] [INFO ] Flow matrix only has 70 transitions (discarded 3 similar events)
[2024-05-24 03:02:49] [INFO ] Invariant cache hit.
[2024-05-24 03:02:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:02:50] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-24 03:02:50] [INFO ] Flow matrix only has 70 transitions (discarded 3 similar events)
[2024-05-24 03:02:50] [INFO ] Invariant cache hit.
[2024-05-24 03:02:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-24 03:02:50] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:02:50] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 69/119 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 1/120 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/120 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 62 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1132 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-24 03:02:51] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:02:51] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-24 03:02:51] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 69/119 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 72/136 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (OVERLAPS) 1/120 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 137 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1846 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 5/5 constraints]
After SMT, in 2995ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 2996ms
Starting structural reductions in LTL mode, iteration 1 : 50/130 places, 73/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3111 ms. Remains : 50/130 places, 73/248 transitions.
[2024-05-24 03:02:53] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:02:53] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:02:53] [INFO ] Input system was already deterministic with 73 transitions.
[2024-05-24 03:02:53] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:02:53] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:02:53] [INFO ] Time to serialize gal into /tmp/CTLFireability11926142040747090170.gal : 2 ms
[2024-05-24 03:02:53] [INFO ] Time to serialize properties into /tmp/CTLFireability4684414187282132875.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11926142040747090170.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4684414187282132875.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,550404,0.131414,9164,2,2164,5,25807,6,0,269,18396,0


Converting to forward existential form...Done !
original formula: AF(E(A(EX((p34==1)) U ((!((p17==1)&&(p152==1)))&&(!((p36==1)&&(p152==1))))) U EF(((p17==1)&&(p152==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(!((E(!(((!((p17==1)&&(p152==1)))&&(!((p36==1)&&(p152==1))))) U (!(EX((p34==1))) * !(((!((p17==1)&...307
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t15, t17, t19, t34, t35, t36, t37, t48, t...257
(forward)formula 0,1,0.677648,27184,1,0,157,128638,179,83,1957,104534,189
FORMULA HealthRecord-PT-07-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 248/248 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 67 transition count 128
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 67 transition count 128
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 133 place count 60 transition count 114
Iterating global reduction 0 with 7 rules applied. Total rules applied 140 place count 60 transition count 114
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 149 place count 60 transition count 105
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 151 place count 58 transition count 99
Iterating global reduction 1 with 2 rules applied. Total rules applied 153 place count 58 transition count 99
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 155 place count 56 transition count 95
Iterating global reduction 1 with 2 rules applied. Total rules applied 157 place count 56 transition count 95
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 162 place count 56 transition count 90
Applied a total of 162 rules in 5 ms. Remains 56 /130 variables (removed 74) and now considering 90/248 (removed 158) transitions.
[2024-05-24 03:02:53] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
// Phase 1: matrix 87 rows 56 cols
[2024-05-24 03:02:53] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:02:53] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-24 03:02:53] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
[2024-05-24 03:02:53] [INFO ] Invariant cache hit.
[2024-05-24 03:02:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:02:53] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2024-05-24 03:02:53] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
[2024-05-24 03:02:53] [INFO ] Invariant cache hit.
[2024-05-24 03:02:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 03:02:54] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:02:54] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 03:02:54] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 86/142 variables, 56/68 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/143 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 0/143 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 69 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1858 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 03:02:55] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 86/142 variables, 56/69 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 89/158 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 1/143 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/143 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 159 constraints, problems are : Problem set: 0 solved, 89 unsolved in 2417 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 4/4 constraints]
After SMT, in 4292ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 4293ms
Starting structural reductions in LTL mode, iteration 1 : 56/130 places, 90/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4388 ms. Remains : 56/130 places, 90/248 transitions.
[2024-05-24 03:02:58] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:02:58] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:02:58] [INFO ] Input system was already deterministic with 90 transitions.
[2024-05-24 03:02:58] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:02:58] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:02:58] [INFO ] Time to serialize gal into /tmp/CTLFireability891999059549888026.gal : 2 ms
[2024-05-24 03:02:58] [INFO ] Time to serialize properties into /tmp/CTLFireability9426224863277606737.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability891999059549888026.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9426224863277606737.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.13239e+06,0.044843,5328,2,1016,5,8657,6,0,310,8016,0


Converting to forward existential form...Done !
original formula: AF((((AG((p134!=1)) * (p150!=1)) * ((p36!=1) * ((AX(((p109!=1)||(p143!=1))) + (p17!=1)) + (p152!=1)))) + (EG(AF((p77==0))) * (EG(AG((p55=...205
=> equivalent forward existential formula: [FwdG(Init,!((((!(E(TRUE U !((p134!=1)))) * (p150!=1)) * ((p36!=1) * ((!(EX(!(((p109!=1)||(p143!=1))))) + (p17!=...298
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t5, t6, t7, t8, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, ...283
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,4.81269,158772,1,0,672,909643,230,417,2300,1.05348e+06,677
FORMULA HealthRecord-PT-07-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 248/248 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 76 transition count 145
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 76 transition count 145
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 115 place count 69 transition count 131
Iterating global reduction 0 with 7 rules applied. Total rules applied 122 place count 69 transition count 131
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 129 place count 69 transition count 124
Applied a total of 129 rules in 4 ms. Remains 69 /130 variables (removed 61) and now considering 124/248 (removed 124) transitions.
[2024-05-24 03:03:03] [INFO ] Flow matrix only has 120 transitions (discarded 4 similar events)
// Phase 1: matrix 120 rows 69 cols
[2024-05-24 03:03:03] [INFO ] Computed 10 invariants in 3 ms
[2024-05-24 03:03:03] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-24 03:03:03] [INFO ] Flow matrix only has 120 transitions (discarded 4 similar events)
[2024-05-24 03:03:03] [INFO ] Invariant cache hit.
[2024-05-24 03:03:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:03:03] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-24 03:03:03] [INFO ] Flow matrix only has 120 transitions (discarded 4 similar events)
[2024-05-24 03:03:03] [INFO ] Invariant cache hit.
[2024-05-24 03:03:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-24 03:03:03] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:03:03] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:03:03] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:03:03] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:03:03] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:03:03] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:03:03] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-24 03:03:04] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 119/188 variables, 69/87 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-24 03:03:05] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:03:05] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:03:05] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-05-24 03:03:05] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:03:05] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:03:05] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 6/93 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 1/189 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (OVERLAPS) 0/189 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 94 constraints, problems are : Problem set: 0 solved, 123 unsolved in 3946 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-24 03:03:07] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-24 03:03:07] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-24 03:03:08] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:03:08] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-24 03:03:08] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:03:08] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 119/188 variables, 69/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 123/222 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (OVERLAPS) 1/189 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 13 (OVERLAPS) 0/189 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 223 constraints, problems are : Problem set: 0 solved, 123 unsolved in 4637 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 20/20 constraints]
After SMT, in 8616ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 8617ms
Starting structural reductions in LTL mode, iteration 1 : 69/130 places, 124/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8731 ms. Remains : 69/130 places, 124/248 transitions.
[2024-05-24 03:03:11] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:03:11] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:03:11] [INFO ] Input system was already deterministic with 124 transitions.
[2024-05-24 03:03:11] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:03:11] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:03:11] [INFO ] Time to serialize gal into /tmp/CTLFireability16370379996832116244.gal : 1 ms
[2024-05-24 03:03:11] [INFO ] Time to serialize properties into /tmp/CTLFireability15464906838461400711.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16370379996832116244.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15464906838461400711.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.32927e+06,0.202865,12144,2,2750,5,33026,6,0,393,42117,0


Converting to forward existential form...Done !
original formula: (!(A((EG((AF((p5==1)) + AX((p44==1)))) * (!((((p17==1)&&(p152==1)) + A((p95==1) U (p47==1)))) + AG(AF((p54==1))))) U !(((!(AF((p125==1)))...305
=> equivalent forward existential formula: (([FwdG((((FwdU(Init,!(!(((!(!(EG(!((p125==1))))) * (p45==1)) * !(((p84==1)&&(p40==1))))))) * !((EG((!(EG(!((p5=...622
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...470
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 115/0/9
(forward)formula 0,1,15.8502,507548,1,0,982,2.96179e+06,328,554,3119,3.3368e+06,1136
FORMULA HealthRecord-PT-07-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 248/248 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 66 transition count 126
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 66 transition count 126
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 136 place count 58 transition count 110
Iterating global reduction 0 with 8 rules applied. Total rules applied 144 place count 58 transition count 110
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 153 place count 58 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 154 place count 57 transition count 98
Iterating global reduction 1 with 1 rules applied. Total rules applied 155 place count 57 transition count 98
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 156 place count 56 transition count 96
Iterating global reduction 1 with 1 rules applied. Total rules applied 157 place count 56 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 160 place count 56 transition count 93
Applied a total of 160 rules in 5 ms. Remains 56 /130 variables (removed 74) and now considering 93/248 (removed 155) transitions.
[2024-05-24 03:03:27] [INFO ] Flow matrix only has 90 transitions (discarded 3 similar events)
// Phase 1: matrix 90 rows 56 cols
[2024-05-24 03:03:27] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:03:27] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 03:03:27] [INFO ] Flow matrix only has 90 transitions (discarded 3 similar events)
[2024-05-24 03:03:27] [INFO ] Invariant cache hit.
[2024-05-24 03:03:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:03:27] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-05-24 03:03:27] [INFO ] Flow matrix only has 90 transitions (discarded 3 similar events)
[2024-05-24 03:03:27] [INFO ] Invariant cache hit.
[2024-05-24 03:03:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-24 03:03:28] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:03:28] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 89/145 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 1/146 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-24 03:03:29] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:03:29] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 0/146 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 70 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2086 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-24 03:03:30] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-24 03:03:30] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-24 03:03:30] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 89/145 variables, 56/72 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 92/164 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 1/146 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/146 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 11 (OVERLAPS) 0/146 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 165 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2771 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 7/7 constraints]
After SMT, in 4889ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 4893ms
Starting structural reductions in LTL mode, iteration 1 : 56/130 places, 93/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4972 ms. Remains : 56/130 places, 93/248 transitions.
[2024-05-24 03:03:32] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:03:32] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:03:32] [INFO ] Input system was already deterministic with 93 transitions.
[2024-05-24 03:03:32] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:03:32] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:03:32] [INFO ] Time to serialize gal into /tmp/CTLFireability18350419984058727679.gal : 4 ms
[2024-05-24 03:03:32] [INFO ] Time to serialize properties into /tmp/CTLFireability10813481892146257808.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18350419984058727679.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10813481892146257808.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.04005e+06,0.042377,5096,2,810,5,7122,6,0,313,6624,0


Converting to forward existential form...Done !
original formula: E(!(AX(!((!(E((p147==1) U (p46==1))) * !(AG((p67==1))))))) U AF(((p109==1)&&(p130==1))))
=> equivalent forward existential formula: [(FwdU(Init,!(!(EX(!(!((!(E((p147==1) U (p46==1))) * !(!(E(TRUE U !((p67==1)))))))))))) * !(EG(!(((p109==1)&&(p1...176
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t22, t...287
(forward)formula 0,1,1.90606,74516,1,0,427,424114,221,238,2303,418824,501
FORMULA HealthRecord-PT-07-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 248/248 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 71 transition count 136
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 71 transition count 136
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 126 place count 63 transition count 120
Iterating global reduction 0 with 8 rules applied. Total rules applied 134 place count 63 transition count 120
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 140 place count 63 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 62 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 62 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 61 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 61 transition count 109
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 147 place count 61 transition count 106
Applied a total of 147 rules in 15 ms. Remains 61 /130 variables (removed 69) and now considering 106/248 (removed 142) transitions.
[2024-05-24 03:03:34] [INFO ] Flow matrix only has 103 transitions (discarded 3 similar events)
// Phase 1: matrix 103 rows 61 cols
[2024-05-24 03:03:34] [INFO ] Computed 9 invariants in 5 ms
[2024-05-24 03:03:34] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-24 03:03:34] [INFO ] Flow matrix only has 103 transitions (discarded 3 similar events)
[2024-05-24 03:03:34] [INFO ] Invariant cache hit.
[2024-05-24 03:03:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:03:34] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-05-24 03:03:34] [INFO ] Flow matrix only has 103 transitions (discarded 3 similar events)
[2024-05-24 03:03:34] [INFO ] Invariant cache hit.
[2024-05-24 03:03:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-24 03:03:35] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:03:35] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-24 03:03:35] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-24 03:03:35] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:03:35] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:03:35] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-24 03:03:36] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:03:36] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:03:36] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:03:36] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 102/163 variables, 61/80 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 1/164 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (OVERLAPS) 0/164 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 81 constraints, problems are : Problem set: 0 solved, 105 unsolved in 2740 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-24 03:03:37] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:03:38] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:03:38] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 102/163 variables, 61/83 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 105/188 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 1/164 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (OVERLAPS) 0/164 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 189 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3562 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 13/13 constraints]
After SMT, in 6332ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 6333ms
Starting structural reductions in LTL mode, iteration 1 : 61/130 places, 106/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6503 ms. Remains : 61/130 places, 106/248 transitions.
[2024-05-24 03:03:41] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:03:41] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:03:41] [INFO ] Input system was already deterministic with 106 transitions.
[2024-05-24 03:03:41] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:03:41] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:03:41] [INFO ] Time to serialize gal into /tmp/CTLFireability2475578007956482696.gal : 2 ms
[2024-05-24 03:03:41] [INFO ] Time to serialize properties into /tmp/CTLFireability4995274534658376719.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2475578007956482696.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4995274534658376719.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.24241e+06,0.130986,9652,2,1789,5,25511,6,0,346,28863,0


Converting to forward existential form...Done !
original formula: AX((E(A(!(((p142==1)&&(p27==1))) U EF((p135==1))) U ((p86==1) + (((p49==1) * EF((p41==1))) * AF((p144==1))))) + (AX(AX(AX((p6==1)))) * AF...189
=> equivalent forward existential formula: ([(EY(EY(EY((EY(Init) * !(E(!((E(!(E(TRUE U (p135==1))) U (!(!(((p142==1)&&(p27==1)))) * !(E(TRUE U (p135==1))))...552
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, ...369
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,4.59043,156080,1,0,636,927496,262,360,2589,926503,697
FORMULA HealthRecord-PT-07-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 248/248 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 66 transition count 126
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 66 transition count 126
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 137 place count 57 transition count 108
Iterating global reduction 0 with 9 rules applied. Total rules applied 146 place count 57 transition count 108
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 155 place count 57 transition count 99
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 158 place count 54 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 161 place count 54 transition count 90
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 164 place count 51 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 167 place count 51 transition count 84
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 175 place count 51 transition count 76
Applied a total of 175 rules in 3 ms. Remains 51 /130 variables (removed 79) and now considering 76/248 (removed 172) transitions.
[2024-05-24 03:03:45] [INFO ] Flow matrix only has 73 transitions (discarded 3 similar events)
// Phase 1: matrix 73 rows 51 cols
[2024-05-24 03:03:45] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:03:45] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 03:03:45] [INFO ] Flow matrix only has 73 transitions (discarded 3 similar events)
[2024-05-24 03:03:45] [INFO ] Invariant cache hit.
[2024-05-24 03:03:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:03:45] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 75 sub problems to find dead transitions.
[2024-05-24 03:03:45] [INFO ] Flow matrix only has 73 transitions (discarded 3 similar events)
[2024-05-24 03:03:45] [INFO ] Invariant cache hit.
[2024-05-24 03:03:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-05-24 03:03:46] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:03:46] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 72/123 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 1/124 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 0/124 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 63 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1195 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-05-24 03:03:47] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-05-24 03:03:47] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-05-24 03:03:47] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 72/123 variables, 51/65 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 75/140 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 1/124 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 12 (OVERLAPS) 0/124 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 141 constraints, problems are : Problem set: 0 solved, 75 unsolved in 2003 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 5/5 constraints]
After SMT, in 3212ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 3213ms
Starting structural reductions in LTL mode, iteration 1 : 51/130 places, 76/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3297 ms. Remains : 51/130 places, 76/248 transitions.
[2024-05-24 03:03:49] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:03:49] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:03:49] [INFO ] Input system was already deterministic with 76 transitions.
[2024-05-24 03:03:49] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:03:49] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:03:49] [INFO ] Time to serialize gal into /tmp/CTLFireability16349283331823417625.gal : 1 ms
[2024-05-24 03:03:49] [INFO ] Time to serialize properties into /tmp/CTLFireability5068010697773724908.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16349283331823417625.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5068010697773724908.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,745776,0.18522,12356,2,2698,5,43673,6,0,276,28545,0


Converting to forward existential form...Done !
original formula: EF(((p49==1) * AF((EG(EX((p38==1))) * EF((p36==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (p49==1)) * !(EG(!((EG(EX((p38==1))) * E(TRUE U (p36==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t15, t17, t19, t31, t32, t36, t40, Inter...247
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,4.66823,161492,1,0,328,995263,182,198,2062,974821,354
FORMULA HealthRecord-PT-07-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 248/248 transitions.
Graph (trivial) has 114 edges and 130 vertex of which 10 / 130 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 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 42 place count 83 transition count 164
Iterating global reduction 0 with 41 rules applied. Total rules applied 83 place count 83 transition count 164
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 86 place count 80 transition count 158
Iterating global reduction 0 with 3 rules applied. Total rules applied 89 place count 80 transition count 158
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 91 place count 80 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 80 transition count 151
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 1 with 2 rules applied. Total rules applied 98 place count 79 transition count 150
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 101 place count 76 transition count 147
Applied a total of 101 rules in 25 ms. Remains 76 /130 variables (removed 54) and now considering 147/248 (removed 101) transitions.
[2024-05-24 03:03:53] [INFO ] Flow matrix only has 138 transitions (discarded 9 similar events)
// Phase 1: matrix 138 rows 76 cols
[2024-05-24 03:03:53] [INFO ] Computed 11 invariants in 1 ms
[2024-05-24 03:03:53] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 03:03:53] [INFO ] Flow matrix only has 138 transitions (discarded 9 similar events)
[2024-05-24 03:03:53] [INFO ] Invariant cache hit.
[2024-05-24 03:03:54] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-05-24 03:03:54] [INFO ] Redundant transitions in 15 ms returned []
Running 133 sub problems to find dead transitions.
[2024-05-24 03:03:54] [INFO ] Flow matrix only has 138 transitions (discarded 9 similar events)
[2024-05-24 03:03:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 2/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-24 03:03:54] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:03:54] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:03:54] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:03:54] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:03:54] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-24 03:03:55] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 5/76 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 137/213 variables, 76/93 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 0/213 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/214 variables, and 93 constraints, problems are : Problem set: 0 solved, 133 unsolved in 3195 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 2/71 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 5/76 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-24 03:03:58] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-24 03:03:58] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:03:58] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-24 03:03:58] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:03:58] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:03:58] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/76 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (OVERLAPS) 137/213 variables, 76/99 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 133/232 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/213 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 14 (OVERLAPS) 0/213 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/214 variables, and 232 constraints, problems are : Problem set: 0 solved, 133 unsolved in 4562 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 12/12 constraints]
After SMT, in 7803ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 7805ms
Starting structural reductions in SI_CTL mode, iteration 1 : 76/130 places, 147/248 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7955 ms. Remains : 76/130 places, 147/248 transitions.
[2024-05-24 03:04:01] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:04:01] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:04:01] [INFO ] Input system was already deterministic with 147 transitions.
[2024-05-24 03:04:01] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:04:01] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:04:01] [INFO ] Time to serialize gal into /tmp/CTLFireability11870811677351724618.gal : 1 ms
[2024-05-24 03:04:01] [INFO ] Time to serialize properties into /tmp/CTLFireability12463337005237720772.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11870811677351724618.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12463337005237720772.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.04647e+06,0.415836,17560,2,3801,5,38229,6,0,431,70018,0


Converting to forward existential form...Done !
original formula: A(((!((((p108==1)||(p38==1))||((p133==1)||(p94==1)))) + (E(!(((p109==1)&&(p116==1))) U A((p90==1) U (p68==1))) * !(EG((p99==1))))) + ((!(...489
=> equivalent forward existential formula: [((Init * !(EG(!((!(E(TRUE U !((p130==1)))) + !((E(!(E(TRUE U (p102==1))) U (!((E(E(TRUE U (p69==1)) U E((p136==...1200
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t7, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...593
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-05-24 03:04:31] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:04:31] [INFO ] Applying decomposition
[2024-05-24 03:04:31] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph638327495289601701.txt' '-o' '/tmp/graph638327495289601701.bin' '-w' '/tmp/graph638327495289601701.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph638327495289601701.bin' '-l' '-1' '-v' '-w' '/tmp/graph638327495289601701.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:04:32] [INFO ] Decomposing Gal with order
[2024-05-24 03:04:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:04:32] [INFO ] Removed a total of 106 redundant transitions.
[2024-05-24 03:04:32] [INFO ] Flatten gal took : 38 ms
[2024-05-24 03:04:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 6 ms.
[2024-05-24 03:04:32] [INFO ] Time to serialize gal into /tmp/CTLFireability2294236010813610368.gal : 2 ms
[2024-05-24 03:04:32] [INFO ] Time to serialize properties into /tmp/CTLFireability6593029636443102759.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2294236010813610368.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6593029636443102759.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.04647e+06,0.09419,7504,302,348,5197,2434,313,11934,165,11094,0


Converting to forward existential form...Done !
original formula: A(((!((((i6.u11.p108==1)||(i1.u3.p38==1))||((i7.u14.p133==1)||(i6.u12.p94==1)))) + (E(!(((i6.u12.p109==1)&&(i7.u14.p116==1))) U A((i6.u12...662
=> equivalent forward existential formula: [((Init * !(EG(!((!(E(TRUE U !((i7.u14.p130==1)))) + !((E(!(E(TRUE U (i6.u12.p102==1))) U (!((E(E(TRUE U (i4.u7....1523
Reverse transition relation is NOT exact ! Due to transitions t90, t91, t95, t96, t97, t101, t108, t109, t115, t118, t119, t124, t136, u1.t73, u1.t74, u1.t...873
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,1.16846,49744,1,0,72269,17200,1912,154203,804,67690,140891
FORMULA HealthRecord-PT-07-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 248/248 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 75 transition count 144
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 75 transition count 144
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 116 place count 69 transition count 132
Iterating global reduction 0 with 6 rules applied. Total rules applied 122 place count 69 transition count 132
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 127 place count 69 transition count 127
Applied a total of 127 rules in 8 ms. Remains 69 /130 variables (removed 61) and now considering 127/248 (removed 121) transitions.
[2024-05-24 03:04:33] [INFO ] Flow matrix only has 124 transitions (discarded 3 similar events)
// Phase 1: matrix 124 rows 69 cols
[2024-05-24 03:04:33] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:04:33] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-24 03:04:33] [INFO ] Flow matrix only has 124 transitions (discarded 3 similar events)
[2024-05-24 03:04:33] [INFO ] Invariant cache hit.
[2024-05-24 03:04:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:04:33] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-05-24 03:04:33] [INFO ] Flow matrix only has 124 transitions (discarded 3 similar events)
[2024-05-24 03:04:33] [INFO ] Invariant cache hit.
[2024-05-24 03:04:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-24 03:04:34] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 10 ms to minimize.
[2024-05-24 03:04:34] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:04:34] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:04:34] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-24 03:04:34] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:04:34] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2024-05-24 03:04:34] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:04:34] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:04:34] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:04:34] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:04:34] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:04:34] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:04:34] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:04:34] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:04:34] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-24 03:04:35] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 123/192 variables, 69/94 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 1/193 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 0/193 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 95 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3931 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 16/25 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-24 03:04:37] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:04:37] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:04:38] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:04:38] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:04:38] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-24 03:04:38] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2024-05-24 03:04:38] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:04:38] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:04:38] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-24 03:04:38] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-24 03:04:39] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:04:39] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-24 03:04:39] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-24 03:04:40] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:04:40] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:04:40] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:04:40] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-24 03:04:40] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 11 (OVERLAPS) 123/192 variables, 69/112 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 126/238 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 14 (OVERLAPS) 1/193 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/193 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 16 (OVERLAPS) 0/193 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 239 constraints, problems are : Problem set: 0 solved, 126 unsolved in 7906 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 34/34 constraints]
After SMT, in 11899ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 11900ms
Starting structural reductions in LTL mode, iteration 1 : 69/130 places, 127/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12071 ms. Remains : 69/130 places, 127/248 transitions.
[2024-05-24 03:04:45] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:04:45] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:04:45] [INFO ] Input system was already deterministic with 127 transitions.
[2024-05-24 03:04:45] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:04:45] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:04:45] [INFO ] Time to serialize gal into /tmp/CTLFireability9054958601774699652.gal : 1 ms
[2024-05-24 03:04:45] [INFO ] Time to serialize properties into /tmp/CTLFireability11630940921280517955.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9054958601774699652.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11630940921280517955.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.69847e+06,0.270663,14040,2,2629,5,34526,6,0,399,56666,0


Converting to forward existential form...Done !
original formula: (E((E(EF((p48==1)) U (p113==1)) * ((!((((((((p18==1)&&(p37==1))&&((p56==1)&&(p61==1)))&&(((p66==1)&&(p71==1))&&((p76==1)&&(p83==1))))&&((...537
=> equivalent forward existential formula: [(FwdU((Init * !(E((E(E(TRUE U (p48==1)) U (p113==1)) * ((!((((((((p18==1)&&(p37==1))&&((p56==1)&&(p61==1)))&&((...701
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...459
(forward)formula 0,1,10.3222,288068,1,0,731,1.87901e+06,309,375,3039,1.44745e+06,798
FORMULA HealthRecord-PT-07-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 248/248 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 71 transition count 135
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 71 transition count 135
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 127 place count 62 transition count 117
Iterating global reduction 0 with 9 rules applied. Total rules applied 136 place count 62 transition count 117
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 145 place count 62 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 147 place count 60 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 149 place count 60 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 151 place count 58 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 153 place count 58 transition count 98
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 158 place count 58 transition count 93
Applied a total of 158 rules in 3 ms. Remains 58 /130 variables (removed 72) and now considering 93/248 (removed 155) transitions.
[2024-05-24 03:04:55] [INFO ] Flow matrix only has 89 transitions (discarded 4 similar events)
// Phase 1: matrix 89 rows 58 cols
[2024-05-24 03:04:55] [INFO ] Computed 10 invariants in 3 ms
[2024-05-24 03:04:55] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-24 03:04:55] [INFO ] Flow matrix only has 89 transitions (discarded 4 similar events)
[2024-05-24 03:04:55] [INFO ] Invariant cache hit.
[2024-05-24 03:04:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:04:55] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-05-24 03:04:55] [INFO ] Flow matrix only has 89 transitions (discarded 4 similar events)
[2024-05-24 03:04:55] [INFO ] Invariant cache hit.
[2024-05-24 03:04:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-24 03:04:56] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:04:56] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:04:56] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-24 03:04:56] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-24 03:04:56] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 88/146 variables, 58/73 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 1/147 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (OVERLAPS) 0/147 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 74 constraints, problems are : Problem set: 0 solved, 92 unsolved in 1993 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-24 03:04:58] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-24 03:04:58] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-24 03:04:58] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:04:58] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:04:58] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 88/146 variables, 58/78 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 92/170 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/146 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 11 (OVERLAPS) 1/147 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/147 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 13 (OVERLAPS) 0/147 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 171 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2913 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 10/10 constraints]
After SMT, in 4924ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 4925ms
Starting structural reductions in LTL mode, iteration 1 : 58/130 places, 93/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5024 ms. Remains : 58/130 places, 93/248 transitions.
[2024-05-24 03:05:00] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:05:00] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:05:00] [INFO ] Input system was already deterministic with 93 transitions.
[2024-05-24 03:05:00] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:05:00] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:05:00] [INFO ] Time to serialize gal into /tmp/CTLFireability9455502543206239038.gal : 1 ms
[2024-05-24 03:05:00] [INFO ] Time to serialize properties into /tmp/CTLFireability14451200406841490440.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9455502543206239038.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14451200406841490440.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.34364e+06,0.234869,14068,2,3359,5,47069,6,0,318,35378,0


Converting to forward existential form...Done !
original formula: AG((((p101==1) + AF((p31==0))) + (((EF(((p36==0)||(p152==0))) * A((p73==1) U (p127==1))) * ((p95==0)&&(p106==0))) * (EG((p64==1)) + AX((p...166
=> equivalent forward existential formula: ((([((FwdU(Init,TRUE) * !(((p101==1) + !(EG(!((p31==0))))))) * !(E(TRUE U ((p36==0)||(p152==0)))))] = FALSE * ([...567
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t20, t22, t24, t...347
(forward)formula 0,0,1.16873,44752,1,0,257,222859,212,116,2233,203177,276
FORMULA HealthRecord-PT-07-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 248/248 transitions.
Graph (trivial) has 166 edges and 130 vertex of which 12 / 130 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 57 place count 67 transition count 135
Iterating global reduction 0 with 56 rules applied. Total rules applied 113 place count 67 transition count 135
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 122 place count 58 transition count 117
Iterating global reduction 0 with 9 rules applied. Total rules applied 131 place count 58 transition count 117
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 140 place count 58 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 142 place count 56 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 144 place count 56 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 146 place count 54 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 148 place count 54 transition count 98
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 153 place count 54 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 159 place count 54 transition count 87
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 163 place count 52 transition count 85
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 167 place count 48 transition count 81
Applied a total of 167 rules in 17 ms. Remains 48 /130 variables (removed 82) and now considering 81/248 (removed 167) transitions.
[2024-05-24 03:05:02] [INFO ] Flow matrix only has 72 transitions (discarded 9 similar events)
// Phase 1: matrix 72 rows 48 cols
[2024-05-24 03:05:02] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:05:02] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-05-24 03:05:02] [INFO ] Flow matrix only has 72 transitions (discarded 9 similar events)
[2024-05-24 03:05:02] [INFO ] Invariant cache hit.
[2024-05-24 03:05:02] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
[2024-05-24 03:05:02] [INFO ] Redundant transitions in 13 ms returned []
Running 67 sub problems to find dead transitions.
[2024-05-24 03:05:02] [INFO ] Flow matrix only has 72 transitions (discarded 9 similar events)
[2024-05-24 03:05:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 7/48 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-24 03:05:02] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-24 03:05:02] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:05:02] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (OVERLAPS) 71/119 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 0/119 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/120 variables, and 60 constraints, problems are : Problem set: 0 solved, 67 unsolved in 923 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 48/48 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 7/48 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (OVERLAPS) 71/119 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 67/127 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 0/119 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/120 variables, and 127 constraints, problems are : Problem set: 0 solved, 67 unsolved in 913 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 48/48 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 3/3 constraints]
After SMT, in 1850ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 1851ms
Starting structural reductions in SI_CTL mode, iteration 1 : 48/130 places, 81/248 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2283 ms. Remains : 48/130 places, 81/248 transitions.
[2024-05-24 03:05:04] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:05:04] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:05:04] [INFO ] Input system was already deterministic with 81 transitions.
[2024-05-24 03:05:04] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:05:04] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:05:04] [INFO ] Time to serialize gal into /tmp/CTLFireability18030180869577448144.gal : 1 ms
[2024-05-24 03:05:04] [INFO ] Time to serialize properties into /tmp/CTLFireability4426873810052909978.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18030180869577448144.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4426873810052909978.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,177559,0.145331,9512,2,1619,5,21064,6,0,257,25716,0


Converting to forward existential form...Done !
original formula: EF(((p8==1) * ((AF((p44==1)) + (p103==0)) + (EF(((p82==0)||(p152==0))) * EF((p50==0))))))
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * (p8==1)) * !(EG(!((p44==1)))))] != FALSE + [((FwdU(Init,TRUE) * (p8==1)) * (p103==0))] !=...264
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t17, t19, t21, t29, t30...290
(forward)formula 0,1,1.40368,53116,1,0,291,292580,177,138,1880,310000,315
FORMULA HealthRecord-PT-07-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 248/248 transitions.
Graph (trivial) has 188 edges and 130 vertex of which 14 / 130 are part of one of the 7 SCC in 2 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 60 place count 63 transition count 128
Iterating global reduction 0 with 59 rules applied. Total rules applied 119 place count 63 transition count 128
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 129 place count 53 transition count 108
Iterating global reduction 0 with 10 rules applied. Total rules applied 139 place count 53 transition count 108
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 149 place count 53 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 151 place count 51 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 153 place count 51 transition count 92
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 155 place count 49 transition count 88
Iterating global reduction 1 with 2 rules applied. Total rules applied 157 place count 49 transition count 88
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 163 place count 49 transition count 82
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 169 place count 49 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 173 place count 47 transition count 74
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 177 place count 43 transition count 70
Applied a total of 177 rules in 20 ms. Remains 43 /130 variables (removed 87) and now considering 70/248 (removed 178) transitions.
[2024-05-24 03:05:05] [INFO ] Flow matrix only has 61 transitions (discarded 9 similar events)
// Phase 1: matrix 61 rows 43 cols
[2024-05-24 03:05:05] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:05:05] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 03:05:05] [INFO ] Flow matrix only has 61 transitions (discarded 9 similar events)
[2024-05-24 03:05:05] [INFO ] Invariant cache hit.
[2024-05-24 03:05:05] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-05-24 03:05:05] [INFO ] Redundant transitions in 15 ms returned []
Running 56 sub problems to find dead transitions.
[2024-05-24 03:05:05] [INFO ] Flow matrix only has 61 transitions (discarded 9 similar events)
[2024-05-24 03:05:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 7/43 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-24 03:05:06] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:05:06] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-24 03:05:06] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 60/103 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/103 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/104 variables, and 55 constraints, problems are : Problem set: 0 solved, 56 unsolved in 749 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 7/43 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-24 03:05:06] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 60/103 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 56/112 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (OVERLAPS) 0/103 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/104 variables, and 112 constraints, problems are : Problem set: 0 solved, 56 unsolved in 828 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 4/4 constraints]
After SMT, in 1592ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 1592ms
Starting structural reductions in SI_CTL mode, iteration 1 : 43/130 places, 70/248 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1711 ms. Remains : 43/130 places, 70/248 transitions.
[2024-05-24 03:05:07] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:05:07] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:05:07] [INFO ] Input system was already deterministic with 70 transitions.
[2024-05-24 03:05:07] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:05:07] [INFO ] Flatten gal took : 1 ms
[2024-05-24 03:05:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4812175268565577728.gal : 1 ms
[2024-05-24 03:05:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15570045057184310412.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4812175268565577728.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15570045057184310412.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality15570045057184310412.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 16
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :16 after 112
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :112 after 144
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :144 after 176
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :176 after 4176
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4176 after 23472
Reachability property HealthRecord-PT-07-CTLFireability-2024-10 is true.
FORMULA HealthRecord-PT-07-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,129459,0.03617,4816,2,528,14,5396,6,0,226,5131,0
Total reachable state count : 129459

Verifying 1 reachability properties.
Reachability property HealthRecord-PT-07-CTLFireability-2024-10 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
HealthRecord-PT-07-CTLFireability-2024-10,1,0.036524,4816,2,44,14,5396,7,0,229,5131,0
RANDOM walk for 40000 steps (4013 resets) in 236 ms. (168 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (646 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 13137 steps, run visited all 1 properties in 20 ms. (steps per millisecond=656 )
Probabilistic random walk after 13137 steps, saw 2768 distinct states, run finished after 20 ms. (steps per millisecond=656 ) properties seen :1
Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 248/248 transitions.
Graph (trivial) has 97 edges and 130 vertex of which 14 / 130 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 60 place count 63 transition count 128
Iterating global reduction 0 with 59 rules applied. Total rules applied 119 place count 63 transition count 128
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 129 place count 53 transition count 108
Iterating global reduction 0 with 10 rules applied. Total rules applied 139 place count 53 transition count 108
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 149 place count 53 transition count 98
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 152 place count 50 transition count 89
Iterating global reduction 1 with 3 rules applied. Total rules applied 155 place count 50 transition count 89
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 157 place count 48 transition count 85
Iterating global reduction 1 with 2 rules applied. Total rules applied 159 place count 48 transition count 85
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 165 place count 48 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 171 place count 48 transition count 73
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 175 place count 46 transition count 71
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 179 place count 42 transition count 67
Applied a total of 179 rules in 10 ms. Remains 42 /130 variables (removed 88) and now considering 67/248 (removed 181) transitions.
[2024-05-24 03:05:07] [INFO ] Flow matrix only has 58 transitions (discarded 9 similar events)
// Phase 1: matrix 58 rows 42 cols
[2024-05-24 03:05:07] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:05:07] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 03:05:07] [INFO ] Flow matrix only has 58 transitions (discarded 9 similar events)
[2024-05-24 03:05:07] [INFO ] Invariant cache hit.
[2024-05-24 03:05:07] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-24 03:05:07] [INFO ] Redundant transitions in 15 ms returned []
Running 53 sub problems to find dead transitions.
[2024-05-24 03:05:07] [INFO ] Flow matrix only has 58 transitions (discarded 9 similar events)
[2024-05-24 03:05:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 7/42 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-24 03:05:07] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:05:07] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:05:08] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-24 03:05:08] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 57/99 variables, 42/55 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 0/99 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/100 variables, and 55 constraints, problems are : Problem set: 0 solved, 53 unsolved in 760 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 7/42 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-24 03:05:08] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-24 03:05:08] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:05:08] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:05:08] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 57/99 variables, 42/59 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 53/112 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 0/99 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/100 variables, and 112 constraints, problems are : Problem set: 0 solved, 53 unsolved in 948 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 8/8 constraints]
After SMT, in 1724ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 1724ms
Starting structural reductions in SI_CTL mode, iteration 1 : 42/130 places, 67/248 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1820 ms. Remains : 42/130 places, 67/248 transitions.
[2024-05-24 03:05:09] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:05:09] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:05:09] [INFO ] Input system was already deterministic with 67 transitions.
[2024-05-24 03:05:09] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:05:09] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:05:09] [INFO ] Time to serialize gal into /tmp/CTLFireability13590007354454475188.gal : 1 ms
[2024-05-24 03:05:09] [INFO ] Time to serialize properties into /tmp/CTLFireability536329745517608758.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13590007354454475188.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability536329745517608758.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,119092,0.030065,4444,2,400,5,4147,6,0,219,4100,0


Converting to forward existential form...Done !
original formula: AF(AG((((p44==0)&&(p128==0))&&(((((p18==0)||(p37==0))||((p56==0)||(p61==0)))||(((p66==0)||(p71==0))||((p76==0)||(p83==0))))||((p109==0)||...169
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((((p44==0)&&(p128==0))&&(((((p18==0)||(p37==0))||((p56==0)||(p61==0)))||(((p66==0)||(p...226
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t14, t15, t23, t24, t39, t40, Interse...245
(forward)formula 0,0,0.300638,16852,1,0,193,62619,152,124,1600,92800,212
FORMULA HealthRecord-PT-07-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 248/248 transitions.
Discarding 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 66 place count 64 transition count 122
Iterating global reduction 0 with 66 rules applied. Total rules applied 132 place count 64 transition count 122
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 141 place count 55 transition count 104
Iterating global reduction 0 with 9 rules applied. Total rules applied 150 place count 55 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 159 place count 55 transition count 95
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 162 place count 52 transition count 86
Iterating global reduction 1 with 3 rules applied. Total rules applied 165 place count 52 transition count 86
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 168 place count 49 transition count 80
Iterating global reduction 1 with 3 rules applied. Total rules applied 171 place count 49 transition count 80
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 180 place count 49 transition count 71
Applied a total of 180 rules in 5 ms. Remains 49 /130 variables (removed 81) and now considering 71/248 (removed 177) transitions.
[2024-05-24 03:05:09] [INFO ] Flow matrix only has 68 transitions (discarded 3 similar events)
// Phase 1: matrix 68 rows 49 cols
[2024-05-24 03:05:09] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:05:09] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 03:05:09] [INFO ] Flow matrix only has 68 transitions (discarded 3 similar events)
[2024-05-24 03:05:09] [INFO ] Invariant cache hit.
[2024-05-24 03:05:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:05:09] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2024-05-24 03:05:09] [INFO ] Flow matrix only has 68 transitions (discarded 3 similar events)
[2024-05-24 03:05:09] [INFO ] Invariant cache hit.
[2024-05-24 03:05:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-24 03:05:10] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:05:10] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 67/116 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 1/117 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 61 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1092 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-24 03:05:11] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:05:11] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:05:11] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-24 03:05:11] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-24 03:05:11] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 67/116 variables, 49/65 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 70/135 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (OVERLAPS) 1/117 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/117 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 12 (OVERLAPS) 0/117 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 136 constraints, problems are : Problem set: 0 solved, 70 unsolved in 2040 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 7/7 constraints]
After SMT, in 3144ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 3145ms
Starting structural reductions in LTL mode, iteration 1 : 49/130 places, 71/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3233 ms. Remains : 49/130 places, 71/248 transitions.
[2024-05-24 03:05:13] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:05:13] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:05:13] [INFO ] Input system was already deterministic with 71 transitions.
[2024-05-24 03:05:13] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:05:13] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:05:13] [INFO ] Time to serialize gal into /tmp/CTLFireability6895090832241774372.gal : 1 ms
[2024-05-24 03:05:13] [INFO ] Time to serialize properties into /tmp/CTLFireability4765258565826054629.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6895090832241774372.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4765258565826054629.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,484794,0.107748,8468,2,2025,5,24044,6,0,263,15397,0


Converting to forward existential form...Done !
original formula: EF(EX(((p17==1)&&(p152==1))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * ((p17==1)&&(p152==1)))] != FALSE
(forward)formula 0,1,0.128706,8732,1,0,8,24044,8,1,465,15397,2
FORMULA HealthRecord-PT-07-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 248/248 transitions.
Graph (trivial) has 184 edges and 130 vertex of which 14 / 130 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 58 place count 65 transition count 132
Iterating global reduction 0 with 57 rules applied. Total rules applied 115 place count 65 transition count 132
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 125 place count 55 transition count 112
Iterating global reduction 0 with 10 rules applied. Total rules applied 135 place count 55 transition count 112
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 144 place count 55 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 145 place count 54 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 146 place count 54 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 147 place count 53 transition count 98
Iterating global reduction 1 with 1 rules applied. Total rules applied 148 place count 53 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 151 place count 53 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 157 place count 53 transition count 89
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 161 place count 51 transition count 87
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 165 place count 47 transition count 83
Applied a total of 165 rules in 18 ms. Remains 47 /130 variables (removed 83) and now considering 83/248 (removed 165) transitions.
[2024-05-24 03:05:13] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
// Phase 1: matrix 74 rows 47 cols
[2024-05-24 03:05:13] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:05:13] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 03:05:13] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
[2024-05-24 03:05:13] [INFO ] Invariant cache hit.
[2024-05-24 03:05:13] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-05-24 03:05:13] [INFO ] Redundant transitions in 16 ms returned []
Running 69 sub problems to find dead transitions.
[2024-05-24 03:05:13] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
[2024-05-24 03:05:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 7/47 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-05-24 03:05:13] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-24 03:05:13] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:05:13] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (OVERLAPS) 73/120 variables, 47/59 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 0/120 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/121 variables, and 59 constraints, problems are : Problem set: 0 solved, 69 unsolved in 936 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 7/47 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-05-24 03:05:14] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:05:14] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-24 03:05:14] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-05-24 03:05:14] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 73/120 variables, 47/63 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 69/132 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/121 variables, and 132 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1312 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 7/7 constraints]
After SMT, in 2270ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 2272ms
Starting structural reductions in SI_CTL mode, iteration 1 : 47/130 places, 83/248 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2390 ms. Remains : 47/130 places, 83/248 transitions.
[2024-05-24 03:05:15] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:05:15] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:05:15] [INFO ] Input system was already deterministic with 83 transitions.
[2024-05-24 03:05:15] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:05:15] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:05:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14968321188592214159.gal : 1 ms
[2024-05-24 03:05:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15805671154496245575.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14968321188592214159.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15805671154496245575.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (4037 resets) in 68 ms. (579 steps per ms) remains 1/1 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality15805671154496245575.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 16
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :16 after 114
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :114 after 160
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :160 after 576
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :576 after 4336
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4336 after 50834
BEST_FIRST walk for 40004 steps (649 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
Invariant property HealthRecord-PT-07-CTLFireability-2023-13 does not hold.
FORMULA HealthRecord-PT-07-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,118466,0.03784,5244,2,747,13,6478,6,0,255,6215,0
Total reachable state count : 118466

Verifying 1 reachability properties.
Invariant property HealthRecord-PT-07-CTLFireability-2023-13 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
HealthRecord-PT-07-CTLFireability-2023-13,1,0.038587,5244,2,48,13,6478,7,0,263,6215,0
ITS tools runner thread asked to quit. Dying gracefully.
Finished probabilistic random walk after 16446 steps, run visited all 1 properties in 22 ms. (steps per millisecond=747 )
Probabilistic random walk after 16446 steps, saw 3273 distinct states, run finished after 22 ms. (steps per millisecond=747 ) properties seen :1
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 248/248 transitions.
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 65 place count 65 transition count 124
Iterating global reduction 0 with 65 rules applied. Total rules applied 130 place count 65 transition count 124
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 138 place count 57 transition count 108
Iterating global reduction 0 with 8 rules applied. Total rules applied 146 place count 57 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 152 place count 57 transition count 102
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 155 place count 54 transition count 93
Iterating global reduction 1 with 3 rules applied. Total rules applied 158 place count 54 transition count 93
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 161 place count 51 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 164 place count 51 transition count 87
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 173 place count 51 transition count 78
Applied a total of 173 rules in 3 ms. Remains 51 /130 variables (removed 79) and now considering 78/248 (removed 170) transitions.
[2024-05-24 03:05:15] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
// Phase 1: matrix 75 rows 51 cols
[2024-05-24 03:05:15] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:05:15] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 03:05:15] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
[2024-05-24 03:05:15] [INFO ] Invariant cache hit.
[2024-05-24 03:05:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:05:15] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2024-05-24 03:05:15] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
[2024-05-24 03:05:15] [INFO ] Invariant cache hit.
[2024-05-24 03:05:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-24 03:05:16] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:05:16] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-24 03:05:16] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 74/125 variables, 51/63 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-24 03:05:16] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 65 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1708 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-24 03:05:17] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-24 03:05:17] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 74/125 variables, 51/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 77/143 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 1/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1917 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 6/6 constraints]
After SMT, in 3640ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 3641ms
Starting structural reductions in LTL mode, iteration 1 : 51/130 places, 78/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3723 ms. Remains : 51/130 places, 78/248 transitions.
[2024-05-24 03:05:19] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:05:19] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:05:19] [INFO ] Input system was already deterministic with 78 transitions.
[2024-05-24 03:05:19] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:05:19] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:05:19] [INFO ] Time to serialize gal into /tmp/CTLFireability5511675342105315043.gal : 1 ms
[2024-05-24 03:05:19] [INFO ] Time to serialize properties into /tmp/CTLFireability11312471413853923520.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5511675342105315043.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11312471413853923520.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,653193,0.329894,16596,2,4305,5,66569,6,0,278,40040,0


Converting to forward existential form...Done !
original formula: AG(AX((p88==0)))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !((p88==0)))] = FALSE
(forward)formula 0,0,0.378192,16860,1,0,8,66569,9,2,487,40040,2
FORMULA HealthRecord-PT-07-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 248/248 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 71 transition count 135
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 71 transition count 135
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 125 place count 64 transition count 121
Iterating global reduction 0 with 7 rules applied. Total rules applied 132 place count 64 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 141 place count 64 transition count 112
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 143 place count 62 transition count 106
Iterating global reduction 1 with 2 rules applied. Total rules applied 145 place count 62 transition count 106
Applied a total of 145 rules in 4 ms. Remains 62 /130 variables (removed 68) and now considering 106/248 (removed 142) transitions.
[2024-05-24 03:05:19] [INFO ] Flow matrix only has 102 transitions (discarded 4 similar events)
// Phase 1: matrix 102 rows 62 cols
[2024-05-24 03:05:19] [INFO ] Computed 10 invariants in 2 ms
[2024-05-24 03:05:19] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 03:05:19] [INFO ] Flow matrix only has 102 transitions (discarded 4 similar events)
[2024-05-24 03:05:19] [INFO ] Invariant cache hit.
[2024-05-24 03:05:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:05:19] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-05-24 03:05:19] [INFO ] Flow matrix only has 102 transitions (discarded 4 similar events)
[2024-05-24 03:05:19] [INFO ] Invariant cache hit.
[2024-05-24 03:05:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-24 03:05:20] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:05:20] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-24 03:05:20] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:05:20] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:05:20] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:05:20] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:05:20] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:05:20] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 101/163 variables, 62/80 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-24 03:05:21] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:05:21] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:05:21] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 1/164 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (OVERLAPS) 0/164 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 84 constraints, problems are : Problem set: 0 solved, 105 unsolved in 2650 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-24 03:05:22] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:05:23] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-24 03:05:23] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 101/163 variables, 62/86 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 105/191 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (OVERLAPS) 1/164 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-24 03:05:25] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/164 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/164 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 14 (OVERLAPS) 0/164 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 193 constraints, problems are : Problem set: 0 solved, 105 unsolved in 4645 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 15/15 constraints]
After SMT, in 7321ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 7322ms
Starting structural reductions in LTL mode, iteration 1 : 62/130 places, 106/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7418 ms. Remains : 62/130 places, 106/248 transitions.
[2024-05-24 03:05:27] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:05:27] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:05:27] [INFO ] Input system was already deterministic with 106 transitions.
[2024-05-24 03:05:27] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:05:27] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:05:27] [INFO ] Time to serialize gal into /tmp/CTLFireability4226248339993323721.gal : 1 ms
[2024-05-24 03:05:27] [INFO ] Time to serialize properties into /tmp/CTLFireability4342190416973287785.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4226248339993323721.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4342190416973287785.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.65597e+06,0.065434,6512,2,1446,5,11378,6,0,347,14288,0


Converting to forward existential form...Done !
original formula: AG(((E(AF((p67==1)) U (p150!=1)) * ((AX(((p55==1)&&(p152==1))) + (p17==0)) + ((p152==0)||((p132==1)&&(p90==1))))) * (((E((p58==1) U (p136...247
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(E(!(EG(!((p67==1)))) U (p150!=1))))] = FALSE * [(EY(((FwdU(Init,TRUE) * !(((p152==0)||((...386
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...428
Hit Full ! (commute/partial/dont) 103/0/3
(forward)formula 0,0,0.35354,17660,1,0,229,65987,246,100,2562,64188,237
FORMULA HealthRecord-PT-07-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

[2024-05-24 03:05:27] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:05:27] [INFO ] Flatten gal took : 5 ms
Total runtime 222403 ms.

BK_STOP 1716519927740

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-07"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is HealthRecord-PT-07, 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 r180-tall-171640604100746"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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