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.r356-tall-171683761300553.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 ShieldPPPt-PT-002B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761300553
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 14:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 14:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 14:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K Apr 11 14:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 37K May 18 16:43 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 ShieldPPPt-PT-002B-CTLCardinality-2024-00
FORMULA_NAME ShieldPPPt-PT-002B-CTLCardinality-2024-01
FORMULA_NAME ShieldPPPt-PT-002B-CTLCardinality-2024-02
FORMULA_NAME ShieldPPPt-PT-002B-CTLCardinality-2024-03
FORMULA_NAME ShieldPPPt-PT-002B-CTLCardinality-2024-04
FORMULA_NAME ShieldPPPt-PT-002B-CTLCardinality-2024-05
FORMULA_NAME ShieldPPPt-PT-002B-CTLCardinality-2024-06
FORMULA_NAME ShieldPPPt-PT-002B-CTLCardinality-2024-07
FORMULA_NAME ShieldPPPt-PT-002B-CTLCardinality-2024-08
FORMULA_NAME ShieldPPPt-PT-002B-CTLCardinality-2024-09
FORMULA_NAME ShieldPPPt-PT-002B-CTLCardinality-2024-10
FORMULA_NAME ShieldPPPt-PT-002B-CTLCardinality-2024-11
FORMULA_NAME ShieldPPPt-PT-002B-CTLCardinality-2023-12
FORMULA_NAME ShieldPPPt-PT-002B-CTLCardinality-2023-13
FORMULA_NAME ShieldPPPt-PT-002B-CTLCardinality-2023-14
FORMULA_NAME ShieldPPPt-PT-002B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717001986175

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-002B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-29 16:59:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 16:59:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 16:59:47] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2024-05-29 16:59:47] [INFO ] Transformed 159 places.
[2024-05-29 16:59:47] [INFO ] Transformed 145 transitions.
[2024-05-29 16:59:47] [INFO ] Found NUPN structural information;
[2024-05-29 16:59:47] [INFO ] Parsed PT model containing 159 places and 145 transitions and 362 arcs in 160 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPt-PT-002B-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002B-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 99 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 145/145 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 153 transition count 139
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 153 transition count 139
Applied a total of 12 rules in 26 ms. Remains 153 /159 variables (removed 6) and now considering 139/145 (removed 6) transitions.
// Phase 1: matrix 139 rows 153 cols
[2024-05-29 16:59:47] [INFO ] Computed 23 invariants in 15 ms
[2024-05-29 16:59:47] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-29 16:59:47] [INFO ] Invariant cache hit.
[2024-05-29 16:59:48] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2024-05-29 16:59:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 16:59:49] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 14 ms to minimize.
[2024-05-29 16:59:49] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 4 ms to minimize.
[2024-05-29 16:59:49] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 16:59:49] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2024-05-29 16:59:49] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-29 16:59:49] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2024-05-29 16:59:49] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 0 ms to minimize.
[2024-05-29 16:59:49] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-05-29 16:59:49] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 16:59:49] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-29 16:59:49] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-29 16:59:49] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 1 ms to minimize.
[2024-05-29 16:59:49] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2024-05-29 16:59:49] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-29 16:59:50] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 0 ms to minimize.
[2024-05-29 16:59:50] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 0 ms to minimize.
[2024-05-29 16:59:50] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 0 ms to minimize.
[2024-05-29 16:59:50] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 3 ms to minimize.
[2024-05-29 16:59:50] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 10 ms to minimize.
[2024-05-29 16:59:50] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 16:59:50] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 16:59:51] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 16:59:51] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (OVERLAPS) 139/292 variables, 153/199 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 16:59:52] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-29 16:59:52] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 16:59:54] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-29 16:59:54] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-29 16:59:54] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-29 16:59:54] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-29 16:59:54] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/292 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 16:59:56] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/292 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/292 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 16:59:57] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/292 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/292 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 15 (OVERLAPS) 0/292 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 208 constraints, problems are : Problem set: 0 solved, 138 unsolved in 12028 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 32/55 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/292 variables, 153/208 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 138/346 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 17:00:01] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-29 17:00:01] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:00:02] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-29 17:00:02] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-29 17:00:02] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 5/351 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 17:00:03] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-29 17:00:03] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 2/353 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 17:00:05] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:00:05] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-29 17:00:05] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 17:00:06] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 17:00:10] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-29 17:00:10] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 2 ms to minimize.
[2024-05-29 17:00:10] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/292 variables, 3/360 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/292 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 13 (OVERLAPS) 0/292 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 360 constraints, problems are : Problem set: 0 solved, 138 unsolved in 15148 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 46/46 constraints]
After SMT, in 27230ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 27252ms
Starting structural reductions in LTL mode, iteration 1 : 153/159 places, 139/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27701 ms. Remains : 153/159 places, 139/145 transitions.
Support contains 99 out of 153 places after structural reductions.
[2024-05-29 17:00:15] [INFO ] Flatten gal took : 30 ms
[2024-05-29 17:00:15] [INFO ] Flatten gal took : 13 ms
[2024-05-29 17:00:15] [INFO ] Input system was already deterministic with 139 transitions.
Support contains 96 out of 153 places (down from 99) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1370 ms. (29 steps per ms) remains 2/69 properties
BEST_FIRST walk for 36126 steps (9 resets) in 366 ms. (98 steps per ms) remains 0/2 properties
[2024-05-29 17:00:16] [INFO ] Flatten gal took : 10 ms
[2024-05-29 17:00:16] [INFO ] Flatten gal took : 10 ms
[2024-05-29 17:00:16] [INFO ] Input system was already deterministic with 139 transitions.
Computed a total of 36 stabilizing places and 36 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 139/139 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 138 transition count 124
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 138 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 137 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 137 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 136 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 136 transition count 122
Applied a total of 34 rules in 27 ms. Remains 136 /153 variables (removed 17) and now considering 122/139 (removed 17) transitions.
// Phase 1: matrix 122 rows 136 cols
[2024-05-29 17:00:16] [INFO ] Computed 23 invariants in 5 ms
[2024-05-29 17:00:16] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-29 17:00:16] [INFO ] Invariant cache hit.
[2024-05-29 17:00:16] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-29 17:00:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:00:17] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:00:17] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:00:17] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:00:17] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:00:17] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:00:17] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-05-29 17:00:17] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:00:17] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:00:17] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:00:17] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:00:17] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:00:17] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:00:17] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 13/36 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/258 variables, 136/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:00:18] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:00:19] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 0/258 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 174 constraints, problems are : Problem set: 0 solved, 121 unsolved in 4426 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/258 variables, 136/174 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 121/295 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:00:21] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-05-29 17:00:21] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-29 17:00:21] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:00:22] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-29 17:00:22] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-29 17:00:22] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 6/301 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:00:23] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:00:24] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:00:24] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:00:25] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 0/258 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 305 constraints, problems are : Problem set: 0 solved, 121 unsolved in 8406 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 25/25 constraints]
After SMT, in 12848ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 12850ms
Starting structural reductions in LTL mode, iteration 1 : 136/153 places, 122/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13038 ms. Remains : 136/153 places, 122/139 transitions.
[2024-05-29 17:00:29] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:00:29] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:00:29] [INFO ] Input system was already deterministic with 122 transitions.
[2024-05-29 17:00:29] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:00:29] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:00:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality5783362467570133161.gal : 3 ms
[2024-05-29 17:00:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality15487191032315088128.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/CTLCardinality5783362467570133161.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15487191032315088128.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.76248e+13,2.14728,67544,2,4385,5,209947,6,0,668,435798,0


Converting to forward existential form...Done !
original formula: AX(((EX(TRUE) * E(A(AX(((p40==0)||(p154==1))) U AG((p26==0))) U !(EG((p53==1))))) * AG(AF((p154==1)))))
=> equivalent forward existential formula: (([(EY(Init) * !(EX(TRUE)))] = FALSE * [(EY(Init) * !(E(!((E(!(!(E(TRUE U !((p26==0))))) U (!(!(EX(!(((p40==0)||...320
Hit Full ! (commute/partial/dont) 119/0/3
Detected timeout of ITS tools.
[2024-05-29 17:00:59] [INFO ] Flatten gal took : 8 ms
[2024-05-29 17:00:59] [INFO ] Applying decomposition
[2024-05-29 17:00:59] [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/graph7871791423266590144.txt' '-o' '/tmp/graph7871791423266590144.bin' '-w' '/tmp/graph7871791423266590144.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7871791423266590144.bin' '-l' '-1' '-v' '-w' '/tmp/graph7871791423266590144.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:00:59] [INFO ] Decomposing Gal with order
[2024-05-29 17:00:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:00:59] [INFO ] Removed a total of 23 redundant transitions.
[2024-05-29 17:00:59] [INFO ] Flatten gal took : 35 ms
[2024-05-29 17:00:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-29 17:00:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality3812295386099619472.gal : 7 ms
[2024-05-29 17:00:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality11291061712226664621.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/CTLCardinality3812295386099619472.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11291061712226664621.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.76248e+13,0.150498,10464,536,29,15834,278,354,20670,45,615,0


Converting to forward existential form...Done !
original formula: AX(((EX(TRUE) * E(A(AX(((i4.u15.p40==0)||(i15.u51.p154==1))) U AG((i3.u10.p26==0))) U !(EG((i5.u20.p53==1))))) * AG(AF((i15.u51.p154==1))...158
=> equivalent forward existential formula: (([(EY(Init) * !(EX(TRUE)))] = FALSE * [(EY(Init) * !(E(!((E(!(!(E(TRUE U !((i3.u10.p26==0))))) U (!(!(EX(!(((i4...371
Using saturation style SCC detection
Using 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 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,0,6.38652,263640,1,0,641961,396,1380,615018,176,1278,760080
FORMULA ShieldPPPt-PT-002B-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 139/139 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 138 transition count 124
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 138 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 137 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 137 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 136 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 136 transition count 122
Applied a total of 34 rules in 15 ms. Remains 136 /153 variables (removed 17) and now considering 122/139 (removed 17) transitions.
// Phase 1: matrix 122 rows 136 cols
[2024-05-29 17:01:05] [INFO ] Computed 23 invariants in 2 ms
[2024-05-29 17:01:06] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-29 17:01:06] [INFO ] Invariant cache hit.
[2024-05-29 17:01:06] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-29 17:01:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:01:06] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:01:06] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:01:06] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-29 17:01:06] [INFO ] Deduced a trap composed of 20 places in 16 ms of which 0 ms to minimize.
[2024-05-29 17:01:06] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:01:06] [INFO ] Deduced a trap composed of 16 places in 17 ms of which 0 ms to minimize.
[2024-05-29 17:01:07] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:01:07] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:01:07] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:01:07] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-29 17:01:07] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2024-05-29 17:01:07] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:01:07] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:01:07] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/258 variables, 136/173 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 0/258 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 173 constraints, problems are : Problem set: 0 solved, 121 unsolved in 3309 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:01:09] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/258 variables, 136/174 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 121/295 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:01:10] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:01:10] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:01:11] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 3 ms to minimize.
[2024-05-29 17:01:11] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:01:11] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:01:11] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 6/301 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:01:12] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:01:13] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-29 17:01:13] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-29 17:01:13] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:01:14] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:01:15] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (OVERLAPS) 0/258 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 307 constraints, problems are : Problem set: 0 solved, 121 unsolved in 9598 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 27/27 constraints]
After SMT, in 12920ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 12922ms
Starting structural reductions in LTL mode, iteration 1 : 136/153 places, 122/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13088 ms. Remains : 136/153 places, 122/139 transitions.
[2024-05-29 17:01:19] [INFO ] Flatten gal took : 7 ms
[2024-05-29 17:01:19] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:01:19] [INFO ] Input system was already deterministic with 122 transitions.
[2024-05-29 17:01:19] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:01:19] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:01:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality551446253986676599.gal : 1 ms
[2024-05-29 17:01:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality9848511772501542424.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/CTLCardinality551446253986676599.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9848511772501542424.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.75215e+13,1.72213,59332,2,4388,5,187476,6,0,668,378373,0


Converting to forward existential form...Done !
original formula: EG(((A(!(((p18==0)||(p24==1))) U (((((p42!=1) * EX((p0==1))) + (((p12==0)||(p3==1))&&((p49==0)||(p66==1)))) + ((p137==1)||(p4==0))) + (p7...187
=> equivalent forward existential formula: [FwdG(Init,((!((E(!((((((p42!=1) * EX((p0==1))) + (((p12==0)||(p3==1))&&((p49==0)||(p66==1)))) + ((p137==1)||(p4...479
Reverse transition relation is NOT exact ! Due to transitions t9, t13, t18, t23, t25, t28, t32, t37, t38, t41, t43, t44, t46, t47, t49, t50, t54, t58, t63,...332
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-29 17:01:49] [INFO ] Flatten gal took : 11 ms
[2024-05-29 17:01:49] [INFO ] Applying decomposition
[2024-05-29 17:01:49] [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/graph4573740095019977666.txt' '-o' '/tmp/graph4573740095019977666.bin' '-w' '/tmp/graph4573740095019977666.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4573740095019977666.bin' '-l' '-1' '-v' '-w' '/tmp/graph4573740095019977666.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:01:49] [INFO ] Decomposing Gal with order
[2024-05-29 17:01:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:01:49] [INFO ] Removed a total of 19 redundant transitions.
[2024-05-29 17:01:49] [INFO ] Flatten gal took : 10 ms
[2024-05-29 17:01:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 17:01:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality9696237065031254521.gal : 3 ms
[2024-05-29 17:01:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality15882691003172714271.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/CTLCardinality9696237065031254521.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15882691003172714271.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.75215e+13,0.311797,17016,509,45,28505,405,338,43467,61,804,0


Converting to forward existential form...Done !
original formula: EG(((A(!(((i2.u8.p18==0)||(i3.u9.p24==1))) U (((((i5.u15.p42!=1) * EX((i0.u0.p0==1))) + (((i1.i1.u5.p12==0)||(i3.u1.p3==1))&&((i6.u19.p49...276
=> equivalent forward existential formula: [FwdG(Init,((!((E(!((((((i5.u15.p42!=1) * EX((i0.u0.p0==1))) + (((i1.i1.u5.p12==0)||(i3.u1.p3==1))&&((i6.u19.p49...694
Reverse transition relation is NOT exact ! Due to transitions t41, t44, t87, t90, t93, t114, t119, u34.t43, i1.i1.u6.t96, i2.u7.t95, i3.u1.t97, i3.u9.t92, ...483
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 139/139 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 139 transition count 125
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 139 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 138 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 138 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 137 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 137 transition count 123
Applied a total of 32 rules in 13 ms. Remains 137 /153 variables (removed 16) and now considering 123/139 (removed 16) transitions.
// Phase 1: matrix 123 rows 137 cols
[2024-05-29 17:02:19] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 17:02:19] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-29 17:02:19] [INFO ] Invariant cache hit.
[2024-05-29 17:02:19] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-29 17:02:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-29 17:02:20] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:02:20] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:02:20] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
[2024-05-29 17:02:20] [INFO ] Deduced a trap composed of 19 places in 16 ms of which 0 ms to minimize.
[2024-05-29 17:02:20] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-29 17:02:20] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:02:20] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:02:20] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-29 17:02:20] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:02:20] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-29 17:02:20] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-29 17:02:20] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:02:20] [INFO ] Deduced a trap composed of 17 places in 16 ms of which 1 ms to minimize.
[2024-05-29 17:02:20] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:02:20] [INFO ] Deduced a trap composed of 20 places in 17 ms of which 0 ms to minimize.
[2024-05-29 17:02:20] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-29 17:02:20] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:02:21] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-29 17:02:21] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/260 variables, 137/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-29 17:02:23] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/260 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/260 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/260 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 180 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5465 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/260 variables, 137/180 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 122/302 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-29 17:02:25] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-29 17:02:26] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-29 17:02:26] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:02:26] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 4/306 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-29 17:02:27] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:02:27] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 0/260 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 308 constraints, problems are : Problem set: 0 solved, 122 unsolved in 6102 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 26/26 constraints]
After SMT, in 11579ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 11580ms
Starting structural reductions in LTL mode, iteration 1 : 137/153 places, 123/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11731 ms. Remains : 137/153 places, 123/139 transitions.
[2024-05-29 17:02:30] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:02:31] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:02:31] [INFO ] Input system was already deterministic with 123 transitions.
[2024-05-29 17:02:31] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:02:31] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:02:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality18125702514828388787.gal : 1 ms
[2024-05-29 17:02:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality795759797618364993.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/CTLCardinality18125702514828388787.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality795759797618364993.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.76332e+13,2.21424,76604,2,5275,5,234118,6,0,673,500072,0


Converting to forward existential form...Done !
original formula: (AG((E(!(((p101==0)||(p22==1))) U (EX(((p79==0)||(p5==1))) * E((p22==1) U ((p1==0)||(p132==1))))) * ((p42==0)||(p41==1)))) + A((((AG((p69...376
=> equivalent forward existential formula: ([(FwdU((Init * !(!((E(!(!(E(TRUE U !(!(((EG(((p131==0)||(p86==1))) * EX((p46==0))) + EX(((p30==0)||(p148==1))))...1334
Reverse transition relation is NOT exact ! Due to transitions t9, t13, t18, t22, t27, t31, t36, t37, t40, t42, t43, t45, t46, t48, t49, t53, t54, t58, t60,...336
Detected timeout of ITS tools.
[2024-05-29 17:03:01] [INFO ] Flatten gal took : 12 ms
[2024-05-29 17:03:01] [INFO ] Applying decomposition
[2024-05-29 17:03:01] [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/graph5060588473054653385.txt' '-o' '/tmp/graph5060588473054653385.bin' '-w' '/tmp/graph5060588473054653385.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5060588473054653385.bin' '-l' '-1' '-v' '-w' '/tmp/graph5060588473054653385.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:03:01] [INFO ] Decomposing Gal with order
[2024-05-29 17:03:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:03:01] [INFO ] Removed a total of 19 redundant transitions.
[2024-05-29 17:03:01] [INFO ] Flatten gal took : 20 ms
[2024-05-29 17:03:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 17:03:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality17423824067118574636.gal : 2 ms
[2024-05-29 17:03:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality14365229782697899963.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/CTLCardinality17423824067118574636.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14365229782697899963.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.76332e+13,0.289037,15776,682,32,24998,288,355,40588,52,631,0


Converting to forward existential form...Done !
original formula: (AG((E(!(((i11.u34.p101==0)||(i1.u6.p22==1))) U (EX(((i7.u26.p79==0)||(i0.i1.u2.p5==1))) * E((i1.u6.p22==1) U ((i0.i0.u0.p1==0)||(i13.u42...575
=> equivalent forward existential formula: ([(FwdU((Init * !(!((E(!(!(E(TRUE U !(!(((EG(((i13.u42.p131==0)||(i9.i0.u29.p86==1))) * EX((i4.u14.p46==0))) + E...1897
Reverse transition relation is NOT exact ! Due to transitions t40, t43, t46, t91, t94, t115, i0.i0.u1.t98, i1.u6.t96, i2.u8.t93, i3.t88, i3.i0.u5.t97, i3.i...517
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 153/153 places, 139/139 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 152 transition count 102
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 74 place count 116 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 115 transition count 100
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 75 place count 115 transition count 92
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 91 place count 107 transition count 92
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 100 place count 98 transition count 83
Iterating global reduction 3 with 9 rules applied. Total rules applied 109 place count 98 transition count 83
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 109 place count 98 transition count 77
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 121 place count 92 transition count 77
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 185 place count 60 transition count 45
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 187 place count 58 transition count 43
Applied a total of 187 rules in 35 ms. Remains 58 /153 variables (removed 95) and now considering 43/139 (removed 96) transitions.
// Phase 1: matrix 43 rows 58 cols
[2024-05-29 17:03:31] [INFO ] Computed 23 invariants in 0 ms
[2024-05-29 17:03:31] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-29 17:03:31] [INFO ] Invariant cache hit.
[2024-05-29 17:03:31] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2024-05-29 17:03:31] [INFO ] Redundant transitions in 0 ms returned []
Running 41 sub problems to find dead transitions.
[2024-05-29 17:03:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 2/58 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 43/101 variables, 58/81 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 0/101 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 81 constraints, problems are : Problem set: 0 solved, 41 unsolved in 485 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 2/58 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 43/101 variables, 58/81 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 41/122 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 0/101 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 122 constraints, problems are : Problem set: 0 solved, 41 unsolved in 435 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
After SMT, in 929ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 930ms
Starting structural reductions in SI_CTL mode, iteration 1 : 58/153 places, 43/139 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1116 ms. Remains : 58/153 places, 43/139 transitions.
[2024-05-29 17:03:32] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:03:32] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:03:32] [INFO ] Input system was already deterministic with 43 transitions.
[2024-05-29 17:03:32] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:03:32] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:03:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality10536735661706680036.gal : 1 ms
[2024-05-29 17:03:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality10808656712251992744.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/CTLCardinality10536735661706680036.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10808656712251992744.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.374e+08,0.083545,7176,2,104,5,16604,6,0,278,24763,0


Converting to forward existential form...Done !
original formula: AF((p122==1))
=> equivalent forward existential formula: [FwdG(Init,!((p122==1)))] = FALSE
Hit Full ! (commute/partial/dont) 41/0/2
(forward)formula 0,0,0.122857,7440,1,0,10,16604,20,4,1346,24763,8
FORMULA ShieldPPPt-PT-002B-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 139/139 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 140 transition count 126
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 140 transition count 126
Applied a total of 26 rules in 3 ms. Remains 140 /153 variables (removed 13) and now considering 126/139 (removed 13) transitions.
// Phase 1: matrix 126 rows 140 cols
[2024-05-29 17:03:32] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 17:03:32] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-29 17:03:32] [INFO ] Invariant cache hit.
[2024-05-29 17:03:32] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2024-05-29 17:03:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-29 17:03:33] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:03:33] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:03:33] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
[2024-05-29 17:03:33] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-29 17:03:33] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-29 17:03:33] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2024-05-29 17:03:33] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-29 17:03:33] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-29 17:03:33] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:03:33] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-29 17:03:33] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:03:33] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-29 17:03:34] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:03:34] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:03:34] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-29 17:03:34] [INFO ] Deduced a trap composed of 20 places in 17 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-29 17:03:35] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:03:35] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 126/266 variables, 140/181 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-29 17:03:36] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/266 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-29 17:03:38] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/266 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-29 17:03:38] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-29 17:03:38] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 13 (OVERLAPS) 0/266 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 185 constraints, problems are : Problem set: 0 solved, 125 unsolved in 7653 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 22/45 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 126/266 variables, 140/185 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 125/310 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-29 17:03:41] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2024-05-29 17:03:41] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2024-05-29 17:03:41] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-29 17:03:41] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:03:42] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-29 17:03:42] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:03:42] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-29 17:03:42] [INFO ] Deduced a trap composed of 17 places in 16 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 8/318 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-29 17:03:43] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-29 17:03:45] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/266 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/266 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 11 (OVERLAPS) 0/266 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 320 constraints, problems are : Problem set: 0 solved, 125 unsolved in 9980 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 32/32 constraints]
After SMT, in 17645ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 17646ms
Starting structural reductions in LTL mode, iteration 1 : 140/153 places, 126/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17915 ms. Remains : 140/153 places, 126/139 transitions.
[2024-05-29 17:03:50] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:03:50] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:03:50] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-29 17:03:50] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:03:50] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:03:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality14149226180875922712.gal : 1 ms
[2024-05-29 17:03:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality12606507216880740976.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/CTLCardinality14149226180875922712.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12606507216880740976.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,2.46589e+13,1.98138,75944,2,5786,5,235264,6,0,688,492192,0


Converting to forward existential form...Done !
original formula: (AX((A(((p78==0)||(p113==1)) U AG((p29==0))) + (EG((((p63==0)&&(p153==1))||(p7==0))) * !(E(AX((p2==1)) U ((p142==0)||(p70==0))))))) + (EX...364
=> equivalent forward existential formula: ([((Init * !(!(EX(!((!((E(!(!(E(TRUE U !((p29==0))))) U (!(((p78==0)||(p113==1))) * !(!(E(TRUE U !((p29==0))))))...853
Reverse transition relation is NOT exact ! Due to transitions t9, t13, t18, t23, t25, t28, t32, t36, t40, t41, t44, t46, t47, t49, t50, t52, t53, t57, t61,...349
Detected timeout of ITS tools.
[2024-05-29 17:04:20] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:04:20] [INFO ] Applying decomposition
[2024-05-29 17:04:20] [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/graph3686270558697221734.txt' '-o' '/tmp/graph3686270558697221734.bin' '-w' '/tmp/graph3686270558697221734.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3686270558697221734.bin' '-l' '-1' '-v' '-w' '/tmp/graph3686270558697221734.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:04:20] [INFO ] Decomposing Gal with order
[2024-05-29 17:04:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:04:20] [INFO ] Removed a total of 21 redundant transitions.
[2024-05-29 17:04:20] [INFO ] Flatten gal took : 12 ms
[2024-05-29 17:04:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-29 17:04:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality3743591342862873625.gal : 4 ms
[2024-05-29 17:04:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality18376746431183532151.ctl : 15 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/CTLCardinality3743591342862873625.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18376746431183532151.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.46589e+13,0.244173,14500,742,29,23097,277,364,36744,52,640,0


Converting to forward existential form...Done !
original formula: (AX((A(((i7.u26.p78==0)||(i8.i1.u37.p113==1)) U AG((i0.u8.p29==0))) + (EG((((i6.u20.p63==0)&&(i14.u51.p153==1))||(i1.i1.u3.p7==0))) * !(E...561
=> equivalent forward existential formula: ([((Init * !(!(EX(!((!((E(!(!(E(TRUE U !((i0.u8.p29==0))))) U (!(((i7.u26.p78==0)||(i8.i1.u37.p113==1))) * !(!(E...1177
Reverse transition relation is NOT exact ! Due to transitions t44, t47, t94, t97, t118, t123, i0.u8.t96, i1.i0.u1.t101, i2.u6.t99, i3.t91, i3.i0.u5.t100, i...528
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 139/139 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 138 transition count 124
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 138 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 137 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 137 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 136 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 136 transition count 122
Applied a total of 34 rules in 16 ms. Remains 136 /153 variables (removed 17) and now considering 122/139 (removed 17) transitions.
// Phase 1: matrix 122 rows 136 cols
[2024-05-29 17:04:50] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 17:04:50] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-29 17:04:50] [INFO ] Invariant cache hit.
[2024-05-29 17:04:50] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-29 17:04:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:04:51] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:04:51] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:04:51] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-29 17:04:51] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
[2024-05-29 17:04:51] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:04:51] [INFO ] Deduced a trap composed of 16 places in 16 ms of which 1 ms to minimize.
[2024-05-29 17:04:51] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-29 17:04:51] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:04:51] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-29 17:04:51] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:04:51] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 0 ms to minimize.
[2024-05-29 17:04:52] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:04:52] [INFO ] Deduced a trap composed of 17 places in 16 ms of which 1 ms to minimize.
[2024-05-29 17:04:52] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:04:52] [INFO ] Deduced a trap composed of 20 places in 18 ms of which 1 ms to minimize.
[2024-05-29 17:04:52] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/258 variables, 136/175 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:04:53] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-29 17:04:53] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 0/258 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 177 constraints, problems are : Problem set: 0 solved, 121 unsolved in 3887 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 18/41 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:04:55] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/258 variables, 136/178 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 121/299 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:04:56] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-29 17:04:56] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:04:56] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-29 17:04:56] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-29 17:04:56] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-29 17:04:56] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 6/305 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:04:58] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/258 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 0/258 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 306 constraints, problems are : Problem set: 0 solved, 121 unsolved in 7997 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 26/26 constraints]
After SMT, in 11895ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 11896ms
Starting structural reductions in LTL mode, iteration 1 : 136/153 places, 122/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12077 ms. Remains : 136/153 places, 122/139 transitions.
[2024-05-29 17:05:02] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:05:02] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:05:02] [INFO ] Input system was already deterministic with 122 transitions.
[2024-05-29 17:05:02] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:05:02] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:05:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality15799088699611504709.gal : 1 ms
[2024-05-29 17:05:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality10857206749550887592.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/CTLCardinality15799088699611504709.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10857206749550887592.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.76248e+13,2.14062,80756,2,4702,5,255618,6,0,668,526603,0


Converting to forward existential form...Done !
original formula: ((EG(EF(AX(((p157==0) * AG(((p109==0)||(p149==1))))))) + AX(AF((((p78==0)&&(p32==1))||((p28==0)&&(p6==1)))))) + (EX(AX((p36==1))) + AG((p...165
=> equivalent forward existential formula: [(FwdU(((Init * !((EG(E(TRUE U !(EX(!(((p157==0) * !(E(TRUE U !(((p109==0)||(p149==1))))))))))) + !(EX(!(!(EG(!(...267
Reverse transition relation is NOT exact ! Due to transitions t9, t14, t16, t19, t23, t28, t32, t37, t38, t41, t43, t44, t46, t47, t49, t50, t54, t58, t63,...332
Detected timeout of ITS tools.
[2024-05-29 17:05:32] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:05:32] [INFO ] Applying decomposition
[2024-05-29 17:05:32] [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/graph5571919614715519352.txt' '-o' '/tmp/graph5571919614715519352.bin' '-w' '/tmp/graph5571919614715519352.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5571919614715519352.bin' '-l' '-1' '-v' '-w' '/tmp/graph5571919614715519352.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:05:32] [INFO ] Decomposing Gal with order
[2024-05-29 17:05:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:05:32] [INFO ] Removed a total of 22 redundant transitions.
[2024-05-29 17:05:32] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:05:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 17:05:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality1236225256023532488.gal : 1 ms
[2024-05-29 17:05:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality5819303948576155847.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/CTLCardinality1236225256023532488.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5819303948576155847.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,1.76248e+13,0.135721,9420,552,29,12920,307,327,18168,47,645,0


Converting to forward existential form...Done !
original formula: ((EG(EF(AX(((i15.u46.p157==0) * AG(((i11.u35.p109==0)||(i15.u48.p149==1))))))) + AX(AF((((i8.u24.p78==0)&&(i3.u11.p32==1))||((i2.u9.p28==...233
=> equivalent forward existential formula: [(FwdU(((Init * !((EG(E(TRUE U !(EX(!(((i15.u46.p157==0) * !(E(TRUE U !(((i11.u35.p109==0)||(i15.u48.p149==1))))...335
Reverse transition relation is NOT exact ! Due to transitions t41, t47, t87, t90, t93, t114, t119, i0.i0.u1.t97, i1.u6.t95, i2.u8.t92, i3.u10.t89, i4.t80, ...492
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 153/153 places, 139/139 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 152 transition count 102
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 74 place count 116 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 115 transition count 100
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 75 place count 115 transition count 91
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 93 place count 106 transition count 91
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 102 place count 97 transition count 82
Iterating global reduction 3 with 9 rules applied. Total rules applied 111 place count 97 transition count 82
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 111 place count 97 transition count 77
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 121 place count 92 transition count 77
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 185 place count 60 transition count 45
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 187 place count 58 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 188 place count 57 transition count 43
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 188 place count 57 transition count 41
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 192 place count 55 transition count 41
Applied a total of 192 rules in 20 ms. Remains 55 /153 variables (removed 98) and now considering 41/139 (removed 98) transitions.
// Phase 1: matrix 41 rows 55 cols
[2024-05-29 17:06:02] [INFO ] Computed 22 invariants in 0 ms
[2024-05-29 17:06:02] [INFO ] Implicit Places using invariants in 76 ms returned [34, 38]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 79 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 53/153 places, 41/139 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 51 transition count 39
Applied a total of 4 rules in 2 ms. Remains 51 /53 variables (removed 2) and now considering 39/41 (removed 2) transitions.
// Phase 1: matrix 39 rows 51 cols
[2024-05-29 17:06:02] [INFO ] Computed 20 invariants in 0 ms
[2024-05-29 17:06:03] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-29 17:06:03] [INFO ] Invariant cache hit.
[2024-05-29 17:06:03] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 51/153 places, 39/139 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 200 ms. Remains : 51/153 places, 39/139 transitions.
[2024-05-29 17:06:03] [INFO ] Flatten gal took : 1 ms
[2024-05-29 17:06:03] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:06:03] [INFO ] Input system was already deterministic with 39 transitions.
[2024-05-29 17:06:03] [INFO ] Flatten gal took : 1 ms
[2024-05-29 17:06:03] [INFO ] Flatten gal took : 1 ms
[2024-05-29 17:06:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality13470245258633606372.gal : 1 ms
[2024-05-29 17:06:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality6392414909957662772.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/CTLCardinality13470245258633606372.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6392414909957662772.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,4.6656e+07,0.072745,7140,2,89,5,16115,6,0,246,24440,0


Converting to forward existential form...Done !
original formula: EG(EF((p156!=1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (p156!=1)))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.128104,7932,1,0,8,19376,18,5,1217,28603,10
FORMULA ShieldPPPt-PT-002B-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 153/153 places, 139/139 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 152 transition count 102
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 74 place count 116 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 115 transition count 100
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 75 place count 115 transition count 91
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 93 place count 106 transition count 91
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 102 place count 97 transition count 82
Iterating global reduction 3 with 9 rules applied. Total rules applied 111 place count 97 transition count 82
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 111 place count 97 transition count 76
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 123 place count 91 transition count 76
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 185 place count 60 transition count 45
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 187 place count 58 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 188 place count 57 transition count 43
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 188 place count 57 transition count 41
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 192 place count 55 transition count 41
Applied a total of 192 rules in 33 ms. Remains 55 /153 variables (removed 98) and now considering 41/139 (removed 98) transitions.
// Phase 1: matrix 41 rows 55 cols
[2024-05-29 17:06:03] [INFO ] Computed 22 invariants in 1 ms
[2024-05-29 17:06:03] [INFO ] Implicit Places using invariants in 43 ms returned [34, 38]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 53/153 places, 41/139 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 51 transition count 39
Applied a total of 4 rules in 2 ms. Remains 51 /53 variables (removed 2) and now considering 39/41 (removed 2) transitions.
// Phase 1: matrix 39 rows 51 cols
[2024-05-29 17:06:03] [INFO ] Computed 20 invariants in 1 ms
[2024-05-29 17:06:03] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-29 17:06:03] [INFO ] Invariant cache hit.
[2024-05-29 17:06:03] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 51/153 places, 39/139 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 160 ms. Remains : 51/153 places, 39/139 transitions.
[2024-05-29 17:06:03] [INFO ] Flatten gal took : 1 ms
[2024-05-29 17:06:03] [INFO ] Flatten gal took : 1 ms
[2024-05-29 17:06:03] [INFO ] Input system was already deterministic with 39 transitions.
[2024-05-29 17:06:03] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:06:03] [INFO ] Flatten gal took : 1 ms
[2024-05-29 17:06:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality9208406104749286490.gal : 1 ms
[2024-05-29 17:06:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality13900732308463647746.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/CTLCardinality9208406104749286490.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13900732308463647746.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,4.6656e+07,0.044743,5560,2,165,5,9559,6,0,246,13301,0


Converting to forward existential form...Done !
original formula: AF(EG((p139==1)))
=> equivalent forward existential formula: [FwdG(Init,!(EG((p139==1))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.358321,18200,1,0,73,88312,22,67,1147,85080,70
FORMULA ShieldPPPt-PT-002B-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 153/153 places, 139/139 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 152 transition count 108
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 62 place count 122 transition count 106
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 121 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 65 place count 120 transition count 105
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 65 place count 120 transition count 96
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 83 place count 111 transition count 96
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 92 place count 102 transition count 87
Iterating global reduction 4 with 9 rules applied. Total rules applied 101 place count 102 transition count 87
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 101 place count 102 transition count 82
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 111 place count 97 transition count 82
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 169 place count 68 transition count 53
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 170 place count 68 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 171 place count 67 transition count 52
Applied a total of 171 rules in 14 ms. Remains 67 /153 variables (removed 86) and now considering 52/139 (removed 87) transitions.
// Phase 1: matrix 52 rows 67 cols
[2024-05-29 17:06:03] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 17:06:03] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-29 17:06:03] [INFO ] Invariant cache hit.
[2024-05-29 17:06:03] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 17:06:03] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2024-05-29 17:06:03] [INFO ] Redundant transitions in 1 ms returned []
Running 51 sub problems to find dead transitions.
[2024-05-29 17:06:03] [INFO ] Invariant cache hit.
[2024-05-29 17:06:03] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-29 17:06:04] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-29 17:06:04] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 1 ms to minimize.
[2024-05-29 17:06:04] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 52/119 variables, 67/93 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (OVERLAPS) 0/119 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 96 constraints, problems are : Problem set: 0 solved, 51 unsolved in 772 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 67/67 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 52/119 variables, 67/93 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 51/147 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (OVERLAPS) 0/119 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 147 constraints, problems are : Problem set: 0 solved, 51 unsolved in 824 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 67/67 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 3/3 constraints]
After SMT, in 1604ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 1606ms
Starting structural reductions in SI_CTL mode, iteration 1 : 67/153 places, 52/139 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1730 ms. Remains : 67/153 places, 52/139 transitions.
[2024-05-29 17:06:05] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:06:05] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:06:05] [INFO ] Input system was already deterministic with 52 transitions.
[2024-05-29 17:06:05] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:06:05] [INFO ] Flatten gal took : 1 ms
[2024-05-29 17:06:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality12123874909381250904.gal : 1 ms
[2024-05-29 17:06:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality331391842580317115.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/CTLCardinality12123874909381250904.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality331391842580317115.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.25388e+09,0.074597,7240,2,267,5,16482,6,0,320,22359,0


Converting to forward existential form...Done !
original formula: (AF(!(E(E(((p125==0)&&(p83==1)) U (p130!=0)) U EG(E((p85==1) U (p75==1)))))) * EF(((p14==0)&&(p108==1))))
=> equivalent forward existential formula: ([FwdG(Init,!(!(E(E(((p125==0)&&(p83==1)) U (p130!=0)) U EG(E((p85==1) U (p75==1)))))))] = FALSE * [(Init * !(E(...196
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t10, t21, t22, t25, t28, t30, t32, t34, t47, Intersection with reachable...225
Using saturation style SCC detection
(forward)formula 0,1,25.7918,841212,1,0,1202,4.30955e+06,150,736,1981,7.49879e+06,1140
FORMULA ShieldPPPt-PT-002B-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 153/153 places, 139/139 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 152 transition count 104
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 70 place count 118 transition count 102
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 72 place count 117 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 73 place count 116 transition count 101
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 73 place count 116 transition count 92
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 91 place count 107 transition count 92
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 100 place count 98 transition count 83
Iterating global reduction 4 with 9 rules applied. Total rules applied 109 place count 98 transition count 83
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 109 place count 98 transition count 78
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 119 place count 93 transition count 78
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 183 place count 61 transition count 46
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 185 place count 59 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 186 place count 58 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 186 place count 58 transition count 43
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 188 place count 57 transition count 43
Applied a total of 188 rules in 21 ms. Remains 57 /153 variables (removed 96) and now considering 43/139 (removed 96) transitions.
// Phase 1: matrix 43 rows 57 cols
[2024-05-29 17:06:31] [INFO ] Computed 22 invariants in 1 ms
[2024-05-29 17:06:31] [INFO ] Implicit Places using invariants in 44 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 56/153 places, 43/139 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 55 transition count 42
Applied a total of 2 rules in 2 ms. Remains 55 /56 variables (removed 1) and now considering 42/43 (removed 1) transitions.
// Phase 1: matrix 42 rows 55 cols
[2024-05-29 17:06:31] [INFO ] Computed 21 invariants in 1 ms
[2024-05-29 17:06:31] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-29 17:06:31] [INFO ] Invariant cache hit.
[2024-05-29 17:06:31] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 55/153 places, 42/139 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 160 ms. Remains : 55/153 places, 42/139 transitions.
[2024-05-29 17:06:31] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:06:31] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:06:31] [INFO ] Input system was already deterministic with 42 transitions.
[2024-05-29 17:06:31] [INFO ] Flatten gal took : 1 ms
[2024-05-29 17:06:31] [INFO ] Flatten gal took : 1 ms
[2024-05-29 17:06:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality4518273634094809772.gal : 1 ms
[2024-05-29 17:06:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality10590987649384829230.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/CTLCardinality4518273634094809772.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10590987649384829230.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.5552e+08,0.058781,6108,2,271,5,11990,6,0,265,17617,0


Converting to forward existential form...Done !
original formula: EG(((p104==0)&&((p149==0)||(p138==1))))
=> equivalent forward existential formula: [FwdG(Init,((p104==0)&&((p149==0)||(p138==1))))] != FALSE
Hit Full ! (commute/partial/dont) 36/3/6
(forward)formula 0,1,0.123434,7692,1,0,10,20800,19,4,1304,23248,8
FORMULA ShieldPPPt-PT-002B-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 139/139 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 138 transition count 124
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 138 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 137 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 137 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 136 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 136 transition count 122
Applied a total of 34 rules in 4 ms. Remains 136 /153 variables (removed 17) and now considering 122/139 (removed 17) transitions.
// Phase 1: matrix 122 rows 136 cols
[2024-05-29 17:06:31] [INFO ] Computed 23 invariants in 2 ms
[2024-05-29 17:06:31] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-29 17:06:31] [INFO ] Invariant cache hit.
[2024-05-29 17:06:31] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-29 17:06:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:06:32] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:06:32] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:06:32] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:06:32] [INFO ] Deduced a trap composed of 19 places in 17 ms of which 0 ms to minimize.
[2024-05-29 17:06:32] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:06:32] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-29 17:06:32] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:06:32] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:06:32] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:06:32] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:06:33] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2024-05-29 17:06:33] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:06:33] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 0 ms to minimize.
[2024-05-29 17:06:33] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:06:33] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-29 17:06:33] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:06:33] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:06:34] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:06:34] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 122/258 variables, 136/178 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:06:35] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/258 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 0/258 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 179 constraints, problems are : Problem set: 0 solved, 121 unsolved in 5484 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/258 variables, 136/179 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 121/300 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:06:38] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-29 17:06:38] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-29 17:06:38] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-29 17:06:38] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-29 17:06:39] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-29 17:06:39] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 6/306 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-29 17:06:39] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (OVERLAPS) 0/258 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 307 constraints, problems are : Problem set: 0 solved, 121 unsolved in 6626 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 27/27 constraints]
After SMT, in 12118ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 12121ms
Starting structural reductions in LTL mode, iteration 1 : 136/153 places, 122/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12260 ms. Remains : 136/153 places, 122/139 transitions.
[2024-05-29 17:06:44] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:06:44] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:06:44] [INFO ] Input system was already deterministic with 122 transitions.
[2024-05-29 17:06:44] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:06:44] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:06:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality12750716124437276143.gal : 1 ms
[2024-05-29 17:06:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality17903549638167239536.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/CTLCardinality12750716124437276143.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17903549638167239536.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.7495e+13,1.72113,65252,2,4217,5,204072,6,0,668,422756,0


Converting to forward existential form...Done !
original formula: A(EX(AG(AF((p122!=1)))) U (AF((AG(!(((p82==0)||(p122==1)))) + !(AX(((p18==0)||(p9==1)))))) * (p126==0)))
=> equivalent forward existential formula: [((Init * !(EG(!((!(EG(!((!(E(TRUE U !(!(((p82==0)||(p122==1)))))) + !(!(EX(!(((p18==0)||(p9==1)))))))))) * (p12...443
Reverse transition relation is NOT exact ! Due to transitions t9, t13, t18, t22, t27, t31, t35, t37, t38, t40, t41, t43, t44, t46, t47, t49, t50, t54, t58,...337
Detected timeout of ITS tools.
[2024-05-29 17:07:14] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:07:14] [INFO ] Applying decomposition
[2024-05-29 17:07:14] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12199376588790893135.txt' '-o' '/tmp/graph12199376588790893135.bin' '-w' '/tmp/graph12199376588790893135.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12199376588790893135.bin' '-l' '-1' '-v' '-w' '/tmp/graph12199376588790893135.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:07:14] [INFO ] Decomposing Gal with order
[2024-05-29 17:07:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:07:14] [INFO ] Removed a total of 19 redundant transitions.
[2024-05-29 17:07:14] [INFO ] Flatten gal took : 7 ms
[2024-05-29 17:07:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 17:07:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality12316582904543629912.gal : 2 ms
[2024-05-29 17:07:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality11884311281836369286.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/CTLCardinality12316582904543629912.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11884311281836369286.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.7495e+13,0.20099,11816,529,32,16153,291,342,30687,52,539,0


Converting to forward existential form...Done !
original formula: A(EX(AG(AF((i11.u36.p122!=1)))) U (AF((AG(!(((i8.i0.u25.p82==0)||(i11.u36.p122==1)))) + !(AX(((i1.u7.p18==0)||(i4.i1.u3.p9==1)))))) * (i1...171
=> equivalent forward existential formula: [((Init * !(EG(!((!(EG(!((!(E(TRUE U !(!(((i8.i0.u25.p82==0)||(i11.u36.p122==1)))))) + !(!(EX(!(((i1.u7.p18==0)|...574
Reverse transition relation is NOT exact ! Due to transitions t41, t44, t90, t93, t114, t119, i0.u8.t92, i1.u6.t95, i2.t87, i2.i0.u5.t96, i2.i1.u10.t89, i3...521
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 139/139 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 140 transition count 126
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 140 transition count 126
Applied a total of 26 rules in 5 ms. Remains 140 /153 variables (removed 13) and now considering 126/139 (removed 13) transitions.
// Phase 1: matrix 126 rows 140 cols
[2024-05-29 17:07:44] [INFO ] Computed 23 invariants in 2 ms
[2024-05-29 17:07:44] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-29 17:07:44] [INFO ] Invariant cache hit.
[2024-05-29 17:07:44] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2024-05-29 17:07:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-29 17:07:45] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-29 17:07:45] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-29 17:07:45] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-29 17:07:45] [INFO ] Deduced a trap composed of 19 places in 14 ms of which 1 ms to minimize.
[2024-05-29 17:07:45] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:07:45] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-05-29 17:07:45] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:07:45] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:07:45] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:07:45] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:07:45] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:07:45] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
[2024-05-29 17:07:45] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:07:45] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
[2024-05-29 17:07:45] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:07:45] [INFO ] Deduced a trap composed of 20 places in 17 ms of which 1 ms to minimize.
[2024-05-29 17:07:45] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-29 17:07:45] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-29 17:07:46] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 126/266 variables, 140/182 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-29 17:07:47] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-29 17:07:48] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (OVERLAPS) 0/266 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 184 constraints, problems are : Problem set: 0 solved, 125 unsolved in 5595 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 21/44 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-29 17:07:50] [INFO ] Deduced a trap composed of 19 places in 17 ms of which 0 ms to minimize.
[2024-05-29 17:07:50] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:07:50] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (OVERLAPS) 126/266 variables, 140/187 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 125/312 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-29 17:07:51] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:07:51] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-29 17:07:52] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:07:52] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-29 17:07:52] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 3/317 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-29 17:07:55] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/266 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 12 (OVERLAPS) 0/266 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 318 constraints, problems are : Problem set: 0 solved, 125 unsolved in 9094 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 30/30 constraints]
After SMT, in 14702ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 14703ms
Starting structural reductions in LTL mode, iteration 1 : 140/153 places, 126/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14859 ms. Remains : 140/153 places, 126/139 transitions.
[2024-05-29 17:07:59] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:07:59] [INFO ] Flatten gal took : 7 ms
[2024-05-29 17:07:59] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-29 17:07:59] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:07:59] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:07:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality8303286363309865148.gal : 1 ms
[2024-05-29 17:07:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality2464709117101475031.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/CTLCardinality8303286363309865148.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2464709117101475031.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.23204e+13,2.5976,94684,2,5465,5,293828,6,0,688,626169,0


Converting to forward existential form...Done !
original formula: EX((EG(((((p37==0)&&(p118==1)) * AX((p114==1))) + AF((((p16==0)||(p20==1))&&((p157==0)||(p89==1)))))) * A(!(((!(((p50==0)||(p141==1))) + ...278
=> equivalent forward existential formula: [(((EY(Init) * EG(((((p37==0)&&(p118==1)) * !(EX(!((p114==1))))) + !(EG(!((((p16==0)||(p20==1))&&((p157==0)||(p8...543
Reverse transition relation is NOT exact ! Due to transitions t9, t14, t16, t19, t23, t28, t32, t36, t40, t43, t45, t46, t48, t49, t51, t52, t56, t60, t65,...350
Detected timeout of ITS tools.
[2024-05-29 17:08:29] [INFO ] Flatten gal took : 9 ms
[2024-05-29 17:08:29] [INFO ] Applying decomposition
[2024-05-29 17:08:29] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12903723472389327860.txt' '-o' '/tmp/graph12903723472389327860.bin' '-w' '/tmp/graph12903723472389327860.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12903723472389327860.bin' '-l' '-1' '-v' '-w' '/tmp/graph12903723472389327860.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:08:29] [INFO ] Decomposing Gal with order
[2024-05-29 17:08:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:08:29] [INFO ] Removed a total of 17 redundant transitions.
[2024-05-29 17:08:29] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:08:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-29 17:08:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality4949927869015755733.gal : 2 ms
[2024-05-29 17:08:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality15341111315850267208.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/CTLCardinality4949927869015755733.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15341111315850267208.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.23204e+13,0.127092,9684,642,55,12375,585,355,21156,66,1292,0


Converting to forward existential form...Done !
original formula: EX((EG(((((i3.u15.p37==0)&&(i11.u36.p118==1)) * AX((i11.u35.p114==1))) + AF((((i2.u6.p16==0)||(i2.u6.p20==1))&&((i14.u45.p157==0)||(i8.u2...411
=> equivalent forward existential formula: [(((EY(Init) * EG(((((i3.u15.p37==0)&&(i11.u36.p118==1)) * !(EX(!((i11.u35.p114==1))))) + !(EG(!((((i2.u6.p16==0...766
Reverse transition relation is NOT exact ! Due to transitions t46, t49, t91, t97, t118, t123, i0.t94, i0.i0.u5.t100, i0.i1.u8.t96, i1.u10.t93, i2.u6.t99, i...539
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 139/139 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 139 transition count 125
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 139 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 138 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 138 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 137 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 137 transition count 123
Applied a total of 32 rules in 4 ms. Remains 137 /153 variables (removed 16) and now considering 123/139 (removed 16) transitions.
// Phase 1: matrix 123 rows 137 cols
[2024-05-29 17:08:59] [INFO ] Computed 23 invariants in 0 ms
[2024-05-29 17:08:59] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-29 17:08:59] [INFO ] Invariant cache hit.
[2024-05-29 17:08:59] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-29 17:08:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-29 17:09:00] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:09:00] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-29 17:09:00] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
[2024-05-29 17:09:00] [INFO ] Deduced a trap composed of 19 places in 16 ms of which 1 ms to minimize.
[2024-05-29 17:09:00] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:09:00] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 2 ms to minimize.
[2024-05-29 17:09:00] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:09:00] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 17:09:00] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-29 17:09:00] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:09:00] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-29 17:09:00] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-29 17:09:00] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:09:00] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 5 ms to minimize.
[2024-05-29 17:09:00] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-29 17:09:00] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-29 17:09:00] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-29 17:09:01] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-29 17:09:01] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-29 17:09:01] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 123/260 variables, 137/180 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 0/260 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 180 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4729 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/260 variables, 137/180 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 122/302 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-29 17:09:05] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:09:05] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:09:05] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:09:05] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 4/306 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-29 17:09:06] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:09:06] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 0 ms to minimize.
[2024-05-29 17:09:06] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-29 17:09:07] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 17:09:07] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 17:09:07] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 6/312 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-29 17:09:08] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/260 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-29 17:09:10] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/260 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/260 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 12 (OVERLAPS) 0/260 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 314 constraints, problems are : Problem set: 0 solved, 122 unsolved in 10821 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 32/32 constraints]
After SMT, in 15560ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 15562ms
Starting structural reductions in LTL mode, iteration 1 : 137/153 places, 123/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15691 ms. Remains : 137/153 places, 123/139 transitions.
[2024-05-29 17:09:14] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:09:14] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:09:14] [INFO ] Input system was already deterministic with 123 transitions.
[2024-05-29 17:09:14] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:09:14] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:09:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality9959127393443235454.gal : 1 ms
[2024-05-29 17:09:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality5487083854272609197.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/CTLCardinality9959127393443235454.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5487083854272609197.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.99001e+13,2.15375,81288,2,5644,5,251052,6,0,673,530762,0


Converting to forward existential form...Done !
original formula: E((EX(TRUE) + (p73==0)) U ((p76==1)||(p38==1)))
=> equivalent forward existential formula: [(FwdU(Init,(EX(TRUE) + (p73==0))) * ((p76==1)||(p38==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t13, t18, t22, t27, t31, t36, t37, t40, t42, t43, t45, t46, t48, t49, t53, t57, t59, t63,...342
(forward)formula 0,1,5.54798,154544,1,0,267,576878,264,126,3790,989439,256
FORMULA ShieldPPPt-PT-002B-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 153/153 places, 139/139 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 152 transition count 113
Reduce places removed 25 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 30 rules applied. Total rules applied 55 place count 127 transition count 108
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 61 place count 122 transition count 107
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 61 place count 122 transition count 99
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 77 place count 114 transition count 99
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 83 place count 108 transition count 93
Iterating global reduction 3 with 6 rules applied. Total rules applied 89 place count 108 transition count 93
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 89 place count 108 transition count 90
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 95 place count 105 transition count 90
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 153 place count 76 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 154 place count 75 transition count 60
Applied a total of 154 rules in 15 ms. Remains 75 /153 variables (removed 78) and now considering 60/139 (removed 79) transitions.
// Phase 1: matrix 60 rows 75 cols
[2024-05-29 17:09:20] [INFO ] Computed 23 invariants in 0 ms
[2024-05-29 17:09:20] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-29 17:09:20] [INFO ] Invariant cache hit.
[2024-05-29 17:09:20] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-05-29 17:09:20] [INFO ] Redundant transitions in 1 ms returned []
Running 56 sub problems to find dead transitions.
[2024-05-29 17:09:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 4/75 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-29 17:09:20] [INFO ] Deduced a trap composed of 8 places in 14 ms of which 0 ms to minimize.
[2024-05-29 17:09:20] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-29 17:09:20] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
[2024-05-29 17:09:20] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-29 17:09:21] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-29 17:09:21] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-05-29 17:09:21] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 7/30 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 60/135 variables, 75/105 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/135 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 105 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1007 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (OVERLAPS) 4/75 variables, 15/26 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 60/135 variables, 75/105 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 56/161 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (OVERLAPS) 0/135 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 161 constraints, problems are : Problem set: 0 solved, 56 unsolved in 856 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 7/7 constraints]
After SMT, in 1870ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 1872ms
Starting structural reductions in SI_CTL mode, iteration 1 : 75/153 places, 60/139 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1982 ms. Remains : 75/153 places, 60/139 transitions.
[2024-05-29 17:09:22] [INFO ] Flatten gal took : 1 ms
[2024-05-29 17:09:22] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:09:22] [INFO ] Input system was already deterministic with 60 transitions.
[2024-05-29 17:09:22] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:09:22] [INFO ] Flatten gal took : 2 ms
[2024-05-29 17:09:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality9514579574972070033.gal : 1 ms
[2024-05-29 17:09:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality15777634460013804829.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/CTLCardinality9514579574972070033.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15777634460013804829.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,6.69867e+09,0.379854,19964,2,409,5,64338,6,0,361,114979,0


Converting to forward existential form...Done !
original formula: AG((A((((((p151==0)||(p120==1))||((p5==0)||(p144==1)))&&(p58==1))&&(p36==1)) U E(((p95==0)||(p132==1)) U ((p66==0)||(p34==1)))) + (!(A(((...206
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * !(!((E(!(E(((p95==0)||(p132==1)) U ((p66==0)||(p34==1)))) U (!((((((p151==0)||(p120==1))|...713
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t10, t34, t35, t38, t44, t45, t50, Intersection with reachable at each step ...211
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 58/0/2
(forward)formula 0,0,8.09915,312456,1,0,576,1.586e+06,159,333,2249,2.66704e+06,582
FORMULA ShieldPPPt-PT-002B-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-29 17:09:30] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:09:30] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:09:30] [INFO ] Applying decomposition
[2024-05-29 17:09:30] [INFO ] Flatten gal took : 2 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/graph6128245253875827157.txt' '-o' '/tmp/graph6128245253875827157.bin' '-w' '/tmp/graph6128245253875827157.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6128245253875827157.bin' '-l' '-1' '-v' '-w' '/tmp/graph6128245253875827157.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:09:30] [INFO ] Decomposing Gal with order
[2024-05-29 17:09:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:09:30] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-29 17:09:30] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:09:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 17:09:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality4826968436257527893.gal : 5 ms
[2024-05-29 17:09:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality9992068765334934335.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/CTLCardinality4826968436257527893.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9992068765334934335.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 6 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.6027e+13,1.31923,49716,1261,24,82533,176,384,151646,39,434,0


Converting to forward existential form...Done !
original formula: EG(((A(!(((i0.u7.p18==0)||(i1.i1.u8.p24==1))) U (((((i3.u13.p42!=1) * EX((i1.i0.u0.p0==1))) + (((i4.i0.u4.p12==0)||(i1.i0.u1.p3==1))&&((i...296
=> equivalent forward existential formula: [FwdG(Init,((!((E(!((((((i3.u13.p42!=1) * EX((i1.i0.u0.p0==1))) + (((i4.i0.u4.p12==0)||(i1.i0.u1.p3==1))&&((i4.i...738
Reverse transition relation is NOT exact ! Due to transitions t50, t56, t104, t107, t110, t131, i0.u6.t112, i1.i0.u1.t114, i1.i1.u8.t109, i2.u10.t106, i3.t...711
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,977.289,3428984,1,0,4.47402e+06,207,747,8.22192e+06,76,564,3933921
FORMULA ShieldPPPt-PT-002B-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AG((E(!(((i7.i1.u35.p101==0)||(i0.u6.p22==1))) U (EX(((i6.u28.p79==0)||(i1.i0.u2.p5==1))) * E((i0.u6.p22==1) U ((i1.i0.u0.p1==0)||(i11.u...578
=> equivalent forward existential formula: ([(FwdU((Init * !(!((E(!(!(E(TRUE U !(!(((EG(((i11.u47.p131==0)||(i9.i1.u30.p86==1))) * EX((i3.u12.p46==0))) + E...1897
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-29 17:32:44] [INFO ] Applying decomposition
[2024-05-29 17:32:45] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:32:45] [INFO ] Decomposing Gal with order
[2024-05-29 17:32:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:32:45] [INFO ] Removed a total of 1 redundant transitions.
[2024-05-29 17:32:45] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:32:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2024-05-29 17:32:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality121105694014149416.gal : 1 ms
[2024-05-29 17:32:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality9705717369312933448.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/CTLCardinality121105694014149416.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9705717369312933448.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 5 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.6027e+13,9.85051,355224,4721,270,699507,682,245,2.44029e+06,107,5009,0


Converting to forward existential form...Done !
original formula: (AG((E(!(((i1.i0.i0.i0.i0.i0.i1.u48.p101==0)||(i0.i1.i0.i0.i0.i0.i0.i0.i1.u13.p22==1))) U (EX(((i0.i1.u23.p79==0)||(i0.i1.u54.p5==1))) * ...854
=> equivalent forward existential formula: ([(FwdU((Init * !(!((E(!(!(E(TRUE U !(!(((EG(((i1.i0.i0.u42.p131==0)||(i1.i0.i0.i0.u65.p86==1))) * EX((i0.i1.i0....2621
Reverse transition relation is NOT exact ! Due to transitions i0.u2.t114, i0.i1.u23.t63, i0.i1.u23.t64, i0.i1.u23.t68, i0.i1.u23.t70, i0.i1.u23.t71, i0.i1....1196
ITS-tools command line returned an error code 137
[2024-05-29 17:41:05] [INFO ] Flatten gal took : 10 ms
[2024-05-29 17:41:05] [INFO ] Input system was already deterministic with 139 transitions.
[2024-05-29 17:41:05] [INFO ] Transformed 153 places.
[2024-05-29 17:41:05] [INFO ] Transformed 139 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-29 17:41:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality66101983997466830.gal : 2 ms
[2024-05-29 17:41:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality5361286967260267479.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/CTLCardinality66101983997466830.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5361286967260267479.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...326
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 5 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.6027e+13,2.44027,82228,2,24423,5,270691,6,0,753,455933,0


Converting to forward existential form...Done !
original formula: (AG((E(!(((p101==0)||(p22==1))) U (EX(((p79==0)||(p5==1))) * E((p22==1) U ((p1==0)||(p132==1))))) * ((p42==0)||(p41==1)))) + A((((AG((p69...376
=> equivalent forward existential formula: ([(FwdU((Init * !(!((E(!(!(E(TRUE U !(!(((EG(((p131==0)||(p86==1))) * EX((p46==0))) + EX(((p30==0)||(p148==1))))...1334
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t14, t15, t16, t17, t21, t22, t26, t28, t29, t32, t36, t41, t42, t46, t48, t49, t50,...422
ITS-tools command line returned an error code 137
Total runtime 3095987 ms.

BK_STOP 1717005083384

--------------------
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="ShieldPPPt-PT-002B"
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 ShieldPPPt-PT-002B, 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 r356-tall-171683761300553"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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