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

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

=== Now, execution of the tool begins

BK_START 1716520514097

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
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
CTLCardinality PT
Running Version 202405141337
[2024-05-24 03:15:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 03:15:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:15:15] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-05-24 03:15:15] [INFO ] Transformed 160 places.
[2024-05-24 03:15:15] [INFO ] Transformed 340 transitions.
[2024-05-24 03:15:15] [INFO ] Found NUPN structural information;
[2024-05-24 03:15:15] [INFO ] Parsed PT model containing 160 places and 340 transitions and 895 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
FORMULA HealthRecord-PT-12-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 101 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 312/312 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 135 transition count 264
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 135 transition count 264
Applied a total of 50 rules in 22 ms. Remains 135 /160 variables (removed 25) and now considering 264/312 (removed 48) transitions.
[2024-05-24 03:15:15] [INFO ] Flow matrix only has 254 transitions (discarded 10 similar events)
// Phase 1: matrix 254 rows 135 cols
[2024-05-24 03:15:15] [INFO ] Computed 16 invariants in 12 ms
[2024-05-24 03:15:15] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-24 03:15:15] [INFO ] Flow matrix only has 254 transitions (discarded 10 similar events)
[2024-05-24 03:15:15] [INFO ] Invariant cache hit.
[2024-05-24 03:15:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:15:15] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Running 263 sub problems to find dead transitions.
[2024-05-24 03:15:15] [INFO ] Flow matrix only has 254 transitions (discarded 10 similar events)
[2024-05-24 03:15:15] [INFO ] Invariant cache hit.
[2024-05-24 03:15:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-24 03:15:18] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 22 ms to minimize.
[2024-05-24 03:15:18] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 2 ms to minimize.
[2024-05-24 03:15:18] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-05-24 03:15:18] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 1 ms to minimize.
[2024-05-24 03:15:19] [INFO ] Deduced a trap composed of 20 places in 514 ms of which 0 ms to minimize.
[2024-05-24 03:15:19] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-24 03:15:19] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:15:19] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 29 ms to minimize.
[2024-05-24 03:15:20] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 0 ms to minimize.
[2024-05-24 03:15:20] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2024-05-24 03:15:21] [INFO ] Deduced a trap composed of 23 places in 743 ms of which 1 ms to minimize.
[2024-05-24 03:15:21] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:15:21] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 1 ms to minimize.
[2024-05-24 03:15:21] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 24 ms to minimize.
[2024-05-24 03:15:21] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 9 ms to minimize.
[2024-05-24 03:15:21] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 10 ms to minimize.
[2024-05-24 03:15:21] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 1 ms to minimize.
[2024-05-24 03:15:22] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:15:22] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-24 03:15:23] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:15:23] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-24 03:15:23] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 2 ms to minimize.
[2024-05-24 03:15:23] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:15:23] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-05-24 03:15:23] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:15:23] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-05-24 03:15:23] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:15:23] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2024-05-24 03:15:23] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 3 ms to minimize.
[2024-05-24 03:15:23] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:15:23] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:15:23] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-24 03:15:23] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2024-05-24 03:15:24] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:15:24] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 4 ms to minimize.
[2024-05-24 03:15:24] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-24 03:15:24] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-24 03:15:24] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 3 ms to minimize.
[2024-05-24 03:15:25] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:15:25] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:15:25] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 253/388 variables, 135/192 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-24 03:15:27] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:15:28] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 1/389 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/389 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (OVERLAPS) 0/389 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 195 constraints, problems are : Problem set: 0 solved, 263 unsolved in 19817 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 135/135 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 43/59 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-24 03:15:37] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-05-24 03:15:37] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
[2024-05-24 03:15:37] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 0 ms to minimize.
[2024-05-24 03:15:37] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:15:37] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-24 03:15:38] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:15:38] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:15:38] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 2 ms to minimize.
[2024-05-24 03:15:38] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:15:38] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:15:38] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2024-05-24 03:15:39] [INFO ] Deduced a trap composed of 37 places in 59 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 4 ms to minimize.
[2024-05-24 03:15:39] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 14 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 9/73 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-24 03:15:40] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 0 ms to minimize.
[2024-05-24 03:15:40] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-24 03:15:40] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-24 03:15:41] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 253/388 variables, 135/212 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/388 variables, 263/475 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-24 03:15:44] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:15:44] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:15:44] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 3 ms to minimize.
[2024-05-24 03:15:44] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2024-05-24 03:15:44] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:15:44] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:15:44] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 0 ms to minimize.
[2024-05-24 03:15:45] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-24 03:15:45] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:15:45] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:15:45] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:15:46] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:15:46] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:15:47] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/388 variables, 14/489 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-24 03:15:48] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:15:48] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:15:49] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:15:49] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-24 03:15:53] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:15:53] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 2/495 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/388 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 16 (OVERLAPS) 1/389 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 389/389 variables, and 496 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 135/135 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 81/81 constraints]
After SMT, in 50020ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 50034ms
Starting structural reductions in LTL mode, iteration 1 : 135/160 places, 264/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50498 ms. Remains : 135/160 places, 264/312 transitions.
Support contains 101 out of 135 places after structural reductions.
[2024-05-24 03:16:06] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-24 03:16:06] [INFO ] Flatten gal took : 59 ms
FORMULA HealthRecord-PT-12-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 03:16:06] [INFO ] Flatten gal took : 44 ms
[2024-05-24 03:16:06] [INFO ] Input system was already deterministic with 264 transitions.
Support contains 86 out of 135 places (down from 101) after GAL structural reductions.
RANDOM walk for 40000 steps (2894 resets) in 2215 ms. (18 steps per ms) remains 24/67 properties
BEST_FIRST walk for 4002 steps (35 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (34 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (37 resets) in 21 ms. (182 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (32 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (35 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (34 resets) in 31 ms. (125 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (37 resets) in 38 ms. (102 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (35 resets) in 69 ms. (57 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (31 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (32 resets) in 8 ms. (444 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (32 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (33 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (35 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (35 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (32 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (33 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (33 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (34 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (33 resets) in 10 ms. (364 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (35 resets) in 30 ms. (129 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (32 resets) in 8 ms. (444 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (32 resets) in 7 ms. (500 steps per ms) remains 22/24 properties
BEST_FIRST walk for 4004 steps (35 resets) in 38 ms. (102 steps per ms) remains 22/22 properties
[2024-05-24 03:16:07] [INFO ] Flow matrix only has 254 transitions (discarded 10 similar events)
[2024-05-24 03:16:07] [INFO ] Invariant cache hit.
[2024-05-24 03:16:07] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 47/83 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 52/135 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-24 03:16:08] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 253/388 variables, 135/152 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-24 03:16:08] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
[2024-05-24 03:16:08] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-24 03:16:09] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-24 03:16:09] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 1/389 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-24 03:16:09] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/389 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/389 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 0/389 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 158 constraints, problems are : Problem set: 0 solved, 22 unsolved in 2458 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 135/135 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 47/83 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-24 03:16:10] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:16:10] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:16:10] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:16:10] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 1 ms to minimize.
Problem AtomicPropp20 is UNSAT
[2024-05-24 03:16:10] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:16:10] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
Problem AtomicPropp55 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 6/14 constraints. Problems are: Problem set: 2 solved, 20 unsolved
[2024-05-24 03:16:10] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:16:10] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 0 ms to minimize.
[2024-05-24 03:16:11] [INFO ] Deduced a trap composed of 32 places in 502 ms of which 1 ms to minimize.
[2024-05-24 03:16:11] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 4/18 constraints. Problems are: Problem set: 2 solved, 20 unsolved
[2024-05-24 03:16:11] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 1/19 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 52/135 variables, 8/27 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 6/33 constraints. Problems are: Problem set: 2 solved, 20 unsolved
[2024-05-24 03:16:12] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2024-05-24 03:16:12] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:16:12] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 2 ms to minimize.
[2024-05-24 03:16:12] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2024-05-24 03:16:12] [INFO ] Deduced a trap composed of 32 places in 505 ms of which 1 ms to minimize.
[2024-05-24 03:16:12] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2024-05-24 03:16:12] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 0 ms to minimize.
[2024-05-24 03:16:13] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
[2024-05-24 03:16:13] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:16:13] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:16:13] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:16:13] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2024-05-24 03:16:13] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-24 03:16:13] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-24 03:16:13] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 1 ms to minimize.
[2024-05-24 03:16:13] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 1 ms to minimize.
[2024-05-24 03:16:13] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:16:13] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:16:13] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:16:13] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 20/53 constraints. Problems are: Problem set: 2 solved, 20 unsolved
[2024-05-24 03:16:13] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:16:14] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-05-24 03:16:14] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:16:14] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:16:14] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 3 ms to minimize.
[2024-05-24 03:16:14] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:16:14] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:16:14] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2024-05-24 03:16:14] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:16:14] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:16:14] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-05-24 03:16:14] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-24 03:16:14] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 13/66 constraints. Problems are: Problem set: 2 solved, 20 unsolved
[2024-05-24 03:16:14] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:16:14] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 2/68 constraints. Problems are: Problem set: 2 solved, 20 unsolved
[2024-05-24 03:16:15] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
SMT process timed out in 7512ms, After SMT, problems are : Problem set: 2 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 264/264 transitions.
Graph (trivial) has 146 edges and 135 vertex of which 6 / 135 are part of one of the 3 SCC in 3 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 574 edges and 132 vertex of which 129 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 129 transition count 244
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 126 transition count 241
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 11 place count 126 transition count 240
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 13 place count 125 transition count 240
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 55 place count 83 transition count 157
Iterating global reduction 2 with 42 rules applied. Total rules applied 97 place count 83 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 83 transition count 156
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 102 place count 79 transition count 148
Iterating global reduction 3 with 4 rules applied. Total rules applied 106 place count 79 transition count 148
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 110 place count 79 transition count 144
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 112 place count 78 transition count 143
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 124 place count 72 transition count 175
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 126 place count 72 transition count 173
Partial Free-agglomeration rule applied 20 times.
Drop transitions (Partial Free agglomeration) removed 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 146 place count 72 transition count 173
Applied a total of 146 rules in 94 ms. Remains 72 /135 variables (removed 63) and now considering 173/264 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 72/135 places, 173/264 transitions.
RANDOM walk for 40000 steps (3014 resets) in 1704 ms. (23 steps per ms) remains 14/20 properties
BEST_FIRST walk for 40003 steps (484 resets) in 62 ms. (634 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (512 resets) in 192 ms. (207 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (507 resets) in 58 ms. (678 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (505 resets) in 82 ms. (481 steps per ms) remains 12/14 properties
BEST_FIRST walk for 40004 steps (520 resets) in 44 ms. (888 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (499 resets) in 48 ms. (816 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (501 resets) in 47 ms. (833 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (499 resets) in 45 ms. (869 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (500 resets) in 47 ms. (833 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (502 resets) in 46 ms. (851 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (471 resets) in 41 ms. (952 steps per ms) remains 9/12 properties
[2024-05-24 03:16:16] [INFO ] Flow matrix only has 161 transitions (discarded 12 similar events)
// Phase 1: matrix 161 rows 72 cols
[2024-05-24 03:16:16] [INFO ] Computed 13 invariants in 2 ms
[2024-05-24 03:16:16] [INFO ] State equation strengthened by 15 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 33/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 27/72 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 161/233 variables, 72/85 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 15/100 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/233 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 100 constraints, problems are : Problem set: 0 solved, 9 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 72/72 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 33/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-24 03:16:16] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:16:16] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:16:16] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:16:16] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2024-05-24 03:16:16] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-24 03:16:16] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 27/72 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-24 03:16:16] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 0 ms to minimize.
[2024-05-24 03:16:16] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:16:16] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:16:16] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:16:16] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:16:16] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2024-05-24 03:16:16] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-24 03:16:16] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 161/233 variables, 72/99 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 15/114 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 9/123 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-24 03:16:17] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:16:17] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2024-05-24 03:16:17] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:16:17] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 4/127 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-24 03:16:17] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-24 03:16:17] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2024-05-24 03:16:17] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/233 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/233 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 0/233 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 130 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1327 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 72/72 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 21/21 constraints]
After SMT, in 1484ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 7 properties in 370 ms.
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 173/173 transitions.
Graph (complete) has 426 edges and 72 vertex of which 68 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 54 transition count 145
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 54 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 30 place count 54 transition count 144
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 52 transition count 140
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 52 transition count 140
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 1 with 4 rules applied. Total rules applied 38 place count 50 transition count 138
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 47 transition count 152
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 47 transition count 150
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 48 place count 45 transition count 150
Partial Free-agglomeration rule applied 21 times.
Drop transitions (Partial Free agglomeration) removed 21 transitions
Iterating global reduction 2 with 21 rules applied. Total rules applied 69 place count 45 transition count 150
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 72 place count 45 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 44 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 44 transition count 148
Applied a total of 74 rules in 34 ms. Remains 44 /72 variables (removed 28) and now considering 148/173 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 44/72 places, 148/173 transitions.
RANDOM walk for 40000 steps (2981 resets) in 993 ms. (40 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (475 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (508 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 4043 steps, run visited all 2 properties in 26 ms. (steps per millisecond=155 )
Probabilistic random walk after 4043 steps, saw 1298 distinct states, run finished after 29 ms. (steps per millisecond=139 ) properties seen :2
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
[2024-05-24 03:16:18] [INFO ] Flatten gal took : 13 ms
[2024-05-24 03:16:18] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:16:18] [INFO ] Input system was already deterministic with 264 transitions.
Computed a total of 14 stabilizing places and 25 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 264/264 transitions.
Graph (trivial) has 180 edges and 135 vertex of which 6 / 135 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 64 place count 69 transition count 142
Iterating global reduction 0 with 63 rules applied. Total rules applied 127 place count 69 transition count 142
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 136 place count 60 transition count 124
Iterating global reduction 0 with 9 rules applied. Total rules applied 145 place count 60 transition count 124
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 152 place count 60 transition count 117
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 153 place count 59 transition count 114
Iterating global reduction 1 with 1 rules applied. Total rules applied 154 place count 59 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 155 place count 58 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 156 place count 58 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 159 place count 58 transition count 109
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 161 place count 58 transition count 107
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 165 place count 56 transition count 105
Applied a total of 165 rules in 21 ms. Remains 56 /135 variables (removed 79) and now considering 105/264 (removed 159) transitions.
[2024-05-24 03:16:18] [INFO ] Flow matrix only has 100 transitions (discarded 5 similar events)
// Phase 1: matrix 100 rows 56 cols
[2024-05-24 03:16:18] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:16:18] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-24 03:16:18] [INFO ] Flow matrix only has 100 transitions (discarded 5 similar events)
[2024-05-24 03:16:18] [INFO ] Invariant cache hit.
[2024-05-24 03:16:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:16:18] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-24 03:16:18] [INFO ] Redundant transitions in 18 ms returned []
Running 104 sub problems to find dead transitions.
[2024-05-24 03:16:18] [INFO ] Flow matrix only has 100 transitions (discarded 5 similar events)
[2024-05-24 03:16:18] [INFO ] Invariant cache hit.
[2024-05-24 03:16:18] [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, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-24 03:16:18] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:16:18] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:16:19] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 99/155 variables, 56/68 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 1/156 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (OVERLAPS) 0/156 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 69 constraints, problems are : Problem set: 0 solved, 104 unsolved in 2070 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-24 03:16:21] [INFO ] Deduced a trap composed of 8 places in 41 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, 104 unsolved
[2024-05-24 03:16:21] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-24 03:16:21] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 99/155 variables, 56/71 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 104/175 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (OVERLAPS) 1/156 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/156 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 12 (OVERLAPS) 0/156 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 176 constraints, problems are : Problem set: 0 solved, 104 unsolved in 3582 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 6/6 constraints]
After SMT, in 5697ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 5699ms
Starting structural reductions in SI_CTL mode, iteration 1 : 56/135 places, 105/264 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5868 ms. Remains : 56/135 places, 105/264 transitions.
[2024-05-24 03:16:24] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:16:24] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:16:24] [INFO ] Input system was already deterministic with 105 transitions.
[2024-05-24 03:16:24] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:16:24] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:16:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality12646593025080540375.gal : 3 ms
[2024-05-24 03:16:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality6336469492520768422.ctl : 14 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/CTLCardinality12646593025080540375.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6336469492520768422.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.16446e+06,0.554482,19116,2,2360,5,68598,6,0,323,78042,0


Converting to forward existential form...Done !
original formula: A(EF(((!(E(((p134==0)||(p152==1)) U (p12==1))) * (((p27==1)||(p70==0))||(p123==1))) * ((p150==0)||(p84==1)))) U (p75==1))
=> equivalent forward existential formula: [((Init * !(EG(!((p75==1))))) * !(E(!((p75==1)) U (!(E(TRUE U ((!(E(((p134==0)||(p152==1)) U (p12==1))) * (((p27...238
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t2...347
(forward)formula 0,1,7.69006,249696,1,0,413,1.45718e+06,239,190,2494,1.51544e+06,458
FORMULA HealthRecord-PT-12-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 264/264 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 71 transition count 142
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 71 transition count 142
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 137 place count 62 transition count 124
Iterating global reduction 0 with 9 rules applied. Total rules applied 146 place count 62 transition count 124
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 151 place count 62 transition count 119
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 153 place count 60 transition count 113
Iterating global reduction 1 with 2 rules applied. Total rules applied 155 place count 60 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 156 place count 59 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 157 place count 59 transition count 111
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 160 place count 59 transition count 108
Applied a total of 160 rules in 7 ms. Remains 59 /135 variables (removed 76) and now considering 108/264 (removed 156) transitions.
[2024-05-24 03:16:32] [INFO ] Flow matrix only has 104 transitions (discarded 4 similar events)
// Phase 1: matrix 104 rows 59 cols
[2024-05-24 03:16:32] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 03:16:32] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-24 03:16:32] [INFO ] Flow matrix only has 104 transitions (discarded 4 similar events)
[2024-05-24 03:16:32] [INFO ] Invariant cache hit.
[2024-05-24 03:16:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:16:32] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2024-05-24 03:16:32] [INFO ] Flow matrix only has 104 transitions (discarded 4 similar events)
[2024-05-24 03:16:32] [INFO ] Invariant cache hit.
[2024-05-24 03:16:32] [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, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-24 03:16:33] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:16:33] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:16:33] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-24 03:16:33] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2024-05-24 03:16:33] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:16:33] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 103/162 variables, 59/75 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 1/163 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 0/163 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 76 constraints, problems are : Problem set: 0 solved, 107 unsolved in 2687 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 59/59 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/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-24 03:16:35] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 103/162 variables, 59/76 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 107/183 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 1/163 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (OVERLAPS) 0/163 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 184 constraints, problems are : Problem set: 0 solved, 107 unsolved in 3269 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 59/59 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 7/7 constraints]
After SMT, in 6007ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 6009ms
Starting structural reductions in LTL mode, iteration 1 : 59/135 places, 108/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6161 ms. Remains : 59/135 places, 108/264 transitions.
[2024-05-24 03:16:38] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:16:38] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:16:38] [INFO ] Input system was already deterministic with 108 transitions.
[2024-05-24 03:16:38] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:16:38] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:16:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality7353025773735462504.gal : 2 ms
[2024-05-24 03:16:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality4619677189143683242.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/CTLCardinality7353025773735462504.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4619677189143683242.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.51576e+06,0.184786,10736,2,1451,5,30021,6,0,337,33797,0


Converting to forward existential form...Done !
original formula: E(AX(AF(((p34==1) + A(((p83==0)||(p77==1)) U ((p121==0)||(p111==1)))))) U (AG(EX((p99==1))) + AX(!(((p3==0)||(p44==1))))))
=> equivalent forward existential formula: ([(FwdU(Init,!(EX(!(!(EG(!(((p34==1) + !((E(!(((p121==0)||(p111==1))) U (!(((p83==0)||(p77==1))) * !(((p121==0)|...470
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...379
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,1.09175,36984,1,0,367,173042,256,186,2669,185959,396
FORMULA HealthRecord-PT-12-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 264/264 transitions.
Graph (trivial) has 194 edges and 135 vertex of which 8 / 135 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.
Discarding 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 67 place count 65 transition count 135
Iterating global reduction 0 with 66 rules applied. Total rules applied 133 place count 65 transition count 135
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 144 place count 54 transition count 113
Iterating global reduction 0 with 11 rules applied. Total rules applied 155 place count 54 transition count 113
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 165 place count 54 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 168 place count 51 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 171 place count 51 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 174 place count 48 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 177 place count 48 transition count 88
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 186 place count 48 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 189 place count 48 transition count 76
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 195 place count 45 transition count 73
Applied a total of 195 rules in 20 ms. Remains 45 /135 variables (removed 90) and now considering 73/264 (removed 191) transitions.
[2024-05-24 03:16:39] [INFO ] Flow matrix only has 67 transitions (discarded 6 similar events)
// Phase 1: matrix 67 rows 45 cols
[2024-05-24 03:16:39] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:16:39] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-24 03:16:39] [INFO ] Flow matrix only has 67 transitions (discarded 6 similar events)
[2024-05-24 03:16:39] [INFO ] Invariant cache hit.
[2024-05-24 03:16:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:16:39] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-05-24 03:16:39] [INFO ] Redundant transitions in 17 ms returned []
Running 72 sub problems to find dead transitions.
[2024-05-24 03:16:39] [INFO ] Flow matrix only has 67 transitions (discarded 6 similar events)
[2024-05-24 03:16:39] [INFO ] Invariant cache hit.
[2024-05-24 03:16:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-24 03:16:39] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:16:39] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 66/111 variables, 45/56 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-24 03:16:40] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 1/112 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (OVERLAPS) 0/112 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 58 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1481 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-24 03:16:41] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:16:41] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 66/111 variables, 45/59 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 72/131 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-24 03:16:41] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:16:41] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (OVERLAPS) 1/112 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (OVERLAPS) 0/112 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 134 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2090 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 7/7 constraints]
After SMT, in 3586ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3587ms
Starting structural reductions in SI_CTL mode, iteration 1 : 45/135 places, 73/264 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3742 ms. Remains : 45/135 places, 73/264 transitions.
[2024-05-24 03:16:43] [INFO ] Flatten gal took : 10 ms
[2024-05-24 03:16:43] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:16:43] [INFO ] Input system was already deterministic with 73 transitions.
[2024-05-24 03:16:43] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:16:43] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:16:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality10244304686593378376.gal : 1 ms
[2024-05-24 03:16:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality15300574805961565582.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/CTLCardinality10244304686593378376.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15300574805961565582.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,359807,0.056638,5268,2,861,5,9553,6,0,246,8628,0


Converting to forward existential form...Done !
original formula: E((p18==1) U EF((p105==1)))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(p18==1)),TRUE) * (p105==1))] != FALSE
Hit Full ! (commute/partial/dont) 70/0/3
(forward)formula 0,1,0.080692,5532,1,0,8,10073,16,1,476,8628,6
FORMULA HealthRecord-PT-12-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 264/264 transitions.
Graph (trivial) has 189 edges and 135 vertex of which 8 / 135 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 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 65 place count 66 transition count 137
Iterating global reduction 0 with 64 rules applied. Total rules applied 129 place count 66 transition count 137
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 140 place count 55 transition count 115
Iterating global reduction 0 with 11 rules applied. Total rules applied 151 place count 55 transition count 115
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 161 place count 55 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 162 place count 54 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 163 place count 54 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 164 place count 53 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 165 place count 53 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 167 place count 53 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 170 place count 53 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 174 place count 51 transition count 93
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 175 place count 50 transition count 92
Applied a total of 175 rules in 28 ms. Remains 50 /135 variables (removed 85) and now considering 92/264 (removed 172) transitions.
[2024-05-24 03:16:43] [INFO ] Flow matrix only has 85 transitions (discarded 7 similar events)
// Phase 1: matrix 85 rows 50 cols
[2024-05-24 03:16:43] [INFO ] Computed 10 invariants in 0 ms
[2024-05-24 03:16:43] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-24 03:16:43] [INFO ] Flow matrix only has 85 transitions (discarded 7 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 111 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2024-05-24 03:16:43] [INFO ] Redundant transitions in 12 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-24 03:16:43] [INFO ] Flow matrix only has 85 transitions (discarded 7 similar events)
[2024-05-24 03:16:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 2/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-24 03:16:43] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:16:43] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-24 03:16:43] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-24 03:16:44] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 6/50 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 84/134 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/134 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/135 variables, and 64 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1362 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 2/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 6/50 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 84/134 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 76/140 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/134 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/135 variables, and 140 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1221 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 4/4 constraints]
After SMT, in 2609ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 2611ms
Starting structural reductions in SI_CTL mode, iteration 1 : 50/135 places, 92/264 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2831 ms. Remains : 50/135 places, 92/264 transitions.
[2024-05-24 03:16:46] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:16:46] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:16:46] [INFO ] Input system was already deterministic with 92 transitions.
[2024-05-24 03:16:46] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:16:46] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:16:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality1392558432796460182.gal : 1 ms
[2024-05-24 03:16:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality484446896634206752.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/CTLCardinality1392558432796460182.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality484446896634206752.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,634234,0.108315,7980,2,2366,5,21850,6,0,280,18788,0


Converting to forward existential form...Done !
original formula: EF(!(E(A(((p132==0)||(p13==1)) U ((p76==0)||(p49==1))) U AF((p9==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!((E(!(((p76==0)||(p49==1))) U (!(((p132==0)||(p13==1))) * !(((p76==0)||(p49==1))))) + E...216
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, t19, t20, t31...300
(forward)formula 0,1,6.68766,194016,1,0,414,1.20539e+06,212,220,2099,1.1765e+06,459
FORMULA HealthRecord-PT-12-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 264/264 transitions.
Graph (trivial) has 188 edges and 135 vertex of which 8 / 135 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.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 64 place count 68 transition count 141
Iterating global reduction 0 with 63 rules applied. Total rules applied 127 place count 68 transition count 141
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 137 place count 58 transition count 121
Iterating global reduction 0 with 10 rules applied. Total rules applied 147 place count 58 transition count 121
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 156 place count 58 transition count 112
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 158 place count 56 transition count 106
Iterating global reduction 1 with 2 rules applied. Total rules applied 160 place count 56 transition count 106
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 162 place count 54 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 164 place count 54 transition count 102
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 170 place count 54 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 173 place count 54 transition count 93
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 179 place count 51 transition count 90
Applied a total of 179 rules in 21 ms. Remains 51 /135 variables (removed 84) and now considering 90/264 (removed 174) transitions.
[2024-05-24 03:16:52] [INFO ] Flow matrix only has 84 transitions (discarded 6 similar events)
// Phase 1: matrix 84 rows 51 cols
[2024-05-24 03:16:52] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:16:52] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-24 03:16:52] [INFO ] Flow matrix only has 84 transitions (discarded 6 similar events)
[2024-05-24 03:16:52] [INFO ] Invariant cache hit.
[2024-05-24 03:16:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:16:53] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-05-24 03:16:53] [INFO ] Redundant transitions in 13 ms returned []
Running 89 sub problems to find dead transitions.
[2024-05-24 03:16:53] [INFO ] Flow matrix only has 84 transitions (discarded 6 similar events)
[2024-05-24 03:16:53] [INFO ] Invariant cache hit.
[2024-05-24 03:16:53] [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, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 03:16:53] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-05-24 03:16:53] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-24 03:16:53] [INFO ] Deduced a trap composed of 18 places in 34 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, 89 unsolved
[2024-05-24 03:16:53] [INFO ] Deduced a trap composed of 14 places in 35 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, 89 unsolved
[2024-05-24 03:16:53] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:16:53] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:16:53] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 83/134 variables, 51/67 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 1/135 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/135 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 68 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1965 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 03:16:55] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:16:55] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 03:16:55] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-24 03:16:55] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 83/134 variables, 51/71 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 89/160 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 03:16:56] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 1/135 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/135 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 0/135 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 162 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3299 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 12/12 constraints]
After SMT, in 5289ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 5290ms
Starting structural reductions in SI_CTL mode, iteration 1 : 51/135 places, 90/264 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5418 ms. Remains : 51/135 places, 90/264 transitions.
[2024-05-24 03:16:58] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:16:58] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:16:58] [INFO ] Input system was already deterministic with 90 transitions.
[2024-05-24 03:16:58] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:16:58] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:16:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality14027934847938884529.gal : 2 ms
[2024-05-24 03:16:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality8456021631346200424.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/CTLCardinality14027934847938884529.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8456021631346200424.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,711509,0.161505,10064,2,2115,5,29693,6,0,287,31257,0


Converting to forward existential form...Done !
original formula: EF((AG((((p8==1)&&(p96==1))&&(p105==1))) * ((p40==0)||(p82==1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * ((p40==0)||(p82==1))) * !(E(TRUE U !((((p8==1)&&(p96==1))&&(p105==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, t17, t18, t19, t20, t21...370
(forward)formula 0,0,0.567922,21516,1,0,189,90337,195,74,2102,82861,182
FORMULA HealthRecord-PT-12-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 264/264 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 75 transition count 151
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 75 transition count 151
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 127 place count 68 transition count 137
Iterating global reduction 0 with 7 rules applied. Total rules applied 134 place count 68 transition count 137
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 142 place count 68 transition count 129
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 67 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 67 transition count 126
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 145 place count 66 transition count 124
Iterating global reduction 1 with 1 rules applied. Total rules applied 146 place count 66 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 149 place count 66 transition count 121
Applied a total of 149 rules in 4 ms. Remains 66 /135 variables (removed 69) and now considering 121/264 (removed 143) transitions.
[2024-05-24 03:16:58] [INFO ] Flow matrix only has 118 transitions (discarded 3 similar events)
// Phase 1: matrix 118 rows 66 cols
[2024-05-24 03:16:58] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:16:59] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-24 03:16:59] [INFO ] Flow matrix only has 118 transitions (discarded 3 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 56 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-24 03:16:59] [INFO ] Flow matrix only has 118 transitions (discarded 3 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/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-24 03:16:59] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:16:59] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:16:59] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:16:59] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:16:59] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 117/183 variables, 66/80 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 1/184 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 81 constraints, problems are : Problem set: 0 solved, 120 unsolved in 2593 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-24 03:17:01] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:17:02] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:17:02] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:17:02] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:17:02] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:17:02] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:17:02] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:17:02] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:17:02] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:17:02] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2024-05-24 03:17:02] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 117/183 variables, 66/91 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 120/211 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 1/184 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/184 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 212 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4528 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 16/16 constraints]
After SMT, in 7148ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 7150ms
Starting structural reductions in LTL mode, iteration 1 : 66/135 places, 121/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7259 ms. Remains : 66/135 places, 121/264 transitions.
[2024-05-24 03:17:06] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:17:06] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:17:06] [INFO ] Input system was already deterministic with 121 transitions.
[2024-05-24 03:17:06] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:17:06] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:17:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality16095536521588887608.gal : 4 ms
[2024-05-24 03:17:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality11267053253932854871.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/CTLCardinality16095536521588887608.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11267053253932854871.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.65338e+06,0.982435,32852,2,4679,5,105939,6,0,381,123250,0


Converting to forward existential form...Done !
original formula: E((((EF(!(EG((p124==0)))) * !((!(((p157==1)||(p50==0))) * (!(EX((p60==1))) + EF((p38==1)))))) * (!(AG(((p37==0)||(p153==1)))) * !(((p142=...325
=> equivalent forward existential formula: [(FwdU(Init,(((E(TRUE U !(EG((p124==0)))) * !((!(((p157==1)||(p50==0))) * (!(EX((p60==1))) + E(TRUE U (p38==1)))...458
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
(forward)formula 0,0,20.3513,527664,1,0,681,3.29e+06,283,342,2837,2.7906e+06,814
FORMULA HealthRecord-PT-12-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 264/264 transitions.
Graph (trivial) has 194 edges and 135 vertex of which 8 / 135 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.
Discarding 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 67 place count 65 transition count 135
Iterating global reduction 0 with 66 rules applied. Total rules applied 133 place count 65 transition count 135
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 144 place count 54 transition count 113
Iterating global reduction 0 with 11 rules applied. Total rules applied 155 place count 54 transition count 113
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 165 place count 54 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 168 place count 51 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 171 place count 51 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 174 place count 48 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 177 place count 48 transition count 88
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 186 place count 48 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 189 place count 48 transition count 76
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 195 place count 45 transition count 73
Applied a total of 195 rules in 20 ms. Remains 45 /135 variables (removed 90) and now considering 73/264 (removed 191) transitions.
[2024-05-24 03:17:26] [INFO ] Flow matrix only has 67 transitions (discarded 6 similar events)
// Phase 1: matrix 67 rows 45 cols
[2024-05-24 03:17:26] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:17:26] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-24 03:17:26] [INFO ] Flow matrix only has 67 transitions (discarded 6 similar events)
[2024-05-24 03:17:26] [INFO ] Invariant cache hit.
[2024-05-24 03:17:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:17:26] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2024-05-24 03:17:26] [INFO ] Redundant transitions in 13 ms returned []
Running 72 sub problems to find dead transitions.
[2024-05-24 03:17:26] [INFO ] Flow matrix only has 67 transitions (discarded 6 similar events)
[2024-05-24 03:17:26] [INFO ] Invariant cache hit.
[2024-05-24 03:17:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-24 03:17:27] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:17:27] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 66/111 variables, 45/56 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 1/112 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/112 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 57 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1128 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-24 03:17:28] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:17:28] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-24 03:17:28] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 66/111 variables, 45/59 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 72/131 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (OVERLAPS) 1/112 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (OVERLAPS) 0/112 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 132 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2074 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 5/5 constraints]
After SMT, in 3235ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3236ms
Starting structural reductions in SI_CTL mode, iteration 1 : 45/135 places, 73/264 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3397 ms. Remains : 45/135 places, 73/264 transitions.
[2024-05-24 03:17:30] [INFO ] Flatten gal took : 10 ms
[2024-05-24 03:17:30] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:17:30] [INFO ] Input system was already deterministic with 73 transitions.
[2024-05-24 03:17:30] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:17:30] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:17:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15294418588059534571.gal : 24 ms
[2024-05-24 03:17:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15019676828665535869.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/ReachabilityCardinality15294418588059534571.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15019676828665535869.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (3377 resets) in 308 ms. (129 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (434 resets) in 19 ms. (2000 steps per ms) remains 1/1 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality15019676828665535869.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 25
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :25 after 1351
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1351 after 1991
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1991 after 2215
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2215 after 17281
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :17281 after 20197
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :20197 after 184885
Reachability property HealthRecord-PT-12-CTLCardinality-2024-08 is true.
FORMULA HealthRecord-PT-12-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 513 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,279349,0.189392,6144,2,740,14,13732,6,0,246,11367,0
Total reachable state count : 279349

Verifying 1 reachability properties.
Reachability property HealthRecord-PT-12-CTLCardinality-2024-08 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
HealthRecord-PT-12-CTLCardinality-2024-08,1,0.189863,6404,2,46,14,13732,7,0,252,11367,0
ITS tools runner thread asked to quit. Dying gracefully.
Finished probabilistic random walk after 481695 steps, run visited all 1 properties in 458 ms. (steps per millisecond=1051 )
Probabilistic random walk after 481695 steps, saw 63274 distinct states, run finished after 458 ms. (steps per millisecond=1051 ) properties seen :1
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 264/264 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 74 transition count 148
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 74 transition count 148
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 131 place count 65 transition count 130
Iterating global reduction 0 with 9 rules applied. Total rules applied 140 place count 65 transition count 130
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 149 place count 65 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 150 place count 64 transition count 118
Iterating global reduction 1 with 1 rules applied. Total rules applied 151 place count 64 transition count 118
Applied a total of 151 rules in 15 ms. Remains 64 /135 variables (removed 71) and now considering 118/264 (removed 146) transitions.
[2024-05-24 03:17:30] [INFO ] Flow matrix only has 114 transitions (discarded 4 similar events)
// Phase 1: matrix 114 rows 64 cols
[2024-05-24 03:17:30] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 03:17:30] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-24 03:17:30] [INFO ] Flow matrix only has 114 transitions (discarded 4 similar events)
[2024-05-24 03:17:30] [INFO ] Invariant cache hit.
[2024-05-24 03:17:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:17:31] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2024-05-24 03:17:31] [INFO ] Flow matrix only has 114 transitions (discarded 4 similar events)
[2024-05-24 03:17:31] [INFO ] Invariant cache hit.
[2024-05-24 03:17:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-24 03:17:31] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:17:31] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:17:31] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:17:31] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-24 03:17:31] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 0 ms to minimize.
[2024-05-24 03:17:31] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-24 03:17:32] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 113/177 variables, 64/81 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-24 03:17:33] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-24 03:17:33] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:17:33] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:17:33] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (OVERLAPS) 1/178 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 12 (OVERLAPS) 0/178 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 86 constraints, problems are : Problem set: 0 solved, 117 unsolved in 4280 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 64/64 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-24 03:17:35] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:17:35] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:17:35] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 113/177 variables, 64/88 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 117/205 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 1/178 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 11 (OVERLAPS) 0/178 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 206 constraints, problems are : Problem set: 0 solved, 117 unsolved in 3646 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 64/64 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 14/14 constraints]
After SMT, in 7982ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 7983ms
Starting structural reductions in LTL mode, iteration 1 : 64/135 places, 118/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8177 ms. Remains : 64/135 places, 118/264 transitions.
[2024-05-24 03:17:39] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:17:39] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:17:39] [INFO ] Input system was already deterministic with 118 transitions.
[2024-05-24 03:17:39] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:17:39] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:17:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality1549404280583119086.gal : 2 ms
[2024-05-24 03:17:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality5866061462163801735.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/CTLCardinality1549404280583119086.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5866061462163801735.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.55745e+06,0.572872,24404,2,3860,5,95161,6,0,367,96914,0


Converting to forward existential form...Done !
original formula: E((EX(((p47==0)||(p44==1))) + ((!(A(((p105==0)||(p54==1)) U (p13==1))) * EG(((p146==0)||(p84==1)))) * (!(EG((p18==1))) * ((p156!=1)||(p13...233
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(EX(((p47==0)||(p44==1))) + ((!(!((E(!((p13==1)) U (!(((p105==0)||(p54==1))) * !((p13==1)))) + ...331
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...419
Detected timeout of ITS tools.
[2024-05-24 03:18:09] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:18:09] [INFO ] Applying decomposition
[2024-05-24 03:18:09] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9884331992867435279.txt' '-o' '/tmp/graph9884331992867435279.bin' '-w' '/tmp/graph9884331992867435279.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9884331992867435279.bin' '-l' '-1' '-v' '-w' '/tmp/graph9884331992867435279.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:18:09] [INFO ] Decomposing Gal with order
[2024-05-24 03:18:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:18:09] [INFO ] Removed a total of 106 redundant transitions.
[2024-05-24 03:18:09] [INFO ] Flatten gal took : 82 ms
[2024-05-24 03:18:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 6 ms.
[2024-05-24 03:18:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality8921013234250573795.gal : 16 ms
[2024-05-24 03:18:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality17818647789678491604.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/CTLCardinality8921013234250573795.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17818647789678491604.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
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.55745e+06,0.113616,8632,169,127,7143,3476,258,18045,108,22559,0


Converting to forward existential form...Done !
original formula: E((EX(((u2.p47==0)||(u2.p44==1))) + ((!(A(((i7.u11.p105==0)||(u2.p54==1)) U (u0.p13==1))) * EG(((i9.u14.p146==0)||(u8.p84==1)))) * (!(EG(...301
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(EX(((u2.p47==0)||(u2.p44==1))) + ((!(!((E(!((u0.p13==1)) U (!(((i7.u11.p105==0)||(u2.p54==1)))...405
Reverse transition relation is NOT exact ! Due to transitions t6, t74, t75, t76, t77, t81, t111, u0.t59, u0.t60, u0.t61, u0.t62, u0.t63, u0.t64, u2.t47, u2...582
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,0.567266,26056,1,0,42638,5927,1683,83319,599,28728,70254
FORMULA HealthRecord-PT-12-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 264/264 transitions.
Graph (trivial) has 177 edges and 135 vertex of which 8 / 135 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 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 65 place count 66 transition count 138
Iterating global reduction 0 with 64 rules applied. Total rules applied 129 place count 66 transition count 138
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 136 place count 59 transition count 124
Iterating global reduction 0 with 7 rules applied. Total rules applied 143 place count 59 transition count 124
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 147 place count 59 transition count 120
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 149 place count 57 transition count 114
Iterating global reduction 1 with 2 rules applied. Total rules applied 151 place count 57 transition count 114
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 153 place count 55 transition count 110
Iterating global reduction 1 with 2 rules applied. Total rules applied 155 place count 55 transition count 110
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 160 place count 55 transition count 105
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 163 place count 55 transition count 102
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 167 place count 53 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 52 transition count 99
Applied a total of 168 rules in 17 ms. Remains 52 /135 variables (removed 83) and now considering 99/264 (removed 165) transitions.
[2024-05-24 03:18:09] [INFO ] Flow matrix only has 93 transitions (discarded 6 similar events)
// Phase 1: matrix 93 rows 52 cols
[2024-05-24 03:18:09] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:18:10] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-24 03:18:10] [INFO ] Flow matrix only has 93 transitions (discarded 6 similar events)
[2024-05-24 03:18:10] [INFO ] Invariant cache hit.
[2024-05-24 03:18:10] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-05-24 03:18:10] [INFO ] Redundant transitions in 22 ms returned []
Running 83 sub problems to find dead transitions.
[2024-05-24 03:18:10] [INFO ] Flow matrix only has 93 transitions (discarded 6 similar events)
[2024-05-24 03:18:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 8/52 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-24 03:18:10] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 11 ms to minimize.
[2024-05-24 03:18:10] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:18:10] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:18:10] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-05-24 03:18:10] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:18:10] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (OVERLAPS) 92/144 variables, 52/67 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 0/144 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/145 variables, and 67 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1477 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 8/52 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (OVERLAPS) 92/144 variables, 52/67 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 83/150 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 0/144 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/145 variables, and 150 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1509 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 6/6 constraints]
After SMT, in 3038ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 3039ms
Starting structural reductions in SI_CTL mode, iteration 1 : 52/135 places, 99/264 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3270 ms. Remains : 52/135 places, 99/264 transitions.
[2024-05-24 03:18:13] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:18:13] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:18:13] [INFO ] Input system was already deterministic with 99 transitions.
[2024-05-24 03:18:13] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:18:13] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:18:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality14005863029476905984.gal : 4 ms
[2024-05-24 03:18:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality12042162833373390495.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/CTLCardinality14005863029476905984.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12042162833373390495.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,733702,0.265003,8840,2,3200,5,21997,6,0,298,23961,0


Converting to forward existential form...Done !
original formula: E((((p10==0)||(p104==1))||(p157==0)) U !(EF(EG(((EF((p91==1)) + (p120==0)) + (p131==1))))))
=> equivalent forward existential formula: [(FwdU(Init,(((p10==0)||(p104==1))||(p157==0))) * !(E(TRUE U EG(((E(TRUE U (p91==1)) + (p120==0)) + (p131==1))))...167
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, t19, t20...310
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,6.50252,171796,1,0,352,969588,222,183,2290,1.01337e+06,368
FORMULA HealthRecord-PT-12-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 264/264 transitions.
Discarding 67 places :
Symmetric choice reduction at 0 with 67 rule applications. Total rules 67 place count 68 transition count 136
Iterating global reduction 0 with 67 rules applied. Total rules applied 134 place count 68 transition count 136
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 143 place count 59 transition count 118
Iterating global reduction 0 with 9 rules applied. Total rules applied 152 place count 59 transition count 118
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 158 place count 59 transition count 112
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 161 place count 56 transition count 103
Iterating global reduction 1 with 3 rules applied. Total rules applied 164 place count 56 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 167 place count 53 transition count 97
Iterating global reduction 1 with 3 rules applied. Total rules applied 170 place count 53 transition count 97
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 179 place count 53 transition count 88
Applied a total of 179 rules in 2 ms. Remains 53 /135 variables (removed 82) and now considering 88/264 (removed 176) transitions.
[2024-05-24 03:18:19] [INFO ] Flow matrix only has 84 transitions (discarded 4 similar events)
// Phase 1: matrix 84 rows 53 cols
[2024-05-24 03:18:19] [INFO ] Computed 10 invariants in 0 ms
[2024-05-24 03:18:19] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-24 03:18:19] [INFO ] Flow matrix only has 84 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 58 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2024-05-24 03:18:19] [INFO ] Flow matrix only has 84 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/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 03:18:20] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:18:20] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:18:20] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 83/136 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 1/137 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 0/137 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 67 constraints, problems are : Problem set: 0 solved, 87 unsolved in 1687 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: 87/87 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 03:18:21] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 83/136 variables, 53/67 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 87/154 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 1/137 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (OVERLAPS) 0/137 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 155 constraints, problems are : Problem set: 0 solved, 87 unsolved in 2069 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: 87/87 constraints, Known Traps: 4/4 constraints]
After SMT, in 3806ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 3807ms
Starting structural reductions in LTL mode, iteration 1 : 53/135 places, 88/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3926 ms. Remains : 53/135 places, 88/264 transitions.
[2024-05-24 03:18:23] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:18:23] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:18:23] [INFO ] Input system was already deterministic with 88 transitions.
[2024-05-24 03:18:23] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:18:23] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:18:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality12586233551047622999.gal : 1 ms
[2024-05-24 03:18:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality12988974239047919921.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/CTLCardinality12586233551047622999.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12988974239047919921.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,885177,0.057614,6144,2,931,5,12493,6,0,293,11620,0


Converting to forward existential form...Done !
original formula: EX(E(((p58==0)||(p79==1)) U AF(!(((p20==0)||(p93==1))))))
=> equivalent forward existential formula: [(FwdU(EY(Init),((p58==0)||(p79==1))) * !(EG(!(!(((p20==0)||(p93==1)))))))] != FALSE
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, t21, t22, t60, t66, ...252
Hit Full ! (commute/partial/dont) 82/0/6
(forward)formula 0,1,2.53668,78700,1,0,277,443242,200,143,2173,449582,355
FORMULA HealthRecord-PT-12-CTLCardinality-2024-11 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 : 135/135 places, 264/264 transitions.
Discarding 67 places :
Symmetric choice reduction at 0 with 67 rule applications. Total rules 67 place count 68 transition count 136
Iterating global reduction 0 with 67 rules applied. Total rules applied 134 place count 68 transition count 136
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 143 place count 59 transition count 118
Iterating global reduction 0 with 9 rules applied. Total rules applied 152 place count 59 transition count 118
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 158 place count 59 transition count 112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 159 place count 58 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 160 place count 58 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 161 place count 57 transition count 107
Iterating global reduction 1 with 1 rules applied. Total rules applied 162 place count 57 transition count 107
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 165 place count 57 transition count 104
Applied a total of 165 rules in 3 ms. Remains 57 /135 variables (removed 78) and now considering 104/264 (removed 160) transitions.
[2024-05-24 03:18:26] [INFO ] Flow matrix only has 100 transitions (discarded 4 similar events)
// Phase 1: matrix 100 rows 57 cols
[2024-05-24 03:18:26] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 03:18:26] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-24 03:18:26] [INFO ] Flow matrix only has 100 transitions (discarded 4 similar events)
[2024-05-24 03:18:26] [INFO ] Invariant cache hit.
[2024-05-24 03:18:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:18:26] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2024-05-24 03:18:26] [INFO ] Flow matrix only has 100 transitions (discarded 4 similar events)
[2024-05-24 03:18:26] [INFO ] Invariant cache hit.
[2024-05-24 03:18:26] [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, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-24 03:18:26] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:18:26] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:18:26] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 99/156 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-24 03:18:27] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:18:27] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 1/157 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (OVERLAPS) 0/157 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 73 constraints, problems are : Problem set: 0 solved, 103 unsolved in 2332 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: 103/103 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 99/156 variables, 57/72 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 103/175 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 1/157 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (OVERLAPS) 0/157 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 176 constraints, problems are : Problem set: 0 solved, 103 unsolved in 2492 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: 103/103 constraints, Known Traps: 5/5 constraints]
After SMT, in 4888ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 4889ms
Starting structural reductions in LTL mode, iteration 1 : 57/135 places, 104/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4996 ms. Remains : 57/135 places, 104/264 transitions.
[2024-05-24 03:18:31] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:18:31] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:18:31] [INFO ] Input system was already deterministic with 104 transitions.
[2024-05-24 03:18:31] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:18:31] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:18:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality15566904854671104563.gal : 1 ms
[2024-05-24 03:18:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality17690648666122342660.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/CTLCardinality15566904854671104563.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17690648666122342660.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.12753e+06,0.359683,16032,2,2702,5,52498,6,0,325,52829,0


Converting to forward existential form...Done !
original formula: (AX(EX(AF((p153==1)))) + (EG(((AF(((p58==0)||(p11==1))) + (p25==1)) + ((p157==0)||(p132==1)))) * EX(EX(!(E((p39==1) U (p123==0)))))))
=> equivalent forward existential formula: [(EY((Init * !((EG(((!(EG(!(((p58==0)||(p11==1))))) + (p25==1)) + ((p157==0)||(p132==1)))) * EX(EX(!(E((p39==1) ...213
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...303
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,9.13448,265516,1,0,546,1.55315e+06,245,289,2500,1.72537e+06,612
FORMULA HealthRecord-PT-12-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 264/264 transitions.
Discarding 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 66 place count 69 transition count 139
Iterating global reduction 0 with 66 rules applied. Total rules applied 132 place count 69 transition count 139
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 141 place count 60 transition count 121
Iterating global reduction 0 with 9 rules applied. Total rules applied 150 place count 60 transition count 121
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 159 place count 60 transition count 112
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 162 place count 57 transition count 103
Iterating global reduction 1 with 3 rules applied. Total rules applied 165 place count 57 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 168 place count 54 transition count 97
Iterating global reduction 1 with 3 rules applied. Total rules applied 171 place count 54 transition count 97
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 178 place count 54 transition count 90
Applied a total of 178 rules in 2 ms. Remains 54 /135 variables (removed 81) and now considering 90/264 (removed 174) transitions.
[2024-05-24 03:18:40] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
// Phase 1: matrix 87 rows 54 cols
[2024-05-24 03:18:40] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:18:40] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-24 03:18:40] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
[2024-05-24 03:18:40] [INFO ] Invariant cache hit.
[2024-05-24 03:18:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:18:40] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2024-05-24 03:18:40] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
[2024-05-24 03:18:40] [INFO ] Invariant cache hit.
[2024-05-24 03:18:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 03:18:41] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:18:41] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:18:41] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:18:41] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:18:41] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:18:41] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 2 ms to minimize.
[2024-05-24 03:18:41] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 86/140 variables, 54/70 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 1/141 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 0/141 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 71 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1709 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 03:18:42] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:18:42] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 86/140 variables, 54/72 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 89/161 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 03:18:43] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 1/141 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (OVERLAPS) 0/141 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 163 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3001 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 10/10 constraints]
After SMT, in 4751ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 4756ms
Starting structural reductions in LTL mode, iteration 1 : 54/135 places, 90/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4880 ms. Remains : 54/135 places, 90/264 transitions.
[2024-05-24 03:18:45] [INFO ] Flatten gal took : 15 ms
[2024-05-24 03:18:45] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:18:45] [INFO ] Input system was already deterministic with 90 transitions.
[2024-05-24 03:18:45] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:18:45] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:18:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality11576763897245322941.gal : 9 ms
[2024-05-24 03:18:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality9518767323035424441.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/CTLCardinality11576763897245322941.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9518767323035424441.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,980758,0.166477,9848,2,1287,5,26398,6,0,302,27266,0


Converting to forward existential form...Done !
original formula: (AF(EG(EF(((p63==0)||(p32==1))))) * EX(EG((AG(EF(((p72==0)||(p108==1)))) + ((EF((p48==1)) + EX(TRUE)) * (p125==1))))))
=> equivalent forward existential formula: ([FwdG(Init,!(EG(E(TRUE U ((p63==0)||(p32==1))))))] = FALSE * [(Init * !(EX(EG((!(E(TRUE U !(E(TRUE U ((p72==0)|...233
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t12, t13, t14, t16, t18, t20, t22, t34, t35, t38, t39, t...292
(forward)formula 0,1,2.60825,80928,1,0,231,473898,207,114,2242,374629,276
FORMULA HealthRecord-PT-12-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 264/264 transitions.
Graph (trivial) has 179 edges and 135 vertex of which 8 / 135 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 61 place count 71 transition count 146
Iterating global reduction 0 with 60 rules applied. Total rules applied 121 place count 71 transition count 146
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 130 place count 62 transition count 128
Iterating global reduction 0 with 9 rules applied. Total rules applied 139 place count 62 transition count 128
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 145 place count 62 transition count 122
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 148 place count 62 transition count 119
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 154 place count 59 transition count 116
Applied a total of 154 rules in 7 ms. Remains 59 /135 variables (removed 76) and now considering 116/264 (removed 148) transitions.
[2024-05-24 03:18:48] [INFO ] Flow matrix only has 109 transitions (discarded 7 similar events)
// Phase 1: matrix 109 rows 59 cols
[2024-05-24 03:18:48] [INFO ] Computed 10 invariants in 7 ms
[2024-05-24 03:18:48] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-24 03:18:48] [INFO ] Flow matrix only has 109 transitions (discarded 7 similar events)
[2024-05-24 03:18:48] [INFO ] Invariant cache hit.
[2024-05-24 03:18:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:18:48] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-05-24 03:18:48] [INFO ] Redundant transitions in 13 ms returned []
Running 115 sub problems to find dead transitions.
[2024-05-24 03:18:48] [INFO ] Flow matrix only has 109 transitions (discarded 7 similar events)
[2024-05-24 03:18:48] [INFO ] Invariant cache hit.
[2024-05-24 03:18:48] [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, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-24 03:18:48] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:18:48] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-24 03:18:49] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 108/167 variables, 59/72 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 1/168 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (OVERLAPS) 0/168 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 73 constraints, problems are : Problem set: 0 solved, 115 unsolved in 2428 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 59/59 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-24 03:18:51] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 108/167 variables, 59/73 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 115/188 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (OVERLAPS) 1/168 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 11 (OVERLAPS) 0/168 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 189 constraints, problems are : Problem set: 0 solved, 115 unsolved in 3518 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 59/59 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 4/4 constraints]
After SMT, in 5986ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 5988ms
Starting structural reductions in SI_CTL mode, iteration 1 : 59/135 places, 116/264 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6199 ms. Remains : 59/135 places, 116/264 transitions.
[2024-05-24 03:18:54] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:18:54] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:18:54] [INFO ] Input system was already deterministic with 116 transitions.
[2024-05-24 03:18:54] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:18:54] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:18:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality17603810313335667020.gal : 1 ms
[2024-05-24 03:18:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality5393788499610031896.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/CTLCardinality17603810313335667020.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5393788499610031896.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.30767e+06,0.22066,11860,2,1665,5,38643,6,0,343,43990,0


Converting to forward existential form...Done !
original formula: AG(((A((!((EF((p81==0)) * ((p89==0)||(p120==1)))) + (EF((p90==1)) * ((p45==0)||(p104==1)))) U EG(!(EF((p9==1))))) + (p46==0)) + (p34==1))...156
=> equivalent forward existential formula: ([((FwdU(((FwdU(Init,TRUE) * !((p34==1))) * !((p46==0))),!(EG(!(E(TRUE U (p9==1)))))) * !((!((E(TRUE U (p81==0))...366
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, t19, t20...371
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,7.3633,202824,1,0,419,1.14479e+06,261,236,2764,1.32203e+06,428
FORMULA HealthRecord-PT-12-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 264/264 transitions.
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 65 place count 70 transition count 141
Iterating global reduction 0 with 65 rules applied. Total rules applied 130 place count 70 transition count 141
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 138 place count 62 transition count 125
Iterating global reduction 0 with 8 rules applied. Total rules applied 146 place count 62 transition count 125
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 154 place count 62 transition count 117
Applied a total of 154 rules in 3 ms. Remains 62 /135 variables (removed 73) and now considering 117/264 (removed 147) transitions.
[2024-05-24 03:19:01] [INFO ] Flow matrix only has 114 transitions (discarded 3 similar events)
// Phase 1: matrix 114 rows 62 cols
[2024-05-24 03:19:01] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:19:01] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-24 03:19:01] [INFO ] Flow matrix only has 114 transitions (discarded 3 similar events)
[2024-05-24 03:19:01] [INFO ] Invariant cache hit.
[2024-05-24 03:19:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:19:01] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-05-24 03:19:01] [INFO ] Flow matrix only has 114 transitions (discarded 3 similar events)
[2024-05-24 03:19:01] [INFO ] Invariant cache hit.
[2024-05-24 03:19:01] [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, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-24 03:19:02] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 3 ms to minimize.
[2024-05-24 03:19:02] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 113/175 variables, 62/73 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-24 03:19:03] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:19:03] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:19:03] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 1/176 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/176 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/176 variables, and 77 constraints, problems are : Problem set: 0 solved, 116 unsolved in 2973 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-24 03:19:05] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:19:05] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:19:05] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:19:05] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (OVERLAPS) 113/175 variables, 62/80 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 116/196 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 1/176 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 0/176 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 176/176 variables, and 197 constraints, problems are : Problem set: 0 solved, 116 unsolved in 4029 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 9/9 constraints]
After SMT, in 7038ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 7039ms
Starting structural reductions in LTL mode, iteration 1 : 62/135 places, 117/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7143 ms. Remains : 62/135 places, 117/264 transitions.
[2024-05-24 03:19:08] [INFO ] Flatten gal took : 10 ms
[2024-05-24 03:19:08] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:19:08] [INFO ] Input system was already deterministic with 117 transitions.
[2024-05-24 03:19:08] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:19:08] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:19:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality395524606932960215.gal : 1 ms
[2024-05-24 03:19:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality3288348330917425876.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/CTLCardinality395524606932960215.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3288348330917425876.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AX((AG(E(EG((p15==1)) U ((AX(((p46==0)||(p97==1))) + (p116==0)) + (p52==1)))) * ((p87==0)||(p98==1))))
=> equivalent forward existential formula: ([(FwdU(EY(Init),TRUE) * !(E(EG((p15==1)) U ((!(EX(!(((p46==0)||(p97==1))))) + (p116==0)) + (p52==1)))))] = FALS...206
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...403
(forward)formula 0,1,1.78912,61712,1,0,292,292907,261,125,2706,307369,311
FORMULA HealthRecord-PT-12-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-24 03:19:10] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:19:10] [INFO ] Flatten gal took : 6 ms
Total runtime 235616 ms.

BK_STOP 1716520750876

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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:
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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="CTLCardinality"
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 CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-tall-171640604200785"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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