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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K 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 90K 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-08-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717356844829

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-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-02 19:34:07] [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-02 19:34:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:34:07] [INFO ] Load time of PNML (sax parser for PT used): 188 ms
[2024-06-02 19:34:07] [INFO ] Transformed 147 places.
[2024-06-02 19:34:07] [INFO ] Transformed 312 transitions.
[2024-06-02 19:34:07] [INFO ] Found NUPN structural information;
[2024-06-02 19:34:07] [INFO ] Parsed PT model containing 147 places and 312 transitions and 1378 arcs in 430 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 31 ms.
Support contains 84 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 312/312 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 135 transition count 298
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 135 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 134 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 134 transition count 297
Applied a total of 26 rules in 53 ms. Remains 134 /147 variables (removed 13) and now considering 297/312 (removed 15) transitions.
// Phase 1: matrix 297 rows 134 cols
[2024-06-02 19:34:08] [INFO ] Computed 11 invariants in 36 ms
[2024-06-02 19:34:08] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-06-02 19:34:08] [INFO ] Invariant cache hit.
[2024-06-02 19:34:08] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 710 ms to find 0 implicit places.
Running 296 sub problems to find dead transitions.
[2024-06-02 19:34:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Problem TDEAD152 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD259 is UNSAT
At refinement iteration 2 (OVERLAPS) 3/134 variables, 6/11 constraints. Problems are: Problem set: 48 solved, 248 unsolved
[2024-06-02 19:34:13] [INFO ] Deduced a trap composed of 33 places in 296 ms of which 35 ms to minimize.
[2024-06-02 19:34:13] [INFO ] Deduced a trap composed of 36 places in 192 ms of which 4 ms to minimize.
[2024-06-02 19:34:14] [INFO ] Deduced a trap composed of 46 places in 146 ms of which 3 ms to minimize.
[2024-06-02 19:34:14] [INFO ] Deduced a trap composed of 54 places in 119 ms of which 2 ms to minimize.
[2024-06-02 19:34:14] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 3 ms to minimize.
[2024-06-02 19:34:14] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 2 ms to minimize.
[2024-06-02 19:34:14] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 3 ms to minimize.
[2024-06-02 19:34:15] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 3 ms to minimize.
[2024-06-02 19:34:15] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 2 ms to minimize.
[2024-06-02 19:34:15] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
[2024-06-02 19:34:15] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-06-02 19:34:15] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 2 ms to minimize.
[2024-06-02 19:34:15] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 13/24 constraints. Problems are: Problem set: 48 solved, 248 unsolved
[2024-06-02 19:34:18] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 2 ms to minimize.
[2024-06-02 19:34:18] [INFO ] Deduced a trap composed of 27 places in 172 ms of which 3 ms to minimize.
[2024-06-02 19:34:19] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 2 ms to minimize.
[2024-06-02 19:34:19] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 4/28 constraints. Problems are: Problem set: 48 solved, 248 unsolved
[2024-06-02 19:34:20] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 1/29 constraints. Problems are: Problem set: 48 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/29 constraints. Problems are: Problem set: 48 solved, 248 unsolved
At refinement iteration 7 (OVERLAPS) 297/431 variables, 134/163 constraints. Problems are: Problem set: 48 solved, 248 unsolved
[2024-06-02 19:34:27] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 1/164 constraints. Problems are: Problem set: 48 solved, 248 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 0/164 constraints. Problems are: Problem set: 48 solved, 248 unsolved
[2024-06-02 19:34:34] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/431 variables, 1/165 constraints. Problems are: Problem set: 48 solved, 248 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 0/165 constraints. Problems are: Problem set: 48 solved, 248 unsolved
[2024-06-02 19:34:39] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 431/431 variables, and 166 constraints, problems are : Problem set: 48 solved, 248 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 48 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 5/5 constraints. Problems are: Problem set: 48 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/5 constraints. Problems are: Problem set: 48 solved, 248 unsolved
At refinement iteration 2 (OVERLAPS) 3/134 variables, 6/11 constraints. Problems are: Problem set: 48 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 21/32 constraints. Problems are: Problem set: 48 solved, 248 unsolved
[2024-06-02 19:34:41] [INFO ] Deduced a trap composed of 61 places in 141 ms of which 3 ms to minimize.
[2024-06-02 19:34:42] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:34:42] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 3/35 constraints. Problems are: Problem set: 48 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/35 constraints. Problems are: Problem set: 48 solved, 248 unsolved
At refinement iteration 6 (OVERLAPS) 297/431 variables, 134/169 constraints. Problems are: Problem set: 48 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/431 variables, 248/417 constraints. Problems are: Problem set: 48 solved, 248 unsolved
[2024-06-02 19:34:47] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 2 ms to minimize.
[2024-06-02 19:34:48] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 3 ms to minimize.
[2024-06-02 19:34:48] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2024-06-02 19:34:49] [INFO ] Deduced a trap composed of 51 places in 181 ms of which 3 ms to minimize.
[2024-06-02 19:34:50] [INFO ] Deduced a trap composed of 31 places in 175 ms of which 2 ms to minimize.
[2024-06-02 19:34:50] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 8 ms to minimize.
[2024-06-02 19:34:50] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 3 ms to minimize.
[2024-06-02 19:34:50] [INFO ] Deduced a trap composed of 36 places in 137 ms of which 2 ms to minimize.
[2024-06-02 19:34:50] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 9/426 constraints. Problems are: Problem set: 48 solved, 248 unsolved
[2024-06-02 19:34:57] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
[2024-06-02 19:34:57] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
[2024-06-02 19:34:58] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 3/429 constraints. Problems are: Problem set: 48 solved, 248 unsolved
[2024-06-02 19:35:06] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 2 ms to minimize.
[2024-06-02 19:35:06] [INFO ] Deduced a trap composed of 55 places in 177 ms of which 3 ms to minimize.
[2024-06-02 19:35:06] [INFO ] Deduced a trap composed of 50 places in 184 ms of which 2 ms to minimize.
[2024-06-02 19:35:06] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 4 ms to minimize.
[2024-06-02 19:35:06] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 2 ms to minimize.
[2024-06-02 19:35:08] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 2 ms to minimize.
[2024-06-02 19:35:09] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 2 ms to minimize.
[2024-06-02 19:35:09] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 431/431 variables, and 437 constraints, problems are : Problem set: 48 solved, 248 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 248/296 constraints, Known Traps: 44/44 constraints]
After SMT, in 60947ms problems are : Problem set: 48 solved, 248 unsolved
Search for dead transitions found 48 dead transitions in 60989ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in LTL mode, iteration 1 : 134/147 places, 249/312 transitions.
Applied a total of 0 rules in 6 ms. Remains 134 /134 variables (removed 0) and now considering 249/249 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61804 ms. Remains : 134/147 places, 249/312 transitions.
Support contains 84 out of 134 places after structural reductions.
[2024-06-02 19:35:10] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-02 19:35:10] [INFO ] Flatten gal took : 110 ms
FORMULA MedleyA-PT-08-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-08-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 19:35:10] [INFO ] Flatten gal took : 48 ms
[2024-06-02 19:35:10] [INFO ] Input system was already deterministic with 249 transitions.
Support contains 79 out of 134 places (down from 84) after GAL structural reductions.
RANDOM walk for 40000 steps (1969 resets) in 3294 ms. (12 steps per ms) remains 22/58 properties
BEST_FIRST walk for 4002 steps (51 resets) in 35 ms. (111 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (61 resets) in 27 ms. (142 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (49 resets) in 50 ms. (78 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4003 steps (54 resets) in 56 ms. (70 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (53 resets) in 52 ms. (75 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (47 resets) in 33 ms. (117 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (51 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (52 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (47 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (58 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (52 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (54 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (49 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (50 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (60 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (53 resets) in 29 ms. (133 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (50 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (52 resets) in 32 ms. (121 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (56 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (52 resets) in 32 ms. (121 steps per ms) remains 19/21 properties
BEST_FIRST walk for 4004 steps (50 resets) in 34 ms. (114 steps per ms) remains 19/19 properties
// Phase 1: matrix 249 rows 134 cols
[2024-06-02 19:35:11] [INFO ] Computed 11 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 64/99 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 35/134 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 249/383 variables, 134/145 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 19:35:12] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/383 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 19:35:13] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 0/383 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 147 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1785 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 64/99 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 19:35:13] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:35:13] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 2 ms to minimize.
[2024-06-02 19:35:13] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 35/134 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 19:35:14] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 2 ms to minimize.
[2024-06-02 19:35:14] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
[2024-06-02 19:35:14] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 2 ms to minimize.
[2024-06-02 19:35:14] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 1 ms to minimize.
[2024-06-02 19:35:14] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 3 ms to minimize.
[2024-06-02 19:35:14] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 2 ms to minimize.
[2024-06-02 19:35:14] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
[2024-06-02 19:35:14] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 13 ms to minimize.
[2024-06-02 19:35:15] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
[2024-06-02 19:35:15] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 1 ms to minimize.
[2024-06-02 19:35:15] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 2 ms to minimize.
[2024-06-02 19:35:15] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 12/28 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 19:35:15] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
[2024-06-02 19:35:15] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 2 ms to minimize.
[2024-06-02 19:35:15] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 4 ms to minimize.
[2024-06-02 19:35:15] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 2 ms to minimize.
[2024-06-02 19:35:15] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 2 ms to minimize.
[2024-06-02 19:35:16] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2024-06-02 19:35:16] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 2 ms to minimize.
[2024-06-02 19:35:16] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 3 ms to minimize.
[2024-06-02 19:35:16] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 3 ms to minimize.
[2024-06-02 19:35:16] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 2 ms to minimize.
[2024-06-02 19:35:16] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 2 ms to minimize.
[2024-06-02 19:35:16] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 2 ms to minimize.
[2024-06-02 19:35:17] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-06-02 19:35:17] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2024-06-02 19:35:17] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 2 ms to minimize.
[2024-06-02 19:35:17] [INFO ] Deduced a trap composed of 57 places in 140 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 16/44 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 19:35:17] [INFO ] Deduced a trap composed of 49 places in 145 ms of which 2 ms to minimize.
[2024-06-02 19:35:17] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 2 ms to minimize.
[2024-06-02 19:35:17] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 1 ms to minimize.
[2024-06-02 19:35:17] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:35:18] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 2 ms to minimize.
[2024-06-02 19:35:18] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:35:18] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 19:35:18] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 1 ms to minimize.
[2024-06-02 19:35:18] [INFO ] Deduced a trap composed of 44 places in 139 ms of which 3 ms to minimize.
[2024-06-02 19:35:18] [INFO ] Deduced a trap composed of 50 places in 113 ms of which 2 ms to minimize.
[2024-06-02 19:35:18] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 2 ms to minimize.
SMT process timed out in 6918ms, After SMT, problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 249/249 transitions.
Graph (complete) has 456 edges and 134 vertex of which 127 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.7 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 127 transition count 228
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 31 place count 118 transition count 225
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 33 place count 116 transition count 225
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 33 place count 116 transition count 223
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 37 place count 114 transition count 223
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 46 place count 105 transition count 210
Iterating global reduction 3 with 9 rules applied. Total rules applied 55 place count 105 transition count 210
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 104 transition count 206
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 104 transition count 206
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 103 transition count 202
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 103 transition count 202
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 103 transition count 201
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 62 place count 102 transition count 200
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 84 place count 91 transition count 189
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 86 place count 91 transition count 187
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 87 place count 90 transition count 186
Iterating global reduction 6 with 1 rules applied. Total rules applied 88 place count 90 transition count 186
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 94 place count 87 transition count 200
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 104 place count 87 transition count 190
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 109 place count 87 transition count 185
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 114 place count 82 transition count 185
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 115 place count 82 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 116 place count 81 transition count 188
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 117 place count 81 transition count 188
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 118 place count 80 transition count 187
Applied a total of 118 rules in 198 ms. Remains 80 /134 variables (removed 54) and now considering 187/249 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 80/134 places, 187/249 transitions.
RANDOM walk for 40000 steps (2713 resets) in 826 ms. (48 steps per ms) remains 7/19 properties
BEST_FIRST walk for 40003 steps (722 resets) in 173 ms. (229 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40003 steps (692 resets) in 107 ms. (370 steps per ms) remains 2/5 properties
BEST_FIRST walk for 39789 steps (711 resets) in 94 ms. (418 steps per ms) remains 0/2 properties
[2024-06-02 19:35:19] [INFO ] Flatten gal took : 31 ms
[2024-06-02 19:35:19] [INFO ] Flatten gal took : 38 ms
[2024-06-02 19:35:19] [INFO ] Input system was already deterministic with 249 transitions.
Computed a total of 11 stabilizing places and 13 stable transitions
Graph (complete) has 456 edges and 134 vertex of which 127 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.7 ms
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 249/249 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 132 transition count 249
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 29 place count 105 transition count 217
Iterating global reduction 1 with 27 rules applied. Total rules applied 56 place count 105 transition count 217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 59 place count 105 transition count 214
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 65 place count 99 transition count 198
Iterating global reduction 2 with 6 rules applied. Total rules applied 71 place count 99 transition count 198
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 73 place count 97 transition count 193
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 97 transition count 193
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 96 transition count 190
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 96 transition count 190
Applied a total of 77 rules in 22 ms. Remains 96 /134 variables (removed 38) and now considering 190/249 (removed 59) transitions.
// Phase 1: matrix 190 rows 96 cols
[2024-06-02 19:35:19] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:35:19] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 19:35:19] [INFO ] Invariant cache hit.
[2024-06-02 19:35:19] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2024-06-02 19:35:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-06-02 19:35:22] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
[2024-06-02 19:35:22] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-06-02 19:35:22] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 2 ms to minimize.
[2024-06-02 19:35:22] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:35:22] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2024-06-02 19:35:22] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 190/286 variables, 96/112 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (OVERLAPS) 0/286 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 112 constraints, problems are : Problem set: 0 solved, 189 unsolved in 8418 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 190/286 variables, 96/112 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 189/301 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-06-02 19:35:32] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-02 19:35:32] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-06-02 19:35:36] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 10 (OVERLAPS) 0/286 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/286 variables, and 304 constraints, problems are : Problem set: 0 solved, 189 unsolved in 16273 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 9/9 constraints]
After SMT, in 24943ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 24948ms
Starting structural reductions in LTL mode, iteration 1 : 96/134 places, 190/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25329 ms. Remains : 96/134 places, 190/249 transitions.
[2024-06-02 19:35:44] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:35:44] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:35:44] [INFO ] Input system was already deterministic with 190 transitions.
[2024-06-02 19:35:44] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:35:44] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:35:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality5664140705086985472.gal : 7 ms
[2024-06-02 19:35:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality552382861948550314.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/CTLCardinality5664140705086985472.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality552382861948550314.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AX(AG((((p57==0)||(p126==1)) * (((p27==0) + AF((p104==0))) + (AF(((p101==0)||(p98==1))) * ((p39==0) + EF(((p96==0)||(p4==1)))))))))
=> equivalent forward existential formula: ([(FwdU(EY(Init),TRUE) * !(((p57==0)||(p126==1))))] = FALSE * ([FwdG((FwdU(EY(Init),TRUE) * !(((p27==0) + !(EG(!...333
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t20, t21, t26, t27, t29, t30, t31, t32...526
(forward)formula 0,0,19.4337,448332,1,0,787,2.62289e+06,423,292,5116,2.05372e+06,889
FORMULA MedleyA-PT-08-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 249/249 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 132 transition count 249
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 28 place count 106 transition count 217
Iterating global reduction 1 with 26 rules applied. Total rules applied 54 place count 106 transition count 217
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 58 place count 106 transition count 213
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 64 place count 100 transition count 193
Iterating global reduction 2 with 6 rules applied. Total rules applied 70 place count 100 transition count 193
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 74 place count 96 transition count 183
Iterating global reduction 2 with 4 rules applied. Total rules applied 78 place count 96 transition count 183
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 80 place count 94 transition count 177
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 94 transition count 177
Applied a total of 82 rules in 14 ms. Remains 94 /134 variables (removed 40) and now considering 177/249 (removed 72) transitions.
// Phase 1: matrix 177 rows 94 cols
[2024-06-02 19:36:04] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:36:04] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 19:36:04] [INFO ] Invariant cache hit.
[2024-06-02 19:36:04] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-06-02 19:36:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-02 19:36:06] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:36:06] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2024-06-02 19:36:07] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:36:07] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-06-02 19:36:07] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:36:07] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:36:07] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (OVERLAPS) 177/271 variables, 94/111 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/271 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 111 constraints, problems are : Problem set: 0 solved, 176 unsolved in 7441 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (OVERLAPS) 177/271 variables, 94/111 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 176/287 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-02 19:36:16] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 9 (OVERLAPS) 0/271 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 288 constraints, problems are : Problem set: 0 solved, 176 unsolved in 12350 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 8/8 constraints]
After SMT, in 19983ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 19987ms
Starting structural reductions in LTL mode, iteration 1 : 94/134 places, 177/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20230 ms. Remains : 94/134 places, 177/249 transitions.
[2024-06-02 19:36:24] [INFO ] Flatten gal took : 20 ms
[2024-06-02 19:36:24] [INFO ] Flatten gal took : 21 ms
[2024-06-02 19:36:24] [INFO ] Input system was already deterministic with 177 transitions.
[2024-06-02 19:36:24] [INFO ] Flatten gal took : 19 ms
[2024-06-02 19:36:24] [INFO ] Flatten gal took : 20 ms
[2024-06-02 19:36:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality3499715078809252601.gal : 5 ms
[2024-06-02 19:36:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality13628666686927149286.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3499715078809252601.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13628666686927149286.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,5.57527e+06,1.6482,40484,2,7290,5,113713,6,0,553,173689,0


Converting to forward existential form...Done !
original formula: !(A(EG(E(E(((p124==0)||(p69==1)) U ((p70==0)||(p136==1))) U ((p84==1) + EG((p15==1))))) U EX(!(((p86==0)||(p17==1))))))
=> equivalent forward existential formula: ([((FwdU(Init,!(EX(!(((p86==0)||(p17==1)))))) * !(EG(E(E(((p124==0)||(p69==1)) U ((p70==0)||(p136==1))) U ((p84=...278
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t20, t21, t26, t27, t28, t29, t30, t33...433
Detected timeout of ITS tools.
[2024-06-02 19:36:55] [INFO ] Flatten gal took : 22 ms
[2024-06-02 19:36:55] [INFO ] Applying decomposition
[2024-06-02 19:36:55] [INFO ] Flatten gal took : 9 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/graph9652518008175706350.txt' '-o' '/tmp/graph9652518008175706350.bin' '-w' '/tmp/graph9652518008175706350.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9652518008175706350.bin' '-l' '-1' '-v' '-w' '/tmp/graph9652518008175706350.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:36:55] [INFO ] Decomposing Gal with order
[2024-06-02 19:36:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:36:55] [INFO ] Removed a total of 298 redundant transitions.
[2024-06-02 19:36:55] [INFO ] Flatten gal took : 84 ms
[2024-06-02 19:36:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 21 ms.
[2024-06-02 19:36:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality2394641488473825983.gal : 9 ms
[2024-06-02 19:36:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality7481190460305349143.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/CTLCardinality2394641488473825983.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7481190460305349143.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,5.57527e+06,0.490242,12696,505,102,16313,700,376,36973,96,3473,0


Converting to forward existential form...Done !
original formula: !(A(EG(E(E(((i7.u20.p124==0)||(i4.u13.p69==1)) U ((i4.u13.p70==0)||(i7.u24.p136==1))) U ((i0.u11.p84==1) + EG((i1.u2.p15==1))))) U EX(!((...191
=> equivalent forward existential formula: ([((FwdU(Init,!(EX(!(((i4.u14.p86==0)||(i3.u3.p17==1)))))) * !(EG(E(E(((i7.u20.p124==0)||(i4.u13.p69==1)) U ((i4...358
Reverse transition relation is NOT exact ! Due to transitions t28, t59, t87, t91, i1.u4.t80, i2.t74, i2.t70, i2.t69, i2.u5.t76, i2.u5.t77, i2.u8.t57, i2.u8...692
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
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 an SCC at level 6
Fast SCC detection found an SCC at level 7
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
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
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,14.0421,348572,1,0,566240,4049,2260,1.36893e+06,501,32078,744254
FORMULA MedleyA-PT-08-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 134/134 places, 249/249 transitions.
Graph (complete) has 456 edges and 134 vertex of which 127 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 126 transition count 229
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 35 place count 110 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 109 transition count 227
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 36 place count 109 transition count 225
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 40 place count 107 transition count 225
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 62 place count 85 transition count 196
Iterating global reduction 3 with 22 rules applied. Total rules applied 84 place count 85 transition count 196
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 84 place count 85 transition count 195
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 84 transition count 195
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 93 place count 77 transition count 174
Iterating global reduction 3 with 7 rules applied. Total rules applied 100 place count 77 transition count 174
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 104 place count 73 transition count 162
Iterating global reduction 3 with 4 rules applied. Total rules applied 108 place count 73 transition count 162
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 110 place count 73 transition count 160
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 114 place count 71 transition count 158
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 116 place count 69 transition count 152
Iterating global reduction 5 with 2 rules applied. Total rules applied 118 place count 69 transition count 152
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 140 place count 57 transition count 142
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 142 place count 55 transition count 140
Iterating global reduction 5 with 2 rules applied. Total rules applied 144 place count 55 transition count 140
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 149 place count 55 transition count 135
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 149 place count 55 transition count 132
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 155 place count 52 transition count 132
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 159 place count 50 transition count 130
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 160 place count 49 transition count 129
Applied a total of 160 rules in 55 ms. Remains 49 /134 variables (removed 85) and now considering 129/249 (removed 120) transitions.
// Phase 1: matrix 129 rows 49 cols
[2024-06-02 19:37:09] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 19:37:09] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 19:37:09] [INFO ] Invariant cache hit.
[2024-06-02 19:37:09] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-02 19:37:09] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2024-06-02 19:37:09] [INFO ] Redundant transitions in 18 ms returned []
Running 121 sub problems to find dead transitions.
[2024-06-02 19:37:09] [INFO ] Invariant cache hit.
[2024-06-02 19:37:09] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 2/48 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 128/176 variables, 48/54 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 12/66 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 2/178 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (OVERLAPS) 0/178 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 67 constraints, problems are : Problem set: 0 solved, 121 unsolved in 3850 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 49/49 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 2/48 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 128/176 variables, 48/54 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 12/66 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 118/184 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 2/178 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 3/188 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 0/178 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 188 constraints, problems are : Problem set: 0 solved, 121 unsolved in 5525 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 49/49 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
After SMT, in 9453ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 9455ms
Starting structural reductions in SI_CTL mode, iteration 1 : 49/134 places, 129/249 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9681 ms. Remains : 49/134 places, 129/249 transitions.
[2024-06-02 19:37:19] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:37:19] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:37:19] [INFO ] Input system was already deterministic with 129 transitions.
[2024-06-02 19:37:19] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:37:19] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:37:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality16652402599650591958.gal : 3 ms
[2024-06-02 19:37:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality2084633823119106920.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/CTLCardinality16652402599650591958.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2084633823119106920.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,425745,0.234639,8588,2,599,5,18969,6,0,314,23591,0


Converting to forward existential form...Done !
original formula: !(A(A((p145==1) U E(((p31==0)||(p30==1)) U (p82==0))) U AG(!(EG((p128==0))))))
=> equivalent forward existential formula: ([FwdG(FwdU((FwdU(Init,!(!(E(TRUE U !(!(EG((p128==0)))))))) * !(!((E(!(E(((p31==0)||(p30==1)) U (p82==0))) U (!(...343
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t9, t10, t14, t21, t23, t24, t35, t36, t115, t117, t119, Int...251
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 127/0/2
(forward)formula 0,1,11.6822,296884,1,0,602,1.70922e+06,306,266,3196,1.61238e+06,755
FORMULA MedleyA-PT-08-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 249/249 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 133 transition count 249
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 32 place count 102 transition count 211
Iterating global reduction 1 with 31 rules applied. Total rules applied 63 place count 102 transition count 211
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 67 place count 102 transition count 207
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 73 place count 96 transition count 187
Iterating global reduction 2 with 6 rules applied. Total rules applied 79 place count 96 transition count 187
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 83 place count 92 transition count 177
Iterating global reduction 2 with 4 rules applied. Total rules applied 87 place count 92 transition count 177
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 91 transition count 174
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 91 transition count 174
Applied a total of 89 rules in 8 ms. Remains 91 /134 variables (removed 43) and now considering 174/249 (removed 75) transitions.
// Phase 1: matrix 174 rows 91 cols
[2024-06-02 19:37:31] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:37:31] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 19:37:31] [INFO ] Invariant cache hit.
[2024-06-02 19:37:31] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2024-06-02 19:37:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-06-02 19:37:33] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 4 ms to minimize.
[2024-06-02 19:37:33] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 174/264 variables, 90/102 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 1/265 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 9 (OVERLAPS) 0/265 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 103 constraints, problems are : Problem set: 0 solved, 173 unsolved in 10566 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 174/264 variables, 90/102 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 172/274 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-06-02 19:37:45] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-06-02 19:37:48] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 10 (OVERLAPS) 1/265 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 13 (OVERLAPS) 0/265 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 278 constraints, problems are : Problem set: 0 solved, 173 unsolved in 19214 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 4/4 constraints]
After SMT, in 29880ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 29884ms
Starting structural reductions in LTL mode, iteration 1 : 91/134 places, 174/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30090 ms. Remains : 91/134 places, 174/249 transitions.
[2024-06-02 19:38:01] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:38:01] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:38:01] [INFO ] Input system was already deterministic with 174 transitions.
[2024-06-02 19:38:01] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:38:01] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:38:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality2011130269618458713.gal : 3 ms
[2024-06-02 19:38:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality4374149504073457691.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/CTLCardinality2011130269618458713.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4374149504073457691.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,5.27178e+06,1.50945,43484,2,6837,5,126257,6,0,536,173799,0


Converting to forward existential form...Done !
original formula: (AF(((p67!=0) * (AX((p50==1)) + (p123!=1)))) * AX(AX(EF(((p125==0)||(p34==1))))))
=> equivalent forward existential formula: ([FwdG(Init,!(((p67!=0) * (!(EX(!((p50==1)))) + (p123!=1)))))] = FALSE * [(EY(EY(Init)) * !(E(TRUE U ((p125==0)|...178
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t31, t32, t34, t3...424
Detected timeout of ITS tools.
[2024-06-02 19:38:31] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:38:31] [INFO ] Applying decomposition
[2024-06-02 19:38:31] [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/graph15488494117734324177.txt' '-o' '/tmp/graph15488494117734324177.bin' '-w' '/tmp/graph15488494117734324177.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15488494117734324177.bin' '-l' '-1' '-v' '-w' '/tmp/graph15488494117734324177.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:38:31] [INFO ] Decomposing Gal with order
[2024-06-02 19:38:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:38:31] [INFO ] Removed a total of 307 redundant transitions.
[2024-06-02 19:38:31] [INFO ] Flatten gal took : 38 ms
[2024-06-02 19:38:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 10 ms.
[2024-06-02 19:38:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality8627726887119789981.gal : 5 ms
[2024-06-02 19:38:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality3291859851053111677.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/CTLCardinality8627726887119789981.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3291859851053111677.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,5.27178e+06,0.485787,13276,403,127,16993,977,361,37877,89,7999,0


Converting to forward existential form...Done !
original formula: (AF(((i6.u12.p67!=0) * (AX((i3.u9.p50==1)) + (i6.u19.p123!=1)))) * AX(AX(EF(((i7.i0.u23.p125==0)||(i2.u7.p34==1))))))
=> equivalent forward existential formula: ([FwdG(Init,!(((i6.u12.p67!=0) * (!(EX(!((i3.u9.p50==1)))) + (i6.u19.p123!=1)))))] = FALSE * [(EY(EY(Init)) * !(...214
Reverse transition relation is NOT exact ! Due to transitions t26, t55, t84, t88, i1.u4.t79, i2.t73, i2.t69, i2.t68, i2.u5.t53, i2.u5.t77, i2.u5.t78, i2.u6...699
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
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,5.92622,167452,1,0,298373,3844,2162,632295,458,34568,422380
FORMULA MedleyA-PT-08-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 249/249 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 132 transition count 249
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 33 place count 101 transition count 211
Iterating global reduction 1 with 31 rules applied. Total rules applied 64 place count 101 transition count 211
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 68 place count 101 transition count 207
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 75 place count 94 transition count 186
Iterating global reduction 2 with 7 rules applied. Total rules applied 82 place count 94 transition count 186
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 86 place count 90 transition count 176
Iterating global reduction 2 with 4 rules applied. Total rules applied 90 place count 90 transition count 176
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 92 place count 88 transition count 170
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 88 transition count 170
Applied a total of 94 rules in 9 ms. Remains 88 /134 variables (removed 46) and now considering 170/249 (removed 79) transitions.
// Phase 1: matrix 170 rows 88 cols
[2024-06-02 19:38:37] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:38:37] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 19:38:37] [INFO ] Invariant cache hit.
[2024-06-02 19:38:37] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2024-06-02 19:38:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-06-02 19:38:38] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:38:38] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/258 variables, 88/100 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (OVERLAPS) 0/258 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 100 constraints, problems are : Problem set: 0 solved, 169 unsolved in 6696 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/258 variables, 88/100 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 169/269 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-06-02 19:38:50] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/258 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 10 (OVERLAPS) 0/258 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 270 constraints, problems are : Problem set: 0 solved, 169 unsolved in 12790 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 3/3 constraints]
After SMT, in 19608ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 19611ms
Starting structural reductions in LTL mode, iteration 1 : 88/134 places, 170/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19896 ms. Remains : 88/134 places, 170/249 transitions.
[2024-06-02 19:38:57] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:38:57] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:38:57] [INFO ] Input system was already deterministic with 170 transitions.
[2024-06-02 19:38:57] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:38:57] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:38:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality12831879643494423668.gal : 2 ms
[2024-06-02 19:38:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality10859816918941055537.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/CTLCardinality12831879643494423668.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10859816918941055537.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,4.57361e+06,1.03112,28416,2,4483,5,79444,6,0,522,113826,0


Converting to forward existential form...Done !
original formula: EG(((p76==1) + EX(((p32==0)||(p130==1)))))
=> equivalent forward existential formula: [FwdG(Init,((p76==1) + EX(((p32==0)||(p130==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t31, t32, t34, t3...405
Detected timeout of ITS tools.
[2024-06-02 19:39:27] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:39:27] [INFO ] Applying decomposition
[2024-06-02 19:39:27] [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/graph16718761112614682169.txt' '-o' '/tmp/graph16718761112614682169.bin' '-w' '/tmp/graph16718761112614682169.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16718761112614682169.bin' '-l' '-1' '-v' '-w' '/tmp/graph16718761112614682169.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:39:27] [INFO ] Decomposing Gal with order
[2024-06-02 19:39:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:39:27] [INFO ] Removed a total of 310 redundant transitions.
[2024-06-02 19:39:27] [INFO ] Flatten gal took : 19 ms
[2024-06-02 19:39:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 5 ms.
[2024-06-02 19:39:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality7594074096115752069.gal : 3 ms
[2024-06-02 19:39:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality866377398564240223.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/CTLCardinality7594074096115752069.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality866377398564240223.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 -...261
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,4.57361e+06,0.262551,10844,339,38,13572,409,307,30313,64,1093,0


Converting to forward existential form...Done !
original formula: EG(((i4.u12.p76==1) + EX(((i2.u7.p32==0)||(i7.u23.p130==1)))))
=> equivalent forward existential formula: [FwdG(Init,((i4.u12.p76==1) + EX(((i2.u7.p32==0)||(i7.u23.p130==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t26, t55, t80, t84, i1.u4.t76, i2.t70, i2.t66, i2.t65, i2.u5.t53, i2.u5.t74, i2.u5.t75, i2.u6...616
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,5.79969,159740,1,0,285826,725,1647,596267,282,2902,454512
FORMULA MedleyA-PT-08-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 134/134 places, 249/249 transitions.
Graph (complete) has 456 edges and 134 vertex of which 127 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 126 transition count 227
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 39 place count 108 transition count 225
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 39 place count 108 transition count 224
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 107 transition count 224
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 62 place count 86 transition count 196
Iterating global reduction 2 with 21 rules applied. Total rules applied 83 place count 86 transition count 196
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 83 place count 86 transition count 194
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 87 place count 84 transition count 194
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 93 place count 78 transition count 174
Iterating global reduction 2 with 6 rules applied. Total rules applied 99 place count 78 transition count 174
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 103 place count 74 transition count 162
Iterating global reduction 2 with 4 rules applied. Total rules applied 107 place count 74 transition count 162
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 109 place count 74 transition count 160
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 113 place count 72 transition count 158
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 115 place count 70 transition count 152
Iterating global reduction 4 with 2 rules applied. Total rules applied 117 place count 70 transition count 152
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 137 place count 60 transition count 142
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 139 place count 58 transition count 140
Iterating global reduction 4 with 2 rules applied. Total rules applied 141 place count 58 transition count 140
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 146 place count 58 transition count 135
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 146 place count 58 transition count 132
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 152 place count 55 transition count 132
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 156 place count 53 transition count 130
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 157 place count 52 transition count 129
Applied a total of 157 rules in 56 ms. Remains 52 /134 variables (removed 82) and now considering 129/249 (removed 120) transitions.
// Phase 1: matrix 129 rows 52 cols
[2024-06-02 19:39:33] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 19:39:33] [INFO ] Implicit Places using invariants in 89 ms returned [4, 25]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 94 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 50/134 places, 129/249 transitions.
Applied a total of 0 rules in 6 ms. Remains 50 /50 variables (removed 0) and now considering 129/129 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 156 ms. Remains : 50/134 places, 129/249 transitions.
[2024-06-02 19:39:33] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:39:33] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:39:33] [INFO ] Input system was already deterministic with 129 transitions.
[2024-06-02 19:39:33] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:39:33] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:39:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality14774355224907277177.gal : 2 ms
[2024-06-02 19:39:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality5510524692286455077.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/CTLCardinality14774355224907277177.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5510524692286455077.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,278946,0.281009,9120,2,924,5,19064,6,0,319,24356,0


Converting to forward existential form...Done !
original formula: E(((p144==0)||(p123==1)) U ((p66==1)||(p14==1)))
=> equivalent forward existential formula: [(FwdU(Init,((p144==0)||(p123==1))) * ((p66==1)||(p14==1)))] != FALSE
Hit Full ! (commute/partial/dont) 117/0/12
(forward)formula 0,0,0.292913,9384,1,0,9,19064,15,1,613,24356,4
FORMULA MedleyA-PT-08-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 249/249 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 132 transition count 249
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 30 place count 104 transition count 214
Iterating global reduction 1 with 28 rules applied. Total rules applied 58 place count 104 transition count 214
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 62 place count 104 transition count 210
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 69 place count 97 transition count 189
Iterating global reduction 2 with 7 rules applied. Total rules applied 76 place count 97 transition count 189
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 80 place count 93 transition count 179
Iterating global reduction 2 with 4 rules applied. Total rules applied 84 place count 93 transition count 179
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 86 place count 91 transition count 173
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 91 transition count 173
Applied a total of 88 rules in 12 ms. Remains 91 /134 variables (removed 43) and now considering 173/249 (removed 76) transitions.
// Phase 1: matrix 173 rows 91 cols
[2024-06-02 19:39:33] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:39:33] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-02 19:39:33] [INFO ] Invariant cache hit.
[2024-06-02 19:39:34] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2024-06-02 19:39:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-02 19:39:35] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:39:35] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (OVERLAPS) 173/264 variables, 91/103 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (OVERLAPS) 0/264 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 103 constraints, problems are : Problem set: 0 solved, 172 unsolved in 7551 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (OVERLAPS) 173/264 variables, 91/103 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 172/275 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-02 19:39:45] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:39:45] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (OVERLAPS) 0/264 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/264 variables, and 277 constraints, problems are : Problem set: 0 solved, 172 unsolved in 11333 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 4/4 constraints]
After SMT, in 19037ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 19040ms
Starting structural reductions in LTL mode, iteration 1 : 91/134 places, 173/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19361 ms. Remains : 91/134 places, 173/249 transitions.
[2024-06-02 19:39:53] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:39:53] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:39:53] [INFO ] Input system was already deterministic with 173 transitions.
[2024-06-02 19:39:53] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:39:53] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:39:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality17688040646064242979.gal : 2 ms
[2024-06-02 19:39:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality12747442017434712004.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/CTLCardinality17688040646064242979.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12747442017434712004.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,6.22477e+06,1.40438,34680,2,5930,5,98250,6,0,537,154463,0


Converting to forward existential form...Done !
original formula: AX(((p82==1) + EG(AG((((p80==0)&&(p27==1)) + EF(((p139==0)||(p6==1))))))))
=> equivalent forward existential formula: [((EY(Init) * !((p82==1))) * !(EG(!(E(TRUE U !((((p80==0)&&(p27==1)) + E(TRUE U ((p139==0)||(p6==1))))))))))] = ...160
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t31, t32, t34, t3...420
Detected timeout of ITS tools.
[2024-06-02 19:40:23] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:40:23] [INFO ] Applying decomposition
[2024-06-02 19:40:23] [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/graph782753659659759603.txt' '-o' '/tmp/graph782753659659759603.bin' '-w' '/tmp/graph782753659659759603.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph782753659659759603.bin' '-l' '-1' '-v' '-w' '/tmp/graph782753659659759603.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:40:23] [INFO ] Decomposing Gal with order
[2024-06-02 19:40:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:40:23] [INFO ] Removed a total of 298 redundant transitions.
[2024-06-02 19:40:23] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:40:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 8 ms.
[2024-06-02 19:40:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality4382714275104713059.gal : 4 ms
[2024-06-02 19:40:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality15885936151427238105.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/CTLCardinality4382714275104713059.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15885936151427238105.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,6.22477e+06,0.475272,13272,465,63,16489,524,360,43138,76,2433,0


Converting to forward existential form...Done !
original formula: AX(((i6.u12.p82==1) + EG(AG((((i6.u12.p80==0)&&(i1.u2.p27==1)) + EF(((i7.i0.u25.p139==0)||(i3.u3.p6==1))))))))
=> equivalent forward existential formula: [((EY(Init) * !((i6.u12.p82==1))) * !(EG(!(E(TRUE U !((((i6.u12.p80==0)&&(i1.u2.p27==1)) + E(TRUE U ((i7.i0.u25....196
Reverse transition relation is NOT exact ! Due to transitions t26, t57, t82, t87, i1.u4.t78, i2.t68, i2.t67, i2.u5.t71, i2.u5.t72, i2.u5.t74, i2.u5.t75, i2...703
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
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 an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,7.00387,174508,1,0,245996,1614,2131,847032,371,7172,264598
FORMULA MedleyA-PT-08-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 249/249 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 132 transition count 249
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 25 place count 109 transition count 222
Iterating global reduction 1 with 23 rules applied. Total rules applied 48 place count 109 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 51 place count 109 transition count 219
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 55 place count 105 transition count 212
Iterating global reduction 2 with 4 rules applied. Total rules applied 59 place count 105 transition count 212
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 104 transition count 209
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 104 transition count 209
Applied a total of 61 rules in 5 ms. Remains 104 /134 variables (removed 30) and now considering 209/249 (removed 40) transitions.
// Phase 1: matrix 209 rows 104 cols
[2024-06-02 19:40:30] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 19:40:30] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 19:40:30] [INFO ] Invariant cache hit.
[2024-06-02 19:40:30] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-06-02 19:40:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-06-02 19:40:32] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 2 ms to minimize.
[2024-06-02 19:40:32] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
[2024-06-02 19:40:33] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 2 ms to minimize.
[2024-06-02 19:40:33] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 209/313 variables, 104/118 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-06-02 19:40:36] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 2 ms to minimize.
[2024-06-02 19:40:36] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/313 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 120 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12143 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 209/313 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 208/328 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/313 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 313/313 variables, and 328 constraints, problems are : Problem set: 0 solved, 208 unsolved in 10407 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 6/6 constraints]
After SMT, in 22717ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 22720ms
Starting structural reductions in LTL mode, iteration 1 : 104/134 places, 209/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22980 ms. Remains : 104/134 places, 209/249 transitions.
[2024-06-02 19:40:53] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:40:53] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:40:53] [INFO ] Input system was already deterministic with 209 transitions.
[2024-06-02 19:40:53] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:40:53] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:40:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality5045074824427036997.gal : 5 ms
[2024-06-02 19:40:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality9198768132019253268.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/CTLCardinality5045074824427036997.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9198768132019253268.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.2031e+07,2.05693,52564,2,6716,5,134063,6,0,625,236135,0


Converting to forward existential form...Done !
original formula: ((AG((p13==1)) + A(((EX(!(((p93==0)&&((p41==0)||(p48==1))))) * AX((p49==1))) * AG(E(((p33==0)||(p84==1)) U ((p23==0)||(p97==1))))) U AG((...303
=> equivalent forward existential formula: [(FwdU(((Init * !(!(!((E(!(((p47==0)||(p51==1))) U (!(E(((p61==1) * !((E(!(((p46==0)||(p54==1))) U (!((p120==1))...636
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t30, t32, t33, t3...567
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-06-02 19:41:23] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:41:23] [INFO ] Applying decomposition
[2024-06-02 19:41:23] [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/graph6079381577020901115.txt' '-o' '/tmp/graph6079381577020901115.bin' '-w' '/tmp/graph6079381577020901115.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6079381577020901115.bin' '-l' '-1' '-v' '-w' '/tmp/graph6079381577020901115.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:41:23] [INFO ] Decomposing Gal with order
[2024-06-02 19:41:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:41:23] [INFO ] Removed a total of 376 redundant transitions.
[2024-06-02 19:41:23] [INFO ] Flatten gal took : 18 ms
[2024-06-02 19:41:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 5 ms.
[2024-06-02 19:41:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality1941243342419693360.gal : 3 ms
[2024-06-02 19:41:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality468231391678850026.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/CTLCardinality1941243342419693360.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality468231391678850026.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 -...261
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.2031e+07,0.565214,18384,491,295,22597,5472,394,53038,133,35937,0


Converting to forward existential form...Done !
original formula: ((AG((i1.u2.p13==1)) + A(((EX(!(((i5.u16.p93==0)&&((i3.u10.p41==0)||(i3.u9.p48==1))))) * AX((i3.u9.p49==1))) * AG(E(((i2.u7.p33==0)||(i0....438
=> equivalent forward existential formula: [(FwdU(((Init * !(!(!((E(!(((i3.u10.p47==0)||(i3.u10.p51==1))) U (!(E(((i3.u10.p61==1) * !((E(!(((i3.u10.p46==0)...855
Reverse transition relation is NOT exact ! Due to transitions t26, t61, t103, t109, t181, t183, i1.u2.t100, i1.u2.t101, i1.u4.t98, i2.t91, i2.t88, i2.t87, ...907
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
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
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 an SCC at level 6
Fast SCC detection found an SCC at level 7
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
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
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
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
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
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
(forward)formula 0,0,8.41221,209636,1,0,298281,30774,2909,972850,736,221391,395253
FORMULA MedleyA-PT-08-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 134/134 places, 249/249 transitions.
Graph (complete) has 456 edges and 134 vertex of which 129 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 128 transition count 231
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 19 rules applied. Total rules applied 35 place count 113 transition count 227
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 37 place count 111 transition count 227
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 37 place count 111 transition count 226
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 110 transition count 226
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 60 place count 89 transition count 199
Iterating global reduction 3 with 21 rules applied. Total rules applied 81 place count 89 transition count 199
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 81 place count 89 transition count 198
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 88 transition count 198
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 89 place count 82 transition count 181
Iterating global reduction 3 with 6 rules applied. Total rules applied 95 place count 82 transition count 181
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 79 transition count 173
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 79 transition count 173
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 102 place count 79 transition count 172
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 104 place count 78 transition count 171
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 106 place count 76 transition count 165
Iterating global reduction 5 with 2 rules applied. Total rules applied 108 place count 76 transition count 165
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 134 place count 62 transition count 153
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 136 place count 62 transition count 151
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 138 place count 60 transition count 149
Iterating global reduction 6 with 2 rules applied. Total rules applied 140 place count 60 transition count 149
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 145 place count 60 transition count 144
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 145 place count 60 transition count 141
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 151 place count 57 transition count 141
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 155 place count 55 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 156 place count 54 transition count 138
Applied a total of 156 rules in 37 ms. Remains 54 /134 variables (removed 80) and now considering 138/249 (removed 111) transitions.
// Phase 1: matrix 138 rows 54 cols
[2024-06-02 19:41:32] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:41:32] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-02 19:41:32] [INFO ] Invariant cache hit.
[2024-06-02 19:41:32] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-02 19:41:32] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2024-06-02 19:41:32] [INFO ] Redundant transitions in 16 ms returned []
Running 130 sub problems to find dead transitions.
[2024-06-02 19:41:32] [INFO ] Invariant cache hit.
[2024-06-02 19:41:32] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 19:41:33] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 137/190 variables, 53/61 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 12/73 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 2/192 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 11 (OVERLAPS) 0/192 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 74 constraints, problems are : Problem set: 0 solved, 130 unsolved in 4309 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 137/190 variables, 53/61 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 12/73 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 127/200 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 2/192 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 13 (OVERLAPS) 0/192 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 204 constraints, problems are : Problem set: 0 solved, 130 unsolved in 6832 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 1/1 constraints]
After SMT, in 11227ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 11228ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/134 places, 138/249 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11426 ms. Remains : 54/134 places, 138/249 transitions.
[2024-06-02 19:41:43] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:41:43] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:41:43] [INFO ] Input system was already deterministic with 138 transitions.
[2024-06-02 19:41:43] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:41:43] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:41:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality8453173025532277888.gal : 1 ms
[2024-06-02 19:41:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality8253469620884326731.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/CTLCardinality8453173025532277888.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8253469620884326731.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,415488,0.366533,10216,2,843,5,23519,6,0,347,31489,0


Converting to forward existential form...Done !
original formula: AG((EF(((p78==1) + AF((p138==1)))) * !(E(EG(((p45==1)&&((p27==0)||(p146==1)))) U AG(!(((p51==0)||(p131==1))))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U ((p78==1) + !(EG(!((p138==1))))))))] = FALSE * [(FwdU(FwdU(Init,TRUE),EG(((p45==...237
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t8, t9, t10, t11, t12, t13, t14, t16, t17, t18, t20, t21, t23, t2...343
(forward)formula 0,0,11.1683,276940,1,0,587,1.59645e+06,306,234,3220,1.54278e+06,701
FORMULA MedleyA-PT-08-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 249/249 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 132 transition count 249
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 28 place count 106 transition count 217
Iterating global reduction 1 with 26 rules applied. Total rules applied 54 place count 106 transition count 217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 57 place count 106 transition count 214
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 63 place count 100 transition count 197
Iterating global reduction 2 with 6 rules applied. Total rules applied 69 place count 100 transition count 197
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 72 place count 97 transition count 190
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 97 transition count 190
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 96 transition count 187
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 96 transition count 187
Applied a total of 77 rules in 4 ms. Remains 96 /134 variables (removed 38) and now considering 187/249 (removed 62) transitions.
// Phase 1: matrix 187 rows 96 cols
[2024-06-02 19:41:54] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:41:54] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 19:41:54] [INFO ] Invariant cache hit.
[2024-06-02 19:41:54] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 186 sub problems to find dead transitions.
[2024-06-02 19:41:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-06-02 19:41:56] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 2 ms to minimize.
[2024-06-02 19:41:57] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 2 ms to minimize.
[2024-06-02 19:41:57] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 187/283 variables, 96/109 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-06-02 19:42:02] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/283 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 9 (OVERLAPS) 0/283 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 110 constraints, problems are : Problem set: 0 solved, 186 unsolved in 12939 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 187/283 variables, 96/110 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 186/296 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (OVERLAPS) 0/283 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 296 constraints, problems are : Problem set: 0 solved, 186 unsolved in 10477 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 4/4 constraints]
After SMT, in 23528ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 23530ms
Starting structural reductions in LTL mode, iteration 1 : 96/134 places, 187/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23722 ms. Remains : 96/134 places, 187/249 transitions.
[2024-06-02 19:42:18] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:42:18] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:42:18] [INFO ] Input system was already deterministic with 187 transitions.
[2024-06-02 19:42:18] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:42:18] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:42:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality4861866111531085588.gal : 2 ms
[2024-06-02 19:42:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality2495529784186563514.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/CTLCardinality4861866111531085588.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2495529784186563514.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,7.44845e+06,1.88617,42860,2,7186,5,123861,6,0,571,184619,0


Converting to forward existential form...Done !
original formula: (EG(E(AX(((p112==1)||(p28==0))) U ((p73==0)||(p85==1)))) * !(A((((p89==0)||(p23==1)) * EG(!(((p127==0)||(p104==1))))) U !(((p33==0)||(p11...165
=> equivalent forward existential formula: (([((FwdU((Init * EG(E(!(EX(!(((p112==1)||(p28==0))))) U ((p73==0)||(p85==1))))),!(!(((p33==0)||(p110==1))))) * ...527
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t29, t30, t31, t3...494
Detected timeout of ITS tools.
[2024-06-02 19:42:48] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:42:48] [INFO ] Applying decomposition
[2024-06-02 19:42:48] [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/graph997825881407306609.txt' '-o' '/tmp/graph997825881407306609.bin' '-w' '/tmp/graph997825881407306609.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph997825881407306609.bin' '-l' '-1' '-v' '-w' '/tmp/graph997825881407306609.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:42:48] [INFO ] Decomposing Gal with order
[2024-06-02 19:42:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:42:48] [INFO ] Removed a total of 350 redundant transitions.
[2024-06-02 19:42:48] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:42:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 3 ms.
[2024-06-02 19:42:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality8997918425857342.gal : 2 ms
[2024-06-02 19:42:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality1508628219820319045.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/CTLCardinality8997918425857342.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1508628219820319045.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 -...259
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,7.44845e+06,0.727979,23352,632,48,33509,437,384,110663,76,1612,0


Converting to forward existential form...Done !
original formula: (EG(E(AX(((i6.u19.p112==1)||(i2.u8.p28==0))) U ((i6.u13.p73==0)||(i4.u14.p85==1)))) * !(A((((i5.u15.p89==0)||(i0.u1.p23==1)) * EG(!(((i7....232
=> equivalent forward existential formula: (([((FwdU((Init * EG(E(!(EX(!(((i6.u19.p112==1)||(i2.u8.p28==0))))) U ((i6.u13.p73==0)||(i4.u14.p85==1))))),!(!(...700
Reverse transition relation is NOT exact ! Due to transitions t26, t67, t91, t93, t97, t165, t166, i1.u4.t88, i2.t81, i2.t78, i2.t77, i2.u5.t84, i2.u5.t85,...741
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
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
(forward)formula 0,1,12.7308,338308,1,0,493818,1553,2348,1.80248e+06,345,7402,567875
FORMULA MedleyA-PT-08-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 134/134 places, 249/249 transitions.
Graph (complete) has 456 edges and 134 vertex of which 127 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 126 transition count 227
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 39 place count 108 transition count 225
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 39 place count 108 transition count 224
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 107 transition count 224
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 64 place count 84 transition count 194
Iterating global reduction 2 with 23 rules applied. Total rules applied 87 place count 84 transition count 194
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 87 place count 84 transition count 192
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 91 place count 82 transition count 192
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 98 place count 75 transition count 171
Iterating global reduction 2 with 7 rules applied. Total rules applied 105 place count 75 transition count 171
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 109 place count 71 transition count 159
Iterating global reduction 2 with 4 rules applied. Total rules applied 113 place count 71 transition count 159
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 115 place count 71 transition count 157
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 119 place count 69 transition count 155
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 121 place count 67 transition count 149
Iterating global reduction 4 with 2 rules applied. Total rules applied 123 place count 67 transition count 149
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 145 place count 55 transition count 139
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 147 place count 53 transition count 137
Iterating global reduction 4 with 2 rules applied. Total rules applied 149 place count 53 transition count 137
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 154 place count 53 transition count 132
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 154 place count 53 transition count 130
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 158 place count 51 transition count 130
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 162 place count 49 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 163 place count 48 transition count 127
Applied a total of 163 rules in 33 ms. Remains 48 /134 variables (removed 86) and now considering 127/249 (removed 122) transitions.
// Phase 1: matrix 127 rows 48 cols
[2024-06-02 19:43:01] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 19:43:01] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-02 19:43:01] [INFO ] Invariant cache hit.
[2024-06-02 19:43:01] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-02 19:43:01] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2024-06-02 19:43:01] [INFO ] Redundant transitions in 20 ms returned []
Running 119 sub problems to find dead transitions.
[2024-06-02 19:43:01] [INFO ] Invariant cache hit.
[2024-06-02 19:43:01] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 2/47 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 126/173 variables, 47/53 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 2/175 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 0/175 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 66 constraints, problems are : Problem set: 0 solved, 119 unsolved in 4860 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 48/48 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 2/47 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 126/173 variables, 47/53 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 116/181 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 2/175 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 3/185 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (OVERLAPS) 0/175 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 185 constraints, problems are : Problem set: 0 solved, 119 unsolved in 6683 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 48/48 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
After SMT, in 11617ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 11620ms
Starting structural reductions in SI_CTL mode, iteration 1 : 48/134 places, 127/249 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11820 ms. Remains : 48/134 places, 127/249 transitions.
[2024-06-02 19:43:13] [INFO ] Flatten gal took : 4 ms
[2024-06-02 19:43:13] [INFO ] Flatten gal took : 4 ms
[2024-06-02 19:43:13] [INFO ] Input system was already deterministic with 127 transitions.
[2024-06-02 19:43:13] [INFO ] Flatten gal took : 4 ms
[2024-06-02 19:43:13] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:43:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality8994124327204273988.gal : 1 ms
[2024-06-02 19:43:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality15040871446292092066.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/CTLCardinality8994124327204273988.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15040871446292092066.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,281409,0.145823,7220,2,358,5,14567,6,0,307,18121,0


Converting to forward existential form...Done !
original formula: EG(EF((AF(EG(((p95==0)||(p62==1)))) + (p135==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (!(EG(!(EG(((p95==0)||(p62==1)))))) + (p135==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t7, t8, t10, t11, t22, t26, t27, t115, t117, Intersection with reach...231
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,7.49792,206096,1,0,665,1.25092e+06,290,302,3172,1.16813e+06,808
FORMULA MedleyA-PT-08-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 134/134 places, 249/249 transitions.
Graph (complete) has 456 edges and 134 vertex of which 127 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 126 transition count 228
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 38 place count 109 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 108 transition count 225
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 39 place count 108 transition count 223
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 43 place count 106 transition count 223
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 64 place count 85 transition count 195
Iterating global reduction 3 with 21 rules applied. Total rules applied 85 place count 85 transition count 195
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 85 place count 85 transition count 194
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 84 transition count 194
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 94 place count 77 transition count 173
Iterating global reduction 3 with 7 rules applied. Total rules applied 101 place count 77 transition count 173
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 103 place count 75 transition count 167
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 75 transition count 167
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 106 place count 75 transition count 166
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 108 place count 74 transition count 165
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 109 place count 73 transition count 162
Iterating global reduction 5 with 1 rules applied. Total rules applied 110 place count 73 transition count 162
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 134 place count 60 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 135 place count 60 transition count 150
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 137 place count 58 transition count 148
Iterating global reduction 6 with 2 rules applied. Total rules applied 139 place count 58 transition count 148
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 143 place count 58 transition count 144
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 143 place count 58 transition count 141
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 149 place count 55 transition count 141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 151 place count 54 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 152 place count 53 transition count 139
Applied a total of 152 rules in 25 ms. Remains 53 /134 variables (removed 81) and now considering 139/249 (removed 110) transitions.
// Phase 1: matrix 139 rows 53 cols
[2024-06-02 19:43:20] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 19:43:20] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-02 19:43:21] [INFO ] Invariant cache hit.
[2024-06-02 19:43:21] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-02 19:43:21] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-06-02 19:43:21] [INFO ] Redundant transitions in 21 ms returned []
Running 133 sub problems to find dead transitions.
[2024-06-02 19:43:21] [INFO ] Invariant cache hit.
[2024-06-02 19:43:21] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 2/52 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-06-02 19:43:22] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 138/190 variables, 52/59 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 2/192 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 72 constraints, problems are : Problem set: 0 solved, 133 unsolved in 5400 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 53/53 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 2/52 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 138/190 variables, 52/59 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 130/201 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (OVERLAPS) 2/192 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 12 (OVERLAPS) 0/192 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 205 constraints, problems are : Problem set: 0 solved, 133 unsolved in 8135 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 53/53 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 1/1 constraints]
After SMT, in 13663ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 13666ms
Starting structural reductions in SI_CTL mode, iteration 1 : 53/134 places, 139/249 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13891 ms. Remains : 53/134 places, 139/249 transitions.
[2024-06-02 19:43:34] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:43:34] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:43:34] [INFO ] Input system was already deterministic with 139 transitions.
[2024-06-02 19:43:34] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:43:34] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:43:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality16421288949944560255.gal : 2 ms
[2024-06-02 19:43:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality9050651352786060950.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/CTLCardinality16421288949944560255.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9050651352786060950.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,457672,0.368682,10468,2,1798,5,25483,6,0,339,30265,0


Converting to forward existential form...Done !
original formula: AF(!(A((p43!=1) U AF((((p58==0)||(p18==1))||(((p28==0)||(p50==1))&&(p69==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!(!(EG(!((((p58==0)||(p18==1))||(((p28==0)||(p50==1))&&(p69==1))))))) U (!((p43!=1)) * !(!(E...311
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t14, t15, t16, t18, t19, t21, t22, t23...394
Using saturation style SCC detection
(forward)formula 0,0,11.9811,304504,1,0,769,1.52885e+06,313,391,3161,1.86522e+06,836
FORMULA MedleyA-PT-08-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 134/134 places, 249/249 transitions.
Graph (complete) has 456 edges and 134 vertex of which 129 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 128 transition count 229
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 37 place count 111 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 110 transition count 227
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 38 place count 110 transition count 225
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 42 place count 108 transition count 225
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 63 place count 87 transition count 197
Iterating global reduction 3 with 21 rules applied. Total rules applied 84 place count 87 transition count 197
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 84 place count 87 transition count 195
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 88 place count 85 transition count 195
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 94 place count 79 transition count 175
Iterating global reduction 3 with 6 rules applied. Total rules applied 100 place count 79 transition count 175
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 103 place count 76 transition count 165
Iterating global reduction 3 with 3 rules applied. Total rules applied 106 place count 76 transition count 165
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 108 place count 76 transition count 163
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 112 place count 74 transition count 161
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 113 place count 73 transition count 158
Iterating global reduction 5 with 1 rules applied. Total rules applied 114 place count 73 transition count 158
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 19 rules applied. Total rules applied 133 place count 63 transition count 149
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 135 place count 61 transition count 147
Iterating global reduction 5 with 2 rules applied. Total rules applied 137 place count 61 transition count 147
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 142 place count 61 transition count 142
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 142 place count 61 transition count 139
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 148 place count 58 transition count 139
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 152 place count 56 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 153 place count 55 transition count 136
Applied a total of 153 rules in 22 ms. Remains 55 /134 variables (removed 79) and now considering 136/249 (removed 113) transitions.
// Phase 1: matrix 136 rows 55 cols
[2024-06-02 19:43:46] [INFO ] Computed 8 invariants in 0 ms
[2024-06-02 19:43:47] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-02 19:43:47] [INFO ] Invariant cache hit.
[2024-06-02 19:43:47] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-02 19:43:47] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-06-02 19:43:47] [INFO ] Redundant transitions in 15 ms returned []
Running 128 sub problems to find dead transitions.
[2024-06-02 19:43:47] [INFO ] Invariant cache hit.
[2024-06-02 19:43:47] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-06-02 19:43:48] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 135/189 variables, 54/63 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 12/75 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 2/191 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 12 (OVERLAPS) 0/191 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 76 constraints, problems are : Problem set: 0 solved, 128 unsolved in 6713 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 55/55 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 135/189 variables, 54/63 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 12/75 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 125/200 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 11 (OVERLAPS) 2/191 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/191 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 14 (OVERLAPS) 0/191 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 204 constraints, problems are : Problem set: 0 solved, 128 unsolved in 7703 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 55/55 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 1/1 constraints]
After SMT, in 14499ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 14501ms
Starting structural reductions in SI_CTL mode, iteration 1 : 55/134 places, 136/249 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14703 ms. Remains : 55/134 places, 136/249 transitions.
[2024-06-02 19:44:01] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:44:01] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:44:01] [INFO ] Input system was already deterministic with 136 transitions.
[2024-06-02 19:44:01] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:44:01] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:44:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality8311645718612777039.gal : 2 ms
[2024-06-02 19:44:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality16318814432446824906.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/CTLCardinality8311645718612777039.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16318814432446824906.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,499993,0.366536,10740,2,1205,5,24915,6,0,348,36478,0


Converting to forward existential form...Done !
original formula: EF((AG(((p140==0)||(p30==1))) + ((EF(((p142==0)||(p119==1))) * (p24!=0)) * (p11!=1))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !(((p140==0)||(p30==1))))))] != FALSE + [(FwdU(((FwdU(Init,TRUE) * (p11!=1)) * (...206
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t15, t16, t18, t19, t20, t23, t25...359
(forward)formula 0,1,1.83414,43772,1,0,276,206093,294,98,3160,178771,320
FORMULA MedleyA-PT-08-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 249/249 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 132 transition count 249
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 29 place count 105 transition count 215
Iterating global reduction 1 with 27 rules applied. Total rules applied 56 place count 105 transition count 215
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 58 place count 105 transition count 213
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 65 place count 98 transition count 192
Iterating global reduction 2 with 7 rules applied. Total rules applied 72 place count 98 transition count 192
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 96 transition count 188
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 96 transition count 188
Applied a total of 76 rules in 3 ms. Remains 96 /134 variables (removed 38) and now considering 188/249 (removed 61) transitions.
// Phase 1: matrix 188 rows 96 cols
[2024-06-02 19:44:03] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 19:44:03] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 19:44:03] [INFO ] Invariant cache hit.
[2024-06-02 19:44:03] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 187 sub problems to find dead transitions.
[2024-06-02 19:44:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-02 19:44:05] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-06-02 19:44:05] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (OVERLAPS) 188/284 variables, 96/108 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (OVERLAPS) 0/284 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 108 constraints, problems are : Problem set: 0 solved, 187 unsolved in 8770 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (OVERLAPS) 188/284 variables, 96/108 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 187/295 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-02 19:44:16] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:44:16] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 2 ms to minimize.
[2024-06-02 19:44:16] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 3/298 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (OVERLAPS) 0/284 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/284 variables, and 298 constraints, problems are : Problem set: 0 solved, 187 unsolved in 12735 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 5/5 constraints]
After SMT, in 21627ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 21629ms
Starting structural reductions in LTL mode, iteration 1 : 96/134 places, 188/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21839 ms. Remains : 96/134 places, 188/249 transitions.
[2024-06-02 19:44:25] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:44:25] [INFO ] Flatten gal took : 4 ms
[2024-06-02 19:44:25] [INFO ] Input system was already deterministic with 188 transitions.
[2024-06-02 19:44:25] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:44:25] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:44:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality10941436114961956867.gal : 1 ms
[2024-06-02 19:44:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality18374177886596225453.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/CTLCardinality10941436114961956867.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18374177886596225453.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,7.86986e+06,1.44838,41576,2,7227,5,117701,6,0,572,190957,0


Converting to forward existential form...Done !
original formula: (EX(EF(((p128==1)&&((p27==0)||(p140==1))))) * E((((p0==1)||(((p3!=1)&&(p55==1))&&(p131==1))) + (!(((p115!=1)||(p120==1))) + !((EG(((p27==...214
=> equivalent forward existential formula: [FwdG(FwdU((Init * EX(E(TRUE U ((p128==1)&&((p27==0)||(p140==1)))))),(((p0==1)||(((p3!=1)&&(p55==1))&&(p131==1))...264
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t30, t31, t32, t3...516
Detected timeout of ITS tools.
[2024-06-02 19:44:55] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:44:55] [INFO ] Applying decomposition
[2024-06-02 19:44:55] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7794616460338556489.txt' '-o' '/tmp/graph7794616460338556489.bin' '-w' '/tmp/graph7794616460338556489.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7794616460338556489.bin' '-l' '-1' '-v' '-w' '/tmp/graph7794616460338556489.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:44:55] [INFO ] Decomposing Gal with order
[2024-06-02 19:44:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:44:55] [INFO ] Removed a total of 327 redundant transitions.
[2024-06-02 19:44:55] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:44:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 3 ms.
[2024-06-02 19:44:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality1358644599996596810.gal : 2 ms
[2024-06-02 19:44:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality7198495744293750473.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/CTLCardinality1358644599996596810.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7198495744293750473.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,7.86986e+06,0.356498,13852,446,182,17474,1105,371,40883,107,8979,0


Converting to forward existential form...Done !
original formula: (EX(EF(((i7.u24.p128==1)&&((i1.u3.p27==0)||(i7.u27.p140==1))))) * E((((i0.u0.p0==1)||(((i0.u1.p3!=1)&&(i3.u9.p55==1))&&(i7.u25.p131==1)))...304
=> equivalent forward existential formula: [FwdG(FwdU((Init * EX(E(TRUE U ((i7.u24.p128==1)&&((i1.u3.p27==0)||(i7.u27.p140==1)))))),(((i0.u0.p0==1)||(((i0....354
Reverse transition relation is NOT exact ! Due to transitions t26, t64, t98, t102, i1.u4.t94, i2.t87, i2.t84, i2.t83, i2.u5.t62, i2.u5.t92, i2.u5.t93, i2.u...861
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
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
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 an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,8.81443,230536,1,0,332325,17046,2589,1.01232e+06,535,179397,364796
FORMULA MedleyA-PT-08-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2024-06-02 19:45:04] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:45:04] [INFO ] Flatten gal took : 6 ms
Total runtime 657125 ms.

BK_STOP 1717357504504

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

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