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-171683760200010.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 ShieldIIPs-PT-001B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760200010
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K 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.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 14:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 187K Apr 11 14:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 14:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 14:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:51 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 17K 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 ShieldIIPs-PT-001B-CTLFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-001B-CTLFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-001B-CTLFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-001B-CTLFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-001B-CTLFireability-2024-04
FORMULA_NAME ShieldIIPs-PT-001B-CTLFireability-2024-05
FORMULA_NAME ShieldIIPs-PT-001B-CTLFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-001B-CTLFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-001B-CTLFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-001B-CTLFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-001B-CTLFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-001B-CTLFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-001B-CTLFireability-2023-12
FORMULA_NAME ShieldIIPs-PT-001B-CTLFireability-2023-13
FORMULA_NAME ShieldIIPs-PT-001B-CTLFireability-2023-14
FORMULA_NAME ShieldIIPs-PT-001B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716876383218

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-001B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-28 06:06:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 06:06:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 06:06:24] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2024-05-28 06:06:24] [INFO ] Transformed 63 places.
[2024-05-28 06:06:24] [INFO ] Transformed 62 transitions.
[2024-05-28 06:06:24] [INFO ] Found NUPN structural information;
[2024-05-28 06:06:24] [INFO ] Parsed PT model containing 63 places and 62 transitions and 184 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 59 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 62/62 transitions.
Applied a total of 0 rules in 10 ms. Remains 63 /63 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 63 cols
[2024-05-28 06:06:24] [INFO ] Computed 10 invariants in 8 ms
[2024-05-28 06:06:24] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-28 06:06:24] [INFO ] Invariant cache hit.
[2024-05-28 06:06:24] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2024-05-28 06:06:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 9 ms to minimize.
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 2 ms to minimize.
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 0 ms to minimize.
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 2 ms to minimize.
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 14/87 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:06:26] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:06:26] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:06:26] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:06:26] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:06:26] [INFO ] Deduced a trap composed of 22 places in 18 ms of which 0 ms to minimize.
[2024-05-28 06:06:26] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 6/93 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:06:26] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (OVERLAPS) 62/125 variables, 63/157 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:06:26] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:06:26] [INFO ] Deduced a trap composed of 28 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:06:26] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:06:26] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 3 ms to minimize.
[2024-05-28 06:06:26] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:06:26] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 6/163 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:06:27] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 2 ms to minimize.
[2024-05-28 06:06:27] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:06:27] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:06:27] [INFO ] Deduced a trap composed of 22 places in 18 ms of which 0 ms to minimize.
[2024-05-28 06:06:27] [INFO ] Deduced a trap composed of 22 places in 17 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:06:27] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:06:27] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 2 ms to minimize.
[2024-05-28 06:06:27] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 3 ms to minimize.
[2024-05-28 06:06:27] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:06:27] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:06:27] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:06:27] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/125 variables, 7/175 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/125 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 14 (OVERLAPS) 0/125 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 175 constraints, problems are : Problem set: 0 solved, 61 unsolved in 3470 ms.
Refiners :[Domain max(s): 63/63 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 39/112 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:06:28] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 2 ms to minimize.
[2024-05-28 06:06:28] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:06:28] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:06:29] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:06:29] [INFO ] Deduced a trap composed of 20 places in 18 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:06:29] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-28 06:06:29] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 1 ms to minimize.
[2024-05-28 06:06:29] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/63 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/63 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 62/125 variables, 63/183 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 61/244 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:06:29] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:06:29] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:06:29] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/125 variables, 3/247 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:06:30] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/125 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/125 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 15 (OVERLAPS) 0/125 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 248 constraints, problems are : Problem set: 0 solved, 61 unsolved in 3710 ms.
Refiners :[Domain max(s): 63/63 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 51/51 constraints]
After SMT, in 7231ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 7244ms
Finished structural reductions in LTL mode , in 1 iterations and 7538 ms. Remains : 63/63 places, 62/62 transitions.
Support contains 59 out of 63 places after structural reductions.
[2024-05-28 06:06:32] [INFO ] Flatten gal took : 21 ms
[2024-05-28 06:06:32] [INFO ] Flatten gal took : 10 ms
[2024-05-28 06:06:32] [INFO ] Input system was already deterministic with 62 transitions.
Reduction of identical properties reduced properties to check from 73 to 66
RANDOM walk for 40000 steps (10 resets) in 1031 ms. (38 steps per ms) remains 4/66 properties
BEST_FIRST walk for 40004 steps (10 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (11 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 164 ms. (242 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 209 ms. (190 steps per ms) remains 4/4 properties
[2024-05-28 06:06:33] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp60 is UNSAT
At refinement iteration 2 (OVERLAPS) 43/63 variables, 10/30 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 43/73 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-28 06:06:33] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 35 ms to minimize.
[2024-05-28 06:06:33] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 0 ms to minimize.
Problem AtomicPropp63 is UNSAT
After SMT solving in domain Real declared 63/125 variables, and 75 constraints, problems are : Problem set: 4 solved, 0 unsolved in 261 ms.
Refiners :[Domain max(s): 63/63 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/63 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 267ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2024-05-28 06:06:33] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:06:33] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:06:33] [INFO ] Input system was already deterministic with 62 transitions.
Support contains 54 out of 63 places (down from 56) after GAL structural reductions.
FORMULA ShieldIIPs-PT-001B-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 16 stabilizing places and 16 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 62/62 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 57 transition count 56
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 57 transition count 56
Applied a total of 12 rules in 8 ms. Remains 57 /63 variables (removed 6) and now considering 56/62 (removed 6) transitions.
// Phase 1: matrix 56 rows 57 cols
[2024-05-28 06:06:33] [INFO ] Computed 10 invariants in 5 ms
[2024-05-28 06:06:33] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-28 06:06:33] [INFO ] Invariant cache hit.
[2024-05-28 06:06:33] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 55 sub problems to find dead transitions.
[2024-05-28 06:06:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 06:06:33] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-28 06:06:34] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:06:34] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:06:34] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:06:34] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:06:34] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:06:34] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:06:34] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 3 ms to minimize.
[2024-05-28 06:06:34] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 06:06:34] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 06:06:34] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 56/113 variables, 57/78 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 06:06:35] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-28 06:06:35] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 06:06:35] [INFO ] Deduced a trap composed of 26 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:06:35] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 0/113 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 82 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1979 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 56/113 variables, 57/82 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 55/137 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 06:06:36] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-28 06:06:36] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:06:36] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:06:36] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:06:36] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 5/142 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 06:06:36] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:06:36] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (OVERLAPS) 0/113 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 144 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1770 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 22/22 constraints]
After SMT, in 3787ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 3788ms
Starting structural reductions in LTL mode, iteration 1 : 57/63 places, 56/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3972 ms. Remains : 57/63 places, 56/62 transitions.
[2024-05-28 06:06:37] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:06:37] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:06:37] [INFO ] Input system was already deterministic with 56 transitions.
[2024-05-28 06:06:37] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:06:37] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:06:37] [INFO ] Time to serialize gal into /tmp/CTLFireability17553448028922847658.gal : 2 ms
[2024-05-28 06:06:37] [INFO ] Time to serialize properties into /tmp/CTLFireability18026517847368971503.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/CTLFireability17553448028922847658.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18026517847368971503.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,670455,0.623443,27596,2,5904,5,85831,6,0,286,143718,0


Converting to forward existential form...Done !
original formula: AF((((A(!(EF((p57==1))) U A(EX((p58==1)) U AF((((p27==1)&&(p49==1))&&(p57==1))))) + AG(AX((p13==1)))) + (((p20==1)&&(p48==1)) + ((A((p58=...406
=> equivalent forward existential formula: [FwdG(Init,!((((!((E(!(!((E(!(!(EG(!((((p27==1)&&(p49==1))&&(p57==1)))))) U (!(EX((p58==1))) * !(!(EG(!((((p27==...1086
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t14, t19, t25, t28, t29, t30, t31, t32, t34, t35, t3...261
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-28 06:07:07] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:07:07] [INFO ] Applying decomposition
[2024-05-28 06:07:07] [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/graph12628156647875884772.txt' '-o' '/tmp/graph12628156647875884772.bin' '-w' '/tmp/graph12628156647875884772.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12628156647875884772.bin' '-l' '-1' '-v' '-w' '/tmp/graph12628156647875884772.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:07:07] [INFO ] Decomposing Gal with order
[2024-05-28 06:07:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:07:07] [INFO ] Removed a total of 23 redundant transitions.
[2024-05-28 06:07:07] [INFO ] Flatten gal took : 29 ms
[2024-05-28 06:07:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-28 06:07:07] [INFO ] Time to serialize gal into /tmp/CTLFireability53236850873317808.gal : 2 ms
[2024-05-28 06:07:07] [INFO ] Time to serialize properties into /tmp/CTLFireability2752534445973543540.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/CTLFireability53236850873317808.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2752534445973543540.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 -...260
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,670455,0.105294,8400,344,37,10506,257,188,15703,47,697,0


Converting to forward existential form...Done !
original formula: AF((((A(!(EF((u19.p57==1))) U A(EX((u19.p58==1)) U AF((((i4.u10.p27==1)&&(i6.u17.p49==1))&&(u19.p57==1))))) + AG(AX((i2.u5.p13==1)))) + (...577
=> equivalent forward existential formula: [FwdG(Init,!((((!((E(!(!((E(!(!(EG(!((((i4.u10.p27==1)&&(i6.u17.p49==1))&&(u19.p57==1)))))) U (!(EX((u19.p58==1)...1451
Reverse transition relation is NOT exact ! Due to transitions t28, t30, t32, u19.t7, u19.t8, u19.t9, u19.t10, i0.u0.t36, i0.u9.t31, i2.u5.t35, i3.u6.t34, i...374
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,5.3307,232272,1,0,502729,392,1121,646911,239,1044,670112
FORMULA ShieldIIPs-PT-001B-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 62/62 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 58 transition count 57
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 58 transition count 57
Applied a total of 10 rules in 3 ms. Remains 58 /63 variables (removed 5) and now considering 57/62 (removed 5) transitions.
// Phase 1: matrix 57 rows 58 cols
[2024-05-28 06:07:13] [INFO ] Computed 10 invariants in 3 ms
[2024-05-28 06:07:13] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-28 06:07:13] [INFO ] Invariant cache hit.
[2024-05-28 06:07:13] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Running 56 sub problems to find dead transitions.
[2024-05-28 06:07:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 06:07:14] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-28 06:07:14] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:07:14] [INFO ] Deduced a trap composed of 20 places in 18 ms of which 0 ms to minimize.
[2024-05-28 06:07:14] [INFO ] Deduced a trap composed of 21 places in 16 ms of which 1 ms to minimize.
[2024-05-28 06:07:14] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 57/115 variables, 58/92 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 06:07:14] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (OVERLAPS) 0/115 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 115/115 variables, and 93 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1886 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 57/115 variables, 58/98 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 56/154 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 4/158 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 06:07:16] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:07:16] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 06:07:16] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:07:16] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/115 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 12 (OVERLAPS) 0/115 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 115/115 variables, and 162 constraints, problems are : Problem set: 0 solved, 56 unsolved in 2839 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 38/38 constraints]
After SMT, in 4735ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 4735ms
Starting structural reductions in LTL mode, iteration 1 : 58/63 places, 57/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4840 ms. Remains : 58/63 places, 57/62 transitions.
[2024-05-28 06:07:17] [INFO ] Flatten gal took : 7 ms
[2024-05-28 06:07:17] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:07:17] [INFO ] Input system was already deterministic with 57 transitions.
[2024-05-28 06:07:17] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:07:17] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:07:17] [INFO ] Time to serialize gal into /tmp/CTLFireability9372516530049025030.gal : 2 ms
[2024-05-28 06:07:17] [INFO ] Time to serialize properties into /tmp/CTLFireability10988935051141589118.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/CTLFireability9372516530049025030.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10988935051141589118.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,674583,0.645459,28464,2,6324,5,87127,6,0,291,149327,0


Converting to forward existential form...Done !
original formula: (AG((EX((p58==0)) + (p8==1))) * A(AX((!(EF(((p18==1)&&(p34==1)))) * E(E((p28==1) U (p57==1)) U AX((p17==1))))) U AF(!(AX(((p38==1)||(p16=...164
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !((p8==1))) * !(EX((p58==0))))] = FALSE * ([FwdG((FwdU(Init,!(!(EG(!(!(!(EX(!(((p38==1)||(...392
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t14, t19, t23, t24, t26, t29, t30, t31, t32, t33, t3...271
Using saturation style SCC detection
(forward)formula 0,0,6.54934,211620,1,0,287,1.16373e+06,169,115,1873,1.18977e+06,290
FORMULA ShieldIIPs-PT-001B-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 62/62 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 58 transition count 57
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 58 transition count 57
Applied a total of 10 rules in 3 ms. Remains 58 /63 variables (removed 5) and now considering 57/62 (removed 5) transitions.
// Phase 1: matrix 57 rows 58 cols
[2024-05-28 06:07:24] [INFO ] Computed 10 invariants in 3 ms
[2024-05-28 06:07:24] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-28 06:07:24] [INFO ] Invariant cache hit.
[2024-05-28 06:07:24] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 56 sub problems to find dead transitions.
[2024-05-28 06:07:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 06:07:24] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:07:24] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:07:24] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:07:24] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:07:24] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:07:24] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:07:24] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 06:07:25] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:07:25] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:07:25] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 57/115 variables, 58/78 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/115 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 115/115 variables, and 78 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1060 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 06:07:25] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:07:25] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-28 06:07:25] [INFO ] Deduced a trap composed of 21 places in 18 ms of which 1 ms to minimize.
[2024-05-28 06:07:25] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:07:25] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:07:25] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:07:25] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-05-28 06:07:26] [INFO ] Deduced a trap composed of 17 places in 16 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 06:07:26] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 06:07:26] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
[2024-05-28 06:07:26] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 57/115 variables, 58/89 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 56/145 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 06:07:26] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:07:26] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:07:26] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:07:26] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:07:26] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:07:26] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 6/151 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 06:07:27] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:07:27] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 2 ms to minimize.
[2024-05-28 06:07:27] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:07:27] [INFO ] Deduced a trap composed of 20 places in 18 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 4/155 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 06:07:27] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/115 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 06:07:27] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:07:27] [INFO ] Deduced a trap composed of 24 places in 18 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/115 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 06:07:28] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:07:28] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 2 ms to minimize.
[2024-05-28 06:07:28] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/115 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 06:07:28] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/115 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/115 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 06:07:29] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/115 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/115 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 18 (OVERLAPS) 0/115 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 115/115 variables, and 163 constraints, problems are : Problem set: 0 solved, 56 unsolved in 5088 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 39/39 constraints]
After SMT, in 6157ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 6158ms
Starting structural reductions in LTL mode, iteration 1 : 58/63 places, 57/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6236 ms. Remains : 58/63 places, 57/62 transitions.
[2024-05-28 06:07:30] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:07:30] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:07:30] [INFO ] Input system was already deterministic with 57 transitions.
[2024-05-28 06:07:30] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:07:30] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:07:30] [INFO ] Time to serialize gal into /tmp/CTLFireability15685927875730826357.gal : 1 ms
[2024-05-28 06:07:30] [INFO ] Time to serialize properties into /tmp/CTLFireability15459905871573305009.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/CTLFireability15685927875730826357.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15459905871573305009.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,695733,0.900986,36232,2,7904,5,125414,6,0,291,185618,0


Converting to forward existential form...Done !
original formula: E((EG(AF((AG((p9==1)) + (p42!=1)))) + !(((E(((((p24==1)&&(p32==1))&&(p59==1))||(((p27==1)&&(p46==1))&&(p60==1))) U AF((p47==1))) + !(EF((...267
=> equivalent forward existential formula: [(EY(FwdU(Init,(EG(!(EG(!((!(E(TRUE U !((p9==1)))) + (p42!=1)))))) + !(((E(((((p24==1)&&(p32==1))&&(p59==1))||((...349
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t14, t19, t23, t24, t26, t29, t30, t31, t32, t33, t3...271
Detected timeout of ITS tools.
[2024-05-28 06:08:00] [INFO ] Flatten gal took : 7 ms
[2024-05-28 06:08:00] [INFO ] Applying decomposition
[2024-05-28 06:08:00] [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/graph7486565797414443844.txt' '-o' '/tmp/graph7486565797414443844.bin' '-w' '/tmp/graph7486565797414443844.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7486565797414443844.bin' '-l' '-1' '-v' '-w' '/tmp/graph7486565797414443844.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:08:00] [INFO ] Decomposing Gal with order
[2024-05-28 06:08:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:08:00] [INFO ] Removed a total of 23 redundant transitions.
[2024-05-28 06:08:00] [INFO ] Flatten gal took : 7 ms
[2024-05-28 06:08:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 06:08:00] [INFO ] Time to serialize gal into /tmp/CTLFireability8531777845478812335.gal : 2 ms
[2024-05-28 06:08:00] [INFO ] Time to serialize properties into /tmp/CTLFireability1818695227774121583.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/CTLFireability8531777845478812335.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1818695227774121583.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,695733,0.056787,6056,354,37,5190,252,200,7642,49,754,0


Converting to forward existential form...Done !
original formula: E((EG(AF((AG((i4.i0.u3.p9==1)) + (i6.u14.p42!=1)))) + !(((E(((((i0.u8.p24==1)&&(i3.u11.p32==1))&&(u18.p59==1))||(((u9.p27==1)&&(u15.p46==...377
=> equivalent forward existential formula: [(EY(FwdU(Init,(EG(!(EG(!((!(E(TRUE U !((i4.i0.u3.p9==1)))) + (i6.u14.p42!=1)))))) + !(((E(((((i0.u8.p24==1)&&(i...459
Reverse transition relation is NOT exact ! Due to transitions t29, t31, t33, u9.t30, u15.t4, u15.t5, u15.t6, u15.t7, u18.t8, u18.t9, u18.t10, i0.u0.t37, i0...394
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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
(forward)formula 0,1,1.89219,93968,1,0,206424,498,1339,251376,265,1429,322587
FORMULA ShieldIIPs-PT-001B-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 62/62 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 56 transition count 55
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 56 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 55 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 55 transition count 54
Applied a total of 16 rules in 8 ms. Remains 55 /63 variables (removed 8) and now considering 54/62 (removed 8) transitions.
// Phase 1: matrix 54 rows 55 cols
[2024-05-28 06:08:02] [INFO ] Computed 10 invariants in 1 ms
[2024-05-28 06:08:02] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-28 06:08:02] [INFO ] Invariant cache hit.
[2024-05-28 06:08:02] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 53 sub problems to find dead transitions.
[2024-05-28 06:08:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:08:03] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:08:03] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-28 06:08:03] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:08:03] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:08:03] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:08:03] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:08:03] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:08:03] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:08:03] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:08:03] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:08:03] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:08:03] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 54/109 variables, 55/77 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:08:03] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:08:03] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 0/109 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 79 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1397 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:08:04] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:08:04] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
[2024-05-28 06:08:04] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 54/109 variables, 55/82 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 53/135 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:08:04] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:08:04] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:08:04] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:08:04] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:08:05] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:08:05] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:08:05] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:08:05] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/109 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (OVERLAPS) 0/109 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 143 constraints, problems are : Problem set: 0 solved, 53 unsolved in 2038 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 25/25 constraints]
After SMT, in 3444ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 3445ms
Starting structural reductions in LTL mode, iteration 1 : 55/63 places, 54/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3529 ms. Remains : 55/63 places, 54/62 transitions.
[2024-05-28 06:08:06] [INFO ] Flatten gal took : 9 ms
[2024-05-28 06:08:06] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:08:06] [INFO ] Input system was already deterministic with 54 transitions.
[2024-05-28 06:08:06] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:08:06] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:08:06] [INFO ] Time to serialize gal into /tmp/CTLFireability4194685283417937504.gal : 1 ms
[2024-05-28 06:08:06] [INFO ] Time to serialize properties into /tmp/CTLFireability914812600607568329.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/CTLFireability4194685283417937504.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability914812600607568329.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,606789,0.476411,23340,2,4634,5,65066,6,0,276,119239,0


Converting to forward existential form...Done !
original formula: E(!(EF((((p24==1)&&(p32==1))&&(p60==1)))) U EF((E(A(((p15==1)&&(p40==1)) U (p17==1)) U EG((((p24==1)&&(p35==1))&&(p60==1)))) + AF(AX((((p...188
=> equivalent forward existential formula: ([FwdG(FwdU(FwdU(FwdU(Init,!(E(TRUE U (((p24==1)&&(p32==1))&&(p60==1))))),TRUE),!((E(!((p17==1)) U (!(((p15==1)&...386
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t13, t18, t27, t28, t29, t30, t31, t33, t34, t35, Inters...246
Hit Full ! (commute/partial/dont) 44/16/10
Using saturation style SCC detection
(forward)formula 0,1,19.9222,600300,1,0,1060,3.31964e+06,166,492,1954,3.96222e+06,1208
FORMULA ShieldIIPs-PT-001B-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 62/62 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 57 transition count 56
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 57 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 56 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 56 transition count 55
Applied a total of 14 rules in 6 ms. Remains 56 /63 variables (removed 7) and now considering 55/62 (removed 7) transitions.
// Phase 1: matrix 55 rows 56 cols
[2024-05-28 06:08:26] [INFO ] Computed 10 invariants in 1 ms
[2024-05-28 06:08:26] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-28 06:08:26] [INFO ] Invariant cache hit.
[2024-05-28 06:08:26] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2024-05-28 06:08:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 06:08:26] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:08:26] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:08:26] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:08:26] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:08:26] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:08:26] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:08:26] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:08:26] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:08:26] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:08:26] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 55/111 variables, 56/76 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 06:08:27] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:08:27] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 06:08:27] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:08:27] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:08:27] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:08:27] [INFO ] Deduced a trap composed of 20 places in 17 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 06:08:27] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/111 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 0/111 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 83 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1683 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 55/111 variables, 56/83 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 54/137 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 06:08:28] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:08:28] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 0 ms to minimize.
[2024-05-28 06:08:28] [INFO ] Deduced a trap composed of 19 places in 17 ms of which 1 ms to minimize.
[2024-05-28 06:08:28] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:08:28] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 5/142 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 06:08:29] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:08:29] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:08:29] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:08:29] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 06:08:29] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 0/111 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 147 constraints, problems are : Problem set: 0 solved, 54 unsolved in 2017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 27/27 constraints]
After SMT, in 3709ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 3710ms
Starting structural reductions in LTL mode, iteration 1 : 56/63 places, 55/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3783 ms. Remains : 56/63 places, 55/62 transitions.
[2024-05-28 06:08:30] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:08:30] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:08:30] [INFO ] Input system was already deterministic with 55 transitions.
[2024-05-28 06:08:30] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:08:30] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:08:30] [INFO ] Time to serialize gal into /tmp/CTLFireability13210947777837003960.gal : 1 ms
[2024-05-28 06:08:30] [INFO ] Time to serialize properties into /tmp/CTLFireability14087991699205244426.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/CTLFireability13210947777837003960.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14087991699205244426.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,610893,0.260683,14628,2,1746,5,37308,6,0,281,72329,0


Converting to forward existential form...Done !
original formula: (AX(EG(((p50==0) + EX((p25==0))))) * E(!(EF(!(((p3==1)&&(p22==1))))) U (EX(!(AG((p39==1)))) + !(((p1==1)&&(p44==1))))))
=> equivalent forward existential formula: ([(EY(Init) * !(EG(((p50==0) + EX((p25==0))))))] = FALSE * [(Init * !(E(!(E(TRUE U !(((p3==1)&&(p22==1))))) U (E...224
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t13, t18, t22, t23, t28, t29, t30, t31, t32, t34, t35, t3...256
(forward)formula 0,1,2.53293,89224,1,0,366,411038,144,151,1764,572757,392
FORMULA ShieldIIPs-PT-001B-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 62/62 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 59 transition count 58
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 59 transition count 58
Applied a total of 8 rules in 7 ms. Remains 59 /63 variables (removed 4) and now considering 58/62 (removed 4) transitions.
// Phase 1: matrix 58 rows 59 cols
[2024-05-28 06:08:32] [INFO ] Computed 10 invariants in 5 ms
[2024-05-28 06:08:32] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-28 06:08:32] [INFO ] Invariant cache hit.
[2024-05-28 06:08:32] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Running 57 sub problems to find dead transitions.
[2024-05-28 06:08:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-28 06:08:33] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:08:33] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:08:33] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:08:33] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:08:33] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:08:33] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:08:33] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 4 ms to minimize.
[2024-05-28 06:08:33] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:08:33] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:08:33] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 0 ms to minimize.
[2024-05-28 06:08:33] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:08:33] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:08:33] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:08:33] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:08:33] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:08:33] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-28 06:08:33] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:08:33] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:08:33] [INFO ] Deduced a trap composed of 21 places in 18 ms of which 1 ms to minimize.
[2024-05-28 06:08:33] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 58/117 variables, 59/89 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-28 06:08:33] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:08:34] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:08:34] [INFO ] Deduced a trap composed of 26 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 3/92 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-28 06:08:34] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:08:34] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:08:34] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-28 06:08:34] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:08:34] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/117 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-28 06:08:34] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:08:34] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:08:34] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/117 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/117 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 12 (OVERLAPS) 0/117 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 100 constraints, problems are : Problem set: 0 solved, 57 unsolved in 2496 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-28 06:08:35] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 58/117 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 57/158 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-28 06:08:35] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:08:35] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:08:35] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:08:36] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:08:36] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:08:36] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 6/164 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-28 06:08:36] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:08:36] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-28 06:08:36] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/117 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 11 (OVERLAPS) 0/117 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 167 constraints, problems are : Problem set: 0 solved, 57 unsolved in 2673 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 41/41 constraints]
After SMT, in 5178ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 5180ms
Starting structural reductions in LTL mode, iteration 1 : 59/63 places, 58/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5272 ms. Remains : 59/63 places, 58/62 transitions.
[2024-05-28 06:08:38] [INFO ] Flatten gal took : 8 ms
[2024-05-28 06:08:38] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:08:38] [INFO ] Input system was already deterministic with 58 transitions.
[2024-05-28 06:08:38] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:08:38] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:08:38] [INFO ] Time to serialize gal into /tmp/CTLFireability17286562043604820901.gal : 0 ms
[2024-05-28 06:08:38] [INFO ] Time to serialize properties into /tmp/CTLFireability12383347877025004412.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/CTLFireability17286562043604820901.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12383347877025004412.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,620769,0.348703,17816,2,2501,5,45968,6,0,296,93852,0


Converting to forward existential form...Done !
original formula: AX((AF((((p29==1)&&(p43==0))&&((p43==0)&&(p46==0)))) + (p39==1)))
=> equivalent forward existential formula: [FwdG((EY(Init) * !((p39==1))),!((((p29==1)&&(p43==0))&&((p43==0)&&(p46==0)))))] = FALSE
Hit Full ! (commute/partial/dont) 50/0/8
(forward)formula 0,0,1.55993,54796,1,0,75,202065,22,6,1477,310138,72
FORMULA ShieldIIPs-PT-001B-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 63/63 places, 62/62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 62 transition count 55
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 56 transition count 55
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 12 place count 56 transition count 49
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 50 transition count 49
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 30 place count 44 transition count 43
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 44 transition count 43
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 36 place count 44 transition count 40
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 42 place count 41 transition count 40
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 68 place count 28 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 27 transition count 26
Applied a total of 69 rules in 23 ms. Remains 27 /63 variables (removed 36) and now considering 26/62 (removed 36) transitions.
// Phase 1: matrix 26 rows 27 cols
[2024-05-28 06:08:39] [INFO ] Computed 10 invariants in 0 ms
[2024-05-28 06:08:39] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-28 06:08:39] [INFO ] Invariant cache hit.
[2024-05-28 06:08:39] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-28 06:08:39] [INFO ] Redundant transitions in 11 ms returned []
Running 25 sub problems to find dead transitions.
[2024-05-28 06:08:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-28 06:08:39] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:08:39] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 26/53 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 0/53 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 39 constraints, problems are : Problem set: 0 solved, 25 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 26/53 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 25/64 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-28 06:08:40] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/53 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 0/53 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/53 variables, and 65 constraints, problems are : Problem set: 0 solved, 25 unsolved in 354 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 3/3 constraints]
After SMT, in 635ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 635ms
Starting structural reductions in SI_CTL mode, iteration 1 : 27/63 places, 26/62 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 728 ms. Remains : 27/63 places, 26/62 transitions.
[2024-05-28 06:08:40] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:08:40] [INFO ] Flatten gal took : 1 ms
[2024-05-28 06:08:40] [INFO ] Input system was already deterministic with 26 transitions.
[2024-05-28 06:08:40] [INFO ] Flatten gal took : 1 ms
[2024-05-28 06:08:40] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:08:40] [INFO ] Time to serialize gal into /tmp/CTLFireability15787206784918518602.gal : 1 ms
[2024-05-28 06:08:40] [INFO ] Time to serialize properties into /tmp/CTLFireability7690418392333110965.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/CTLFireability15787206784918518602.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7690418392333110965.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,8377,0.034186,4932,2,364,5,5967,6,0,137,9722,0


Converting to forward existential form...Done !
original formula: AG((EG(AF((p26==1))) + (p45==1)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((p45==1))) * !(EG(!(EG(!((p26==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t21, t22, t23, t24, t25, Intersection with reachable at ...221
Using saturation style SCC detection
(forward)formula 0,0,0.104608,7836,1,0,167,23550,83,83,968,23901,166
FORMULA ShieldIIPs-PT-001B-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 62/62 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 57 transition count 56
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 57 transition count 56
Applied a total of 12 rules in 2 ms. Remains 57 /63 variables (removed 6) and now considering 56/62 (removed 6) transitions.
// Phase 1: matrix 56 rows 57 cols
[2024-05-28 06:08:40] [INFO ] Computed 10 invariants in 2 ms
[2024-05-28 06:08:40] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-28 06:08:40] [INFO ] Invariant cache hit.
[2024-05-28 06:08:40] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 55 sub problems to find dead transitions.
[2024-05-28 06:08:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 06:08:40] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:08:40] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:08:40] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:08:40] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:08:40] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:08:40] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:08:41] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:08:41] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 5 ms to minimize.
[2024-05-28 06:08:41] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 06:08:41] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:08:41] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 56/113 variables, 57/78 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 06:08:41] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:08:41] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 06:08:41] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:08:41] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 06:08:41] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 3 ms to minimize.
[2024-05-28 06:08:41] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 06:08:42] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/113 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 12 (OVERLAPS) 0/113 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 85 constraints, problems are : Problem set: 0 solved, 55 unsolved in 2044 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 06:08:42] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:08:42] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:08:42] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:08:42] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:08:42] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 56/113 variables, 57/90 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 55/145 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 06:08:43] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:08:43] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:08:43] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:08:43] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 4/149 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 06:08:43] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 0/113 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 150 constraints, problems are : Problem set: 0 solved, 55 unsolved in 2057 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 28/28 constraints]
After SMT, in 4109ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 4109ms
Starting structural reductions in LTL mode, iteration 1 : 57/63 places, 56/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4188 ms. Remains : 57/63 places, 56/62 transitions.
[2024-05-28 06:08:44] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:08:44] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:08:44] [INFO ] Input system was already deterministic with 56 transitions.
[2024-05-28 06:08:44] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:08:44] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:08:44] [INFO ] Time to serialize gal into /tmp/CTLFireability15690319479610605627.gal : 1 ms
[2024-05-28 06:08:44] [INFO ] Time to serialize properties into /tmp/CTLFireability9477723371298262750.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/CTLFireability15690319479610605627.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9477723371298262750.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,617217,0.645101,27624,2,5492,5,85351,6,0,286,144477,0


Converting to forward existential form...Done !
original formula: (AX(AG(((EF((p9==1)) + E(((p18==1)&&(p34==1)) U (p37==1))) + ((p4==1)||(((p18==1)&&(p35==1))&&(p23==1)))))) * EF((((((p20==1)&&(p49==1)) ...220
=> equivalent forward existential formula: ([(((FwdU(EY(Init),TRUE) * !(((p4==1)||(((p18==1)&&(p35==1))&&(p23==1))))) * !(E(((p18==1)&&(p34==1)) U (p37==1)...326
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t13, t18, t25, t27, t28, t29, t30, t31, t32, t34, t35, t3...256
(forward)formula 0,0,5.14964,157344,1,0,220,807189,146,105,1887,844242,224
FORMULA ShieldIIPs-PT-001B-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 62/62 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 56 transition count 55
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 56 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 55 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 55 transition count 54
Applied a total of 16 rules in 4 ms. Remains 55 /63 variables (removed 8) and now considering 54/62 (removed 8) transitions.
// Phase 1: matrix 54 rows 55 cols
[2024-05-28 06:08:49] [INFO ] Computed 10 invariants in 0 ms
[2024-05-28 06:08:49] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-28 06:08:49] [INFO ] Invariant cache hit.
[2024-05-28 06:08:50] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 53 sub problems to find dead transitions.
[2024-05-28 06:08:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:08:50] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:08:50] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:08:50] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:08:50] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:08:50] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:08:50] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:08:50] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:08:50] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:08:50] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:08:50] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:08:50] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:08:50] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 54/109 variables, 55/77 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:08:51] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:08:51] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 0/109 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 79 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1374 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:08:51] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:08:51] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 1 ms to minimize.
[2024-05-28 06:08:51] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 54/109 variables, 55/82 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 53/135 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:08:51] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:08:51] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:08:51] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:08:52] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:08:52] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:08:52] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:08:52] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 1 ms to minimize.
[2024-05-28 06:08:52] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/109 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (OVERLAPS) 0/109 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 143 constraints, problems are : Problem set: 0 solved, 53 unsolved in 2002 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 25/25 constraints]
After SMT, in 3381ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 3381ms
Starting structural reductions in LTL mode, iteration 1 : 55/63 places, 54/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3466 ms. Remains : 55/63 places, 54/62 transitions.
[2024-05-28 06:08:53] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:08:53] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:08:53] [INFO ] Input system was already deterministic with 54 transitions.
[2024-05-28 06:08:53] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:08:53] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:08:53] [INFO ] Time to serialize gal into /tmp/CTLFireability10296088421901360837.gal : 1 ms
[2024-05-28 06:08:53] [INFO ] Time to serialize properties into /tmp/CTLFireability3263001085740053798.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/CTLFireability10296088421901360837.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3263001085740053798.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,606789,0.511347,23336,2,4634,5,65066,6,0,276,119239,0


Converting to forward existential form...Done !
original formula: E(EF((EF(!(AX((p46==1)))) + (p6==1))) U (p57==1))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U (E(TRUE U !(!(EX(!((p46==1)))))) + (p6==1)))) * (p57==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t13, t18, t27, t28, t29, t30, t31, t33, t34, t35, Inters...246
(forward)formula 0,1,8.77077,281184,1,0,371,1.12532e+06,136,273,1743,2.11448e+06,444
FORMULA ShieldIIPs-PT-001B-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 63/63 places, 62/62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 62 transition count 59
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 60 transition count 59
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4 place count 60 transition count 52
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 18 place count 53 transition count 52
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 22 place count 49 transition count 48
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 49 transition count 48
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 52 place count 36 transition count 35
Applied a total of 52 rules in 7 ms. Remains 36 /63 variables (removed 27) and now considering 35/62 (removed 27) transitions.
// Phase 1: matrix 35 rows 36 cols
[2024-05-28 06:09:02] [INFO ] Computed 10 invariants in 0 ms
[2024-05-28 06:09:02] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-28 06:09:02] [INFO ] Invariant cache hit.
[2024-05-28 06:09:02] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-28 06:09:02] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-05-28 06:09:02] [INFO ] Redundant transitions in 1 ms returned []
Running 34 sub problems to find dead transitions.
[2024-05-28 06:09:02] [INFO ] Invariant cache hit.
[2024-05-28 06:09:02] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 1/36 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-28 06:09:02] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:09:02] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2024-05-28 06:09:02] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:09:02] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-28 06:09:02] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:09:02] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
[2024-05-28 06:09:02] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 35/71 variables, 36/53 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 0/71 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 71/71 variables, and 57 constraints, problems are : Problem set: 0 solved, 34 unsolved in 678 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 36/36 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 1/36 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 35/71 variables, 36/53 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 34/91 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-28 06:09:03] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-28 06:09:03] [INFO ] Deduced a trap composed of 16 places in 17 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/71 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (OVERLAPS) 0/71 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 71/71 variables, and 93 constraints, problems are : Problem set: 0 solved, 34 unsolved in 621 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 36/36 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 9/9 constraints]
After SMT, in 1305ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 1305ms
Starting structural reductions in SI_CTL mode, iteration 1 : 36/63 places, 35/62 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1380 ms. Remains : 36/63 places, 35/62 transitions.
[2024-05-28 06:09:03] [INFO ] Flatten gal took : 1 ms
[2024-05-28 06:09:03] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:09:03] [INFO ] Input system was already deterministic with 35 transitions.
[2024-05-28 06:09:03] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:09:03] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:09:03] [INFO ] Time to serialize gal into /tmp/CTLFireability16162610369098134100.gal : 1 ms
[2024-05-28 06:09:03] [INFO ] Time to serialize properties into /tmp/CTLFireability16404284451910429455.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/CTLFireability16162610369098134100.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16404284451910429455.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,14996,0.065298,6848,2,821,5,12270,6,0,179,20354,0


Converting to forward existential form...Done !
original formula: AF(EG((((AF((p58!=1)) * (p5==1)) * (AF((p53!=1)) * ((p36!=1)||(p43!=1)))) * (AG((p16==1)) + ((p56!=1)&&((p7==1)||(((p24==1)&&(p35==1))&&(...169
=> equivalent forward existential formula: [FwdG(Init,!(EG((((!(EG(!((p58!=1)))) * (p5==1)) * (!(EG(!((p53!=1)))) * ((p36!=1)||(p43!=1)))) * (!(E(TRUE U !(...238
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t10, t11, t13, t20, t31, t32, t33, Intersection with reachab...227
(forward)formula 0,0,0.539995,24356,1,0,462,115401,116,194,1265,124571,547
FORMULA ShieldIIPs-PT-001B-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 62/62 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 59 transition count 58
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 59 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 58 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 58 transition count 57
Applied a total of 10 rules in 4 ms. Remains 58 /63 variables (removed 5) and now considering 57/62 (removed 5) transitions.
// Phase 1: matrix 57 rows 58 cols
[2024-05-28 06:09:04] [INFO ] Computed 10 invariants in 0 ms
[2024-05-28 06:09:04] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-28 06:09:04] [INFO ] Invariant cache hit.
[2024-05-28 06:09:04] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Running 56 sub problems to find dead transitions.
[2024-05-28 06:09:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 06:09:04] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:09:04] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:09:04] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:09:04] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:09:04] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:09:04] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-28 06:09:04] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:09:04] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:09:04] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:09:04] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:09:04] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:09:04] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 06:09:04] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:09:05] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:09:05] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 06:09:05] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:09:05] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:09:05] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 06:09:05] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 57/115 variables, 58/87 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 06:09:05] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:09:05] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:09:05] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:09:05] [INFO ] Deduced a trap composed of 16 places in 17 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/115 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 11 (OVERLAPS) 0/115 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 115/115 variables, and 91 constraints, problems are : Problem set: 0 solved, 56 unsolved in 2017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 06:09:06] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 57/115 variables, 58/92 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 56/148 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 06:09:06] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 06:09:07] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 10 (OVERLAPS) 0/115 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 115/115 variables, and 150 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1792 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 26/26 constraints]
After SMT, in 3815ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 3817ms
Starting structural reductions in LTL mode, iteration 1 : 58/63 places, 57/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3887 ms. Remains : 58/63 places, 57/62 transitions.
[2024-05-28 06:09:08] [INFO ] Flatten gal took : 8 ms
[2024-05-28 06:09:08] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:09:08] [INFO ] Input system was already deterministic with 57 transitions.
[2024-05-28 06:09:08] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:09:08] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:09:08] [INFO ] Time to serialize gal into /tmp/CTLFireability2075336131625027362.gal : 0 ms
[2024-05-28 06:09:08] [INFO ] Time to serialize properties into /tmp/CTLFireability5052947213116741606.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2075336131625027362.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5052947213116741606.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,665241,0.218184,13324,2,1645,5,33135,6,0,291,62548,0


Converting to forward existential form...Done !
original formula: (EG(((AX(AF(((p20==0)||(p48==0)))) + A(E((((p27==1)&&(p46==1))&&(p57==1)) U (((p24==1)&&(p35==1))&&(p60==1))) U E((p58==1) U (p53==1)))) ...465
=> equivalent forward existential formula: ([FwdG(Init,((!(EX(!(!(EG(!(((p20==0)||(p48==0)))))))) + !((E(!(E((p58==1) U (p53==1))) U (!(E((((p27==1)&&(p46=...1802
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t15, t18, t21, t23, t30, t31, t32, t33, t34, t36, t3...261
Using saturation style SCC detection
(forward)formula 0,1,5.48569,196696,1,0,954,1.03892e+06,162,516,1959,1.46827e+06,1006
FORMULA ShieldIIPs-PT-001B-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 62/62 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 56 transition count 55
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 56 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 55 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 55 transition count 54
Applied a total of 16 rules in 10 ms. Remains 55 /63 variables (removed 8) and now considering 54/62 (removed 8) transitions.
// Phase 1: matrix 54 rows 55 cols
[2024-05-28 06:09:13] [INFO ] Computed 10 invariants in 1 ms
[2024-05-28 06:09:13] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-28 06:09:13] [INFO ] Invariant cache hit.
[2024-05-28 06:09:13] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Running 53 sub problems to find dead transitions.
[2024-05-28 06:09:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:09:13] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:09:13] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:09:13] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:09:14] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:09:14] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:09:14] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:09:14] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:09:14] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:09:14] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:09:14] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:09:14] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:09:14] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 54/109 variables, 55/77 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:09:14] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:09:14] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 0/109 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 79 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1397 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:09:15] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:09:15] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:09:15] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 54/109 variables, 55/82 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 53/135 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:09:15] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:09:15] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:09:15] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:09:15] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:09:16] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:09:16] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:09:16] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:09:16] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/109 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (OVERLAPS) 0/109 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 143 constraints, problems are : Problem set: 0 solved, 53 unsolved in 2057 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 25/25 constraints]
After SMT, in 3459ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 3461ms
Starting structural reductions in LTL mode, iteration 1 : 55/63 places, 54/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3542 ms. Remains : 55/63 places, 54/62 transitions.
[2024-05-28 06:09:17] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:09:17] [INFO ] Flatten gal took : 1 ms
[2024-05-28 06:09:17] [INFO ] Input system was already deterministic with 54 transitions.
[2024-05-28 06:09:17] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:09:17] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:09:17] [INFO ] Time to serialize gal into /tmp/CTLFireability3946148664134489251.gal : 2 ms
[2024-05-28 06:09:17] [INFO ] Time to serialize properties into /tmp/CTLFireability6857884126700524546.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/CTLFireability3946148664134489251.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6857884126700524546.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,606789,0.48995,23336,2,4634,5,65066,6,0,276,119239,0


Converting to forward existential form...Done !
original formula: AX((EG(EX(((p20==0)||(p48==0)))) * ((p46==1) + (EX(TRUE) * EF(AX((p10==0)))))))
=> equivalent forward existential formula: ([(EY(Init) * !(EG(EX(((p20==0)||(p48==0))))))] = FALSE * ([((EY(Init) * !((p46==1))) * !(EX(TRUE)))] = FALSE * ...227
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t13, t18, t27, t28, t29, t30, t31, t33, t34, t35, Inters...246
Using saturation style SCC detection
(forward)formula 0,1,3.4917,118176,1,0,245,614193,141,118,1785,570157,254
FORMULA ShieldIIPs-PT-001B-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 62/62 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 57 transition count 56
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 57 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 56 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 56 transition count 55
Applied a total of 14 rules in 2 ms. Remains 56 /63 variables (removed 7) and now considering 55/62 (removed 7) transitions.
// Phase 1: matrix 55 rows 56 cols
[2024-05-28 06:09:20] [INFO ] Computed 10 invariants in 1 ms
[2024-05-28 06:09:20] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-28 06:09:20] [INFO ] Invariant cache hit.
[2024-05-28 06:09:20] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2024-05-28 06:09:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 06:09:21] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:09:21] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:09:21] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:09:21] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-05-28 06:09:21] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 1 ms to minimize.
[2024-05-28 06:09:21] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:09:21] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:09:21] [INFO ] Deduced a trap composed of 9 places in 15 ms of which 0 ms to minimize.
[2024-05-28 06:09:21] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:09:21] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 0 ms to minimize.
[2024-05-28 06:09:21] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
[2024-05-28 06:09:21] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 0 ms to minimize.
[2024-05-28 06:09:21] [INFO ] Deduced a trap composed of 18 places in 16 ms of which 0 ms to minimize.
[2024-05-28 06:09:21] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:09:21] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:09:21] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
[2024-05-28 06:09:21] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 0 ms to minimize.
[2024-05-28 06:09:21] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 06:09:21] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:09:21] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 0 ms to minimize.
[2024-05-28 06:09:21] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:09:21] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 55/111 variables, 56/88 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 06:09:21] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:09:21] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 06:09:22] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/111 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 0/111 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 91 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1846 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 55/111 variables, 56/91 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 54/145 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 06:09:23] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:09:23] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 06:09:23] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 0/111 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 148 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1610 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 28/28 constraints]
After SMT, in 3463ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 3464ms
Starting structural reductions in LTL mode, iteration 1 : 56/63 places, 55/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3531 ms. Remains : 56/63 places, 55/62 transitions.
[2024-05-28 06:09:24] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:09:24] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:09:24] [INFO ] Input system was already deterministic with 55 transitions.
[2024-05-28 06:09:24] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:09:24] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:09:24] [INFO ] Time to serialize gal into /tmp/CTLFireability10190673907833360335.gal : 1 ms
[2024-05-28 06:09:24] [INFO ] Time to serialize properties into /tmp/CTLFireability7992501341959477844.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/CTLFireability10190673907833360335.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7992501341959477844.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,606789,0.7309,25412,2,4541,5,73210,6,0,281,129601,0


Converting to forward existential form...Done !
original formula: AF((AG((p23==1)) * ((AX((p6==1)) * EX((p53==0))) + (EX((p57==1)) * ((((p17==0)&&(p55==0))&&(p9==0))||(((p4==0)&&(p14==1))&&((p41==1)&&(((...191
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !((p23==1)))) * ((!(EX(!((p6==1)))) * EX((p53==0))) + (EX((p57==1)) * ((((p17==0)&&(p55...254
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t14, t17, t19, t28, t29, t30, t31, t32, t34, t35, t36, I...251
(forward)formula 0,0,2.46816,62440,1,0,192,228537,141,74,1858,326801,181
FORMULA ShieldIIPs-PT-001B-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 63/63 places, 62/62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 62 transition count 55
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 56 transition count 55
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 12 place count 56 transition count 49
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 50 transition count 49
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 31 place count 43 transition count 42
Iterating global reduction 2 with 7 rules applied. Total rules applied 38 place count 43 transition count 42
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 38 place count 43 transition count 39
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 44 place count 40 transition count 39
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 68 place count 28 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 27 transition count 26
Applied a total of 69 rules in 17 ms. Remains 27 /63 variables (removed 36) and now considering 26/62 (removed 36) transitions.
// Phase 1: matrix 26 rows 27 cols
[2024-05-28 06:09:26] [INFO ] Computed 10 invariants in 1 ms
[2024-05-28 06:09:26] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-28 06:09:26] [INFO ] Invariant cache hit.
[2024-05-28 06:09:26] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-28 06:09:26] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-28 06:09:26] [INFO ] Redundant transitions in 11 ms returned [25]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 24 sub problems to find dead transitions.
// Phase 1: matrix 25 rows 27 cols
[2024-05-28 06:09:26] [INFO ] Computed 10 invariants in 0 ms
[2024-05-28 06:09:26] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-28 06:09:26] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
[2024-05-28 06:09:26] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:09:27] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 25/52 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 43 constraints, problems are : Problem set: 0 solved, 24 unsolved in 287 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 27/27 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 1/27 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 25/52 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 24/67 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 0/52 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 67 constraints, problems are : Problem set: 0 solved, 24 unsolved in 262 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 27/27 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 3/3 constraints]
After SMT, in 557ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 557ms
Starting structural reductions in SI_CTL mode, iteration 1 : 27/63 places, 25/62 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 665 ms. Remains : 27/63 places, 25/62 transitions.
[2024-05-28 06:09:27] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:09:27] [INFO ] Flatten gal took : 1 ms
[2024-05-28 06:09:27] [INFO ] Input system was already deterministic with 25 transitions.
[2024-05-28 06:09:27] [INFO ] Flatten gal took : 1 ms
[2024-05-28 06:09:27] [INFO ] Flatten gal took : 1 ms
[2024-05-28 06:09:27] [INFO ] Time to serialize gal into /tmp/CTLFireability12539301752629479347.gal : 1 ms
[2024-05-28 06:09:27] [INFO ] Time to serialize properties into /tmp/CTLFireability10558804626475186148.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/CTLFireability12539301752629479347.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10558804626475186148.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,3392,0.034284,4668,2,393,5,5616,6,0,133,8680,0


Converting to forward existential form...Done !
original formula: EF(AG((p7==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p7==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t13, t20, t21, t22, t23, t24, Intersection with reachable at eac...218
(forward)formula 0,0,0.057228,5196,1,0,73,8583,72,29,910,8680,63
FORMULA ShieldIIPs-PT-001B-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 62/62 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 57 transition count 56
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 57 transition count 56
Applied a total of 12 rules in 2 ms. Remains 57 /63 variables (removed 6) and now considering 56/62 (removed 6) transitions.
// Phase 1: matrix 56 rows 57 cols
[2024-05-28 06:09:27] [INFO ] Computed 10 invariants in 1 ms
[2024-05-28 06:09:27] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-28 06:09:27] [INFO ] Invariant cache hit.
[2024-05-28 06:09:27] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Running 55 sub problems to find dead transitions.
[2024-05-28 06:09:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 06:09:27] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:09:27] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:09:27] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:09:27] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:09:27] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:09:27] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:09:27] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 0 ms to minimize.
[2024-05-28 06:09:27] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 0 ms to minimize.
[2024-05-28 06:09:28] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 06:09:28] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:09:28] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 56/113 variables, 57/78 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 06:09:28] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-28 06:09:28] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 06:09:28] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:09:28] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 06:09:28] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:09:28] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 06:09:29] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/113 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 12 (OVERLAPS) 0/113 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 85 constraints, problems are : Problem set: 0 solved, 55 unsolved in 2016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 06:09:29] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:09:29] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:09:29] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:09:29] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:09:29] [INFO ] Deduced a trap composed of 23 places in 19 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 56/113 variables, 57/90 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 55/145 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 06:09:30] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:09:30] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:09:30] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:09:30] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 4/149 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 06:09:30] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 0/113 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 150 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1986 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 28/28 constraints]
After SMT, in 4010ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 4011ms
Starting structural reductions in LTL mode, iteration 1 : 57/63 places, 56/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4083 ms. Remains : 57/63 places, 56/62 transitions.
[2024-05-28 06:09:31] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:09:31] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:09:31] [INFO ] Input system was already deterministic with 56 transitions.
[2024-05-28 06:09:31] [INFO ] Flatten gal took : 1 ms
[2024-05-28 06:09:31] [INFO ] Flatten gal took : 1 ms
[2024-05-28 06:09:31] [INFO ] Time to serialize gal into /tmp/CTLFireability9251300168544845292.gal : 0 ms
[2024-05-28 06:09:31] [INFO ] Time to serialize properties into /tmp/CTLFireability16295736513011462744.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/CTLFireability9251300168544845292.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16295736513011462744.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,617217,0.576169,27628,2,5492,5,85351,6,0,286,144477,0


Converting to forward existential form...Done !
original formula: (A(A(((EF((p8==1)) * !((!(((p1==1)&&(p44==1))) + AG((((p27==1)&&(p49==1))&&(p57==1)))))) * ((p36!=1)&&(p26!=1))) U !(EX((((p28==1)&&(p27=...315
=> equivalent forward existential formula: [(FwdU((Init * !(!((E(!((p13==1)) U (!(!((E(!(!(EX((((p28==1)&&(p27==1))&&((p49==1)&&(p60==1)))))) U (!(((E(TRUE...554
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t13, t18, t25, t27, t28, t29, t30, t31, t32, t34, t35, t3...256
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-28 06:10:01] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:10:01] [INFO ] Applying decomposition
[2024-05-28 06:10:01] [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/graph3974744554071829053.txt' '-o' '/tmp/graph3974744554071829053.bin' '-w' '/tmp/graph3974744554071829053.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3974744554071829053.bin' '-l' '-1' '-v' '-w' '/tmp/graph3974744554071829053.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:10:01] [INFO ] Decomposing Gal with order
[2024-05-28 06:10:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:10:01] [INFO ] Removed a total of 23 redundant transitions.
[2024-05-28 06:10:01] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:10:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-28 06:10:01] [INFO ] Time to serialize gal into /tmp/CTLFireability12086165046206893603.gal : 1 ms
[2024-05-28 06:10:01] [INFO ] Time to serialize properties into /tmp/CTLFireability11822558672722733444.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/CTLFireability12086165046206893603.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11822558672722733444.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,617217,0.080721,7360,372,31,8400,182,193,12723,45,478,0


Converting to forward existential form...Done !
original formula: (A(A(((EF((i2.u3.p8==1)) * !((!(((i5.u0.p1==1)&&(u16.p44==1))) + AG((((i2.u10.p27==1)&&(i7.u17.p49==1))&&(u19.p57==1)))))) * ((i4.u11.p36...453
=> equivalent forward existential formula: [(FwdU((Init * !(!((E(!((i1.u5.p13==1)) U (!(!((E(!(!(EX((((i4.u13.p28==1)&&(i2.u10.p27==1))&&((i7.u17.p49==1)&&...760
Reverse transition relation is NOT exact ! Due to transitions t28, t32, u16.t4, u16.t5, u16.t6, u19.t7, u19.t8, u19.t9, i0.t30, i0.u9.t31, i1.u5.t35, i2.u1...359
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,3.67797,175528,1,0,415882,304,1162,476604,218,723,513203
FORMULA ShieldIIPs-PT-001B-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2024-05-28 06:10:05] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:10:05] [INFO ] Flatten gal took : 2 ms
Total runtime 221045 ms.

BK_STOP 1716876605492

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-001B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ShieldIIPs-PT-001B, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683760200010"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-001B.tgz
mv ShieldIIPs-PT-001B execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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