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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 20:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 12 20:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 20:03 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 71K 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-12-CTLFireability-2024-00
FORMULA_NAME HealthRecord-PT-12-CTLFireability-2024-01
FORMULA_NAME HealthRecord-PT-12-CTLFireability-2024-02
FORMULA_NAME HealthRecord-PT-12-CTLFireability-2024-03
FORMULA_NAME HealthRecord-PT-12-CTLFireability-2024-04
FORMULA_NAME HealthRecord-PT-12-CTLFireability-2024-05
FORMULA_NAME HealthRecord-PT-12-CTLFireability-2024-06
FORMULA_NAME HealthRecord-PT-12-CTLFireability-2024-07
FORMULA_NAME HealthRecord-PT-12-CTLFireability-2024-08
FORMULA_NAME HealthRecord-PT-12-CTLFireability-2024-09
FORMULA_NAME HealthRecord-PT-12-CTLFireability-2024-10
FORMULA_NAME HealthRecord-PT-12-CTLFireability-2024-11
FORMULA_NAME HealthRecord-PT-12-CTLFireability-2023-12
FORMULA_NAME HealthRecord-PT-12-CTLFireability-2023-13
FORMULA_NAME HealthRecord-PT-12-CTLFireability-2023-14
FORMULA_NAME HealthRecord-PT-12-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716520518225

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-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-24 03:15:19] [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:15:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:15:19] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-05-24 03:15:19] [INFO ] Transformed 160 places.
[2024-05-24 03:15:19] [INFO ] Transformed 340 transitions.
[2024-05-24 03:15:19] [INFO ] Found NUPN structural information;
[2024-05-24 03:15:19] [INFO ] Parsed PT model containing 160 places and 340 transitions and 895 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
Support contains 85 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 312/312 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 122 transition count 241
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 122 transition count 241
Applied a total of 76 rules in 23 ms. Remains 122 /160 variables (removed 38) and now considering 241/312 (removed 71) transitions.
[2024-05-24 03:15:19] [INFO ] Flow matrix only has 234 transitions (discarded 7 similar events)
// Phase 1: matrix 234 rows 122 cols
[2024-05-24 03:15:19] [INFO ] Computed 13 invariants in 16 ms
[2024-05-24 03:15:19] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-24 03:15:19] [INFO ] Flow matrix only has 234 transitions (discarded 7 similar events)
[2024-05-24 03:15:19] [INFO ] Invariant cache hit.
[2024-05-24 03:15:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:15:20] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2024-05-24 03:15:20] [INFO ] Flow matrix only has 234 transitions (discarded 7 similar events)
[2024-05-24 03:15:20] [INFO ] Invariant cache hit.
[2024-05-24 03:15:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-24 03:15:21] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 16 ms to minimize.
[2024-05-24 03:15:21] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-05-24 03:15:21] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:15:22] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 2 ms to minimize.
[2024-05-24 03:15:22] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:15:22] [INFO ] Deduced a trap composed of 34 places in 327 ms of which 1 ms to minimize.
[2024-05-24 03:15:22] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:15:22] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:15:22] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:15:22] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:15:22] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:15:22] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:15:22] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:15:22] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:15:22] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:15:22] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:15:22] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:15:22] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:15:22] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:15:22] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-24 03:15:23] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:15:23] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:15:23] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:15:23] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:15:23] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:15:23] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:15:23] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 0 ms to minimize.
[2024-05-24 03:15:24] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:15:24] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:15:24] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:15:24] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:15:24] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:15:24] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-24 03:15:24] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:15:25] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 7 ms to minimize.
[2024-05-24 03:15:25] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:15:25] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
[2024-05-24 03:15:25] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:15:25] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:15:25] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:15:25] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:15:25] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-24 03:15:26] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:15:26] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 0 ms to minimize.
[2024-05-24 03:15:26] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 0 ms to minimize.
[2024-05-24 03:15:26] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:15:26] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:15:26] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 2 ms to minimize.
[2024-05-24 03:15:26] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:15:26] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:15:26] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 2 ms to minimize.
[2024-05-24 03:15:26] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:15:26] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:15:26] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:15:26] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:15:26] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-05-24 03:15:26] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 3 ms to minimize.
[2024-05-24 03:15:27] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:15:27] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:15:27] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:15:27] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:15:27] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-24 03:15:28] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 0 ms to minimize.
[2024-05-24 03:15:28] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:15:28] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (OVERLAPS) 233/355 variables, 122/200 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-24 03:15:30] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:15:31] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:15:31] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:15:31] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:15:31] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:15:31] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:15:31] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:15:31] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:15:31] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:15:31] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:15:31] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 0 ms to minimize.
[2024-05-24 03:15:31] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:15:31] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 0 ms to minimize.
[2024-05-24 03:15:31] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:15:31] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:15:31] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:15:32] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:15:32] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:15:32] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2024-05-24 03:15:32] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-24 03:15:32] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:15:32] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:15:32] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 0 ms to minimize.
[2024-05-24 03:15:32] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-24 03:15:34] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:15:34] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:15:34] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:15:34] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:15:34] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:15:34] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 6/230 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-24 03:15:36] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:15:37] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:15:37] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:15:37] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:15:37] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 0 ms to minimize.
[2024-05-24 03:15:37] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:15:37] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 0 ms to minimize.
[2024-05-24 03:15:37] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:15:37] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:15:37] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2024-05-24 03:15:37] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:15:37] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:15:37] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:15:37] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:15:37] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 15/245 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-24 03:15:38] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:15:38] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:15:39] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:15:39] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 4/249 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-24 03:15:40] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:15:40] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:15:40] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:15:40] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:15:40] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:15:40] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:15:40] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:15:41] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 8/257 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/355 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 17 (OVERLAPS) 1/356 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/356 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-24 03:15:46] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:15:46] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:15:46] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/356 variables, 3/261 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/356 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-24 03:15:50] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:15:50] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:15:50] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 356/356 variables, and 264 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 128/128 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 128/141 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-24 03:15:51] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:15:51] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 0 ms to minimize.
[2024-05-24 03:15:51] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-24 03:15:52] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:15:52] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 2 ms to minimize.
[2024-05-24 03:15:52] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:15:52] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:15:52] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:15:52] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 6/150 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-24 03:15:53] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:15:53] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (OVERLAPS) 233/355 variables, 122/274 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 240/514 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-24 03:15:56] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:15:56] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 2/516 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-24 03:16:02] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 1/517 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 13 (OVERLAPS) 1/356 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-24 03:16:19] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 356/356 variables, and 519 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 143/143 constraints]
After SMT, in 60214ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 60236ms
Starting structural reductions in LTL mode, iteration 1 : 122/160 places, 241/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60680 ms. Remains : 122/160 places, 241/312 transitions.
Support contains 85 out of 122 places after structural reductions.
[2024-05-24 03:16:20] [INFO ] Flatten gal took : 42 ms
[2024-05-24 03:16:20] [INFO ] Flatten gal took : 18 ms
[2024-05-24 03:16:20] [INFO ] Input system was already deterministic with 241 transitions.
Support contains 84 out of 122 places (down from 85) after GAL structural reductions.
RANDOM walk for 40000 steps (2898 resets) in 1640 ms. (24 steps per ms) remains 41/84 properties
BEST_FIRST walk for 4002 steps (35 resets) in 22 ms. (174 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (20 resets) in 21 ms. (181 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (32 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (33 resets) in 28 ms. (137 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (31 resets) in 17 ms. (222 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (35 resets) in 25 ms. (153 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (32 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (34 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (31 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (32 resets) in 14 ms. (266 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4004 steps (34 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (35 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (33 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (33 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (31 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (32 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (34 resets) in 12 ms. (308 steps per ms) remains 37/40 properties
BEST_FIRST walk for 4004 steps (35 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (35 resets) in 21 ms. (182 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (32 resets) in 12 ms. (308 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (35 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (32 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (29 resets) in 12 ms. (308 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (31 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (34 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (34 resets) in 10 ms. (364 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (36 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (34 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (35 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (35 resets) in 9 ms. (400 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (35 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (33 resets) in 10 ms. (364 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (36 resets) in 10 ms. (364 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (35 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (38 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (37 resets) in 12 ms. (307 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (33 resets) in 10 ms. (364 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (35 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
[2024-05-24 03:16:21] [INFO ] Flow matrix only has 234 transitions (discarded 7 similar events)
[2024-05-24 03:16:21] [INFO ] Invariant cache hit.
[2024-05-24 03:16:21] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 1 (OVERLAPS) 34/84 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 36 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp51 is UNSAT
At refinement iteration 3 (OVERLAPS) 38/122 variables, 8/13 constraints. Problems are: Problem set: 4 solved, 33 unsolved
[2024-05-24 03:16:21] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-24 03:16:21] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:16:21] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:16:21] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:16:21] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:16:22] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:16:22] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:16:22] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
Problem AtomicPropp20 is UNSAT
[2024-05-24 03:16:22] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:16:22] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:16:22] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:16:22] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 0 ms to minimize.
Problem AtomicPropp31 is UNSAT
[2024-05-24 03:16:22] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:16:22] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp60 is UNSAT
[2024-05-24 03:16:22] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 15/28 constraints. Problems are: Problem set: 8 solved, 29 unsolved
[2024-05-24 03:16:22] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:16:22] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:16:22] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:16:22] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
Problem AtomicPropp1 is UNSAT
[2024-05-24 03:16:22] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:16:22] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:16:22] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:16:22] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:16:22] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:16:23] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:16:23] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:16:23] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:16:23] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
Problem AtomicPropp62 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 13/41 constraints. Problems are: Problem set: 10 solved, 27 unsolved
[2024-05-24 03:16:23] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:16:23] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:16:23] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 0 ms to minimize.
[2024-05-24 03:16:23] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:16:23] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:16:23] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:16:23] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:16:23] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 8/49 constraints. Problems are: Problem set: 10 solved, 27 unsolved
[2024-05-24 03:16:23] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:16:23] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 2/51 constraints. Problems are: Problem set: 10 solved, 27 unsolved
[2024-05-24 03:16:24] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:16:24] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:16:24] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 3/54 constraints. Problems are: Problem set: 10 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/54 constraints. Problems are: Problem set: 10 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 233/355 variables, 122/176 constraints. Problems are: Problem set: 10 solved, 27 unsolved
[2024-05-24 03:16:24] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:16:24] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 2/178 constraints. Problems are: Problem set: 10 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 0/178 constraints. Problems are: Problem set: 10 solved, 27 unsolved
At refinement iteration 13 (OVERLAPS) 1/356 variables, 1/179 constraints. Problems are: Problem set: 10 solved, 27 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/356 variables, 0/179 constraints. Problems are: Problem set: 10 solved, 27 unsolved
At refinement iteration 15 (OVERLAPS) 0/356 variables, 0/179 constraints. Problems are: Problem set: 10 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 356/356 variables, and 179 constraints, problems are : Problem set: 10 solved, 27 unsolved in 3737 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 10 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 45/78 variables, 5/5 constraints. Problems are: Problem set: 10 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 11/16 constraints. Problems are: Problem set: 10 solved, 27 unsolved
[2024-05-24 03:16:25] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/17 constraints. Problems are: Problem set: 10 solved, 27 unsolved
[2024-05-24 03:16:25] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:16:25] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 0 ms to minimize.
[2024-05-24 03:16:25] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/20 constraints. Problems are: Problem set: 10 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/20 constraints. Problems are: Problem set: 10 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 44/122 variables, 8/28 constraints. Problems are: Problem set: 10 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 32/60 constraints. Problems are: Problem set: 10 solved, 27 unsolved
[2024-05-24 03:16:25] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:16:25] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 2 ms to minimize.
[2024-05-24 03:16:25] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:16:25] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:16:26] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:16:26] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 6/66 constraints. Problems are: Problem set: 10 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/66 constraints. Problems are: Problem set: 10 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 233/355 variables, 122/188 constraints. Problems are: Problem set: 10 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 27/215 constraints. Problems are: Problem set: 10 solved, 27 unsolved
[2024-05-24 03:16:26] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:16:26] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 2/217 constraints. Problems are: Problem set: 10 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 0/217 constraints. Problems are: Problem set: 10 solved, 27 unsolved
At refinement iteration 14 (OVERLAPS) 1/356 variables, 1/218 constraints. Problems are: Problem set: 10 solved, 27 unsolved
[2024-05-24 03:16:27] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2024-05-24 03:16:27] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/356 variables, 2/220 constraints. Problems are: Problem set: 10 solved, 27 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/356 variables, 0/220 constraints. Problems are: Problem set: 10 solved, 27 unsolved
At refinement iteration 17 (OVERLAPS) 0/356 variables, 0/220 constraints. Problems are: Problem set: 10 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 356/356 variables, and 220 constraints, problems are : Problem set: 10 solved, 27 unsolved in 3532 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/37 constraints, Known Traps: 57/57 constraints]
After SMT, in 7292ms problems are : Problem set: 10 solved, 27 unsolved
Parikh walk visited 22 properties in 2127 ms.
Support contains 8 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 241/241 transitions.
Graph (trivial) has 158 edges and 122 vertex of which 4 / 122 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 514 edges and 120 vertex of which 115 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 115 transition count 227
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 113 transition count 226
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 113 transition count 225
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 112 transition count 225
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 58 place count 63 transition count 127
Iterating global reduction 2 with 49 rules applied. Total rules applied 107 place count 63 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 110 place count 63 transition count 124
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 116 place count 57 transition count 112
Iterating global reduction 3 with 6 rules applied. Total rules applied 122 place count 57 transition count 112
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 128 place count 57 transition count 106
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 130 place count 55 transition count 100
Iterating global reduction 4 with 2 rules applied. Total rules applied 132 place count 55 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 133 place count 54 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 134 place count 54 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 137 place count 54 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 139 place count 53 transition count 94
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 149 place count 48 transition count 131
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 151 place count 48 transition count 129
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 153 place count 48 transition count 127
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 155 place count 46 transition count 127
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 6 with 15 rules applied. Total rules applied 170 place count 46 transition count 127
Applied a total of 170 rules in 61 ms. Remains 46 /122 variables (removed 76) and now considering 127/241 (removed 114) transitions.
Running 111 sub problems to find dead transitions.
[2024-05-24 03:16:30] [INFO ] Flow matrix only has 114 transitions (discarded 13 similar events)
// Phase 1: matrix 114 rows 46 cols
[2024-05-24 03:16:30] [INFO ] Computed 8 invariants in 5 ms
[2024-05-24 03:16:30] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 111 unsolved
Problem TDEAD126 is UNSAT
At refinement iteration 3 (OVERLAPS) 114/160 variables, 46/54 constraints. Problems are: Problem set: 1 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 20/74 constraints. Problems are: Problem set: 1 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/74 constraints. Problems are: Problem set: 1 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 0/160 variables, 0/74 constraints. Problems are: Problem set: 1 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 74 constraints, problems are : Problem set: 1 solved, 110 unsolved in 1500 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 114/160 variables, 46/54 constraints. Problems are: Problem set: 1 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 20/74 constraints. Problems are: Problem set: 1 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 110/184 constraints. Problems are: Problem set: 1 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/184 constraints. Problems are: Problem set: 1 solved, 110 unsolved
[2024-05-24 03:16:34] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/160 variables, 1/185 constraints. Problems are: Problem set: 1 solved, 110 unsolved
[2024-05-24 03:16:35] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 1/186 constraints. Problems are: Problem set: 1 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 110 unsolved
At refinement iteration 10 (OVERLAPS) 0/160 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 186 constraints, problems are : Problem set: 1 solved, 110 unsolved in 5068 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 110/111 constraints, Known Traps: 2/2 constraints]
After SMT, in 6687ms problems are : Problem set: 1 solved, 110 unsolved
Search for dead transitions found 1 dead transitions in 6689ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 46/122 places, 126/241 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 46 transition count 126
Applied a total of 1 rules in 12 ms. Remains 46 /46 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6768 ms. Remains : 46/122 places, 126/241 transitions.
RANDOM walk for 40000 steps (3879 resets) in 364 ms. (109 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (601 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (674 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (675 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
[2024-05-24 03:16:37] [INFO ] Flow matrix only has 113 transitions (discarded 13 similar events)
// Phase 1: matrix 113 rows 46 cols
[2024-05-24 03:16:37] [INFO ] Computed 8 invariants in 1 ms
[2024-05-24 03:16:37] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 41/46 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 113/159 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 03:16:38] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/159 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/159 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 75 constraints, problems are : Problem set: 0 solved, 3 unsolved in 167 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 41/46 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 113/159 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 03:16:38] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/159 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 79 constraints, problems are : Problem set: 0 solved, 3 unsolved in 158 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 331ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 167 ms.
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 126/126 transitions.
Graph (trivial) has 14 edges and 46 vertex of which 2 / 46 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.
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 2 place count 45 transition count 123
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 4 place count 44 transition count 122
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 42 transition count 120
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 22 place count 42 transition count 120
Applied a total of 22 rules in 16 ms. Remains 42 /46 variables (removed 4) and now considering 120/126 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 42/46 places, 120/126 transitions.
RANDOM walk for 40000 steps (3863 resets) in 370 ms. (107 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (612 resets) in 31 ms. (1250 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (673 resets) in 33 ms. (1176 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (692 resets) in 66 ms. (597 steps per ms) remains 3/3 properties
Probably explored full state space saw : 13892 states, properties seen :2
Probabilistic random walk after 62744 steps, saw 13892 distinct states, run finished after 116 ms. (steps per millisecond=540 ) properties seen :2
Explored full state space saw : 13892 states, properties seen :0
Exhaustive walk after 62744 steps, saw 13892 distinct states, run finished after 56 ms. (steps per millisecond=1120 ) properties seen :0
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
[2024-05-24 03:16:38] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:16:38] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:16:38] [INFO ] Input system was already deterministic with 241 transitions.
Support contains 71 out of 122 places (down from 76) after GAL structural reductions.
Computed a total of 11 stabilizing places and 19 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 241/241 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 64 transition count 129
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 64 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 119 place count 64 transition count 126
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 126 place count 57 transition count 112
Iterating global reduction 1 with 7 rules applied. Total rules applied 133 place count 57 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 136 place count 57 transition count 109
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 139 place count 54 transition count 100
Iterating global reduction 2 with 3 rules applied. Total rules applied 142 place count 54 transition count 100
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 145 place count 51 transition count 94
Iterating global reduction 2 with 3 rules applied. Total rules applied 148 place count 51 transition count 94
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 156 place count 51 transition count 86
Applied a total of 156 rules in 8 ms. Remains 51 /122 variables (removed 71) and now considering 86/241 (removed 155) transitions.
[2024-05-24 03:16:38] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
// Phase 1: matrix 83 rows 51 cols
[2024-05-24 03:16:38] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:16:38] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 03:16:38] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2024-05-24 03:16:38] [INFO ] Invariant cache hit.
[2024-05-24 03:16:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:16:38] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2024-05-24 03:16:38] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2024-05-24 03:16:38] [INFO ] Invariant cache hit.
[2024-05-24 03:16:38] [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, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-24 03:16:39] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:16:39] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 4 ms to minimize.
[2024-05-24 03:16:39] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 82/133 variables, 51/63 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 1/134 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 64 constraints, problems are : Problem set: 0 solved, 85 unsolved in 1477 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-24 03:16:40] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-24 03:16:40] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-24 03:16:41] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 82/133 variables, 51/66 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 85/151 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 1/134 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 12 (OVERLAPS) 0/134 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 152 constraints, problems are : Problem set: 0 solved, 85 unsolved in 2640 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 6/6 constraints]
After SMT, in 4146ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 4147ms
Starting structural reductions in LTL mode, iteration 1 : 51/122 places, 86/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4240 ms. Remains : 51/122 places, 86/241 transitions.
[2024-05-24 03:16:43] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:16:43] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:16:43] [INFO ] Input system was already deterministic with 86 transitions.
[2024-05-24 03:16:43] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:16:43] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:16:43] [INFO ] Time to serialize gal into /tmp/CTLFireability13620386934961894587.gal : 2 ms
[2024-05-24 03:16:43] [INFO ] Time to serialize properties into /tmp/CTLFireability9868879821769155506.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/CTLFireability13620386934961894587.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9868879821769155506.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,617472,0.07401,5768,2,746,5,10798,6,0,286,10274,0


Converting to forward existential form...Done !
original formula: EF((AG(((p66==0)||(p157==0))) + (EX((p32==1)) * AG((p91==0)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !(((p66==0)||(p157==0))))))] != FALSE + [((FwdU(Init,TRUE) * EX((p32==1))) * !(E...188
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t16, t18, t20, t22, t23, t37, t38, t...262
(forward)formula 0,1,0.291222,13148,1,0,160,54653,190,71,2087,37752,191
FORMULA HealthRecord-PT-12-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 122/122 places, 241/241 transitions.
Graph (trivial) has 155 edges and 122 vertex of which 8 / 122 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 59 place count 59 transition count 124
Iterating global reduction 0 with 58 rules applied. Total rules applied 117 place count 59 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 120 place count 59 transition count 121
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 128 place count 51 transition count 105
Iterating global reduction 1 with 8 rules applied. Total rules applied 136 place count 51 transition count 105
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 142 place count 51 transition count 99
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 145 place count 48 transition count 90
Iterating global reduction 2 with 3 rules applied. Total rules applied 148 place count 48 transition count 90
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 151 place count 45 transition count 84
Iterating global reduction 2 with 3 rules applied. Total rules applied 154 place count 45 transition count 84
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 163 place count 45 transition count 75
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 167 place count 45 transition count 71
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 171 place count 43 transition count 69
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 172 place count 42 transition count 68
Applied a total of 172 rules in 22 ms. Remains 42 /122 variables (removed 80) and now considering 68/241 (removed 173) transitions.
[2024-05-24 03:16:43] [INFO ] Flow matrix only has 62 transitions (discarded 6 similar events)
// Phase 1: matrix 62 rows 42 cols
[2024-05-24 03:16:43] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:16:43] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 03:16:43] [INFO ] Flow matrix only has 62 transitions (discarded 6 similar events)
[2024-05-24 03:16:43] [INFO ] Invariant cache hit.
[2024-05-24 03:16:43] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-24 03:16:43] [INFO ] Redundant transitions in 16 ms returned []
Running 52 sub problems to find dead transitions.
[2024-05-24 03:16:43] [INFO ] Flow matrix only has 62 transitions (discarded 6 similar events)
[2024-05-24 03:16:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 8/42 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-24 03:16:43] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-05-24 03:16:43] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:16:43] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-24 03:16:43] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:16:43] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 61/103 variables, 42/56 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/103 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/104 variables, and 56 constraints, problems are : Problem set: 0 solved, 52 unsolved in 746 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 8/42 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-24 03:16:44] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 61/103 variables, 42/57 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 52/109 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 0/103 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/104 variables, and 109 constraints, problems are : Problem set: 0 solved, 52 unsolved in 755 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 6/6 constraints]
After SMT, in 1518ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1519ms
Starting structural reductions in SI_CTL mode, iteration 1 : 42/122 places, 68/241 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1651 ms. Remains : 42/122 places, 68/241 transitions.
[2024-05-24 03:16:45] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:16:45] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:16:45] [INFO ] Input system was already deterministic with 68 transitions.
RANDOM walk for 11273 steps (1028 resets) in 32 ms. (341 steps per ms) remains 0/1 properties
FORMULA HealthRecord-PT-12-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-24 03:16:45] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:16:45] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:16:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17271904315724646477.gal : 1 ms
[2024-05-24 03:16:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13402393522446155959.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/ReachabilityCardinality17271904315724646477.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13402393522446155959.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
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
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 241/241 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 65 transition count 131
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 65 transition count 131
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 117 place count 65 transition count 128
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 124 place count 58 transition count 114
Iterating global reduction 1 with 7 rules applied. Total rules applied 131 place count 58 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 134 place count 58 transition count 111
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 135 place count 57 transition count 108
Iterating global reduction 2 with 1 rules applied. Total rules applied 136 place count 57 transition count 108
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 137 place count 56 transition count 106
Iterating global reduction 2 with 1 rules applied. Total rules applied 138 place count 56 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 141 place count 56 transition count 103
Applied a total of 141 rules in 6 ms. Remains 56 /122 variables (removed 66) and now considering 103/241 (removed 138) transitions.
[2024-05-24 03:16:45] [INFO ] Flow matrix only has 100 transitions (discarded 3 similar events)
// Phase 1: matrix 100 rows 56 cols
[2024-05-24 03:16:45] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:16:45] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 03:16:45] [INFO ] Flow matrix only has 100 transitions (discarded 3 similar events)
[2024-05-24 03:16:45] [INFO ] Invariant cache hit.
[2024-05-24 03:16:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:16:45] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-05-24 03:16:45] [INFO ] Flow matrix only has 100 transitions (discarded 3 similar events)
[2024-05-24 03:16:45] [INFO ] Invariant cache hit.
[2024-05-24 03:16:45] [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, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-24 03:16:45] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:16:45] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-24 03:16:45] [INFO ] Deduced a trap composed of 21 places in 41 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, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 99/155 variables, 56/68 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 1/156 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 0/156 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 69 constraints, problems are : Problem set: 0 solved, 102 unsolved in 2215 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-24 03:16: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/56 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 99/155 variables, 56/69 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 102/171 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 1/156 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/156 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 172 constraints, problems are : Problem set: 0 solved, 102 unsolved in 2742 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 4/4 constraints]
After SMT, in 4989ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 4990ms
Starting structural reductions in LTL mode, iteration 1 : 56/122 places, 103/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5091 ms. Remains : 56/122 places, 103/241 transitions.
[2024-05-24 03:16:50] [INFO ] Flatten gal took : 10 ms
[2024-05-24 03:16:50] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:16:50] [INFO ] Input system was already deterministic with 103 transitions.
[2024-05-24 03:16:50] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:16:50] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:16:50] [INFO ] Time to serialize gal into /tmp/CTLFireability7849841024004755019.gal : 2 ms
[2024-05-24 03:16:50] [INFO ] Time to serialize properties into /tmp/CTLFireability2656202631960771998.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/CTLFireability7849841024004755019.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2656202631960771998.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,846378,0.22307,12300,2,1858,5,38372,6,0,323,42483,0


Converting to forward existential form...Done !
original formula: (EX(((EF((p77==1)) + E((p128==1) U (((p16==1)&&(p35==1))&&((p54==1)&&(p132==1))))) + ((p46==1)||((p16==1)&&(p157==1))))) * EF((((p35==0)&...179
=> equivalent forward existential formula: [(FwdU((Init * EX(((E(TRUE U (p77==1)) + E((p128==1) U (((p16==1)&&(p35==1))&&((p54==1)&&(p132==1))))) + ((p46==...237
(forward)formula 0,0,0.224095,12300,1,0,5,38372,8,0,332,42483,0
FORMULA HealthRecord-PT-12-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 241/241 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 64 transition count 128
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 64 transition count 128
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 119 place count 64 transition count 125
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 126 place count 57 transition count 111
Iterating global reduction 1 with 7 rules applied. Total rules applied 133 place count 57 transition count 111
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 139 place count 57 transition count 105
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 141 place count 55 transition count 99
Iterating global reduction 2 with 2 rules applied. Total rules applied 143 place count 55 transition count 99
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 145 place count 53 transition count 95
Iterating global reduction 2 with 2 rules applied. Total rules applied 147 place count 53 transition count 95
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 153 place count 53 transition count 89
Applied a total of 153 rules in 8 ms. Remains 53 /122 variables (removed 69) and now considering 89/241 (removed 152) transitions.
[2024-05-24 03:16:50] [INFO ] Flow matrix only has 85 transitions (discarded 4 similar events)
// Phase 1: matrix 85 rows 53 cols
[2024-05-24 03:16:50] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 03:16:50] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-24 03:16:50] [INFO ] Flow matrix only has 85 transitions (discarded 4 similar events)
[2024-05-24 03:16:50] [INFO ] Invariant cache hit.
[2024-05-24 03:16:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:16:50] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2024-05-24 03:16:50] [INFO ] Flow matrix only has 85 transitions (discarded 4 similar events)
[2024-05-24 03:16:50] [INFO ] Invariant cache hit.
[2024-05-24 03:16:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-24 03:16:50] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:16:51] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-24 03:16:51] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:16:51] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 84/137 variables, 53/67 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 1/138 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 0/138 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 68 constraints, problems are : Problem set: 0 solved, 88 unsolved in 1736 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 84/137 variables, 53/67 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 88/155 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 1/138 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 0/138 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 156 constraints, problems are : Problem set: 0 solved, 88 unsolved in 1981 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 4/4 constraints]
After SMT, in 3741ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 3742ms
Starting structural reductions in LTL mode, iteration 1 : 53/122 places, 89/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3839 ms. Remains : 53/122 places, 89/241 transitions.
[2024-05-24 03:16:54] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:16:54] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:16:54] [INFO ] Input system was already deterministic with 89 transitions.
[2024-05-24 03:16:54] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:16:54] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:16:54] [INFO ] Time to serialize gal into /tmp/CTLFireability15037901071695888892.gal : 3 ms
[2024-05-24 03:16:54] [INFO ] Time to serialize properties into /tmp/CTLFireability10727019672953894459.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/CTLFireability15037901071695888892.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10727019672953894459.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,518328,0.069584,6656,2,1243,5,15018,6,0,294,12834,0


Converting to forward existential form...Done !
original formula: AX(EG(EX((EF((p20==1)) + (A((((p16==1)&&(p35==1))&&((p54==1)&&(p136==1))) U ((p16==1)&&(p157==1))) * EG((p94==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(EX((E(TRUE U (p20==1)) + (!((E(!(((p16==1)&&(p157==1))) U (!((((p16==1)&&(p35==1))&&((p54==1)&...260
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, t19, t21, t23, t24, t...282
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,4.60812,139536,1,0,377,796177,217,187,2260,795917,459
FORMULA HealthRecord-PT-12-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 241/241 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 67 transition count 134
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 67 transition count 134
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 113 place count 67 transition count 131
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 120 place count 60 transition count 117
Iterating global reduction 1 with 7 rules applied. Total rules applied 127 place count 60 transition count 117
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 133 place count 60 transition count 111
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 134 place count 59 transition count 108
Iterating global reduction 2 with 1 rules applied. Total rules applied 135 place count 59 transition count 108
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 136 place count 58 transition count 106
Iterating global reduction 2 with 1 rules applied. Total rules applied 137 place count 58 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 140 place count 58 transition count 103
Applied a total of 140 rules in 4 ms. Remains 58 /122 variables (removed 64) and now considering 103/241 (removed 138) transitions.
[2024-05-24 03:16:59] [INFO ] Flow matrix only has 99 transitions (discarded 4 similar events)
// Phase 1: matrix 99 rows 58 cols
[2024-05-24 03:16:59] [INFO ] Computed 10 invariants in 2 ms
[2024-05-24 03:16:59] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-24 03:16:59] [INFO ] Flow matrix only has 99 transitions (discarded 4 similar events)
[2024-05-24 03:16:59] [INFO ] Invariant cache hit.
[2024-05-24 03:16:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:16:59] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-05-24 03:16:59] [INFO ] Flow matrix only has 99 transitions (discarded 4 similar events)
[2024-05-24 03:16:59] [INFO ] Invariant cache hit.
[2024-05-24 03:16:59] [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, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-24 03:16:59] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:16:59] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-24 03:17:00] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 98/156 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 1/157 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/157 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 72 constraints, problems are : Problem set: 0 solved, 102 unsolved in 2203 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: 102/102 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-24 03:17:01] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-24 03:17:02] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-24 03:17:02] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:17:02] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 98/156 variables, 58/75 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 102/177 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 1/157 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/157 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 13 (OVERLAPS) 0/157 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 178 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3416 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: 102/102 constraints, Known Traps: 7/7 constraints]
After SMT, in 5645ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 5647ms
Starting structural reductions in LTL mode, iteration 1 : 58/122 places, 103/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5751 ms. Remains : 58/122 places, 103/241 transitions.
[2024-05-24 03:17:04] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:17:04] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:17:04] [INFO ] Input system was already deterministic with 103 transitions.
[2024-05-24 03:17:04] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:17:04] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:17:04] [INFO ] Time to serialize gal into /tmp/CTLFireability8041310036645654476.gal : 2 ms
[2024-05-24 03:17:04] [INFO ] Time to serialize properties into /tmp/CTLFireability17378912657326724566.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/CTLFireability8041310036645654476.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17378912657326724566.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.29082e+06,0.075873,6752,2,1092,5,16260,6,0,328,14993,0


Converting to forward existential form...Done !
original formula: E((!(((AX(FALSE) * E((p59==1) U (p68==1))) * AG(((p143==1)||(p76==1))))) + AG(E((p82==1) U AX((p46==1))))) U (p28==1))
=> equivalent forward existential formula: [(FwdU(Init,(!(((!(EX(!(FALSE))) * E((p59==1) U (p68==1))) * !(E(TRUE U !(((p143==1)||(p76==1))))))) + !(E(TRUE ...218
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t13, t14, t16, t17, t19, t20, t22, t24, t26, t42, t...273
(forward)formula 0,1,1.96227,67828,1,0,297,400451,236,147,2550,347074,357
FORMULA HealthRecord-PT-12-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 241/241 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 62 transition count 125
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 62 transition count 125
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 123 place count 62 transition count 122
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 131 place count 54 transition count 106
Iterating global reduction 1 with 8 rules applied. Total rules applied 139 place count 54 transition count 106
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 145 place count 54 transition count 100
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 147 place count 52 transition count 94
Iterating global reduction 2 with 2 rules applied. Total rules applied 149 place count 52 transition count 94
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 151 place count 50 transition count 90
Iterating global reduction 2 with 2 rules applied. Total rules applied 153 place count 50 transition count 90
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 159 place count 50 transition count 84
Applied a total of 159 rules in 3 ms. Remains 50 /122 variables (removed 72) and now considering 84/241 (removed 157) transitions.
[2024-05-24 03:17:06] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
// Phase 1: matrix 81 rows 50 cols
[2024-05-24 03:17:06] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:17:06] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-24 03:17:06] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
[2024-05-24 03:17:06] [INFO ] Invariant cache hit.
[2024-05-24 03:17:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:17:06] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2024-05-24 03:17:06] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
[2024-05-24 03:17:06] [INFO ] Invariant cache hit.
[2024-05-24 03:17:06] [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, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-24 03:17:07] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:17:07] [INFO ] Deduced a trap composed of 5 places in 30 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, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 80/130 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 1/131 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 0/131 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 62 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1480 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-24 03:17:08] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:17:08] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-24 03:17:08] [INFO ] Deduced a trap composed of 17 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, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 80/130 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 83/147 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (OVERLAPS) 1/131 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 11 (OVERLAPS) 0/131 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 148 constraints, problems are : Problem set: 0 solved, 83 unsolved in 2358 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 5/5 constraints]
After SMT, in 3860ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 3861ms
Starting structural reductions in LTL mode, iteration 1 : 50/122 places, 84/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3969 ms. Remains : 50/122 places, 84/241 transitions.
[2024-05-24 03:17:10] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:17:10] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:17:10] [INFO ] Input system was already deterministic with 84 transitions.
[2024-05-24 03:17:10] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:17:10] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:17:10] [INFO ] Time to serialize gal into /tmp/CTLFireability36321091552810445.gal : 1 ms
[2024-05-24 03:17:10] [INFO ] Time to serialize properties into /tmp/CTLFireability13452068901880700153.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/CTLFireability36321091552810445.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13452068901880700153.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,439596,0.065069,6632,2,1142,5,14949,6,0,280,11813,0


Converting to forward existential form...Done !
original formula: AX(AG((((p16==1)&&(p35==1))&&((p54==1)&&(p140==1)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !((((p16==1)&&(p35==1))&&((p54==1)&&(p140==1)))))] = FALSE
(forward)formula 0,0,0.105153,6896,1,0,11,16032,10,2,567,12777,4
FORMULA HealthRecord-PT-12-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 241/241 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 71 transition count 143
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 71 transition count 143
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 108 place count 65 transition count 131
Iterating global reduction 0 with 6 rules applied. Total rules applied 114 place count 65 transition count 131
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 119 place count 65 transition count 126
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 121 place count 63 transition count 120
Iterating global reduction 1 with 2 rules applied. Total rules applied 123 place count 63 transition count 120
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 124 place count 62 transition count 118
Iterating global reduction 1 with 1 rules applied. Total rules applied 125 place count 62 transition count 118
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 128 place count 62 transition count 115
Applied a total of 128 rules in 6 ms. Remains 62 /122 variables (removed 60) and now considering 115/241 (removed 126) transitions.
[2024-05-24 03:17:10] [INFO ] Flow matrix only has 112 transitions (discarded 3 similar events)
// Phase 1: matrix 112 rows 62 cols
[2024-05-24 03:17:10] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:17:11] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 03:17:11] [INFO ] Flow matrix only has 112 transitions (discarded 3 similar events)
[2024-05-24 03:17:11] [INFO ] Invariant cache hit.
[2024-05-24 03:17:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:17:11] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2024-05-24 03:17:11] [INFO ] Flow matrix only has 112 transitions (discarded 3 similar events)
[2024-05-24 03:17:11] [INFO ] Invariant cache hit.
[2024-05-24 03:17:11] [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, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-24 03:17:11] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:17:11] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:17:11] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:17:11] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 111/173 variables, 62/75 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-24 03:17:12] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 1/174 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (OVERLAPS) 0/174 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 77 constraints, problems are : Problem set: 0 solved, 114 unsolved in 2960 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-24 03:17:14] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:17:14] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-24 03:17:14] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:17:14] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:17:14] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:17:14] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 111/173 variables, 62/82 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 114/196 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (OVERLAPS) 1/174 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 11 (OVERLAPS) 0/174 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 197 constraints, problems are : Problem set: 0 solved, 114 unsolved in 4448 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 11/11 constraints]
After SMT, in 7440ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 7441ms
Starting structural reductions in LTL mode, iteration 1 : 62/122 places, 115/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7542 ms. Remains : 62/122 places, 115/241 transitions.
[2024-05-24 03:17:18] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:17:18] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:17:18] [INFO ] Input system was already deterministic with 115 transitions.
[2024-05-24 03:17:18] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:17:18] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:17:18] [INFO ] Time to serialize gal into /tmp/CTLFireability814896763961711261.gal : 1 ms
[2024-05-24 03:17:18] [INFO ] Time to serialize properties into /tmp/CTLFireability13212862872745713791.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/CTLFireability814896763961711261.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13212862872745713791.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.47624e+06,0.139377,9188,2,2205,5,22209,6,0,359,24483,0


Converting to forward existential form...Done !
original formula: A((EG(((!(((p23==1)||((p38==1)&&(p157==1)))) * (AG((p149==1)) + !(((p35==1)&&(p157==1))))) + (p121==1))) * ((p71==1) + ((p95==1) * EG((p1...235
=> equivalent forward existential formula: [((Init * !(EG(!(!(E((EX((p101!=1)) + (p37==1)) U EX((EX((p108==1)) * (p104==1))))))))) * !(E(!(!(E((EX((p101!=1...456
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, ...424
(forward)formula 0,1,0.569302,21592,1,0,241,84825,259,98,2661,87315,243
FORMULA HealthRecord-PT-12-CTLFireability-2024-06 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 : 122/122 places, 241/241 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 66 transition count 133
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 66 transition count 133
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 115 place count 66 transition count 130
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 121 place count 60 transition count 118
Iterating global reduction 1 with 6 rules applied. Total rules applied 127 place count 60 transition count 118
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 130 place count 60 transition count 115
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 131 place count 59 transition count 112
Iterating global reduction 2 with 1 rules applied. Total rules applied 132 place count 59 transition count 112
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 133 place count 58 transition count 110
Iterating global reduction 2 with 1 rules applied. Total rules applied 134 place count 58 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 136 place count 58 transition count 108
Applied a total of 136 rules in 4 ms. Remains 58 /122 variables (removed 64) and now considering 108/241 (removed 133) transitions.
[2024-05-24 03:17:19] [INFO ] Flow matrix only has 105 transitions (discarded 3 similar events)
// Phase 1: matrix 105 rows 58 cols
[2024-05-24 03:17:19] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:17:19] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 03:17:19] [INFO ] Flow matrix only has 105 transitions (discarded 3 similar events)
[2024-05-24 03:17:19] [INFO ] Invariant cache hit.
[2024-05-24 03:17:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:17:19] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2024-05-24 03:17:19] [INFO ] Flow matrix only has 105 transitions (discarded 3 similar events)
[2024-05-24 03:17:19] [INFO ] Invariant cache hit.
[2024-05-24 03:17:19] [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, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-24 03:17:19] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:17:19] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:17:19] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:17:19] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:17:19] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:17:19] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 104/162 variables, 58/73 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 1/163 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/163 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 74 constraints, problems are : Problem set: 0 solved, 107 unsolved in 2141 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-24 03:17:21] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-24 03:17:21] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 104/162 variables, 58/75 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 107/182 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 1/163 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (OVERLAPS) 0/163 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 183 constraints, problems are : Problem set: 0 solved, 107 unsolved in 3479 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 8/8 constraints]
After SMT, in 5651ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 5652ms
Starting structural reductions in LTL mode, iteration 1 : 58/122 places, 108/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5742 ms. Remains : 58/122 places, 108/241 transitions.
[2024-05-24 03:17:24] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:17:24] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:17:24] [INFO ] Input system was already deterministic with 108 transitions.
[2024-05-24 03:17:24] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:17:24] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:17:24] [INFO ] Time to serialize gal into /tmp/CTLFireability14861286286448350307.gal : 0 ms
[2024-05-24 03:17:24] [INFO ] Time to serialize properties into /tmp/CTLFireability10670255086622112269.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/CTLFireability14861286286448350307.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10670255086622112269.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.05852e+06,0.470878,19472,2,2350,5,66169,6,0,336,73986,0


Converting to forward existential form...Done !
original formula: E(AF(!(A((p49==1) U A((p153==1) U ((p54==1)&&(p157==1)))))) U (((AX(((p129==1)||(p54==1))) * (p130==1)) * (AX(EF(((p114==1)&&(p148==1))))...248
=> equivalent forward existential formula: ([((FwdU(Init,!(EG(!(!(!((E(!(!((E(!(((p54==1)&&(p157==1))) U (!((p153==1)) * !(((p54==1)&&(p157==1))))) + EG(!(...1191
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t12, t13, t14, t15, t16, t18, t19, t21, t22, t23, t25, t...318
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,3.92357,110324,1,0,388,649173,254,197,2659,619937,429
FORMULA HealthRecord-PT-12-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 241/241 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 70 transition count 141
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 70 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 106 place count 70 transition count 139
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 113 place count 63 transition count 125
Iterating global reduction 1 with 7 rules applied. Total rules applied 120 place count 63 transition count 125
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 123 place count 63 transition count 122
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 125 place count 61 transition count 116
Iterating global reduction 2 with 2 rules applied. Total rules applied 127 place count 61 transition count 116
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 129 place count 59 transition count 112
Iterating global reduction 2 with 2 rules applied. Total rules applied 131 place count 59 transition count 112
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 136 place count 59 transition count 107
Applied a total of 136 rules in 3 ms. Remains 59 /122 variables (removed 63) and now considering 107/241 (removed 134) transitions.
[2024-05-24 03:17:28] [INFO ] Flow matrix only has 104 transitions (discarded 3 similar events)
// Phase 1: matrix 104 rows 59 cols
[2024-05-24 03:17:28] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:17:28] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 03:17:28] [INFO ] Flow matrix only has 104 transitions (discarded 3 similar events)
[2024-05-24 03:17:28] [INFO ] Invariant cache hit.
[2024-05-24 03:17:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:17:28] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2024-05-24 03:17:28] [INFO ] Flow matrix only has 104 transitions (discarded 3 similar events)
[2024-05-24 03:17:28] [INFO ] Invariant cache hit.
[2024-05-24 03:17:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-24 03:17:29] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:17:29] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:17:29] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:17:29] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-24 03:17:29] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:17:29] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:17:29] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:17:29] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:17:29] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 103/162 variables, 59/77 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-24 03:17:30] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 1/163 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/163 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 79 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2791 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 59/59 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-24 03:17:32] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2024-05-24 03:17:32] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:17:32] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-05-24 03:17:32] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-24 03:17:32] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 103/162 variables, 59/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 106/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 1/163 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-24 03:17:34] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 12 (OVERLAPS) 0/163 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 191 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4782 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 59/59 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 16/16 constraints]
After SMT, in 7617ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 7618ms
Starting structural reductions in LTL mode, iteration 1 : 59/122 places, 107/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7715 ms. Remains : 59/122 places, 107/241 transitions.
[2024-05-24 03:17:36] [INFO ] Flatten gal took : 15 ms
[2024-05-24 03:17:36] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:17:36] [INFO ] Input system was already deterministic with 107 transitions.
[2024-05-24 03:17:36] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:17:36] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:17:36] [INFO ] Time to serialize gal into /tmp/CTLFireability3473707183249295646.gal : 2 ms
[2024-05-24 03:17:36] [INFO ] Time to serialize properties into /tmp/CTLFireability3985858783074279987.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/CTLFireability3473707183249295646.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3985858783074279987.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.12448e+06,0.586532,23692,2,2260,5,87071,6,0,339,100257,0


Converting to forward existential form...Done !
original formula: A(((EG(!((((p70==1)&&(p118==1))||(p118==1)))) * (p14==1)) * ((EX(AG((p63==1))) + (p8==1)) + ((p22==1)||(p49==1)))) U EF((p100==1)))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (p100==1)))))) * !(E(!(E(TRUE U (p100==1))) U (!(((EG(!((((p70==1)&&(p118==1))||(p118=...282
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...398
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,10.6589,285948,1,0,536,1.60684e+06,250,274,2636,1.83802e+06,565
FORMULA HealthRecord-PT-12-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 122/122 places, 241/241 transitions.
Graph (trivial) has 158 edges and 122 vertex of which 8 / 122 are part of one of the 4 SCC in 2 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 59 place count 59 transition count 124
Iterating global reduction 0 with 58 rules applied. Total rules applied 117 place count 59 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 120 place count 59 transition count 121
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 128 place count 51 transition count 105
Iterating global reduction 1 with 8 rules applied. Total rules applied 136 place count 51 transition count 105
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 142 place count 51 transition count 99
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 144 place count 49 transition count 93
Iterating global reduction 2 with 2 rules applied. Total rules applied 146 place count 49 transition count 93
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 148 place count 47 transition count 89
Iterating global reduction 2 with 2 rules applied. Total rules applied 150 place count 47 transition count 89
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 156 place count 47 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 160 place count 47 transition count 79
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 164 place count 45 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 165 place count 44 transition count 76
Applied a total of 165 rules in 28 ms. Remains 44 /122 variables (removed 78) and now considering 76/241 (removed 165) transitions.
[2024-05-24 03:17:47] [INFO ] Flow matrix only has 70 transitions (discarded 6 similar events)
// Phase 1: matrix 70 rows 44 cols
[2024-05-24 03:17:47] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:17:47] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 03:17:47] [INFO ] Flow matrix only has 70 transitions (discarded 6 similar events)
[2024-05-24 03:17:47] [INFO ] Invariant cache hit.
[2024-05-24 03:17:47] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-05-24 03:17:47] [INFO ] Redundant transitions in 14 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-24 03:17:47] [INFO ] Flow matrix only has 70 transitions (discarded 6 similar events)
[2024-05-24 03:17:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 8/44 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-24 03:17:47] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-05-24 03:17:47] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-24 03:17:47] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:17:47] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:17:47] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 69/113 variables, 44/58 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/113 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/114 variables, and 58 constraints, problems are : Problem set: 0 solved, 60 unsolved in 879 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 8/44 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-24 03:17:48] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 69/113 variables, 44/59 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 60/119 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/113 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/114 variables, and 119 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1024 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints]
After SMT, in 1935ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 1937ms
Starting structural reductions in SI_CTL mode, iteration 1 : 44/122 places, 76/241 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2093 ms. Remains : 44/122 places, 76/241 transitions.
[2024-05-24 03:17:49] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:17:49] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:17:49] [INFO ] Input system was already deterministic with 76 transitions.
[2024-05-24 03:17:49] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:17:49] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:17:49] [INFO ] Time to serialize gal into /tmp/CTLFireability17722972227018622378.gal : 2 ms
[2024-05-24 03:17:49] [INFO ] Time to serialize properties into /tmp/CTLFireability13705306083607390145.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/CTLFireability17722972227018622378.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13705306083607390145.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,293062,0.078085,6820,2,855,5,15988,6,0,243,13885,0


Converting to forward existential form...Done !
original formula: AG(EF(AG(((p136!=1)&&(p35!=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !(((p136!=1)&&(p35!=1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t10, t11, t13, t14, t16, t17, Intersection with reachabl...226
(forward)formula 0,0,0.613209,23328,1,0,139,118688,167,65,1779,83612,168
FORMULA HealthRecord-PT-12-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 241/241 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 71 transition count 143
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 71 transition count 143
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 105 place count 71 transition count 140
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 111 place count 65 transition count 128
Iterating global reduction 1 with 6 rules applied. Total rules applied 117 place count 65 transition count 128
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 122 place count 65 transition count 123
Applied a total of 122 rules in 2 ms. Remains 65 /122 variables (removed 57) and now considering 123/241 (removed 118) transitions.
[2024-05-24 03:17:50] [INFO ] Flow matrix only has 120 transitions (discarded 3 similar events)
// Phase 1: matrix 120 rows 65 cols
[2024-05-24 03:17:50] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:17:50] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-24 03:17:50] [INFO ] Flow matrix only has 120 transitions (discarded 3 similar events)
[2024-05-24 03:17:50] [INFO ] Invariant cache hit.
[2024-05-24 03:17:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:17:50] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-24 03:17:50] [INFO ] Flow matrix only has 120 transitions (discarded 3 similar events)
[2024-05-24 03:17:50] [INFO ] Invariant cache hit.
[2024-05-24 03:17:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-24 03:17:50] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:17:50] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:17:50] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-24 03:17:50] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:17:50] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 119/184 variables, 65/79 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 1/185 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/185 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 80 constraints, problems are : Problem set: 0 solved, 122 unsolved in 2469 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-24 03:17:53] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-24 03:17:53] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:17:53] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:17:53] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:17:53] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:17:53] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:17:53] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:17:53] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-24 03:17:53] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:17:53] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 119/184 variables, 65/89 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 122/211 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 1/185 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-24 03:17:56] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/185 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 13 (OVERLAPS) 0/185 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 213 constraints, problems are : Problem set: 0 solved, 122 unsolved in 6196 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 16/16 constraints]
After SMT, in 8700ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 8701ms
Starting structural reductions in LTL mode, iteration 1 : 65/122 places, 123/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8800 ms. Remains : 65/122 places, 123/241 transitions.
[2024-05-24 03:17:58] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:17:58] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:17:58] [INFO ] Input system was already deterministic with 123 transitions.
[2024-05-24 03:17:58] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:17:58] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:17:58] [INFO ] Time to serialize gal into /tmp/CTLFireability9870364795788406372.gal : 2 ms
[2024-05-24 03:17:58] [INFO ] Time to serialize properties into /tmp/CTLFireability9705181854765401518.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/CTLFireability9870364795788406372.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9705181854765401518.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,3.75366e+06,0.390204,16384,2,4450,5,53084,6,0,379,46972,0


Converting to forward existential form...Done !
original formula: AG((((p61==0) + ((p140==1) * E((((p143==1)&&(p2==1))&&(p86!=1)) U AG((p107==1))))) + (((p46==0) * (EX((p14==0)) + ((p7==0)&&(p51==0)))) +...180
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * !((((p46==0) * (EX((p14==0)) + ((p7==0)&&(p51==0)))) + ((p27==1)&&(p156==1))))) * !((p61=...384
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...405
(forward)formula 0,0,2.3539,68152,1,0,240,373800,274,100,2798,279233,265
FORMULA HealthRecord-PT-12-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 122/122 places, 241/241 transitions.
Graph (trivial) has 168 edges and 122 vertex of which 8 / 122 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 61 transition count 128
Iterating global reduction 0 with 56 rules applied. Total rules applied 113 place count 61 transition count 128
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 116 place count 61 transition count 125
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 122 place count 55 transition count 113
Iterating global reduction 1 with 6 rules applied. Total rules applied 128 place count 55 transition count 113
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 134 place count 55 transition count 107
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 136 place count 53 transition count 101
Iterating global reduction 2 with 2 rules applied. Total rules applied 138 place count 53 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 140 place count 51 transition count 97
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 51 transition count 97
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 148 place count 51 transition count 91
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 151 place count 51 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 153 place count 50 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 154 place count 49 transition count 86
Applied a total of 154 rules in 12 ms. Remains 49 /122 variables (removed 73) and now considering 86/241 (removed 155) transitions.
[2024-05-24 03:18:01] [INFO ] Flow matrix only has 80 transitions (discarded 6 similar events)
// Phase 1: matrix 80 rows 49 cols
[2024-05-24 03:18:01] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:18:01] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-24 03:18:01] [INFO ] Flow matrix only has 80 transitions (discarded 6 similar events)
[2024-05-24 03:18:01] [INFO ] Invariant cache hit.
[2024-05-24 03:18:01] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-05-24 03:18:01] [INFO ] Redundant transitions in 15 ms returned []
Running 70 sub problems to find dead transitions.
[2024-05-24 03:18:01] [INFO ] Flow matrix only has 80 transitions (discarded 6 similar events)
[2024-05-24 03:18:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 8/49 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-24 03:18:01] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-24 03:18:01] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-24 03:18:01] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-24 03:18:01] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-05-24 03:18:01] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:18:01] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:18:01] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:18:01] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (OVERLAPS) 79/128 variables, 49/66 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/129 variables, and 66 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1175 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 8/49 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-24 03:18:02] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-24 03:18:02] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:18:02] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:18:03] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 79/128 variables, 49/70 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 70/140 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (OVERLAPS) 0/128 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/129 variables, and 140 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1441 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 12/12 constraints]
After SMT, in 2642ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 2644ms
Starting structural reductions in SI_CTL mode, iteration 1 : 49/122 places, 86/241 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2761 ms. Remains : 49/122 places, 86/241 transitions.
[2024-05-24 03:18:04] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:18:04] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:18:04] [INFO ] Input system was already deterministic with 86 transitions.
[2024-05-24 03:18:04] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:18:04] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:18:04] [INFO ] Time to serialize gal into /tmp/CTLFireability13261871689387169503.gal : 1 ms
[2024-05-24 03:18:04] [INFO ] Time to serialize properties into /tmp/CTLFireability10553058680733302889.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/CTLFireability13261871689387169503.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10553058680733302889.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,379571,0.080717,6900,2,1474,5,15958,6,0,273,13590,0


Converting to forward existential form...Done !
original formula: AG(AF(((EG(((p105==1)||(p143==1))) + (p110==0)) + (p138==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((EG(((p105==1)||(p143==1))) + (p110==0)) + (p138==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t21, t22...285
(forward)formula 0,0,0.439358,19332,1,0,197,84158,193,90,2012,53280,236
FORMULA HealthRecord-PT-12-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 241/241 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 63 transition count 127
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 63 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 121 place count 63 transition count 124
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 129 place count 55 transition count 108
Iterating global reduction 1 with 8 rules applied. Total rules applied 137 place count 55 transition count 108
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 143 place count 55 transition count 102
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 146 place count 52 transition count 93
Iterating global reduction 2 with 3 rules applied. Total rules applied 149 place count 52 transition count 93
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 152 place count 49 transition count 87
Iterating global reduction 2 with 3 rules applied. Total rules applied 155 place count 49 transition count 87
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 164 place count 49 transition count 78
Applied a total of 164 rules in 5 ms. Remains 49 /122 variables (removed 73) and now considering 78/241 (removed 163) transitions.
[2024-05-24 03:18:04] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
// Phase 1: matrix 75 rows 49 cols
[2024-05-24 03:18:04] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:18:04] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-24 03:18:04] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
[2024-05-24 03:18:04] [INFO ] Invariant cache hit.
[2024-05-24 03:18:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:18:04] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2024-05-24 03:18:04] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
[2024-05-24 03:18:04] [INFO ] Invariant cache hit.
[2024-05-24 03:18:04] [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, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-24 03:18:04] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:18:05] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 74/123 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 1/124 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 0/124 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 61 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1243 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-24 03:18:06] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:18:06] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-24 03:18:06] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 74/123 variables, 49/63 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 77/140 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 1/124 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 0/124 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 141 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1994 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 5/5 constraints]
After SMT, in 3254ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 3254ms
Starting structural reductions in LTL mode, iteration 1 : 49/122 places, 78/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3341 ms. Remains : 49/122 places, 78/241 transitions.
[2024-05-24 03:18:07] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:18:07] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:18:07] [INFO ] Input system was already deterministic with 78 transitions.
[2024-05-24 03:18:07] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:18:07] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:18:07] [INFO ] Time to serialize gal into /tmp/CTLFireability6016861839948621187.gal : 1 ms
[2024-05-24 03:18:07] [INFO ] Time to serialize properties into /tmp/CTLFireability12816294182773380426.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/CTLFireability6016861839948621187.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12816294182773380426.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,435222,0.066785,6044,2,849,5,13001,6,0,270,10842,0


Converting to forward existential form...Done !
original formula: EF(AX(A(!(AG((p43==1))) U ((p35==1)&&(p157==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!((E(!(((p35==1)&&(p157==1))) U (!(!(!(E(TRUE U !((p43==1)))))) * !(((p35==1)&&(p157=...209
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t12, t13, t15, t17, t19, t31, t32, t56, Intersection wi...237
(forward)formula 0,1,2.47747,74092,1,0,297,439079,182,147,2038,423722,350
FORMULA HealthRecord-PT-12-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 241/241 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 64 transition count 128
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 64 transition count 128
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 119 place count 64 transition count 125
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 126 place count 57 transition count 111
Iterating global reduction 1 with 7 rules applied. Total rules applied 133 place count 57 transition count 111
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 139 place count 57 transition count 105
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 140 place count 56 transition count 102
Iterating global reduction 2 with 1 rules applied. Total rules applied 141 place count 56 transition count 102
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 142 place count 55 transition count 100
Iterating global reduction 2 with 1 rules applied. Total rules applied 143 place count 55 transition count 100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 146 place count 55 transition count 97
Applied a total of 146 rules in 9 ms. Remains 55 /122 variables (removed 67) and now considering 97/241 (removed 144) transitions.
[2024-05-24 03:18:10] [INFO ] Flow matrix only has 93 transitions (discarded 4 similar events)
// Phase 1: matrix 93 rows 55 cols
[2024-05-24 03:18:10] [INFO ] Computed 10 invariants in 2 ms
[2024-05-24 03:18:10] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-24 03:18:10] [INFO ] Flow matrix only has 93 transitions (discarded 4 similar events)
[2024-05-24 03:18:10] [INFO ] Invariant cache hit.
[2024-05-24 03:18:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:18:10] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-24 03:18:10] [INFO ] Flow matrix only has 93 transitions (discarded 4 similar events)
[2024-05-24 03:18:10] [INFO ] Invariant cache hit.
[2024-05-24 03:18:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-24 03:18:10] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:18:11] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-24 03:18:11] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:18:11] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 92/147 variables, 55/69 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 1/148 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/148 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 70 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (OVERLAPS) 92/147 variables, 55/69 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 96/165 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 1/148 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/148 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 166 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2339 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 4/4 constraints]
After SMT, in 4397ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 4398ms
Starting structural reductions in LTL mode, iteration 1 : 55/122 places, 97/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4515 ms. Remains : 55/122 places, 97/241 transitions.
[2024-05-24 03:18:14] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:18:14] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:18:14] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-24 03:18:14] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:18:14] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:18:14] [INFO ] Time to serialize gal into /tmp/CTLFireability8117820931255293268.gal : 1 ms
[2024-05-24 03:18:14] [INFO ] Time to serialize properties into /tmp/CTLFireability11099957123782639667.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/CTLFireability8117820931255293268.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11099957123782639667.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,588312,0.055055,5404,2,907,5,10312,6,0,310,7851,0


Converting to forward existential form...Done !
original formula: EG((AX(!(A(EF((p96==1)) U (((p54==1)&&(p157==1))&&((p87==1)&&(p157==1)))))) * AF(AG(((p69==0)&&(((p16==0)||(p35==0))||((p54==0)||(p140==0...163
=> equivalent forward existential formula: [FwdG(Init,(!(EX(!(!(!((E(!((((p54==1)&&(p157==1))&&((p87==1)&&(p157==1)))) U (!(E(TRUE U (p96==1))) * !((((p54=...357
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...297
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,4.14497,128592,1,0,376,737172,230,185,2442,716152,437
FORMULA HealthRecord-PT-12-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 241/241 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 66 transition count 132
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 66 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 114 place count 66 transition count 130
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 121 place count 59 transition count 116
Iterating global reduction 1 with 7 rules applied. Total rules applied 128 place count 59 transition count 116
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 134 place count 59 transition count 110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 135 place count 58 transition count 107
Iterating global reduction 2 with 1 rules applied. Total rules applied 136 place count 58 transition count 107
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 137 place count 57 transition count 105
Iterating global reduction 2 with 1 rules applied. Total rules applied 138 place count 57 transition count 105
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 141 place count 57 transition count 102
Applied a total of 141 rules in 9 ms. Remains 57 /122 variables (removed 65) and now considering 102/241 (removed 139) transitions.
[2024-05-24 03:18:19] [INFO ] Flow matrix only has 98 transitions (discarded 4 similar events)
// Phase 1: matrix 98 rows 57 cols
[2024-05-24 03:18:19] [INFO ] Computed 10 invariants in 2 ms
[2024-05-24 03:18:19] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-24 03:18:19] [INFO ] Flow matrix only has 98 transitions (discarded 4 similar events)
[2024-05-24 03:18:19] [INFO ] Invariant cache hit.
[2024-05-24 03:18:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:18:19] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-05-24 03:18:19] [INFO ] Flow matrix only has 98 transitions (discarded 4 similar events)
[2024-05-24 03:18:19] [INFO ] Invariant cache hit.
[2024-05-24 03:18:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-24 03:18:19] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:18:19] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-24 03:18:20] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 97/154 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 1/155 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-24 03:18:20] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 0/155 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 72 constraints, problems are : Problem set: 0 solved, 101 unsolved in 2369 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-24 03:18:21] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:18:22] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-24 03:18:22] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 97/154 variables, 57/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 101/175 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 1/155 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/155 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 12 (OVERLAPS) 0/155 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 176 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3124 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 7/7 constraints]
After SMT, in 5523ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 5526ms
Starting structural reductions in LTL mode, iteration 1 : 57/122 places, 102/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5630 ms. Remains : 57/122 places, 102/241 transitions.
[2024-05-24 03:18:24] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:18:24] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:18:24] [INFO ] Input system was already deterministic with 102 transitions.
[2024-05-24 03:18:24] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:18:24] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:18:24] [INFO ] Time to serialize gal into /tmp/CTLFireability5843535627397195332.gal : 1 ms
[2024-05-24 03:18:24] [INFO ] Time to serialize properties into /tmp/CTLFireability10604625071932975380.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/CTLFireability5843535627397195332.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10604625071932975380.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,877725,0.159326,9912,2,1373,5,27097,6,0,323,29003,0


Converting to forward existential form...Done !
original formula: AG((EF(EG(((p34==0) + EG(((p80==1)&&(p157==1)))))) + A(((((p54==1)&&(p157==1)) + EX((p102==1))) * !(((((p28==1)&&(p114==1))&&(p127==1))||...193
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(!((E(!(((p87==1)&&(p157==1))) U (!(((((p54==1)&&(p157==1)) + EX((p102==1))) * !(((((p28==...327
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...323
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,5.13505,148620,1,0,369,862324,233,196,2487,908285,400
FORMULA HealthRecord-PT-12-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 241/241 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 66 transition count 133
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 66 transition count 133
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 115 place count 66 transition count 130
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 123 place count 58 transition count 114
Iterating global reduction 1 with 8 rules applied. Total rules applied 131 place count 58 transition count 114
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 137 place count 58 transition count 108
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 139 place count 56 transition count 102
Iterating global reduction 2 with 2 rules applied. Total rules applied 141 place count 56 transition count 102
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 142 place count 55 transition count 100
Iterating global reduction 2 with 1 rules applied. Total rules applied 143 place count 55 transition count 100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 146 place count 55 transition count 97
Applied a total of 146 rules in 6 ms. Remains 55 /122 variables (removed 67) and now considering 97/241 (removed 144) transitions.
[2024-05-24 03:18:30] [INFO ] Flow matrix only has 94 transitions (discarded 3 similar events)
// Phase 1: matrix 94 rows 55 cols
[2024-05-24 03:18:30] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:18:30] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 03:18:30] [INFO ] Flow matrix only has 94 transitions (discarded 3 similar events)
[2024-05-24 03:18:30] [INFO ] Invariant cache hit.
[2024-05-24 03:18:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:18:30] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-24 03:18:30] [INFO ] Flow matrix only has 94 transitions (discarded 3 similar events)
[2024-05-24 03:18:30] [INFO ] Invariant cache hit.
[2024-05-24 03:18:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-24 03:18:30] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:18:30] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-24 03:18:30] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 93/148 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 1/149 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 0/149 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 68 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1736 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-24 03:18:32] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:18:32] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-24 03:18:32] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-24 03:18:32] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-24 03:18:32] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-24 03:18:32] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-24 03:18:32] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 93/148 variables, 55/74 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 96/170 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (OVERLAPS) 1/149 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/149 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (OVERLAPS) 0/149 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 171 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3619 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 10/10 constraints]
After SMT, in 5395ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 5397ms
Starting structural reductions in LTL mode, iteration 1 : 55/122 places, 97/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5491 ms. Remains : 55/122 places, 97/241 transitions.
[2024-05-24 03:18:35] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:18:35] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:18:35] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-24 03:18:35] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:18:35] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:18:35] [INFO ] Time to serialize gal into /tmp/CTLFireability15419282026546206038.gal : 1 ms
[2024-05-24 03:18:35] [INFO ] Time to serialize properties into /tmp/CTLFireability7690482905910266073.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/CTLFireability15419282026546206038.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7690482905910266073.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,809199,0.211055,8556,2,1418,5,21468,6,0,313,23025,0


Converting to forward existential form...Done !
original formula: EX((AF(AX(EG((p25==0)))) + EG(!(E(((p99==1)&&(p52==1)) U AG(((p114==1)&&(p135==1))))))))
=> equivalent forward existential formula: ([(EY(Init) * !(EG(!(!(EX(!(EG((p25==0)))))))))] != FALSE + [FwdG(EY(Init),!(E(((p99==1)&&(p52==1)) U !(E(TRUE U...197
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t17, t18, t19, t20, t22, t24, t...317
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,4.35352,128104,1,0,379,783246,218,180,2404,766972,421
FORMULA HealthRecord-PT-12-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-24 03:18:39] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:18:39] [INFO ] Flatten gal took : 6 ms
Total runtime 200545 ms.

BK_STOP 1716520720009

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

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