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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 21:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 11 21:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 21:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 11 21:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:55 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 24K 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 ShieldRVt-PT-002B-CTLFireability-2024-00
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-2024-01
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-2024-02
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-2024-03
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-2024-04
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-2024-05
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-2024-06
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-2024-07
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-2024-08
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-2024-09
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-2024-10
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-2024-11
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-2023-12
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-2023-13
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-2023-14
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717075359210

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-002B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-30 13:22:40] [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-30 13:22:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 13:22:40] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2024-05-30 13:22:40] [INFO ] Transformed 103 places.
[2024-05-30 13:22:40] [INFO ] Transformed 103 transitions.
[2024-05-30 13:22:40] [INFO ] Found NUPN structural information;
[2024-05-30 13:22:40] [INFO ] Parsed PT model containing 103 places and 103 transitions and 242 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 73 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 99 transition count 99
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 99 transition count 99
Applied a total of 8 rules in 24 ms. Remains 99 /103 variables (removed 4) and now considering 99/103 (removed 4) transitions.
// Phase 1: matrix 99 rows 99 cols
[2024-05-30 13:22:40] [INFO ] Computed 9 invariants in 7 ms
[2024-05-30 13:22:40] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-30 13:22:40] [INFO ] Invariant cache hit.
[2024-05-30 13:22:41] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-30 13:22:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-30 13:22:41] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 8 ms to minimize.
[2024-05-30 13:22:41] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:22:41] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:22:41] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:22:41] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:22:41] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:22:42] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-05-30 13:22:42] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:22:42] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:22:42] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-05-30 13:22:42] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-05-30 13:22:42] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-05-30 13:22:42] [INFO ] Deduced a trap composed of 29 places in 23 ms of which 1 ms to minimize.
[2024-05-30 13:22:42] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:22:42] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 1 ms to minimize.
[2024-05-30 13:22:42] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-05-30 13:22:42] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 17/26 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-30 13:22:42] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-05-30 13:22:42] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:22:43] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-30 13:22:43] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:22:43] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:22:43] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:22:43] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 7/33 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-30 13:22:43] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:22:43] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:22:43] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
[2024-05-30 13:22:43] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-30 13:22:44] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-30 13:22:44] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-30 13:22:44] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:22:44] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-30 13:22:45] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:22:45] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:22:45] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-30 13:22:45] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:22:45] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:22:45] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:22:45] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:22:45] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:22:45] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-05-30 13:22:45] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-30 13:22:46] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:22:46] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-30 13:22:46] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-30 13:22:46] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-30 13:22:46] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/99 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/99 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 99/198 variables, 99/155 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-30 13:22:47] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/198 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/198 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 16 (OVERLAPS) 0/198 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 156 constraints, problems are : Problem set: 0 solved, 98 unsolved in 7100 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 48/57 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 99/198 variables, 99/156 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 98/254 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-30 13:22:48] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:22:48] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:22:49] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 3/257 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-30 13:22:49] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:22:49] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:22:49] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-30 13:22:50] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 0/198 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 261 constraints, problems are : Problem set: 0 solved, 98 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 55/55 constraints]
After SMT, in 12173ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 12193ms
Starting structural reductions in LTL mode, iteration 1 : 99/103 places, 99/103 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12571 ms. Remains : 99/103 places, 99/103 transitions.
Support contains 73 out of 99 places after structural reductions.
[2024-05-30 13:22:53] [INFO ] Flatten gal took : 26 ms
[2024-05-30 13:22:53] [INFO ] Flatten gal took : 9 ms
[2024-05-30 13:22:53] [INFO ] Input system was already deterministic with 99 transitions.
Support contains 70 out of 99 places (down from 73) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 72 to 71
RANDOM walk for 40000 steps (21 resets) in 1491 ms. (26 steps per ms) remains 5/71 properties
BEST_FIRST walk for 40003 steps (8 resets) in 74 ms. (533 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 83 ms. (476 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (9 resets) in 67 ms. (588 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 136 ms. (291 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (10 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
[2024-05-30 13:22:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 1 (OVERLAPS) 46/52 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 47/99 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 99/198 variables, 99/108 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-30 13:22:54] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:22:54] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 2/110 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 110 constraints, problems are : Problem set: 1 solved, 2 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 32/36 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-30 13:22:54] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
Problem AtomicPropp10 is UNSAT
[2024-05-30 13:22:54] [INFO ] Deduced a trap composed of 24 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 2/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 63/99 variables, 6/11 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 2/13 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 99/198 variables, 99/112 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 1/113 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-30 13:22:54] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:22:54] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 2/115 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/115 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/198 variables, 0/115 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 115 constraints, problems are : Problem set: 2 solved, 1 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 6/6 constraints]
After SMT, in 353ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 99/99 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 99 transition count 72
Reduce places removed 27 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 55 place count 72 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 71 transition count 71
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 56 place count 71 transition count 62
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 74 place count 62 transition count 62
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 85 place count 51 transition count 51
Iterating global reduction 3 with 11 rules applied. Total rules applied 96 place count 51 transition count 51
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 96 place count 51 transition count 44
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 110 place count 44 transition count 44
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 142 place count 28 transition count 28
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 154 place count 22 transition count 34
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 155 place count 22 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 156 place count 21 transition count 32
Applied a total of 156 rules in 24 ms. Remains 21 /99 variables (removed 78) and now considering 32/99 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 21/99 places, 32/99 transitions.
RANDOM walk for 31684 steps (187 resets) in 285 ms. (110 steps per ms) remains 0/1 properties
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
FORMULA ShieldRVt-PT-002B-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 13:22:54] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:22:54] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:22:54] [INFO ] Input system was already deterministic with 99 transitions.
Computed a total of 30 stabilizing places and 30 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 99/99 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 83 transition count 83
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 83 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 82 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 82 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 81 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 81 transition count 81
Applied a total of 36 rules in 10 ms. Remains 81 /99 variables (removed 18) and now considering 81/99 (removed 18) transitions.
// Phase 1: matrix 81 rows 81 cols
[2024-05-30 13:22:54] [INFO ] Computed 9 invariants in 7 ms
[2024-05-30 13:22:54] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-30 13:22:54] [INFO ] Invariant cache hit.
[2024-05-30 13:22:54] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-30 13:22:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 13:22:55] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:22:55] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:22:55] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:22:55] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-30 13:22:55] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 81/162 variables, 81/95 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 0/162 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 95 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1452 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 81/162 variables, 81/95 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 80/175 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 13:22:56] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:22:56] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:22:56] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:22:56] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:22:57] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:22:57] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 6/181 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 13:22:57] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:22:57] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:22:57] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 3/184 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 0/162 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 184 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2660 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 14/14 constraints]
After SMT, in 4127ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 4128ms
Starting structural reductions in LTL mode, iteration 1 : 81/99 places, 81/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4238 ms. Remains : 81/99 places, 81/99 transitions.
[2024-05-30 13:22:58] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:22:58] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:22:58] [INFO ] Input system was already deterministic with 81 transitions.
[2024-05-30 13:22:58] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:22:58] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:22:58] [INFO ] Time to serialize gal into /tmp/CTLFireability18034409576965832244.gal : 2 ms
[2024-05-30 13:22:58] [INFO ] Time to serialize properties into /tmp/CTLFireability15187060995980343696.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/CTLFireability18034409576965832244.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15187060995980343696.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,3.37076e+07,0.071858,6448,2,613,5,10438,6,0,407,18807,0


Converting to forward existential form...Done !
original formula: EG(((!(E(EG((p49==1)) U AX((p65==1)))) + A((p91!=1) U EX(((p91==1)&&(p42==1))))) + (EF((p98==1)) + ((p86==0) * (AF((p23==1)) + AX((p46==0...162
=> equivalent forward existential formula: [FwdG(Init,((!(E(EG((p49==1)) U !(EX(!((p65==1)))))) + !((E(!(EX(((p91==1)&&(p42==1)))) U (!((p91!=1)) * !(EX(((...306
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t30, t36, t40, t41, t46, t50, t55, t59, t60, t63, t67, t70, ...258
Using saturation style SCC detection
(forward)formula 0,1,27.2549,812184,1,0,2037,4.13976e+06,215,1114,2529,7.64045e+06,2219
FORMULA ShieldRVt-PT-002B-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 99/99 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 98 transition count 68
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 62 place count 68 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 67 transition count 66
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 63 place count 67 transition count 58
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 79 place count 59 transition count 58
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 91 place count 47 transition count 46
Iterating global reduction 3 with 12 rules applied. Total rules applied 103 place count 47 transition count 46
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 103 place count 47 transition count 39
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 117 place count 40 transition count 39
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 3 with 26 rules applied. Total rules applied 143 place count 27 transition count 26
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 145 place count 25 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 146 place count 24 transition count 24
Applied a total of 146 rules in 12 ms. Remains 24 /99 variables (removed 75) and now considering 24/99 (removed 75) transitions.
// Phase 1: matrix 24 rows 24 cols
[2024-05-30 13:23:26] [INFO ] Computed 8 invariants in 1 ms
[2024-05-30 13:23:26] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-30 13:23:26] [INFO ] Invariant cache hit.
[2024-05-30 13:23:26] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-30 13:23:26] [INFO ] Redundant transitions in 0 ms returned []
Running 23 sub problems to find dead transitions.
[2024-05-30 13:23:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 24/48 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 0/48 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 32 constraints, problems are : Problem set: 0 solved, 23 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 24/48 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 23/55 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 0/48 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 55 constraints, problems are : Problem set: 0 solved, 23 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
After SMT, in 284ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 285ms
Starting structural reductions in SI_CTL mode, iteration 1 : 24/99 places, 24/99 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 370 ms. Remains : 24/99 places, 24/99 transitions.
[2024-05-30 13:23:26] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:23:26] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:23:26] [INFO ] Input system was already deterministic with 24 transitions.
[2024-05-30 13:23:26] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:23:26] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:23:26] [INFO ] Time to serialize gal into /tmp/CTLFireability9427441327183526839.gal : 1 ms
[2024-05-30 13:23:26] [INFO ] Time to serialize properties into /tmp/CTLFireability8307693965629954662.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/CTLFireability9427441327183526839.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8307693965629954662.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,5508,0.006162,3468,2,55,5,896,6,0,123,1117,0


Converting to forward existential form...Done !
original formula: AF(EG(EF((p44==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(E(TRUE U (p44==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t4, t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/...172
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.056271,6160,1,0,68,14716,81,33,793,18493,77
FORMULA ShieldRVt-PT-002B-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 99/99 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 83 transition count 83
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 83 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 82 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 82 transition count 82
Applied a total of 34 rules in 7 ms. Remains 82 /99 variables (removed 17) and now considering 82/99 (removed 17) transitions.
// Phase 1: matrix 82 rows 82 cols
[2024-05-30 13:23:26] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 13:23:26] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-30 13:23:26] [INFO ] Invariant cache hit.
[2024-05-30 13:23:27] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2024-05-30 13:23:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 13:23:27] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:23:27] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-30 13:23:27] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:23:27] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:23:27] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:23:27] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:23:27] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 82/164 variables, 82/98 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 0/164 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 98 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1474 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 82/164 variables, 82/98 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 81/179 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 13:23:28] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:23:29] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:23:29] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
[2024-05-30 13:23:29] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:23:29] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-30 13:23:29] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 6/185 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 13:23:29] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-05-30 13:23:29] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 13:23:30] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 13:23:31] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/164 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 12 (OVERLAPS) 0/164 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 189 constraints, problems are : Problem set: 0 solved, 81 unsolved in 4072 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 17/17 constraints]
After SMT, in 5553ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 5555ms
Starting structural reductions in LTL mode, iteration 1 : 82/99 places, 82/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5661 ms. Remains : 82/99 places, 82/99 transitions.
[2024-05-30 13:23:32] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:23:32] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:23:32] [INFO ] Input system was already deterministic with 82 transitions.
[2024-05-30 13:23:32] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:23:32] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:23:32] [INFO ] Time to serialize gal into /tmp/CTLFireability138582994329630443.gal : 1 ms
[2024-05-30 13:23:32] [INFO ] Time to serialize properties into /tmp/CTLFireability12628705411306527870.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/CTLFireability138582994329630443.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12628705411306527870.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.85478e+07,0.070523,7060,2,761,5,11773,6,0,412,23071,0


Converting to forward existential form...Done !
original formula: !(A(AX(E(((p37==1) + EX((p86==1))) U AF((p63==1)))) U AF(((EX((p51==1)) + (p33==1)) + (p42==1)))))
=> equivalent forward existential formula: ([FwdG((FwdU(Init,!(!(EG(!(((EX((p51==1)) + (p33==1)) + (p42==1))))))) * !(!(EX(!(E(((p37==1) + EX((p86==1))) U ...309
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t30, t31, t37, t38, t42, t44, t47, t51, t53, t57, t61, t64, t68, ...263
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-30 13:24:02] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:24:02] [INFO ] Applying decomposition
[2024-05-30 13:24:02] [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/graph12060768884143034219.txt' '-o' '/tmp/graph12060768884143034219.bin' '-w' '/tmp/graph12060768884143034219.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12060768884143034219.bin' '-l' '-1' '-v' '-w' '/tmp/graph12060768884143034219.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:24:02] [INFO ] Decomposing Gal with order
[2024-05-30 13:24:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:24:02] [INFO ] Removed a total of 19 redundant transitions.
[2024-05-30 13:24:02] [INFO ] Flatten gal took : 33 ms
[2024-05-30 13:24:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 13:24:02] [INFO ] Time to serialize gal into /tmp/CTLFireability9176332667678625970.gal : 4 ms
[2024-05-30 13:24:02] [INFO ] Time to serialize properties into /tmp/CTLFireability7882567442205422693.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/CTLFireability9176332667678625970.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7882567442205422693.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.85478e+07,0.031834,4912,211,32,2557,406,221,3332,49,689,0


Converting to forward existential form...Done !
original formula: !(A(AX(E(((i4.u14.p37==1) + EX((i8.u29.p86==1))) U AF((i6.u23.p63==1)))) U AF(((EX((i5.u17.p51==1)) + (i4.u13.p33==1)) + (i4.u11.p42==1))...158
=> equivalent forward existential formula: ([FwdG((FwdU(Init,!(!(EG(!(((EX((i5.u17.p51==1)) + (i4.u13.p33==1)) + (i4.u11.p42==1))))))) * !(!(EX(!(E(((i4.u1...393
Reverse transition relation is NOT exact ! Due to transitions t76, i0.i0.u1.t71, i2.t64, i2.u4.t68, i3.t61, i3.t57, i4.t51, i4.u11.t47, i4.u13.t53, i5.t42,...364
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,2.59674,108136,1,0,198719,544,1413,333189,274,1550,187988
FORMULA ShieldRVt-PT-002B-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 99/99 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 98 transition count 76
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 25 rules applied. Total rules applied 47 place count 76 transition count 73
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 49 place count 74 transition count 73
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 49 place count 74 transition count 64
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 67 place count 65 transition count 64
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 76 place count 56 transition count 55
Iterating global reduction 3 with 9 rules applied. Total rules applied 85 place count 56 transition count 55
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 85 place count 56 transition count 51
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 93 place count 52 transition count 51
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 3 with 24 rules applied. Total rules applied 117 place count 40 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 118 place count 39 transition count 38
Applied a total of 118 rules in 20 ms. Remains 39 /99 variables (removed 60) and now considering 38/99 (removed 61) transitions.
// Phase 1: matrix 38 rows 39 cols
[2024-05-30 13:24:05] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 13:24:05] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-30 13:24:05] [INFO ] Invariant cache hit.
[2024-05-30 13:24:05] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-30 13:24:05] [INFO ] Redundant transitions in 0 ms returned []
Running 36 sub problems to find dead transitions.
[2024-05-30 13:24:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 2/39 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-05-30 13:24:05] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-30 13:24:05] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-30 13:24:05] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-05-30 13:24:05] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 38/77 variables, 39/52 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/77 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 52 constraints, problems are : Problem set: 0 solved, 36 unsolved in 472 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 39/39 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 2/39 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 38/77 variables, 39/52 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 36/88 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-05-30 13:24:06] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:24:06] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:24:06] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (OVERLAPS) 0/77 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 77/77 variables, and 91 constraints, problems are : Problem set: 0 solved, 36 unsolved in 537 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 39/39 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 7/7 constraints]
After SMT, in 1017ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 1018ms
Starting structural reductions in SI_CTL mode, iteration 1 : 39/99 places, 38/99 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1114 ms. Remains : 39/99 places, 38/99 transitions.
[2024-05-30 13:24:06] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:24:06] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:24:06] [INFO ] Input system was already deterministic with 38 transitions.
[2024-05-30 13:24:06] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:24:06] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:24:06] [INFO ] Time to serialize gal into /tmp/CTLFireability15721211525731190518.gal : 0 ms
[2024-05-30 13:24:06] [INFO ] Time to serialize properties into /tmp/CTLFireability7278650824203062892.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/CTLFireability15721211525731190518.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7278650824203062892.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,146858,0.019527,4168,2,259,5,3080,6,0,195,4751,0


Converting to forward existential form...Done !
original formula: EF((((p18==1)&&(p24==1)) * ((p40==1) * (E(A(((p55==1)&&(p8==1)) U (p72==1)) U A(AF((p37==1)) U (p93!=1))) + (E(!(((p37==1)||(p65==1))) U ...194
=> equivalent forward existential formula: ([((FwdU(((FwdU(Init,TRUE) * ((p18==1)&&(p24==1))) * (p40==1)),!((E(!((p72==1)) U (!(((p55==1)&&(p8==1))) * !((p...464
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t8, t9, t18, t23, t27, t30, t33, t35, t36, Intersection with reachable at ea...219
(forward)formula 0,1,2.24457,87508,1,0,1194,457477,121,560,1165,747238,1328
FORMULA ShieldRVt-PT-002B-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 99/99 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 99 transition count 76
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 27 rules applied. Total rules applied 50 place count 76 transition count 72
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 53 place count 73 transition count 72
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 53 place count 73 transition count 65
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 67 place count 66 transition count 65
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 78 place count 55 transition count 54
Iterating global reduction 3 with 11 rules applied. Total rules applied 89 place count 55 transition count 54
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 89 place count 55 transition count 49
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 99 place count 50 transition count 49
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 121 place count 39 transition count 38
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 122 place count 39 transition count 38
Applied a total of 122 rules in 15 ms. Remains 39 /99 variables (removed 60) and now considering 38/99 (removed 61) transitions.
// Phase 1: matrix 38 rows 39 cols
[2024-05-30 13:24:08] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 13:24:08] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-30 13:24:08] [INFO ] Invariant cache hit.
[2024-05-30 13:24:08] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-30 13:24:08] [INFO ] Redundant transitions in 0 ms returned []
Running 37 sub problems to find dead transitions.
[2024-05-30 13:24:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-30 13:24:09] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (OVERLAPS) 38/77 variables, 39/49 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (OVERLAPS) 0/77 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 49 constraints, problems are : Problem set: 0 solved, 37 unsolved in 363 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 39/39 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (OVERLAPS) 38/77 variables, 39/49 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 37/86 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 0/77 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 77/77 variables, and 86 constraints, problems are : Problem set: 0 solved, 37 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 39/39 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 1/1 constraints]
After SMT, in 759ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 760ms
Starting structural reductions in SI_CTL mode, iteration 1 : 39/99 places, 38/99 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 840 ms. Remains : 39/99 places, 38/99 transitions.
[2024-05-30 13:24:09] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:24:09] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:24:09] [INFO ] Input system was already deterministic with 38 transitions.
[2024-05-30 13:24:09] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:24:09] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:24:09] [INFO ] Time to serialize gal into /tmp/CTLFireability18199486695822029887.gal : 1 ms
[2024-05-30 13:24:09] [INFO ] Time to serialize properties into /tmp/CTLFireability414898690166551236.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/CTLFireability18199486695822029887.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability414898690166551236.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,81117,0.013799,3920,2,226,5,2336,6,0,196,3216,0


Converting to forward existential form...Done !
original formula: (A(!(EF(((p75==1)&&(p1==1)))) U EG(!(((p2==1)&&(p35==1))))) + !(A(A(((p33==1)||((p55==1)&&(p38==1))) U AF((p7==1))) U (!(EG((p65==1))) + ...171
=> equivalent forward existential formula: ([((Init * !(EG(!(EG(!(((p2==1)&&(p35==1)))))))) * !(E(!(EG(!(((p2==1)&&(p35==1))))) U (!(!(E(TRUE U ((p75==1)&&...496
Reverse transition relation is NOT exact ! Due to transitions t2, t9, t11, t15, t17, t23, t25, t27, t31, t35, Intersection with reachable at each step ena...208
Using saturation style SCC detection
(forward)formula 0,1,1.39682,54788,1,0,776,268353,111,389,1258,445715,824
FORMULA ShieldRVt-PT-002B-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 99/99 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 81 transition count 81
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 80 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 79 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 79 transition count 79
Applied a total of 40 rules in 4 ms. Remains 79 /99 variables (removed 20) and now considering 79/99 (removed 20) transitions.
// Phase 1: matrix 79 rows 79 cols
[2024-05-30 13:24:11] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 13:24:11] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-30 13:24:11] [INFO ] Invariant cache hit.
[2024-05-30 13:24:11] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-30 13:24:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 13:24:11] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-05-30 13:24:11] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:24:11] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 79/158 variables, 79/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 0/158 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 91 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1342 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 79/158 variables, 79/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 78/169 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 13:24:12] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-30 13:24:13] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
[2024-05-30 13:24:13] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 3/172 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 13:24:13] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-30 13:24:13] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:24:13] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 13:24:14] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/158 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 13:24:14] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 13:24:15] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/158 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 14 (OVERLAPS) 0/158 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 178 constraints, problems are : Problem set: 0 solved, 78 unsolved in 4094 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 12/12 constraints]
After SMT, in 5443ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 5444ms
Starting structural reductions in LTL mode, iteration 1 : 79/99 places, 79/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5541 ms. Remains : 79/99 places, 79/99 transitions.
[2024-05-30 13:24:16] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:24:16] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:24:16] [INFO ] Input system was already deterministic with 79 transitions.
[2024-05-30 13:24:16] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:24:16] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:24:16] [INFO ] Time to serialize gal into /tmp/CTLFireability15011626914135189162.gal : 1 ms
[2024-05-30 13:24:16] [INFO ] Time to serialize properties into /tmp/CTLFireability2634886380686050909.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/CTLFireability15011626914135189162.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2634886380686050909.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.75398e+07,0.056209,6268,2,544,5,9344,6,0,397,16022,0


Converting to forward existential form...Done !
original formula: AX(EF(EX(((p77==1)&&(p96==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U EX(((p77==1)&&(p96==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t30, t36, t40, t45, t49, t58, t61, t65, t68, t73, Intersect...243
(forward)formula 0,1,0.552211,24504,1,0,186,115500,179,98,2261,121453,206
FORMULA ShieldRVt-PT-002B-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 99/99 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 99 transition count 73
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 54 place count 73 transition count 71
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 56 place count 72 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 57 place count 71 transition count 70
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 57 place count 71 transition count 61
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 75 place count 62 transition count 61
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 87 place count 50 transition count 49
Iterating global reduction 4 with 12 rules applied. Total rules applied 99 place count 50 transition count 49
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 99 place count 50 transition count 43
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 111 place count 44 transition count 43
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 139 place count 30 transition count 29
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 30 transition count 29
Applied a total of 140 rules in 9 ms. Remains 30 /99 variables (removed 69) and now considering 29/99 (removed 70) transitions.
// Phase 1: matrix 29 rows 30 cols
[2024-05-30 13:24:17] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 13:24:17] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-30 13:24:17] [INFO ] Invariant cache hit.
[2024-05-30 13:24:17] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-30 13:24:17] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-30 13:24:17] [INFO ] Redundant transitions in 0 ms returned []
Running 28 sub problems to find dead transitions.
[2024-05-30 13:24:17] [INFO ] Invariant cache hit.
[2024-05-30 13:24:17] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 1/30 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 29/59 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 0/59 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 59/59 variables, and 42 constraints, problems are : Problem set: 0 solved, 28 unsolved in 233 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 30/30 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 1/30 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 29/59 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 28/70 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 0/59 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 59/59 variables, and 70 constraints, problems are : Problem set: 0 solved, 28 unsolved in 241 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 30/30 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 479ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 480ms
Starting structural reductions in SI_CTL mode, iteration 1 : 30/99 places, 29/99 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 559 ms. Remains : 30/99 places, 29/99 transitions.
[2024-05-30 13:24:17] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:24:17] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:24:17] [INFO ] Input system was already deterministic with 29 transitions.
[2024-05-30 13:24:17] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:24:17] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:24:17] [INFO ] Time to serialize gal into /tmp/CTLFireability9080898589448493369.gal : 1 ms
[2024-05-30 13:24:17] [INFO ] Time to serialize properties into /tmp/CTLFireability3107367152433739920.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/CTLFireability9080898589448493369.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3107367152433739920.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,23437,0.01302,3540,2,89,5,1077,6,0,149,1293,0


Converting to forward existential form...Done !
original formula: EG(E((p1==1) U ((p0==1) + !(A((p68==1) U ((p49==1)&&(p74==1)))))))
=> equivalent forward existential formula: [FwdG(Init,E((p1==1) U ((p0==1) + !(!((E(!(((p49==1)&&(p74==1))) U (!((p68==1)) * !(((p49==1)&&(p74==1))))) + EG...196
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 24/0/5
Hit Full ! (commute/partial/dont) 24/0/5
Hit Full ! (commute/partial/dont) 27/0/2
(forward)formula 0,1,0.087805,7556,1,0,113,19904,36,82,801,28273,94
FORMULA ShieldRVt-PT-002B-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 99/99 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 85 transition count 85
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 85 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 84 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 84 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 83 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 83 transition count 83
Applied a total of 32 rules in 10 ms. Remains 83 /99 variables (removed 16) and now considering 83/99 (removed 16) transitions.
// Phase 1: matrix 83 rows 83 cols
[2024-05-30 13:24:17] [INFO ] Computed 9 invariants in 2 ms
[2024-05-30 13:24:17] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-30 13:24:17] [INFO ] Invariant cache hit.
[2024-05-30 13:24:17] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2024-05-30 13:24:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 13:24:18] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:24:18] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:24:18] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 1 ms to minimize.
[2024-05-30 13:24:18] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:24:18] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 13:24:18] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 83/166 variables, 83/98 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 0/166 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 98 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1664 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 13:24:19] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 83/166 variables, 83/99 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 82/181 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 13:24:20] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:24:20] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:24:20] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:24:20] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-30 13:24:20] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:24:20] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-30 13:24:20] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 7/188 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 13:24:21] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/166 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 189 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2593 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 15/15 constraints]
After SMT, in 4267ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 4268ms
Starting structural reductions in LTL mode, iteration 1 : 83/99 places, 83/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4379 ms. Remains : 83/99 places, 83/99 transitions.
[2024-05-30 13:24:22] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:24:22] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:24:22] [INFO ] Input system was already deterministic with 83 transitions.
[2024-05-30 13:24:22] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:24:22] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:24:22] [INFO ] Time to serialize gal into /tmp/CTLFireability1633945389992853440.gal : 1 ms
[2024-05-30 13:24:22] [INFO ] Time to serialize properties into /tmp/CTLFireability14975405351283143727.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/CTLFireability1633945389992853440.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14975405351283143727.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,3.64242e+07,0.061953,6564,2,706,5,10531,6,0,417,18811,0


Converting to forward existential form...Done !
original formula: AX((A(AF((((p19==1)&&(p42==1)) + A((p81==1) U (p15==1)))) U A((p41==1) U (p71==1))) + (EX((p91==0)) * E((p7==1) U (p37==1)))))
=> equivalent forward existential formula: (([(FwdU((FwdU((EY(Init) * !((EX((p91==0)) * E((p7==1) U (p37==1))))),!(!((E(!((p71==1)) U (!((p41==1)) * !((p71...764
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t17, t19, t22, t28, t31, t32, t38, t42, t48, t52, t53, t57, t61, t65, t69, t70, ...258
(forward)formula 0,0,12.3895,411928,1,0,1302,2.07246e+06,203,712,2267,3.692e+06,1253
FORMULA ShieldRVt-PT-002B-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 99/99 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 98 transition count 81
Reduce places removed 17 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 20 rules applied. Total rules applied 37 place count 81 transition count 78
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 40 place count 78 transition count 78
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 40 place count 78 transition count 67
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 62 place count 67 transition count 67
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 74 place count 55 transition count 55
Iterating global reduction 3 with 12 rules applied. Total rules applied 86 place count 55 transition count 55
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 86 place count 55 transition count 52
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 92 place count 52 transition count 52
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 114 place count 41 transition count 41
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 39 transition count 39
Applied a total of 116 rules in 17 ms. Remains 39 /99 variables (removed 60) and now considering 39/99 (removed 60) transitions.
// Phase 1: matrix 39 rows 39 cols
[2024-05-30 13:24:34] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 13:24:34] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-30 13:24:34] [INFO ] Invariant cache hit.
[2024-05-30 13:24:34] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-05-30 13:24:34] [INFO ] Redundant transitions in 1 ms returned []
Running 35 sub problems to find dead transitions.
[2024-05-30 13:24:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (OVERLAPS) 4/39 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 39/78 variables, 39/48 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-30 13:24:35] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 0/78 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 49 constraints, problems are : Problem set: 0 solved, 35 unsolved in 391 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 39/39 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 4/39 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 39/78 variables, 39/49 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 35/84 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 0/78 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 84 constraints, problems are : Problem set: 0 solved, 35 unsolved in 314 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 39/39 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 1/1 constraints]
After SMT, in 709ms problems are : Problem set: 0 solved, 35 unsolved
Search for dead transitions found 0 dead transitions in 710ms
Starting structural reductions in SI_CTL mode, iteration 1 : 39/99 places, 39/99 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 805 ms. Remains : 39/99 places, 39/99 transitions.
[2024-05-30 13:24:35] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:24:35] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:24:35] [INFO ] Input system was already deterministic with 39 transitions.
[2024-05-30 13:24:35] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:24:35] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:24:35] [INFO ] Time to serialize gal into /tmp/CTLFireability15558755135197057259.gal : 0 ms
[2024-05-30 13:24:35] [INFO ] Time to serialize properties into /tmp/CTLFireability4407781474140304754.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/CTLFireability15558755135197057259.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4407781474140304754.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,203400,0.013089,3912,2,107,5,2226,6,0,197,3052,0


Converting to forward existential form...Done !
original formula: !(E(E((p15==1) U ((E((p32==1) U (p62==1)) + (((p14==1)||(((p13==1)&&(p67==1))&&(p101==1))) * AF(((p89==1)&&(p101==1))))) + (EF((p31==1)) ...217
=> equivalent forward existential formula: [(FwdU(Init,E((p15==1) U ((E((p32==1) U (p62==1)) + (((p14==1)||(((p13==1)&&(p67==1))&&(p101==1))) * !(EG(!(((p8...271
Reverse transition relation is NOT exact ! Due to transitions t4, t7, t14, t15, t30, t34, Intersection with reachable at each step enabled. (destroyed/rev...187
(forward)formula 0,0,1.37406,62288,1,0,1091,305643,123,597,1198,509223,1280
FORMULA ShieldRVt-PT-002B-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 99/99 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 82 transition count 82
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 82 transition count 82
Applied a total of 34 rules in 2 ms. Remains 82 /99 variables (removed 17) and now considering 82/99 (removed 17) transitions.
// Phase 1: matrix 82 rows 82 cols
[2024-05-30 13:24:36] [INFO ] Computed 9 invariants in 2 ms
[2024-05-30 13:24:36] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-30 13:24:36] [INFO ] Invariant cache hit.
[2024-05-30 13:24:37] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2024-05-30 13:24:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 13:24:37] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:24:37] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:24:37] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 82/164 variables, 82/94 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 0/164 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 94 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1408 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 82/164 variables, 82/94 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 81/175 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 13:24:38] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:24:38] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:24:39] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-30 13:24:39] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-30 13:24:39] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:24:39] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:24:39] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 7/182 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 13:24:39] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-30 13:24:39] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-30 13:24:39] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 3/185 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 0/164 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 185 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2423 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 13/13 constraints]
After SMT, in 3840ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 3842ms
Starting structural reductions in LTL mode, iteration 1 : 82/99 places, 82/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3921 ms. Remains : 82/99 places, 82/99 transitions.
[2024-05-30 13:24:40] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:24:40] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:24:40] [INFO ] Input system was already deterministic with 82 transitions.
[2024-05-30 13:24:40] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:24:40] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:24:40] [INFO ] Time to serialize gal into /tmp/CTLFireability891426367688885112.gal : 1 ms
[2024-05-30 13:24:40] [INFO ] Time to serialize properties into /tmp/CTLFireability885260325170466393.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/CTLFireability891426367688885112.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability885260325170466393.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 -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.88153e+07,0.067045,6292,2,573,5,9917,6,0,412,17242,0


Converting to forward existential form...Done !
original formula: EX(EF(((!(E(((p86==1)||(p57==1)) U ((p63==1)||(p0==1)))) * (p70==1)) * (p61==1))))
=> equivalent forward existential formula: [(((FwdU(EY(Init),TRUE) * (p61==1)) * (p70==1)) * !(E(((p86==1)||(p57==1)) U ((p63==1)||(p0==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t32, t33, t39, t43, t48, t52, t61, t64, t68, t71, t76, Intersect...243
(forward)formula 0,1,1.54544,64428,1,0,515,306488,187,264,2350,545193,528
FORMULA ShieldRVt-PT-002B-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 99/99 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 98 transition count 70
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 58 place count 70 transition count 68
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 61 place count 69 transition count 66
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 63 place count 67 transition count 66
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 63 place count 67 transition count 59
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 77 place count 60 transition count 59
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 89 place count 48 transition count 47
Iterating global reduction 4 with 12 rules applied. Total rules applied 101 place count 48 transition count 47
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 101 place count 48 transition count 40
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 115 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 4 with 26 rules applied. Total rules applied 141 place count 28 transition count 27
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 143 place count 26 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 144 place count 25 transition count 25
Applied a total of 144 rules in 15 ms. Remains 25 /99 variables (removed 74) and now considering 25/99 (removed 74) transitions.
// Phase 1: matrix 25 rows 25 cols
[2024-05-30 13:24:42] [INFO ] Computed 8 invariants in 1 ms
[2024-05-30 13:24:42] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-30 13:24:42] [INFO ] Invariant cache hit.
[2024-05-30 13:24:42] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-30 13:24:42] [INFO ] Redundant transitions in 0 ms returned []
Running 24 sub problems to find dead transitions.
[2024-05-30 13:24:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 25/50 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 0/50 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 33 constraints, problems are : Problem set: 0 solved, 24 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 25/50 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 24/57 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 0/50 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 57 constraints, problems are : Problem set: 0 solved, 24 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
After SMT, in 313ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 313ms
Starting structural reductions in SI_CTL mode, iteration 1 : 25/99 places, 25/99 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 393 ms. Remains : 25/99 places, 25/99 transitions.
[2024-05-30 13:24:42] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:24:42] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:24:42] [INFO ] Input system was already deterministic with 25 transitions.
[2024-05-30 13:24:42] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:24:42] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:24:42] [INFO ] Time to serialize gal into /tmp/CTLFireability8881266668002627378.gal : 2 ms
[2024-05-30 13:24:42] [INFO ] Time to serialize properties into /tmp/CTLFireability18318269541971606745.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/CTLFireability8881266668002627378.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18318269541971606745.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,7344,0.00907,3500,2,57,5,922,6,0,128,1144,0


Converting to forward existential form...Done !
original formula: EG(((p75==0) + EG((p44==1))))
=> equivalent forward existential formula: [FwdG(Init,((p75==0) + EG((p44==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t7, t14, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/...172
(forward)formula 0,1,0.066859,6724,1,0,213,16932,77,138,763,24326,273
FORMULA ShieldRVt-PT-002B-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 99/99 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 82 transition count 82
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 82 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 81 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 80 transition count 80
Applied a total of 38 rules in 8 ms. Remains 80 /99 variables (removed 19) and now considering 80/99 (removed 19) transitions.
// Phase 1: matrix 80 rows 80 cols
[2024-05-30 13:24:42] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 13:24:42] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-30 13:24:42] [INFO ] Invariant cache hit.
[2024-05-30 13:24:43] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2024-05-30 13:24:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 13:24:43] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-05-30 13:24:43] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:24:43] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 80/160 variables, 80/92 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 0/160 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 92 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1310 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 80/160 variables, 80/92 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 79/171 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 13:24:44] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:24:44] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:24:44] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:24:44] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-05-30 13:24:44] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:24:45] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:24:45] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 7/178 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 13:24:45] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/160 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 13:24:46] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (OVERLAPS) 0/160 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 180 constraints, problems are : Problem set: 0 solved, 79 unsolved in 3044 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 12/12 constraints]
After SMT, in 4362ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 4363ms
Starting structural reductions in LTL mode, iteration 1 : 80/99 places, 80/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4462 ms. Remains : 80/99 places, 80/99 transitions.
[2024-05-30 13:24:47] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:24:47] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:24:47] [INFO ] Input system was already deterministic with 80 transitions.
[2024-05-30 13:24:47] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:24:47] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:24:47] [INFO ] Time to serialize gal into /tmp/CTLFireability9268349270419891899.gal : 2 ms
[2024-05-30 13:24:47] [INFO ] Time to serialize properties into /tmp/CTLFireability7118838611684872652.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/CTLFireability9268349270419891899.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7118838611684872652.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.07177e+07,0.05683,6284,2,550,5,9512,6,0,402,16243,0


Converting to forward existential form...Done !
original formula: EX((EX(AG((p64==0))) * (EF((p8==1)) + ((p49==1) * AX((p78==1))))))
=> equivalent forward existential formula: ([(FwdU((EY(Init) * EX(!(E(TRUE U !((p64==0)))))),TRUE) * (p8==1))] != FALSE + [(((EY(Init) * EX(!(E(TRUE U !((p...211
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t22, t27, t30, t31, t37, t41, t46, t50, t59, t62, t66, t69, t74, Intersect...243
(forward)formula 0,0,0.457797,22988,1,0,183,104789,186,96,2285,114311,201
FORMULA ShieldRVt-PT-002B-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 99/99 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 87 transition count 87
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 87 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 86 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 86 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 85 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 85 transition count 85
Applied a total of 28 rules in 4 ms. Remains 85 /99 variables (removed 14) and now considering 85/99 (removed 14) transitions.
// Phase 1: matrix 85 rows 85 cols
[2024-05-30 13:24:47] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 13:24:47] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-30 13:24:47] [INFO ] Invariant cache hit.
[2024-05-30 13:24:47] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2024-05-30 13:24:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-30 13:24:48] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:24:48] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:24:48] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
[2024-05-30 13:24:48] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:24:48] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:24:48] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-30 13:24:48] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:24:48] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:24:48] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-05-30 13:24:48] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:24:48] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-30 13:24:48] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:24:48] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-30 13:24:49] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 85/170 variables, 85/108 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 0/170 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 108 constraints, problems are : Problem set: 0 solved, 84 unsolved in 2026 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-30 13:24:50] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 85/170 variables, 85/109 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 84/193 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-30 13:24:50] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:24:50] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-30 13:24:51] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-30 13:24:51] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (OVERLAPS) 0/170 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 197 constraints, problems are : Problem set: 0 solved, 84 unsolved in 3242 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 19/19 constraints]
After SMT, in 5280ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 5281ms
Starting structural reductions in LTL mode, iteration 1 : 85/99 places, 85/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5375 ms. Remains : 85/99 places, 85/99 transitions.
[2024-05-30 13:24:53] [INFO ] Flatten gal took : 9 ms
[2024-05-30 13:24:53] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:24:53] [INFO ] Input system was already deterministic with 85 transitions.
[2024-05-30 13:24:53] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:24:53] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:24:53] [INFO ] Time to serialize gal into /tmp/CTLFireability17301224320382940304.gal : 1 ms
[2024-05-30 13:24:53] [INFO ] Time to serialize properties into /tmp/CTLFireability8582105390101100913.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/CTLFireability17301224320382940304.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8582105390101100913.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.86259e+07,0.090522,7892,2,1062,5,13425,6,0,427,28791,0


Converting to forward existential form...Done !
original formula: EG((((p78==0) + A((((A((p33==1) U (p88==1)) + (p1!=1)) * ((p43==1)||(p32==1))) * (p99==1)) U E(AX((p87==1)) U (p71!=1)))) + ((A(((p3==1)|...330
=> equivalent forward existential formula: [FwdG(Init,(((p78==0) + !((E(!(E(!(EX(!((p87==1)))) U (p71!=1))) U (!((((!((E(!((p88==1)) U (!((p33==1)) * !((p8...568
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t17, t19, t23, t27, t29, t32, t33, t39, t40, t44, t46, t49, t50, t54, t56, t57, ...283
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-30 13:25:23] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:25:23] [INFO ] Applying decomposition
[2024-05-30 13:25:23] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16613434746346979207.txt' '-o' '/tmp/graph16613434746346979207.bin' '-w' '/tmp/graph16613434746346979207.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16613434746346979207.bin' '-l' '-1' '-v' '-w' '/tmp/graph16613434746346979207.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:25:23] [INFO ] Decomposing Gal with order
[2024-05-30 13:25:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:25:23] [INFO ] Removed a total of 17 redundant transitions.
[2024-05-30 13:25:23] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:25:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 13:25:23] [INFO ] Time to serialize gal into /tmp/CTLFireability3638436923597538792.gal : 2 ms
[2024-05-30 13:25:23] [INFO ] Time to serialize properties into /tmp/CTLFireability9207893301230096654.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/CTLFireability3638436923597538792.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9207893301230096654.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,4.86259e+07,0.028496,4692,240,29,2141,247,233,3054,46,521,0


Converting to forward existential form...Done !
original formula: EG((((i7.u25.p78==0) + A((((A((i4.u12.p33==1) U (i8.u28.p88==1)) + (i0.i0.u0.p1!=1)) * ((i5.u15.p43==1)||(i4.u14.p32==1))) * (i9.u29.p99=...496
=> equivalent forward existential formula: [FwdG(Init,(((i7.u25.p78==0) + !((E(!(E(!(EX(!((i8.u28.p87==1)))) U (i7.u24.p71!=1))) U (!((((!((E(!((i8.u28.p88...790
Reverse transition relation is NOT exact ! Due to transitions t79, i0.i0.u1.t74, i1.t67, i1.u5.t71, i2.t64, i2.t60, i4.t54, i4.u11.t49, i4.u12.t56, i4.u14....412
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,1.62384,74388,1,0,146971,526,1818,213825,279,1416,190011
FORMULA ShieldRVt-PT-002B-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 99/99 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 82 transition count 82
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 82 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 81 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 80 transition count 80
Applied a total of 38 rules in 2 ms. Remains 80 /99 variables (removed 19) and now considering 80/99 (removed 19) transitions.
// Phase 1: matrix 80 rows 80 cols
[2024-05-30 13:25:25] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 13:25:25] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-30 13:25:25] [INFO ] Invariant cache hit.
[2024-05-30 13:25:25] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2024-05-30 13:25:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 13:25:25] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:25:25] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-30 13:25:25] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 13:25:25] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-30 13:25:25] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 13:25:26] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 80/160 variables, 80/95 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/160 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 95 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1689 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 80/160 variables, 80/95 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 79/174 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 13:25:27] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:25:27] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:25:27] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:25:27] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-05-30 13:25:27] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 5/179 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 13:25:27] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 13:25:28] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-30 13:25:28] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/160 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 13:25:29] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/160 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/160 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 13 (OVERLAPS) 0/160 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 183 constraints, problems are : Problem set: 0 solved, 79 unsolved in 3833 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 15/15 constraints]
After SMT, in 5531ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 5532ms
Starting structural reductions in LTL mode, iteration 1 : 80/99 places, 80/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5625 ms. Remains : 80/99 places, 80/99 transitions.
[2024-05-30 13:25:30] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:25:30] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:25:30] [INFO ] Input system was already deterministic with 80 transitions.
[2024-05-30 13:25:30] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:25:30] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:25:30] [INFO ] Time to serialize gal into /tmp/CTLFireability1669588260300606394.gal : 1 ms
[2024-05-30 13:25:30] [INFO ] Time to serialize properties into /tmp/CTLFireability16939357895131371996.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/CTLFireability1669588260300606394.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16939357895131371996.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.75469e+07,0.056991,6276,2,553,5,9350,6,0,402,15929,0


Converting to forward existential form...Done !
original formula: AX(E(((p8==1) + AF((AX((p102==1)) * (p1==1)))) U EG((!(A((p102==1) U (p37==1))) + AG((p74==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(((p8==1) + !(EG(!((!(EX(!((p102==1)))) * (p1==1)))))) U EG((!(!((E(!((p37==1)) U (!((p102==1)) ...232
Reverse transition relation is NOT exact ! Due to transitions t4, t9, t13, t17, t22, t26, t30, t31, t37, t41, t46, t50, t59, t62, t66, t69, t74, Intersect...243
Using saturation style SCC detection
(forward)formula 0,1,11.7042,348504,1,0,1403,1.89846e+06,206,835,2395,2.97384e+06,1746
FORMULA ShieldRVt-PT-002B-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 99/99 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 82 transition count 82
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 82 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 81 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 80 transition count 80
Applied a total of 38 rules in 1 ms. Remains 80 /99 variables (removed 19) and now considering 80/99 (removed 19) transitions.
// Phase 1: matrix 80 rows 80 cols
[2024-05-30 13:25:42] [INFO ] Computed 9 invariants in 0 ms
[2024-05-30 13:25:42] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-30 13:25:42] [INFO ] Invariant cache hit.
[2024-05-30 13:25:42] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2024-05-30 13:25:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 13:25:42] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:25:42] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:25:43] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 80/160 variables, 80/92 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 0/160 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 92 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1270 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 13:25:44] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 80/160 variables, 80/93 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 79/172 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 13:25:44] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:25:44] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:25:44] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 13:25:44] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:25:44] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:25:45] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 3/178 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 13:25:45] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:25:45] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 13:25:45] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 13:25:46] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/160 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/160 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 13 (OVERLAPS) 0/160 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 182 constraints, problems are : Problem set: 0 solved, 79 unsolved in 3849 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 14/14 constraints]
After SMT, in 5126ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 5128ms
Starting structural reductions in LTL mode, iteration 1 : 80/99 places, 80/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5219 ms. Remains : 80/99 places, 80/99 transitions.
[2024-05-30 13:25:47] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:25:47] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:25:47] [INFO ] Input system was already deterministic with 80 transitions.
[2024-05-30 13:25:47] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:25:47] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:25:47] [INFO ] Time to serialize gal into /tmp/CTLFireability6314450185591896812.gal : 1 ms
[2024-05-30 13:25:47] [INFO ] Time to serialize properties into /tmp/CTLFireability14472798998355562622.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/CTLFireability6314450185591896812.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14472798998355562622.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,3.08051e+07,0.062381,6544,2,623,5,10496,6,0,402,19884,0


Converting to forward existential form...Done !
original formula: EG(AX((AG((p25==1)) + ((!(A((((p13==1)&&(p67==1))&&(p101==1)) U (p85==1))) * (p11==0)) * (((p4==0)||(p18==0))||(p52==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!((!(E(TRUE U !((p25==1)))) + ((!(!((E(!((p85==1)) U (!((((p13==1)&&(p67==1))&&(p101==1))) * !((...248
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t19, t21, t25, t29, t30, t36, t40, t45, t49, t58, t61, t65, t67, t69, t74, ...253
(forward)formula 0,0,4.04945,143380,1,0,1135,794224,200,570,2299,1.22425e+06,1174
FORMULA ShieldRVt-PT-002B-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-30 13:25:51] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:25:51] [INFO ] Flatten gal took : 4 ms
Total runtime 191432 ms.

BK_STOP 1717075551860

--------------------
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="ShieldRVt-PT-002B"
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 ShieldRVt-PT-002B, 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-171683762100906"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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