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.r576-smll-171734920100161.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 MedleyA-PT-21, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920100161
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 70K Jun 2 16:33 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 MedleyA-PT-21-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717389998932

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-21
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-03 04:46:41] [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-06-03 04:46:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 04:46:41] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2024-06-03 04:46:41] [INFO ] Transformed 306 places.
[2024-06-03 04:46:41] [INFO ] Transformed 298 transitions.
[2024-06-03 04:46:41] [INFO ] Found NUPN structural information;
[2024-06-03 04:46:41] [INFO ] Parsed PT model containing 306 places and 298 transitions and 700 arcs in 426 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 31 ms.
FORMULA MedleyA-PT-21-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 79 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 298/298 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 276 transition count 268
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 276 transition count 268
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 78 place count 258 transition count 250
Iterating global reduction 0 with 18 rules applied. Total rules applied 96 place count 258 transition count 250
Applied a total of 96 rules in 137 ms. Remains 258 /306 variables (removed 48) and now considering 250/298 (removed 48) transitions.
// Phase 1: matrix 250 rows 258 cols
[2024-06-03 04:46:42] [INFO ] Computed 20 invariants in 48 ms
[2024-06-03 04:46:42] [INFO ] Implicit Places using invariants in 596 ms returned []
[2024-06-03 04:46:42] [INFO ] Invariant cache hit.
[2024-06-03 04:46:43] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 1170 ms to find 0 implicit places.
Running 249 sub problems to find dead transitions.
[2024-06-03 04:46:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/258 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-06-03 04:46:48] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 18 ms to minimize.
[2024-06-03 04:46:48] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 3 ms to minimize.
[2024-06-03 04:46:48] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 3 ms to minimize.
[2024-06-03 04:46:48] [INFO ] Deduced a trap composed of 7 places in 204 ms of which 5 ms to minimize.
[2024-06-03 04:46:49] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 4 ms to minimize.
[2024-06-03 04:46:49] [INFO ] Deduced a trap composed of 46 places in 120 ms of which 4 ms to minimize.
[2024-06-03 04:46:49] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
[2024-06-03 04:46:49] [INFO ] Deduced a trap composed of 21 places in 162 ms of which 4 ms to minimize.
[2024-06-03 04:46:49] [INFO ] Deduced a trap composed of 53 places in 161 ms of which 3 ms to minimize.
[2024-06-03 04:46:50] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 4 ms to minimize.
[2024-06-03 04:46:50] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 2 ms to minimize.
[2024-06-03 04:46:50] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 2 ms to minimize.
[2024-06-03 04:46:50] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-06-03 04:46:50] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 2 ms to minimize.
[2024-06-03 04:46:50] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 2 ms to minimize.
[2024-06-03 04:46:50] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
[2024-06-03 04:46:51] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-06-03 04:46:51] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
[2024-06-03 04:46:51] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-06-03 04:46:51] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-06-03 04:46:52] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 4 ms to minimize.
[2024-06-03 04:46:52] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 2 ms to minimize.
[2024-06-03 04:46:53] [INFO ] Deduced a trap composed of 52 places in 50 ms of which 1 ms to minimize.
[2024-06-03 04:46:53] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2024-06-03 04:46:53] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-06-03 04:46:53] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 2 ms to minimize.
[2024-06-03 04:46:54] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-06-03 04:46:56] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-06-03 04:46:56] [INFO ] Deduced a trap composed of 43 places in 216 ms of which 5 ms to minimize.
[2024-06-03 04:46:58] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-06-03 04:46:59] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-06-03 04:47:01] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 8 (OVERLAPS) 250/508 variables, 258/310 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/508 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 249 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/508 variables, and 310 constraints, problems are : Problem set: 0 solved, 249 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 249 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/258 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 32/52 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-06-03 04:47:17] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 2 ms to minimize.
[2024-06-03 04:47:17] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-06-03 04:47:19] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 6 ms to minimize.
[2024-06-03 04:47:19] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (OVERLAPS) 250/508 variables, 258/314 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/508 variables, 249/563 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-06-03 04:47:24] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-06-03 04:47:24] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 3 ms to minimize.
[2024-06-03 04:47:25] [INFO ] Deduced a trap composed of 22 places in 176 ms of which 4 ms to minimize.
[2024-06-03 04:47:25] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 5 ms to minimize.
[2024-06-03 04:47:26] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 3 ms to minimize.
[2024-06-03 04:47:26] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 3 ms to minimize.
[2024-06-03 04:47:26] [INFO ] Deduced a trap composed of 49 places in 155 ms of which 4 ms to minimize.
[2024-06-03 04:47:26] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 3 ms to minimize.
[2024-06-03 04:47:27] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 4 ms to minimize.
[2024-06-03 04:47:28] [INFO ] Deduced a trap composed of 47 places in 153 ms of which 4 ms to minimize.
[2024-06-03 04:47:28] [INFO ] Deduced a trap composed of 72 places in 124 ms of which 4 ms to minimize.
[2024-06-03 04:47:29] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 3 ms to minimize.
[2024-06-03 04:47:29] [INFO ] Deduced a trap composed of 94 places in 151 ms of which 3 ms to minimize.
[2024-06-03 04:47:29] [INFO ] Deduced a trap composed of 79 places in 138 ms of which 4 ms to minimize.
[2024-06-03 04:47:30] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 2 ms to minimize.
[2024-06-03 04:47:30] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 3 ms to minimize.
[2024-06-03 04:47:30] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/508 variables, 17/580 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-06-03 04:47:33] [INFO ] Deduced a trap composed of 60 places in 146 ms of which 4 ms to minimize.
[2024-06-03 04:47:33] [INFO ] Deduced a trap composed of 63 places in 154 ms of which 3 ms to minimize.
[2024-06-03 04:47:33] [INFO ] Deduced a trap composed of 58 places in 108 ms of which 2 ms to minimize.
[2024-06-03 04:47:33] [INFO ] Deduced a trap composed of 83 places in 132 ms of which 3 ms to minimize.
[2024-06-03 04:47:34] [INFO ] Deduced a trap composed of 60 places in 119 ms of which 3 ms to minimize.
[2024-06-03 04:47:34] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 3 ms to minimize.
[2024-06-03 04:47:34] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 3 ms to minimize.
[2024-06-03 04:47:34] [INFO ] Deduced a trap composed of 64 places in 107 ms of which 2 ms to minimize.
[2024-06-03 04:47:35] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 2 ms to minimize.
[2024-06-03 04:47:35] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 3 ms to minimize.
[2024-06-03 04:47:35] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 3 ms to minimize.
[2024-06-03 04:47:36] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 2 ms to minimize.
[2024-06-03 04:47:36] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 2 ms to minimize.
[2024-06-03 04:47:37] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 2 ms to minimize.
[2024-06-03 04:47:37] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/508 variables, 15/595 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-06-03 04:47:40] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
[2024-06-03 04:47:40] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 3 ms to minimize.
[2024-06-03 04:47:43] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/508 variables, and 598 constraints, problems are : Problem set: 0 solved, 249 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 71/71 constraints]
After SMT, in 60219ms problems are : Problem set: 0 solved, 249 unsolved
Search for dead transitions found 0 dead transitions in 60256ms
Starting structural reductions in LTL mode, iteration 1 : 258/306 places, 250/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61612 ms. Remains : 258/306 places, 250/298 transitions.
Support contains 79 out of 258 places after structural reductions.
[2024-06-03 04:47:43] [INFO ] Flatten gal took : 63 ms
[2024-06-03 04:47:43] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-21-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-03 04:47:43] [INFO ] Flatten gal took : 30 ms
[2024-06-03 04:47:43] [INFO ] Input system was already deterministic with 250 transitions.
Support contains 68 out of 258 places (down from 79) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2740 ms. (14 steps per ms) remains 9/42 properties
BEST_FIRST walk for 40002 steps (8 resets) in 248 ms. (160 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 161 ms. (246 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 119 ms. (333 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 147 ms. (270 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 110 ms. (360 steps per ms) remains 2/3 properties
[2024-06-03 04:47:45] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 61/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 194/258 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 250/508 variables, 258/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/508 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 508/508 variables, and 278 constraints, problems are : Problem set: 0 solved, 2 unsolved in 258 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 61/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 194/258 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 04:47:45] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-06-03 04:47:45] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
[2024-06-03 04:47:45] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 2 ms to minimize.
[2024-06-03 04:47:45] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2024-06-03 04:47:45] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 250/508 variables, 258/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/508 variables, 2/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/508 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/508 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 508/508 variables, and 285 constraints, problems are : Problem set: 0 solved, 2 unsolved in 771 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 1040ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 338 ms.
Support contains 3 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 250/250 transitions.
Graph (trivial) has 184 edges and 258 vertex of which 6 / 258 are part of one of the 1 SCC in 7 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 253 transition count 184
Reduce places removed 60 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 122 place count 193 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 123 place count 192 transition count 183
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 123 place count 192 transition count 153
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 183 place count 162 transition count 153
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 203 place count 142 transition count 133
Iterating global reduction 3 with 20 rules applied. Total rules applied 223 place count 142 transition count 133
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 223 place count 142 transition count 121
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 247 place count 130 transition count 121
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 319 place count 94 transition count 85
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 325 place count 91 transition count 108
Free-agglomeration rule applied 26 times.
Iterating global reduction 3 with 26 rules applied. Total rules applied 351 place count 91 transition count 82
Reduce places removed 26 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 379 place count 65 transition count 80
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 380 place count 65 transition count 80
Applied a total of 380 rules in 123 ms. Remains 65 /258 variables (removed 193) and now considering 80/250 (removed 170) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 65/258 places, 80/250 transitions.
RANDOM walk for 2420 steps (69 resets) in 83 ms. (28 steps per ms) remains 0/2 properties
[2024-06-03 04:47:46] [INFO ] Flatten gal took : 26 ms
[2024-06-03 04:47:46] [INFO ] Flatten gal took : 26 ms
[2024-06-03 04:47:46] [INFO ] Input system was already deterministic with 250 transitions.
Computed a total of 49 stabilizing places and 49 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 258/258 places, 250/250 transitions.
Graph (trivial) has 183 edges and 258 vertex of which 6 / 258 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 252 transition count 185
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 119 place count 193 transition count 185
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 119 place count 193 transition count 153
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 183 place count 161 transition count 153
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 204 place count 140 transition count 132
Iterating global reduction 2 with 21 rules applied. Total rules applied 225 place count 140 transition count 132
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 225 place count 140 transition count 123
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 243 place count 131 transition count 123
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 297 place count 104 transition count 96
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 299 place count 104 transition count 96
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 300 place count 103 transition count 95
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 47 edges and 102 vertex of which 5 / 102 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 302 place count 99 transition count 95
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 306 place count 98 transition count 92
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 4 with 6 rules applied. Total rules applied 312 place count 95 transition count 89
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 314 place count 95 transition count 87
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 314 place count 95 transition count 86
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 316 place count 94 transition count 86
Applied a total of 316 rules in 58 ms. Remains 94 /258 variables (removed 164) and now considering 86/250 (removed 164) transitions.
// Phase 1: matrix 86 rows 94 cols
[2024-06-03 04:47:46] [INFO ] Computed 18 invariants in 4 ms
[2024-06-03 04:47:46] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-03 04:47:46] [INFO ] Invariant cache hit.
[2024-06-03 04:47:47] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2024-06-03 04:47:47] [INFO ] Redundant transitions in 1 ms returned []
Running 57 sub problems to find dead transitions.
[2024-06-03 04:47:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 13/94 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-06-03 04:47:47] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-06-03 04:47:47] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-06-03 04:47:47] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 85/179 variables, 94/115 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 0/179 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/180 variables, and 115 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1605 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 13/94 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 85/179 variables, 94/115 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 57/172 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (OVERLAPS) 0/179 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/180 variables, and 172 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1440 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 3/3 constraints]
After SMT, in 3059ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 3060ms
Starting structural reductions in SI_CTL mode, iteration 1 : 94/258 places, 86/250 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3342 ms. Remains : 94/258 places, 86/250 transitions.
[2024-06-03 04:47:50] [INFO ] Flatten gal took : 7 ms
[2024-06-03 04:47:50] [INFO ] Flatten gal took : 7 ms
[2024-06-03 04:47:50] [INFO ] Input system was already deterministic with 86 transitions.
[2024-06-03 04:47:50] [INFO ] Flatten gal took : 7 ms
[2024-06-03 04:47:50] [INFO ] Flatten gal took : 7 ms
[2024-06-03 04:47:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality7663866098813729815.gal : 4 ms
[2024-06-03 04:47:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality15590848988561049649.ctl : 3 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/CTLCardinality7663866098813729815.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15590848988561049649.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,9.56413e+10,0.213524,8080,2,785,5,23116,5,0,463,25561,0


Converting to forward existential form...Done !
original formula: A(((p115==0)||(p51==1)) U AF((p203==1)))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!((p203==1)))))))) * !(E(!(!(EG(!((p203==1))))) U (!(((p115==0)||(p51==1))) * !(!(EG(!((p2...179
Reverse transition relation is NOT exact ! Due to transitions t0, t36, t40, t44, t46, t53, Intersection with reachable at each step enabled. (destroyed/re...188
Fast SCC detection found an SCC at level 0
(forward)formula 0,0,19.4278,475124,1,0,334,2.69545e+06,201,231,2717,3.67508e+06,385
FORMULA MedleyA-PT-21-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 258/258 places, 250/250 transitions.
Graph (trivial) has 187 edges and 258 vertex of which 6 / 258 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 252 transition count 184
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 121 place count 192 transition count 184
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 121 place count 192 transition count 152
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 185 place count 160 transition count 152
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 206 place count 139 transition count 131
Iterating global reduction 2 with 21 rules applied. Total rules applied 227 place count 139 transition count 131
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 227 place count 139 transition count 121
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 247 place count 129 transition count 121
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 297 place count 104 transition count 96
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 298 place count 103 transition count 95
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 49 edges and 102 vertex of which 5 / 102 are part of one of the 2 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 300 place count 99 transition count 95
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 304 place count 98 transition count 92
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 4 with 6 rules applied. Total rules applied 310 place count 95 transition count 89
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 312 place count 95 transition count 87
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 312 place count 95 transition count 86
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 314 place count 94 transition count 86
Applied a total of 314 rules in 60 ms. Remains 94 /258 variables (removed 164) and now considering 86/250 (removed 164) transitions.
// Phase 1: matrix 86 rows 94 cols
[2024-06-03 04:48:09] [INFO ] Computed 18 invariants in 2 ms
[2024-06-03 04:48:09] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-03 04:48:09] [INFO ] Invariant cache hit.
[2024-06-03 04:48:10] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2024-06-03 04:48:10] [INFO ] Redundant transitions in 2 ms returned []
Running 65 sub problems to find dead transitions.
[2024-06-03 04:48:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 10/94 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-06-03 04:48:10] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-06-03 04:48:10] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-06-03 04:48:10] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-06-03 04:48:10] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-03 04:48:10] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 85/179 variables, 94/117 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/179 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/180 variables, and 117 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1974 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 10/94 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 85/179 variables, 94/117 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 65/182 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-06-03 04:48:13] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/179 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/179 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/180 variables, and 183 constraints, problems are : Problem set: 0 solved, 65 unsolved in 3199 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 6/6 constraints]
After SMT, in 5196ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 5197ms
Starting structural reductions in SI_CTL mode, iteration 1 : 94/258 places, 86/250 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5522 ms. Remains : 94/258 places, 86/250 transitions.
[2024-06-03 04:48:15] [INFO ] Flatten gal took : 9 ms
[2024-06-03 04:48:15] [INFO ] Flatten gal took : 9 ms
[2024-06-03 04:48:15] [INFO ] Input system was already deterministic with 86 transitions.
[2024-06-03 04:48:15] [INFO ] Flatten gal took : 9 ms
[2024-06-03 04:48:15] [INFO ] Flatten gal took : 9 ms
[2024-06-03 04:48:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality9909619479588118465.gal : 4 ms
[2024-06-03 04:48:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality9346289731196974997.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/CTLCardinality9909619479588118465.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9346289731196974997.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,6.84899e+10,0.227417,8420,2,847,5,23386,5,0,462,27218,0


Converting to forward existential form...Done !
original formula: AF(EG((p23==0)))
=> equivalent forward existential formula: [FwdG(Init,!(EG((p23==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t35, t39, t43, t45, t52, t74, Intersection with reachable at each step enabled. (destroy...193
(forward)formula 0,1,0.602569,14596,1,0,157,66556,197,69,2726,45994,181
FORMULA MedleyA-PT-21-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 258/258 places, 250/250 transitions.
Graph (trivial) has 186 edges and 258 vertex of which 6 / 258 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 252 transition count 184
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 121 place count 192 transition count 184
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 121 place count 192 transition count 153
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 183 place count 161 transition count 153
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 204 place count 140 transition count 132
Iterating global reduction 2 with 21 rules applied. Total rules applied 225 place count 140 transition count 132
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 225 place count 140 transition count 122
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 245 place count 130 transition count 122
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 299 place count 103 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 300 place count 102 transition count 94
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 49 edges and 101 vertex of which 5 / 101 are part of one of the 2 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 302 place count 98 transition count 94
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 306 place count 97 transition count 91
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 4 with 6 rules applied. Total rules applied 312 place count 94 transition count 88
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 314 place count 94 transition count 86
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 314 place count 94 transition count 85
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 316 place count 93 transition count 85
Applied a total of 316 rules in 47 ms. Remains 93 /258 variables (removed 165) and now considering 85/250 (removed 165) transitions.
// Phase 1: matrix 85 rows 93 cols
[2024-06-03 04:48:16] [INFO ] Computed 18 invariants in 1 ms
[2024-06-03 04:48:16] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-03 04:48:16] [INFO ] Invariant cache hit.
[2024-06-03 04:48:16] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2024-06-03 04:48:16] [INFO ] Redundant transitions in 2 ms returned []
Running 57 sub problems to find dead transitions.
[2024-06-03 04:48:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 13/93 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-06-03 04:48:16] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-06-03 04:48:16] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-06-03 04:48:16] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 84/177 variables, 93/114 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 0/177 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/178 variables, and 114 constraints, problems are : Problem set: 0 solved, 57 unsolved in 2170 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 13/93 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 84/177 variables, 93/114 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 57/171 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (OVERLAPS) 0/177 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/178 variables, and 171 constraints, problems are : Problem set: 0 solved, 57 unsolved in 2036 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 3/3 constraints]
After SMT, in 4221ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 4223ms
Starting structural reductions in SI_CTL mode, iteration 1 : 93/258 places, 85/250 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4532 ms. Remains : 93/258 places, 85/250 transitions.
[2024-06-03 04:48:20] [INFO ] Flatten gal took : 9 ms
[2024-06-03 04:48:20] [INFO ] Flatten gal took : 10 ms
[2024-06-03 04:48:20] [INFO ] Input system was already deterministic with 85 transitions.
RANDOM walk for 5791 steps (173 resets) in 55 ms. (103 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-21-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-06-03 04:48:20] [INFO ] Flatten gal took : 12 ms
[2024-06-03 04:48:20] [INFO ] Flatten gal took : 8 ms
[2024-06-03 04:48:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5535460054686403657.gal : 17 ms
[2024-06-03 04:48:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2060678355325611112.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5535460054686403657.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2060678355325611112.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 258/258 places, 250/250 transitions.
Graph (trivial) has 166 edges and 258 vertex of which 6 / 258 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 252 transition count 195
Reduce places removed 49 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 52 rules applied. Total rules applied 102 place count 203 transition count 192
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 105 place count 200 transition count 192
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 105 place count 200 transition count 161
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 167 place count 169 transition count 161
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 186 place count 150 transition count 142
Iterating global reduction 3 with 19 rules applied. Total rules applied 205 place count 150 transition count 142
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 205 place count 150 transition count 134
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 221 place count 142 transition count 134
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 271 place count 117 transition count 109
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 272 place count 117 transition count 109
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 273 place count 116 transition count 108
Applied a total of 273 rules in 54 ms. Remains 116 /258 variables (removed 142) and now considering 108/250 (removed 142) transitions.
// Phase 1: matrix 108 rows 116 cols
[2024-06-03 04:48:20] [INFO ] Computed 20 invariants in 1 ms
[2024-06-03 04:48:20] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-03 04:48:20] [INFO ] Invariant cache hit.
[2024-06-03 04:48:21] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2024-06-03 04:48:21] [INFO ] Redundant transitions in 4 ms returned []
Running 91 sub problems to find dead transitions.
[2024-06-03 04:48:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 10/116 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-03 04:48:22] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-06-03 04:48:22] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-06-03 04:48:22] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-06-03 04:48:22] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-03 04:48:22] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-06-03 04:48:22] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-06-03 04:48:22] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 107/223 variables, 116/143 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/223 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/224 variables, and 143 constraints, problems are : Problem set: 0 solved, 91 unsolved in 3621 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 10/116 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 107/223 variables, 116/143 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 91/234 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/223 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/224 variables, and 234 constraints, problems are : Problem set: 0 solved, 91 unsolved in 4053 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 7/7 constraints]
After SMT, in 7692ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 7694ms
Starting structural reductions in SI_CTL mode, iteration 1 : 116/258 places, 108/250 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8063 ms. Remains : 116/258 places, 108/250 transitions.
[2024-06-03 04:48:28] [INFO ] Flatten gal took : 6 ms
[2024-06-03 04:48:28] [INFO ] Flatten gal took : 7 ms
[2024-06-03 04:48:28] [INFO ] Input system was already deterministic with 108 transitions.
[2024-06-03 04:48:28] [INFO ] Flatten gal took : 6 ms
[2024-06-03 04:48:28] [INFO ] Flatten gal took : 7 ms
[2024-06-03 04:48:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality7732856691593452481.gal : 1 ms
[2024-06-03 04:48:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality6761833964050268721.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/CTLCardinality7732856691593452481.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6761833964050268721.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.58843e+12,0.477954,20256,2,663,5,84550,6,0,572,104663,0


Converting to forward existential form...Done !
original formula: EF((((p207==1) * EG(EF((p159==1)))) * (E(EF(((p75==1)&&((p102==0)||(p210==1)))) U (EF((p196==1)) + ((p280!=1)&&(p257==1)))) * (((p7==0)||...204
=> equivalent forward existential formula: ([(FwdU(FwdU(((FwdU(Init,TRUE) * ((p207==1) * EG(E(TRUE U (p159==1))))) * (((p7==0)||(p98==0))||((p93==1)||((p16...462
Reverse transition relation is NOT exact ! Due to transitions t37, t38, t39, t42, t43, t44, t45, t51, t55, t61, t66, t67, t69, t70, t76, t97, t98, t99, t10...257
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-06-03 04:48:58] [INFO ] Flatten gal took : 7 ms
[2024-06-03 04:48:58] [INFO ] Applying decomposition
[2024-06-03 04:48:58] [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/graph8993384424275808005.txt' '-o' '/tmp/graph8993384424275808005.bin' '-w' '/tmp/graph8993384424275808005.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8993384424275808005.bin' '-l' '-1' '-v' '-w' '/tmp/graph8993384424275808005.weights' '-q' '0' '-e' '0.001'
[2024-06-03 04:48:58] [INFO ] Decomposing Gal with order
[2024-06-03 04:48:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 04:48:59] [INFO ] Removed a total of 13 redundant transitions.
[2024-06-03 04:48:59] [INFO ] Flatten gal took : 54 ms
[2024-06-03 04:48:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-06-03 04:48:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality6691365225232333563.gal : 4 ms
[2024-06-03 04:48:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality1187505515018598278.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/CTLCardinality6691365225232333563.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1187505515018598278.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.58843e+12,0.113107,6852,221,73,7041,566,373,9799,91,1693,0


Converting to forward existential form...Done !
original formula: EF((((i7.u22.p207==1) * EG(EF((i6.u17.p159==1)))) * (E(EF(((i1.u6.p75==1)&&((i3.u12.p102==0)||(i7.u23.p210==1)))) U (EF((i8.i0.u20.p196==...296
=> equivalent forward existential formula: ([(FwdU(FwdU(((FwdU(Init,TRUE) * ((i7.u22.p207==1) * EG(E(TRUE U (i6.u17.p159==1))))) * (((i1.u0.p7==0)||(i3.u11...622
Reverse transition relation is NOT exact ! Due to transitions t37, t39, t42, t43, t44, t45, t55, t61, t97, t98, t99, i1.u1.t67, i2.t38, i2.i1.u27.t102, i3....307
Fast SCC detection found a local SCC at level 1
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
Fast SCC detection found an SCC at level 10
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,1,24.7332,552380,1,0,828320,1791,2294,2.05381e+06,517,11606,1017144
FORMULA MedleyA-PT-21-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 250/250 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 236 transition count 228
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 236 transition count 228
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 56 place count 224 transition count 216
Iterating global reduction 0 with 12 rules applied. Total rules applied 68 place count 224 transition count 216
Applied a total of 68 rules in 10 ms. Remains 224 /258 variables (removed 34) and now considering 216/250 (removed 34) transitions.
// Phase 1: matrix 216 rows 224 cols
[2024-06-03 04:49:23] [INFO ] Computed 20 invariants in 2 ms
[2024-06-03 04:49:24] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-06-03 04:49:24] [INFO ] Invariant cache hit.
[2024-06-03 04:49:24] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-06-03 04:49:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/224 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 04:49:27] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-03 04:49:27] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 3 ms to minimize.
[2024-06-03 04:49:27] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-03 04:49:27] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 4 ms to minimize.
[2024-06-03 04:49:28] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 4 ms to minimize.
[2024-06-03 04:49:28] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 3 ms to minimize.
[2024-06-03 04:49:28] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-06-03 04:49:28] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 3 ms to minimize.
[2024-06-03 04:49:28] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 3 ms to minimize.
[2024-06-03 04:49:28] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 2 ms to minimize.
[2024-06-03 04:49:28] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 4 ms to minimize.
[2024-06-03 04:49:29] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 2 ms to minimize.
[2024-06-03 04:49:29] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 2 ms to minimize.
[2024-06-03 04:49:29] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 2 ms to minimize.
[2024-06-03 04:49:30] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/440 variables, 224/259 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 04:49:35] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 04:49:37] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/440 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 261 constraints, problems are : Problem set: 0 solved, 215 unsolved in 22915 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/224 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 17/37 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/440 variables, 224/261 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 215/476 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 04:49:52] [INFO ] Deduced a trap composed of 57 places in 165 ms of which 3 ms to minimize.
[2024-06-03 04:49:52] [INFO ] Deduced a trap composed of 51 places in 143 ms of which 3 ms to minimize.
[2024-06-03 04:49:52] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 4 ms to minimize.
[2024-06-03 04:49:53] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 4 ms to minimize.
[2024-06-03 04:49:55] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 3 ms to minimize.
[2024-06-03 04:49:55] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 6/482 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 04:50:00] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 04:50:04] [INFO ] Deduced a trap composed of 45 places in 174 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 10 (OVERLAPS) 0/440 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 484 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 25/25 constraints]
After SMT, in 52957ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 52960ms
Starting structural reductions in LTL mode, iteration 1 : 224/258 places, 216/250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53379 ms. Remains : 224/258 places, 216/250 transitions.
[2024-06-03 04:50:17] [INFO ] Flatten gal took : 17 ms
[2024-06-03 04:50:17] [INFO ] Flatten gal took : 15 ms
[2024-06-03 04:50:17] [INFO ] Input system was already deterministic with 216 transitions.
[2024-06-03 04:50:17] [INFO ] Flatten gal took : 14 ms
[2024-06-03 04:50:17] [INFO ] Flatten gal took : 15 ms
[2024-06-03 04:50:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality11554998387645926199.gal : 3 ms
[2024-06-03 04:50:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality8271645120600777332.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/CTLCardinality11554998387645926199.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8271645120600777332.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,2.34207e+17,6.00555,142364,2,18761,5,544965,6,0,1114,869203,0


Converting to forward existential form...Done !
original formula: EF(AX((EG(AG(((p280==0)||(p269==1)))) + ((p235==1)&&(p21==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((EG(!(E(TRUE U !(((p280==0)||(p269==1)))))) + ((p235==1)&&(p21==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t7, t10, t18, t21, t26, t32, t33, t40, t55, t65, t86, t101, t111, t131, t146,...358
Detected timeout of ITS tools.
[2024-06-03 04:50:47] [INFO ] Flatten gal took : 9 ms
[2024-06-03 04:50:47] [INFO ] Applying decomposition
[2024-06-03 04:50:47] [INFO ] Flatten gal took : 11 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/graph1277892516191866150.txt' '-o' '/tmp/graph1277892516191866150.bin' '-w' '/tmp/graph1277892516191866150.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1277892516191866150.bin' '-l' '-1' '-v' '-w' '/tmp/graph1277892516191866150.weights' '-q' '0' '-e' '0.001'
[2024-06-03 04:50:47] [INFO ] Decomposing Gal with order
[2024-06-03 04:50:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 04:50:47] [INFO ] Removed a total of 34 redundant transitions.
[2024-06-03 04:50:47] [INFO ] Flatten gal took : 25 ms
[2024-06-03 04:50:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-06-03 04:50:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality16890862076921992285.gal : 6 ms
[2024-06-03 04:50:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality18173035893836569093.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/CTLCardinality16890862076921992285.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18173035893836569093.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 -...264
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.34207e+17,0.514376,17920,1255,42,31858,361,550,41342,64,982,0


Converting to forward existential form...Done !
original formula: EF(AX((EG(AG(((i13.i1.u84.p280==0)||(i12.i1.u80.p269==1)))) + ((i8.i0.u71.p235==1)&&(i0.i1.u3.p21==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((EG(!(E(TRUE U !(((i13.i1.u84.p280==0)||(i12.i1.u80.p269==1)))))) + ((i8.i0.u71.p235=...193
Reverse transition relation is NOT exact ! Due to transitions t10, t173, t174, t175, t177, t178, t179, t183, t184, t185, t195, t198, t203, t206, t211, t214...516
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 250/250 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 235 transition count 227
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 235 transition count 227
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 60 place count 221 transition count 213
Iterating global reduction 0 with 14 rules applied. Total rules applied 74 place count 221 transition count 213
Applied a total of 74 rules in 13 ms. Remains 221 /258 variables (removed 37) and now considering 213/250 (removed 37) transitions.
// Phase 1: matrix 213 rows 221 cols
[2024-06-03 04:51:17] [INFO ] Computed 20 invariants in 2 ms
[2024-06-03 04:51:17] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-06-03 04:51:17] [INFO ] Invariant cache hit.
[2024-06-03 04:51:18] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2024-06-03 04:51:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-03 04:51:20] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-03 04:51:20] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-03 04:51:21] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-03 04:51:21] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 4 ms to minimize.
[2024-06-03 04:51:21] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 3 ms to minimize.
[2024-06-03 04:51:21] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-06-03 04:51:21] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2024-06-03 04:51:21] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-06-03 04:51:21] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 2 ms to minimize.
[2024-06-03 04:51:22] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 2 ms to minimize.
[2024-06-03 04:51:22] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-03 04:51:23] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 213/434 variables, 221/253 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 0/434 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 253 constraints, problems are : Problem set: 0 solved, 212 unsolved in 15707 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/434 variables, 221/253 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 212/465 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-03 04:51:38] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 4 ms to minimize.
[2024-06-03 04:51:39] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 3 ms to minimize.
[2024-06-03 04:51:40] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
[2024-06-03 04:51:40] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 4/469 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-03 04:51:44] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 3 ms to minimize.
[2024-06-03 04:51:45] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 3 ms to minimize.
[2024-06-03 04:51:45] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 3/472 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-03 04:51:48] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 3 ms to minimize.
[2024-06-03 04:51:48] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 2/474 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (OVERLAPS) 0/434 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 474 constraints, problems are : Problem set: 0 solved, 212 unsolved in 25874 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 21/21 constraints]
After SMT, in 41605ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 41609ms
Starting structural reductions in LTL mode, iteration 1 : 221/258 places, 213/250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41985 ms. Remains : 221/258 places, 213/250 transitions.
[2024-06-03 04:51:59] [INFO ] Flatten gal took : 9 ms
[2024-06-03 04:51:59] [INFO ] Flatten gal took : 7 ms
[2024-06-03 04:51:59] [INFO ] Input system was already deterministic with 213 transitions.
[2024-06-03 04:51:59] [INFO ] Flatten gal took : 11 ms
[2024-06-03 04:51:59] [INFO ] Flatten gal took : 7 ms
[2024-06-03 04:51:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality8374839708372359701.gal : 3 ms
[2024-06-03 04:51:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality15134350364268459433.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/CTLCardinality8374839708372359701.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15134350364268459433.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.38127e+17,2.75258,64120,2,11158,5,255446,6,0,1099,356931,0


Converting to forward existential form...Done !
original formula: (EX(TRUE) * (A((p184!=0) U ((p285==0)||(p106==1))) + AX(AG(EX((p131==1))))))
=> equivalent forward existential formula: ([(Init * !(EX(TRUE)))] = FALSE * [(FwdU(EY((Init * !(!((E(!(((p285==0)||(p106==1))) U (!((p184!=0)) * !(((p285=...246
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t19, t28, t29, t36, t51, t61, t82, t97, t103, t106, t108, t128, t143, t1...355
Detected timeout of ITS tools.
[2024-06-03 04:52:29] [INFO ] Flatten gal took : 9 ms
[2024-06-03 04:52:29] [INFO ] Applying decomposition
[2024-06-03 04:52:29] [INFO ] Flatten gal took : 7 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/graph16330530687725467267.txt' '-o' '/tmp/graph16330530687725467267.bin' '-w' '/tmp/graph16330530687725467267.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16330530687725467267.bin' '-l' '-1' '-v' '-w' '/tmp/graph16330530687725467267.weights' '-q' '0' '-e' '0.001'
[2024-06-03 04:52:29] [INFO ] Decomposing Gal with order
[2024-06-03 04:52:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 04:52:29] [INFO ] Removed a total of 32 redundant transitions.
[2024-06-03 04:52:29] [INFO ] Flatten gal took : 21 ms
[2024-06-03 04:52:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-06-03 04:52:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality15041419480813351120.gal : 6 ms
[2024-06-03 04:52:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality9576464723391934581.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/CTLCardinality15041419480813351120.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9576464723391934581.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,1.38127e+17,0.624823,13988,2055,26,23019,234,537,26526,43,603,0


Converting to forward existential form...Done !
original formula: (EX(TRUE) * (A((i11.u57.p184!=0) U ((i0.i1.u83.p285==0)||(i5.i1.u32.p106==1))) + AX(AG(EX((i8.i2.u38.p131==1))))))
=> equivalent forward existential formula: ([(Init * !(EX(TRUE)))] = FALSE * [(FwdU(EY((Init * !(!((E(!(((i0.i1.u83.p285==0)||(i5.i1.u32.p106==1))) U (!((i...324
Reverse transition relation is NOT exact ! Due to transitions t10, t28, t170, t171, t172, t174, t175, t176, t180, t181, t182, t192, t195, t200, t203, t208,...495
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 250/250 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 234 transition count 226
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 234 transition count 226
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 62 place count 220 transition count 212
Iterating global reduction 0 with 14 rules applied. Total rules applied 76 place count 220 transition count 212
Applied a total of 76 rules in 10 ms. Remains 220 /258 variables (removed 38) and now considering 212/250 (removed 38) transitions.
// Phase 1: matrix 212 rows 220 cols
[2024-06-03 04:52:59] [INFO ] Computed 20 invariants in 2 ms
[2024-06-03 04:53:00] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-03 04:53:00] [INFO ] Invariant cache hit.
[2024-06-03 04:53:00] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2024-06-03 04:53:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-03 04:53:03] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 3 ms to minimize.
[2024-06-03 04:53:03] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 2 ms to minimize.
[2024-06-03 04:53:03] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-03 04:53:03] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 4 ms to minimize.
[2024-06-03 04:53:03] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 3 ms to minimize.
[2024-06-03 04:53:04] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-06-03 04:53:04] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 2 ms to minimize.
[2024-06-03 04:53:04] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 2 ms to minimize.
[2024-06-03 04:53:04] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-06-03 04:53:04] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-06-03 04:53:05] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-03 04:53:06] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-03 04:53:09] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 4 ms to minimize.
[2024-06-03 04:53:09] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 212/432 variables, 220/254 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (OVERLAPS) 0/432 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 254 constraints, problems are : Problem set: 0 solved, 211 unsolved in 20253 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/432 variables, 220/254 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 211/465 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-03 04:53:26] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 4 ms to minimize.
[2024-06-03 04:53:27] [INFO ] Deduced a trap composed of 54 places in 162 ms of which 4 ms to minimize.
[2024-06-03 04:53:28] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 4 ms to minimize.
[2024-06-03 04:53:28] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 2 ms to minimize.
[2024-06-03 04:53:28] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 5/470 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-03 04:53:32] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 4 ms to minimize.
[2024-06-03 04:53:32] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 2/472 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-03 04:53:36] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 4 ms to minimize.
[2024-06-03 04:53:38] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 2/474 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 10 (OVERLAPS) 0/432 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 474 constraints, problems are : Problem set: 0 solved, 211 unsolved in 29897 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 23/23 constraints]
After SMT, in 50171ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 50173ms
Starting structural reductions in LTL mode, iteration 1 : 220/258 places, 212/250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50538 ms. Remains : 220/258 places, 212/250 transitions.
[2024-06-03 04:53:50] [INFO ] Flatten gal took : 7 ms
[2024-06-03 04:53:50] [INFO ] Flatten gal took : 7 ms
[2024-06-03 04:53:50] [INFO ] Input system was already deterministic with 212 transitions.
[2024-06-03 04:53:50] [INFO ] Flatten gal took : 6 ms
[2024-06-03 04:53:50] [INFO ] Flatten gal took : 6 ms
[2024-06-03 04:53:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality13122484380302784315.gal : 2 ms
[2024-06-03 04:53:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality7223471027100480416.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/CTLCardinality13122484380302784315.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7223471027100480416.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.31918e+17,2.28279,54844,2,10280,5,224657,6,0,1094,295065,0


Converting to forward existential form...Done !
original formula: AF(AX((EX(TRUE) * EF(((p247!=0)&&(p28!=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((EX(TRUE) * E(TRUE U ((p247!=0)&&(p28!=1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t19, t28, t29, t36, t51, t61, t82, t97, t107, t127, t142, t152, t169, t1...343
Detected timeout of ITS tools.
[2024-06-03 04:54:20] [INFO ] Flatten gal took : 7 ms
[2024-06-03 04:54:20] [INFO ] Applying decomposition
[2024-06-03 04:54:20] [INFO ] Flatten gal took : 6 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/graph12750488085735177716.txt' '-o' '/tmp/graph12750488085735177716.bin' '-w' '/tmp/graph12750488085735177716.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12750488085735177716.bin' '-l' '-1' '-v' '-w' '/tmp/graph12750488085735177716.weights' '-q' '0' '-e' '0.001'
[2024-06-03 04:54:20] [INFO ] Decomposing Gal with order
[2024-06-03 04:54:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 04:54:20] [INFO ] Removed a total of 32 redundant transitions.
[2024-06-03 04:54:20] [INFO ] Flatten gal took : 18 ms
[2024-06-03 04:54:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-06-03 04:54:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality16372025921378355743.gal : 4 ms
[2024-06-03 04:54:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality11962512080907190202.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/CTLCardinality16372025921378355743.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11962512080907190202.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 -...264
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.31918e+17,0.37255,12028,981,25,19505,303,515,21702,43,747,0


Converting to forward existential form...Done !
original formula: AF(AX((EX(TRUE) * EF(((i13.i1.u68.p247!=0)&&(i2.u10.p28!=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((EX(TRUE) * E(TRUE U ((i13.i1.u68.p247!=0)&&(i2.u10.p28!=1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t169, t170, t171, t173, t174, t175, t179, t180, t181, t191, t194, t199, t202, t207, t210...473
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,1,12.4226,345460,1,0,707685,303,3111,1.16229e+06,213,747,833856
FORMULA MedleyA-PT-21-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 258/258 places, 250/250 transitions.
Graph (trivial) has 175 edges and 258 vertex of which 6 / 258 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 252 transition count 188
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 113 place count 196 transition count 188
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 113 place count 196 transition count 159
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 171 place count 167 transition count 159
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 189 place count 149 transition count 141
Iterating global reduction 2 with 18 rules applied. Total rules applied 207 place count 149 transition count 141
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 207 place count 149 transition count 134
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 221 place count 142 transition count 134
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 279 place count 113 transition count 105
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 280 place count 113 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 281 place count 112 transition count 104
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 48 edges and 111 vertex of which 5 / 111 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 283 place count 108 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 286 place count 108 transition count 101
Applied a total of 286 rules in 33 ms. Remains 108 /258 variables (removed 150) and now considering 101/250 (removed 149) transitions.
[2024-06-03 04:54:33] [INFO ] Flow matrix only has 99 transitions (discarded 2 similar events)
// Phase 1: matrix 99 rows 108 cols
[2024-06-03 04:54:33] [INFO ] Computed 19 invariants in 1 ms
[2024-06-03 04:54:33] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-03 04:54:33] [INFO ] Flow matrix only has 99 transitions (discarded 2 similar events)
[2024-06-03 04:54:33] [INFO ] Invariant cache hit.
[2024-06-03 04:54:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-03 04:54:33] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2024-06-03 04:54:33] [INFO ] Redundant transitions in 3 ms returned []
Running 71 sub problems to find dead transitions.
[2024-06-03 04:54:33] [INFO ] Flow matrix only has 99 transitions (discarded 2 similar events)
[2024-06-03 04:54:33] [INFO ] Invariant cache hit.
[2024-06-03 04:54:33] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 15/108 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-06-03 04:54:34] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 2 ms to minimize.
[2024-06-03 04:54:34] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-06-03 04:54:34] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-03 04:54:34] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-06-03 04:54:34] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (OVERLAPS) 98/206 variables, 108/132 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/206 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/207 variables, and 135 constraints, problems are : Problem set: 0 solved, 71 unsolved in 2916 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 108/108 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 15/108 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (OVERLAPS) 98/206 variables, 108/132 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 71/206 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-06-03 04:54:37] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 0/206 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/207 variables, and 207 constraints, problems are : Problem set: 0 solved, 71 unsolved in 3806 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 108/108 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 6/6 constraints]
After SMT, in 6756ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 6759ms
Starting structural reductions in SI_CTL mode, iteration 1 : 108/258 places, 101/250 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7148 ms. Remains : 108/258 places, 101/250 transitions.
[2024-06-03 04:54:40] [INFO ] Flatten gal took : 8 ms
[2024-06-03 04:54:40] [INFO ] Flatten gal took : 5 ms
[2024-06-03 04:54:40] [INFO ] Input system was already deterministic with 101 transitions.
[2024-06-03 04:54:40] [INFO ] Flatten gal took : 5 ms
[2024-06-03 04:54:40] [INFO ] Flatten gal took : 5 ms
[2024-06-03 04:54:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality12155273902931417096.gal : 2 ms
[2024-06-03 04:54:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality10678515419327465552.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/CTLCardinality12155273902931417096.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10678515419327465552.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,8.73103e+11,1.21086,25020,2,2663,5,108438,6,0,529,116435,0


Converting to forward existential form...Done !
original formula: A(((AG((p169==1)) + E(!(((p29==1)&&(p286==1))) U (p121==1))) + EF(!(E((p108==0) U (p45==0))))) U (p12!=0))
=> equivalent forward existential formula: [((Init * !(EG(!((p12!=0))))) * !(E(!((p12!=0)) U (!(((!(E(TRUE U !((p169==1)))) + E(!(((p29==1)&&(p286==1))) U ...235
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t15, t27, t34, t40, t41, t42, t51, t59, t61, t70, t87, t90, t91, t92, t95, t96, t97, ...254
Detected timeout of ITS tools.
[2024-06-03 04:55:10] [INFO ] Flatten gal took : 5 ms
[2024-06-03 04:55:10] [INFO ] Applying decomposition
[2024-06-03 04:55:10] [INFO ] Flatten gal took : 3 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/graph4584912439347093093.txt' '-o' '/tmp/graph4584912439347093093.bin' '-w' '/tmp/graph4584912439347093093.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4584912439347093093.bin' '-l' '-1' '-v' '-w' '/tmp/graph4584912439347093093.weights' '-q' '0' '-e' '0.001'
[2024-06-03 04:55:10] [INFO ] Decomposing Gal with order
[2024-06-03 04:55:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 04:55:10] [INFO ] Removed a total of 12 redundant transitions.
[2024-06-03 04:55:10] [INFO ] Flatten gal took : 8 ms
[2024-06-03 04:55:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-06-03 04:55:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality14425273235883793151.gal : 4 ms
[2024-06-03 04:55:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality2798061399225078072.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/CTLCardinality14425273235883793151.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2798061399225078072.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,8.73103e+11,0.144709,7288,306,76,8634,410,308,11883,80,1319,0


Converting to forward existential form...Done !
original formula: A(((AG((i5.u17.p169==1)) + E(!(((i2.i0.u2.p29==1)&&(i7.i0.u26.p286==1))) U (i3.u12.p121==1))) + EF(!(E((i3.u9.p108==0) U (i1.u4.p45==0)))...175
=> equivalent forward existential formula: [((Init * !(EG(!((i0.u0.p12!=0))))) * !(E(!((i0.u0.p12!=0)) U (!(((!(E(TRUE U !((i5.u17.p169==1)))) + E(!(((i2.i...298
Reverse transition relation is NOT exact ! Due to transitions t40, t41, t42, t87, t90, t91, t92, t95, t97, i0.u1.t61, i1.u4.t34, i2.t59, i3.t27, i4.u8.t0, ...307
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,0,21.9735,600832,1,0,1.11667e+06,2575,1587,1.90921e+06,423,22700,1104938
FORMULA MedleyA-PT-21-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 258/258 places, 250/250 transitions.
Graph (trivial) has 184 edges and 258 vertex of which 6 / 258 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 252 transition count 186
Reduce places removed 58 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 59 rules applied. Total rules applied 118 place count 194 transition count 185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 119 place count 193 transition count 185
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 119 place count 193 transition count 153
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 183 place count 161 transition count 153
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 202 place count 142 transition count 134
Iterating global reduction 3 with 19 rules applied. Total rules applied 221 place count 142 transition count 134
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 221 place count 142 transition count 125
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 239 place count 133 transition count 125
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 295 place count 105 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 296 place count 104 transition count 96
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 49 edges and 103 vertex of which 5 / 103 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 298 place count 100 transition count 96
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 302 place count 99 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 5 with 6 rules applied. Total rules applied 308 place count 96 transition count 90
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 310 place count 96 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 310 place count 96 transition count 87
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 312 place count 95 transition count 87
Applied a total of 312 rules in 29 ms. Remains 95 /258 variables (removed 163) and now considering 87/250 (removed 163) transitions.
// Phase 1: matrix 87 rows 95 cols
[2024-06-03 04:55:32] [INFO ] Computed 18 invariants in 1 ms
[2024-06-03 04:55:32] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-03 04:55:32] [INFO ] Invariant cache hit.
[2024-06-03 04:55:32] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2024-06-03 04:55:32] [INFO ] Redundant transitions in 2 ms returned []
Running 60 sub problems to find dead transitions.
[2024-06-03 04:55:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 13/95 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-03 04:55:33] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-06-03 04:55:33] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-06-03 04:55:33] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 86/181 variables, 95/116 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/181 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/182 variables, and 116 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2371 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 13/95 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 86/181 variables, 95/116 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 60/176 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/181 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/182 variables, and 176 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2244 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 3/3 constraints]
After SMT, in 4627ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4628ms
Starting structural reductions in SI_CTL mode, iteration 1 : 95/258 places, 87/250 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4927 ms. Remains : 95/258 places, 87/250 transitions.
[2024-06-03 04:55:37] [INFO ] Flatten gal took : 7 ms
[2024-06-03 04:55:37] [INFO ] Flatten gal took : 10 ms
[2024-06-03 04:55:37] [INFO ] Input system was already deterministic with 87 transitions.
[2024-06-03 04:55:37] [INFO ] Flatten gal took : 5 ms
[2024-06-03 04:55:37] [INFO ] Flatten gal took : 4 ms
[2024-06-03 04:55:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality2710617231120985113.gal : 2 ms
[2024-06-03 04:55:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality11836120879529659686.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/CTLCardinality2710617231120985113.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11836120879529659686.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,9.55058e+10,0.23189,8184,2,846,5,22625,5,0,467,25416,0


Converting to forward existential form...Done !
original formula: (EG((p92==0)) + EF(EG((p249==1))))
=> equivalent forward existential formula: ([FwdG(Init,(p92==0))] != FALSE + [FwdG(FwdU(Init,TRUE),(p249==1))] != FALSE)
Hit Full ! (commute/partial/dont) 84/0/3
(forward)formula 0,1,0.655035,14520,1,0,7,61900,18,2,2259,37633,8
FORMULA MedleyA-PT-21-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 250/250 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 239 transition count 231
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 239 transition count 231
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 48 place count 229 transition count 221
Iterating global reduction 0 with 10 rules applied. Total rules applied 58 place count 229 transition count 221
Applied a total of 58 rules in 15 ms. Remains 229 /258 variables (removed 29) and now considering 221/250 (removed 29) transitions.
// Phase 1: matrix 221 rows 229 cols
[2024-06-03 04:55:38] [INFO ] Computed 20 invariants in 4 ms
[2024-06-03 04:55:38] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-03 04:55:38] [INFO ] Invariant cache hit.
[2024-06-03 04:55:38] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-06-03 04:55:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-03 04:55:41] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-03 04:55:41] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-06-03 04:55:41] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-06-03 04:55:42] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 2 ms to minimize.
[2024-06-03 04:55:42] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2024-06-03 04:55:42] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-06-03 04:55:42] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 6 ms to minimize.
[2024-06-03 04:55:42] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 2 ms to minimize.
[2024-06-03 04:55:42] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-06-03 04:55:42] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-03 04:55:43] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 2 ms to minimize.
[2024-06-03 04:55:43] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-03 04:55:44] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 3 ms to minimize.
[2024-06-03 04:55:44] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 2 ms to minimize.
[2024-06-03 04:55:44] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 2 ms to minimize.
[2024-06-03 04:55:45] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 221/450 variables, 229/265 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-03 04:55:51] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/450 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 0/450 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 266 constraints, problems are : Problem set: 0 solved, 220 unsolved in 21641 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 17/37 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 221/450 variables, 229/266 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 220/486 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-03 04:56:04] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 2 ms to minimize.
[2024-06-03 04:56:05] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 4 ms to minimize.
[2024-06-03 04:56:05] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 3 ms to minimize.
[2024-06-03 04:56:06] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 2 ms to minimize.
[2024-06-03 04:56:06] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 3 ms to minimize.
[2024-06-03 04:56:07] [INFO ] Deduced a trap composed of 71 places in 159 ms of which 4 ms to minimize.
[2024-06-03 04:56:07] [INFO ] Deduced a trap composed of 71 places in 150 ms of which 4 ms to minimize.
[2024-06-03 04:56:07] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 8/494 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-03 04:56:10] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2024-06-03 04:56:10] [INFO ] Deduced a trap composed of 46 places in 170 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/450 variables, 2/496 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-03 04:56:17] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 2 ms to minimize.
[2024-06-03 04:56:17] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/450 variables, 2/498 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-03 04:56:20] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/450 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/450 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 499 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 30/30 constraints]
After SMT, in 51679ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 51682ms
Starting structural reductions in LTL mode, iteration 1 : 229/258 places, 221/250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52039 ms. Remains : 229/258 places, 221/250 transitions.
[2024-06-03 04:56:30] [INFO ] Flatten gal took : 7 ms
[2024-06-03 04:56:30] [INFO ] Flatten gal took : 7 ms
[2024-06-03 04:56:30] [INFO ] Input system was already deterministic with 221 transitions.
[2024-06-03 04:56:30] [INFO ] Flatten gal took : 6 ms
[2024-06-03 04:56:30] [INFO ] Flatten gal took : 6 ms
[2024-06-03 04:56:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality15443780288962281769.gal : 2 ms
[2024-06-03 04:56:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality8082235093733597826.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/CTLCardinality15443780288962281769.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8082235093733597826.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,2.52671e+17,7.10708,156524,2,22208,5,573952,6,0,1139,952052,0


Converting to forward existential form...Done !
original formula: EF((EX((p78==1)) * ((((p22==0) + !(A((((p91==0)||(p282==1))&&(p274==1)) U (p27==1)))) + (AG(((p217==0)&&(p128==1))) + EG((p154==1)))) + (...190
=> equivalent forward existential formula: ((([((FwdU(Init,TRUE) * EX((p78==1))) * (p22==0))] != FALSE + ([(FwdU((FwdU(Init,TRUE) * EX((p78==1))),!((p27==1...530
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t7, t10, t17, t18, t21, t30, t31, t38, t53, t58, t64, t65, t86, t101, t111, t...392
Detected timeout of ITS tools.
[2024-06-03 04:57:00] [INFO ] Flatten gal took : 5 ms
[2024-06-03 04:57:00] [INFO ] Applying decomposition
[2024-06-03 04:57:00] [INFO ] Flatten gal took : 7 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/graph16840183532356464408.txt' '-o' '/tmp/graph16840183532356464408.bin' '-w' '/tmp/graph16840183532356464408.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16840183532356464408.bin' '-l' '-1' '-v' '-w' '/tmp/graph16840183532356464408.weights' '-q' '0' '-e' '0.001'
[2024-06-03 04:57:00] [INFO ] Decomposing Gal with order
[2024-06-03 04:57:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 04:57:00] [INFO ] Removed a total of 27 redundant transitions.
[2024-06-03 04:57:00] [INFO ] Flatten gal took : 25 ms
[2024-06-03 04:57:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-06-03 04:57:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality7464237815237016781.gal : 5 ms
[2024-06-03 04:57:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality11328792790828705829.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/CTLCardinality7464237815237016781.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11328792790828705829.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.52671e+17,0.621545,20304,2442,39,37334,318,578,48219,65,824,0


Converting to forward existential form...Done !
original formula: EF((EX((i4.i1.u24.p78==1)) * ((((i0.u5.p22==0) + !(A((((i5.u29.p91==0)||(i14.u84.p282==1))&&(i13.u79.p274==1)) U (i2.i0.u8.p27==1)))) + (...279
=> equivalent forward existential formula: ((([((FwdU(Init,TRUE) * EX((i4.i1.u24.p78==1))) * (i0.u5.p22==0))] != FALSE + ([(FwdU((FwdU(Init,TRUE) * EX((i4....687
Reverse transition relation is NOT exact ! Due to transitions t10, t30, t178, t179, t180, t182, t183, t184, t188, t189, t190, t200, t203, t208, t219, i0.u4...593
(forward)formula 0,1,2.85875,90264,1,0,225995,331,2486,231041,256,824,435520
FORMULA MedleyA-PT-21-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 258/258 places, 250/250 transitions.
Graph (trivial) has 180 edges and 258 vertex of which 6 / 258 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 252 transition count 188
Reduce places removed 56 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 57 rules applied. Total rules applied 114 place count 196 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 195 transition count 187
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 115 place count 195 transition count 156
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 177 place count 164 transition count 156
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 196 place count 145 transition count 137
Iterating global reduction 3 with 19 rules applied. Total rules applied 215 place count 145 transition count 137
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 215 place count 145 transition count 128
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 233 place count 136 transition count 128
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 289 place count 108 transition count 100
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 290 place count 108 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 291 place count 107 transition count 99
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 48 edges and 106 vertex of which 5 / 106 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 293 place count 103 transition count 99
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 297 place count 102 transition count 96
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 5 with 6 rules applied. Total rules applied 303 place count 99 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 305 place count 99 transition count 91
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 305 place count 99 transition count 90
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 307 place count 98 transition count 90
Applied a total of 307 rules in 35 ms. Remains 98 /258 variables (removed 160) and now considering 90/250 (removed 160) transitions.
// Phase 1: matrix 90 rows 98 cols
[2024-06-03 04:57:03] [INFO ] Computed 18 invariants in 2 ms
[2024-06-03 04:57:03] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-03 04:57:03] [INFO ] Invariant cache hit.
[2024-06-03 04:57:03] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2024-06-03 04:57:03] [INFO ] Redundant transitions in 2 ms returned []
Running 63 sub problems to find dead transitions.
[2024-06-03 04:57:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 13/98 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-06-03 04:57:04] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-06-03 04:57:04] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-06-03 04:57:04] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 89/187 variables, 98/119 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/187 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/188 variables, and 119 constraints, problems are : Problem set: 0 solved, 63 unsolved in 2680 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 13/98 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 89/187 variables, 98/119 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 63/182 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/187 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/188 variables, and 182 constraints, problems are : Problem set: 0 solved, 63 unsolved in 2398 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 3/3 constraints]
After SMT, in 5086ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 5087ms
Starting structural reductions in SI_CTL mode, iteration 1 : 98/258 places, 90/250 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5437 ms. Remains : 98/258 places, 90/250 transitions.
[2024-06-03 04:57:08] [INFO ] Flatten gal took : 7 ms
[2024-06-03 04:57:08] [INFO ] Flatten gal took : 5 ms
[2024-06-03 04:57:08] [INFO ] Input system was already deterministic with 90 transitions.
[2024-06-03 04:57:08] [INFO ] Flatten gal took : 3 ms
[2024-06-03 04:57:08] [INFO ] Flatten gal took : 4 ms
[2024-06-03 04:57:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality3554374248512712021.gal : 2 ms
[2024-06-03 04:57:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality8370342627177343133.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/CTLCardinality3554374248512712021.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8370342627177343133.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.40657e+11,0.245093,8476,2,987,5,22920,5,0,481,26398,0


Converting to forward existential form...Done !
original formula: AF(!(A(((p156==0)||(p211==1)) U EG(((p250==0)||(p99==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!(EG(((p250==0)||(p99==1)))) U (!(((p156==0)||(p211==1))) * !(EG(((p250==0)||(p99==1)))))) +...202
Reverse transition relation is NOT exact ! Due to transitions t0, t19, t41, t45, t47, t48, t54, t78, Intersection with reachable at each step enabled. (de...198
Fast SCC detection found an SCC at level 0
(forward)formula 0,0,13.7688,387100,1,0,590,2.18784e+06,212,450,2809,3.00954e+06,620
FORMULA MedleyA-PT-21-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 250/250 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 236 transition count 228
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 236 transition count 228
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 56 place count 224 transition count 216
Iterating global reduction 0 with 12 rules applied. Total rules applied 68 place count 224 transition count 216
Applied a total of 68 rules in 7 ms. Remains 224 /258 variables (removed 34) and now considering 216/250 (removed 34) transitions.
// Phase 1: matrix 216 rows 224 cols
[2024-06-03 04:57:22] [INFO ] Computed 20 invariants in 1 ms
[2024-06-03 04:57:22] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-03 04:57:22] [INFO ] Invariant cache hit.
[2024-06-03 04:57:22] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-06-03 04:57:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/224 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 04:57:26] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
[2024-06-03 04:57:26] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-03 04:57:26] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-03 04:57:26] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 4 ms to minimize.
[2024-06-03 04:57:26] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 3 ms to minimize.
[2024-06-03 04:57:26] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 2 ms to minimize.
[2024-06-03 04:57:26] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 2 ms to minimize.
[2024-06-03 04:57:26] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 2 ms to minimize.
[2024-06-03 04:57:26] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-03 04:57:27] [INFO ] Deduced a trap composed of 18 places in 188 ms of which 4 ms to minimize.
[2024-06-03 04:57:27] [INFO ] Deduced a trap composed of 45 places in 176 ms of which 4 ms to minimize.
[2024-06-03 04:57:27] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 2 ms to minimize.
[2024-06-03 04:57:27] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 2 ms to minimize.
[2024-06-03 04:57:28] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 04:57:29] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 4 ms to minimize.
[2024-06-03 04:57:29] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 2 ms to minimize.
[2024-06-03 04:57:30] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/440 variables, 224/261 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 04:57:35] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/440 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 262 constraints, problems are : Problem set: 0 solved, 215 unsolved in 21091 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/224 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 04:57:46] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/440 variables, 224/263 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 215/478 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 04:57:51] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
[2024-06-03 04:57:51] [INFO ] Deduced a trap composed of 45 places in 161 ms of which 4 ms to minimize.
[2024-06-03 04:57:51] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 3 ms to minimize.
[2024-06-03 04:57:52] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 4/482 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 04:57:55] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 4 ms to minimize.
[2024-06-03 04:57:57] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 3 ms to minimize.
[2024-06-03 04:57:57] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 3/485 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 04:58:01] [INFO ] Deduced a trap composed of 54 places in 169 ms of which 3 ms to minimize.
[2024-06-03 04:58:02] [INFO ] Deduced a trap composed of 45 places in 161 ms of which 4 ms to minimize.
[2024-06-03 04:58:02] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 3/488 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-03 04:58:09] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/440 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/440 variables, and 489 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 30/30 constraints]
After SMT, in 51127ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 51130ms
Starting structural reductions in LTL mode, iteration 1 : 224/258 places, 216/250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51455 ms. Remains : 224/258 places, 216/250 transitions.
[2024-06-03 04:58:14] [INFO ] Flatten gal took : 8 ms
[2024-06-03 04:58:14] [INFO ] Flatten gal took : 8 ms
[2024-06-03 04:58:14] [INFO ] Input system was already deterministic with 216 transitions.
[2024-06-03 04:58:14] [INFO ] Flatten gal took : 8 ms
[2024-06-03 04:58:14] [INFO ] Flatten gal took : 8 ms
[2024-06-03 04:58:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality14522948109942360991.gal : 3 ms
[2024-06-03 04:58:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality6778641317879146447.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/CTLCardinality14522948109942360991.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6778641317879146447.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,2.04942e+17,4.13591,94268,2,19019,5,377704,6,0,1114,533871,0


Converting to forward existential form...Done !
original formula: AX(E((p294==0) U !(AX(AF((p290==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E((p294==0) U !(!(EX(!(!(EG(!((p290==1)))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t12, t15, t17, t23, t32, t33, t40, t55, t65, t86, t101, t111, t131, t146...359
(forward)formula 0,1,27.4275,590856,1,0,396,2.95465e+06,459,199,6047,3.36518e+06,463
FORMULA MedleyA-PT-21-CTLCardinality-2024-12 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 : 258/258 places, 250/250 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 238 transition count 230
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 238 transition count 230
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 52 place count 226 transition count 218
Iterating global reduction 0 with 12 rules applied. Total rules applied 64 place count 226 transition count 218
Applied a total of 64 rules in 9 ms. Remains 226 /258 variables (removed 32) and now considering 218/250 (removed 32) transitions.
// Phase 1: matrix 218 rows 226 cols
[2024-06-03 04:58:41] [INFO ] Computed 20 invariants in 2 ms
[2024-06-03 04:58:41] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-03 04:58:41] [INFO ] Invariant cache hit.
[2024-06-03 04:58:42] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-03 04:58:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-03 04:58:44] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-06-03 04:58:44] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-03 04:58:44] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-03 04:58:45] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 3 ms to minimize.
[2024-06-03 04:58:45] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 4 ms to minimize.
[2024-06-03 04:58:45] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 3 ms to minimize.
[2024-06-03 04:58:45] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
[2024-06-03 04:58:45] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 2 ms to minimize.
[2024-06-03 04:58:45] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 2 ms to minimize.
[2024-06-03 04:58:45] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 2 ms to minimize.
[2024-06-03 04:58:46] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 2 ms to minimize.
[2024-06-03 04:58:46] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 2 ms to minimize.
[2024-06-03 04:58:46] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-03 04:58:47] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-03 04:58:49] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-03 04:58:51] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 218/444 variables, 226/262 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-03 04:58:54] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-03 04:58:56] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/444 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 264 constraints, problems are : Problem set: 0 solved, 217 unsolved in 19786 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-03 04:59:03] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-03 04:59:05] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-03 04:59:06] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 218/444 variables, 226/267 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 217/484 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-03 04:59:08] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 3 ms to minimize.
[2024-06-03 04:59:09] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 2 ms to minimize.
[2024-06-03 04:59:09] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 2 ms to minimize.
[2024-06-03 04:59:10] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-03 04:59:13] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 2 ms to minimize.
[2024-06-03 04:59:14] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
[2024-06-03 04:59:14] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 3/491 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-03 04:59:17] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/444 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-03 04:59:30] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 3 ms to minimize.
[2024-06-03 04:59:30] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 3 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/444 variables, 2/494 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/444 variables, and 494 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 31/31 constraints]
After SMT, in 49820ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 49822ms
Starting structural reductions in LTL mode, iteration 1 : 226/258 places, 218/250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50188 ms. Remains : 226/258 places, 218/250 transitions.
[2024-06-03 04:59:32] [INFO ] Flatten gal took : 8 ms
[2024-06-03 04:59:32] [INFO ] Flatten gal took : 7 ms
[2024-06-03 04:59:32] [INFO ] Input system was already deterministic with 218 transitions.
[2024-06-03 04:59:32] [INFO ] Flatten gal took : 10 ms
[2024-06-03 04:59:32] [INFO ] Flatten gal took : 7 ms
[2024-06-03 04:59:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality8949626820125277121.gal : 15 ms
[2024-06-03 04:59:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality2025883862937098227.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/CTLCardinality8949626820125277121.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2025883862937098227.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.05618e+17,5.19908,126944,2,21390,5,486196,6,0,1124,765926,0


Converting to forward existential form...Done !
original formula: (AF(((!(E(((p174==0)||(p81==1)) U ((p13==0)||(p42==1)))) + !(A((p278!=0) U ((p8==0)||(p291==1))))) + AF((((p74==1)&&((p227==0)||(p119==1)...230
=> equivalent forward existential formula: ([FwdG(Init,!(((!(E(((p174==0)||(p81==1)) U ((p13==0)||(p42==1)))) + !(!((E(!(((p8==0)||(p291==1))) U (!((p278!=...461
Hit Full ! (commute/partial/dont) 213/5/5
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t11, t13, t20, t29, t30, t37, t47, t51, t54, t64, t74, t79, t86, t101, t...374
Detected timeout of ITS tools.
[2024-06-03 05:00:02] [INFO ] Flatten gal took : 5 ms
[2024-06-03 05:00:02] [INFO ] Applying decomposition
[2024-06-03 05:00:02] [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/graph14205475859993267493.txt' '-o' '/tmp/graph14205475859993267493.bin' '-w' '/tmp/graph14205475859993267493.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14205475859993267493.bin' '-l' '-1' '-v' '-w' '/tmp/graph14205475859993267493.weights' '-q' '0' '-e' '0.001'
[2024-06-03 05:00:02] [INFO ] Decomposing Gal with order
[2024-06-03 05:00:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 05:00:02] [INFO ] Removed a total of 34 redundant transitions.
[2024-06-03 05:00:02] [INFO ] Flatten gal took : 12 ms
[2024-06-03 05:00:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-06-03 05:00:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality9419950685089923302.gal : 5 ms
[2024-06-03 05:00:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality2710381424971975499.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/CTLCardinality9419950685089923302.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2710381424971975499.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.05618e+17,1.0753,29248,2999,43,56063,290,550,76645,57,740,0


Converting to forward existential form...Done !
original formula: (AF(((!(E(((i10.u56.p174==0)||(i4.i1.u26.p81==1)) U ((i0.u5.p13==0)||(i2.u13.p42==1)))) + !(A((i13.i1.u0.p278!=0) U ((i0.u3.p8==0)||(i3.i...357
=> equivalent forward existential formula: ([FwdG(Init,!(((!(E(((i10.u56.p174==0)||(i4.i1.u26.p81==1)) U ((i0.u5.p13==0)||(i2.u13.p42==1)))) + !(!((E(!(((i...662
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 250/250 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 235 transition count 227
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 235 transition count 227
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 59 place count 222 transition count 214
Iterating global reduction 0 with 13 rules applied. Total rules applied 72 place count 222 transition count 214
Applied a total of 72 rules in 7 ms. Remains 222 /258 variables (removed 36) and now considering 214/250 (removed 36) transitions.
// Phase 1: matrix 214 rows 222 cols
[2024-06-03 05:00:32] [INFO ] Computed 20 invariants in 4 ms
[2024-06-03 05:00:32] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-06-03 05:00:32] [INFO ] Invariant cache hit.
[2024-06-03 05:00:32] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2024-06-03 05:00:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:00:35] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 2 ms to minimize.
[2024-06-03 05:00:35] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-06-03 05:00:35] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-06-03 05:00:35] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 2 ms to minimize.
[2024-06-03 05:00:35] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 2 ms to minimize.
[2024-06-03 05:00:35] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-06-03 05:00:35] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-06-03 05:00:36] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-06-03 05:00:36] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-06-03 05:00:36] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 1 ms to minimize.
[2024-06-03 05:00:36] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-06-03 05:00:36] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:00:37] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:00:40] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:00:40] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 214/436 variables, 222/257 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (OVERLAPS) 0/436 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 257 constraints, problems are : Problem set: 0 solved, 213 unsolved in 17262 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/436 variables, 222/257 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 213/470 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:00:54] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-06-03 05:00:55] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 3 ms to minimize.
[2024-06-03 05:00:56] [INFO ] Deduced a trap composed of 45 places in 145 ms of which 3 ms to minimize.
[2024-06-03 05:00:56] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 4/474 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:01:00] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 2 ms to minimize.
[2024-06-03 05:01:01] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2024-06-03 05:01:02] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 3/477 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:01:05] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-03 05:01:11] [INFO ] Deduced a trap composed of 49 places in 144 ms of which 3 ms to minimize.
[2024-06-03 05:01:11] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 2/480 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/436 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 436/436 variables, and 480 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 25/25 constraints]
After SMT, in 47305ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 47312ms
Starting structural reductions in LTL mode, iteration 1 : 222/258 places, 214/250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47690 ms. Remains : 222/258 places, 214/250 transitions.
[2024-06-03 05:01:19] [INFO ] Flatten gal took : 5 ms
[2024-06-03 05:01:19] [INFO ] Flatten gal took : 5 ms
[2024-06-03 05:01:19] [INFO ] Input system was already deterministic with 214 transitions.
[2024-06-03 05:01:19] [INFO ] Flatten gal took : 7 ms
[2024-06-03 05:01:20] [INFO ] Flatten gal took : 5 ms
[2024-06-03 05:01:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality17937595350398860601.gal : 1 ms
[2024-06-03 05:01:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality7018652885487314158.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/CTLCardinality17937595350398860601.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7018652885487314158.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.49229e+17,2.30567,62892,2,10830,5,256571,6,0,1104,347086,0


Converting to forward existential form...Done !
original formula: EG(AG(AF((EG((p112==1)) * AX(((p155==0)&&(p23==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(!(EG(!((EG((p112==1)) * !(EX(!(((p155==0)&&(p23==1)))))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t19, t28, t29, t36, t51, t61, t82, t97, t107, t114, t118, t129, t144, t1...349
(forward)formula 0,0,18.3886,421212,1,0,390,2.08292e+06,458,196,6282,2.35336e+06,459
FORMULA MedleyA-PT-21-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-06-03 05:01:38] [INFO ] Flatten gal took : 5 ms
[2024-06-03 05:01:38] [INFO ] Flatten gal took : 5 ms
[2024-06-03 05:01:38] [INFO ] Applying decomposition
[2024-06-03 05:01:38] [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/graph18138084298267317192.txt' '-o' '/tmp/graph18138084298267317192.bin' '-w' '/tmp/graph18138084298267317192.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18138084298267317192.bin' '-l' '-1' '-v' '-w' '/tmp/graph18138084298267317192.weights' '-q' '0' '-e' '0.001'
[2024-06-03 05:01:38] [INFO ] Decomposing Gal with order
[2024-06-03 05:01:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 05:01:38] [INFO ] Removed a total of 27 redundant transitions.
[2024-06-03 05:01:38] [INFO ] Flatten gal took : 14 ms
[2024-06-03 05:01:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-06-03 05:01:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality12849098039936963237.gal : 4 ms
[2024-06-03 05:01:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality13193570285539054389.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/CTLCardinality12849098039936963237.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13193570285539054389.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 -...264
No direction supplied, using forward translation only.
Parsed 3 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.12811e+18,16.2958,332668,9402,39,578172,356,628,1.17996e+06,59,991,0


Converting to forward existential form...Done !
original formula: EF(AX((EG(AG(((i15.u96.p280==0)||(i14.i0.u92.p269==1)))) + ((i9.u82.p235==1)&&(i3.u6.p21==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((EG(!(E(TRUE U !(((i15.u96.p280==0)||(i14.i0.u92.p269==1)))))) + ((i9.u82.p235==1)&&(...184
Reverse transition relation is NOT exact ! Due to transitions t207, t208, t209, t211, t212, t213, t218, t219, t230, t232, t237, t240, t246, t248, i0.i0.t39...866
Detected timeout of ITS tools.
[2024-06-03 05:26:38] [INFO ] Applying decomposition
[2024-06-03 05:26:38] [INFO ] Flatten gal took : 10 ms
[2024-06-03 05:26:38] [INFO ] Decomposing Gal with order
[2024-06-03 05:26:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 05:26:38] [INFO ] Removed a total of 8 redundant transitions.
[2024-06-03 05:26:38] [INFO ] Flatten gal took : 11 ms
[2024-06-03 05:26:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 8 ms.
[2024-06-03 05:26:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality8033828560475009825.gal : 3 ms
[2024-06-03 05:26:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality14328776158932540922.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/CTLCardinality8033828560475009825.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14328776158932540922.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 3 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.12811e+18,92.1903,1618528,9862,2207,1.65112e+06,14324,457,1.43923e+07,246,224572,0


Converting to forward existential form...Done !
original formula: EF(AX((EG(AG(((i0.i1.u36.p280==0)||(i0.i0.u34.p269==1)))) + ((i0.i0.i0.i0.i1.i1.u32.p235==1)&&(i0.i0.i0.i0.i0.i0.i0.u9.p21==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((EG(!(E(TRUE U !(((i0.i1.u36.p280==0)||(i0.i0.u34.p269==1)))))) + ((i0.i0.i0.i0.i1.i1...218
Reverse transition relation is NOT exact ! Due to transitions t207, t213, u38.t6, u38.t7, i0.t219, i0.i0.u34.t27, i0.i0.u34.t32, i0.i0.u34.t35, i0.i0.i0.t3...1677

BK_TIME_CONFINEMENT_REACHED

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="MedleyA-PT-21"
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 MedleyA-PT-21, 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 r576-smll-171734920100161"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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