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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K 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 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 07:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 20:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 12 20:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 20:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 20:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 17K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-2024-00
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-2024-01
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-2024-02
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-2024-03
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-2024-04
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-2024-05
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-2024-06
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-2024-07
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-2024-08
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-2024-09
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-2024-10
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-2024-11
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-2023-12
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-2023-13
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-2023-14
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716924328228

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-001B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-28 19:25:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 19:25:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 19:25:29] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2024-05-28 19:25:29] [INFO ] Transformed 73 places.
[2024-05-28 19:25:29] [INFO ] Transformed 68 transitions.
[2024-05-28 19:25:29] [INFO ] Found NUPN structural information;
[2024-05-28 19:25:29] [INFO ] Parsed PT model containing 73 places and 68 transitions and 168 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 61 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Applied a total of 0 rules in 18 ms. Remains 73 /73 variables (removed 0) and now considering 68/68 (removed 0) transitions.
// Phase 1: matrix 68 rows 73 cols
[2024-05-28 19:25:29] [INFO ] Computed 10 invariants in 5 ms
[2024-05-28 19:25:29] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-28 19:25:29] [INFO ] Invariant cache hit.
[2024-05-28 19:25:29] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Running 67 sub problems to find dead transitions.
[2024-05-28 19:25:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-28 19:25:30] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 10 ms to minimize.
[2024-05-28 19:25:30] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-28 19:25:30] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:25:30] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-28 19:25:30] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:25:30] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:25:30] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:25:30] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:25:30] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-28 19:25:30] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-28 19:25:30] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:25:30] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:25:31] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:25:31] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:25:31] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:25:31] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:25:31] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:25:31] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 18/101 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-28 19:25:31] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:25:31] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 68/141 variables, 73/176 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-28 19:25:31] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-28 19:25:32] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:25:32] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:25:32] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/141 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/141 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 12 (OVERLAPS) 0/141 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 180 constraints, problems are : Problem set: 0 solved, 67 unsolved in 3067 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 24/107 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-28 19:25:33] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 68/141 variables, 73/181 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 67/248 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-28 19:25:33] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-28 19:25:34] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/141 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 12 (OVERLAPS) 0/141 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 250 constraints, problems are : Problem set: 0 solved, 67 unsolved in 2401 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 27/27 constraints]
After SMT, in 5521ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 5532ms
Finished structural reductions in LTL mode , in 1 iterations and 5860 ms. Remains : 73/73 places, 68/68 transitions.
Support contains 61 out of 73 places after structural reductions.
[2024-05-28 19:25:35] [INFO ] Flatten gal took : 21 ms
[2024-05-28 19:25:35] [INFO ] Flatten gal took : 8 ms
[2024-05-28 19:25:35] [INFO ] Input system was already deterministic with 68 transitions.
Reduction of identical properties reduced properties to check from 62 to 58
RANDOM walk for 40000 steps (8 resets) in 1308 ms. (30 steps per ms) remains 4/58 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
[2024-05-28 19:25:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp58 is UNSAT
At refinement iteration 2 (OVERLAPS) 56/70 variables, 9/23 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 56/79 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-28 19:25:36] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:25:36] [INFO ] Deduced a trap composed of 34 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 2/81 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/81 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/73 variables, 1/82 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 3/85 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/85 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 68/141 variables, 73/158 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/158 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/141 variables, 0/158 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 158 constraints, problems are : Problem set: 2 solved, 1 unsolved in 127 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 46/50 variables, 5/9 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 46/55 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/55 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/73 variables, 5/60 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 23/83 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 2/85 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-28 19:25:36] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 0 ms to minimize.
[2024-05-28 19:25:36] [INFO ] Deduced a trap composed of 18 places in 16 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 2/87 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 0/87 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 68/141 variables, 73/160 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/141 variables, 1/161 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/141 variables, 0/161 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/141 variables, 0/161 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 161 constraints, problems are : Problem set: 2 solved, 1 unsolved in 123 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 258ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 68/68 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 73 transition count 52
Reduce places removed 16 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 18 rules applied. Total rules applied 34 place count 57 transition count 50
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 36 place count 56 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 37 place count 55 transition count 49
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 37 place count 55 transition count 44
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 47 place count 50 transition count 44
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 52 place count 45 transition count 39
Iterating global reduction 4 with 5 rules applied. Total rules applied 57 place count 45 transition count 39
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 57 place count 45 transition count 36
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 63 place count 42 transition count 36
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 93 place count 27 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 97 place count 25 transition count 22
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 98 place count 25 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 99 place count 24 transition count 20
Applied a total of 99 rules in 23 ms. Remains 24 /73 variables (removed 49) and now considering 20/68 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 24/73 places, 20/68 transitions.
RANDOM walk for 40000 steps (19 resets) in 304 ms. (131 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (12 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Probably explored full state space saw : 995 states, properties seen :0
Probabilistic random walk after 4727 steps, saw 995 distinct states, run finished after 13 ms. (steps per millisecond=363 ) properties seen :0
Explored full state space saw : 995 states, properties seen :0
Exhaustive walk after 4727 steps, saw 995 distinct states, run finished after 4 ms. (steps per millisecond=1181 ) properties seen :0
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2024-05-28 19:25:36] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-28 19:25:36] [INFO ] Flatten gal took : 6 ms
FORMULA ShieldIIPt-PT-001B-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-001B-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 19:25:36] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:25:36] [INFO ] Input system was already deterministic with 68 transitions.
Support contains 53 out of 73 places (down from 60) after GAL structural reductions.
Computed a total of 20 stabilizing places and 20 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 64 transition count 59
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 63 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 62 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 62 transition count 57
Applied a total of 22 rules in 7 ms. Remains 62 /73 variables (removed 11) and now considering 57/68 (removed 11) transitions.
// Phase 1: matrix 57 rows 62 cols
[2024-05-28 19:25:36] [INFO ] Computed 10 invariants in 6 ms
[2024-05-28 19:25:36] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-28 19:25:36] [INFO ] Invariant cache hit.
[2024-05-28 19:25:36] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 56 sub problems to find dead transitions.
[2024-05-28 19:25:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 19:25:37] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:25:37] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:25:37] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:25:37] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 4 ms to minimize.
[2024-05-28 19:25:37] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2024-05-28 19:25:37] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-28 19:25:37] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-28 19:25:37] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-28 19:25:37] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 1 ms to minimize.
[2024-05-28 19:25:37] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-28 19:25:37] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 19:25:37] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:25:37] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 19:25:37] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 57/119 variables, 62/86 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/119 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 86 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1232 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 57/119 variables, 62/86 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 56/142 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/119 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 142 constraints, problems are : Problem set: 0 solved, 56 unsolved in 736 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 14/14 constraints]
After SMT, in 1976ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 1977ms
Starting structural reductions in LTL mode, iteration 1 : 62/73 places, 57/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2060 ms. Remains : 62/73 places, 57/68 transitions.
[2024-05-28 19:25:38] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:25:38] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:25:38] [INFO ] Input system was already deterministic with 57 transitions.
[2024-05-28 19:25:38] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:25:38] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:25:38] [INFO ] Time to serialize gal into /tmp/CTLFireability15960900504105619559.gal : 2 ms
[2024-05-28 19:25:38] [INFO ] Time to serialize properties into /tmp/CTLFireability6705183640902410807.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/CTLFireability15960900504105619559.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6705183640902410807.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.58976e+06,0.132208,9460,2,704,5,20281,6,0,307,38949,0


Converting to forward existential form...Done !
original formula: AX(!(A((p58==1) U AG(((p51!=1)||(p53==1))))))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(!(E(TRUE U !(((p51!=1)||(p53==1))))))))) * !(E(!(!(E(TRUE U !(((p51!=1)||(p53==1)))))) U (!...220
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t13, t18, t19, t21, t24, t28, t33, t34, t37, t38, t39, t40, t41, t43, t44, t45, Inte...248
Using saturation style SCC detection
(forward)formula 0,1,1.57268,60220,1,0,178,309452,146,82,1812,318783,193
FORMULA ShieldIIPt-PT-001B-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 72 transition count 48
Reduce places removed 19 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 21 rules applied. Total rules applied 40 place count 53 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 52 transition count 46
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 41 place count 52 transition count 41
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 51 place count 47 transition count 41
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 57 place count 41 transition count 35
Iterating global reduction 3 with 6 rules applied. Total rules applied 63 place count 41 transition count 35
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 63 place count 41 transition count 33
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 67 place count 39 transition count 33
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 97 place count 24 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 23 transition count 17
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 100 place count 21 transition count 17
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 100 place count 21 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 102 place count 20 transition count 16
Applied a total of 102 rules in 13 ms. Remains 20 /73 variables (removed 53) and now considering 16/68 (removed 52) transitions.
// Phase 1: matrix 16 rows 20 cols
[2024-05-28 19:25:40] [INFO ] Computed 8 invariants in 1 ms
[2024-05-28 19:25:40] [INFO ] Implicit Places using invariants in 28 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 19/73 places, 16/68 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 18 transition count 15
Applied a total of 2 rules in 1 ms. Remains 18 /19 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 18 cols
[2024-05-28 19:25:40] [INFO ] Computed 7 invariants in 1 ms
[2024-05-28 19:25:40] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-28 19:25:40] [INFO ] Invariant cache hit.
[2024-05-28 19:25:40] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 18/73 places, 15/68 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 98 ms. Remains : 18/73 places, 15/68 transitions.
[2024-05-28 19:25:40] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:25:40] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:25:40] [INFO ] Input system was already deterministic with 15 transitions.
[2024-05-28 19:25:40] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:25:40] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:25:40] [INFO ] Time to serialize gal into /tmp/CTLFireability14192695772498042861.gal : 1 ms
[2024-05-28 19:25:40] [INFO ] Time to serialize properties into /tmp/CTLFireability11353668778720471117.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/CTLFireability14192695772498042861.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11353668778720471117.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,572,0.006264,3396,2,46,5,1022,6,0,90,1365,0


Converting to forward existential form...Done !
original formula: AF(EG((p51==0)))
=> equivalent forward existential formula: [FwdG(Init,!(EG((p51==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...171
(forward)formula 0,1,0.041084,5560,1,0,195,12466,56,100,504,16808,217
FORMULA ShieldIIPt-PT-001B-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 64 transition count 59
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 63 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 62 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 62 transition count 57
Applied a total of 22 rules in 7 ms. Remains 62 /73 variables (removed 11) and now considering 57/68 (removed 11) transitions.
// Phase 1: matrix 57 rows 62 cols
[2024-05-28 19:25:40] [INFO ] Computed 10 invariants in 2 ms
[2024-05-28 19:25:40] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-28 19:25:40] [INFO ] Invariant cache hit.
[2024-05-28 19:25:40] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Running 56 sub problems to find dead transitions.
[2024-05-28 19:25:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 19:25:41] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-28 19:25:41] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-28 19:25:41] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:25:41] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:25:41] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 19:25:41] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 19:25:41] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 57/119 variables, 62/79 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 19:25:41] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 19:25:41] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 10 (OVERLAPS) 0/119 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 81 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1530 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 19:25:42] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 57/119 variables, 62/82 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 56/138 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 19:25:42] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:25:42] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:25:42] [INFO ] Deduced a trap composed of 20 places in 15 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 19:25:43] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 19:25:43] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 19:25:43] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 12 (OVERLAPS) 0/119 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 144 constraints, problems are : Problem set: 0 solved, 56 unsolved in 2142 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 16/16 constraints]
After SMT, in 3679ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 3681ms
Starting structural reductions in LTL mode, iteration 1 : 62/73 places, 57/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3789 ms. Remains : 62/73 places, 57/68 transitions.
[2024-05-28 19:25:44] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:25:44] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:25:44] [INFO ] Input system was already deterministic with 57 transitions.
[2024-05-28 19:25:44] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:25:44] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:25:44] [INFO ] Time to serialize gal into /tmp/CTLFireability15953645750016935108.gal : 1 ms
[2024-05-28 19:25:44] [INFO ] Time to serialize properties into /tmp/CTLFireability10413475513199579568.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/CTLFireability15953645750016935108.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10413475513199579568.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.42451e+06,0.094668,8216,2,641,5,15808,6,0,307,28957,0


Converting to forward existential form...Done !
original formula: A((p61!=1) U AX((EG(((p44==1) * AF((p34==1)))) + (E(AF((p53==1)) U EG((p44==1))) * E(AF((p72==1)) U E((p62==1) U (p56==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!((EG(((p44==1) * !(EG(!((p34==1)))))) + (E(!(EG(!((p53==1)))) U EG((p44==1))) * E(!(EG(!(...520
Reverse transition relation is NOT exact ! Due to transitions t5, t10, t14, t18, t19, t24, t28, t33, t34, t37, t38, t39, t40, t41, t43, t44, t45, Intersec...244
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,9.8698,307808,1,0,2757,1.71186e+06,176,1418,1750,2.49193e+06,3101
FORMULA ShieldIIPt-PT-001B-CTLFireability-2024-02 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 : 73/73 places, 68/68 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 65 transition count 60
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 65 transition count 60
Applied a total of 16 rules in 8 ms. Remains 65 /73 variables (removed 8) and now considering 60/68 (removed 8) transitions.
// Phase 1: matrix 60 rows 65 cols
[2024-05-28 19:25:54] [INFO ] Computed 10 invariants in 1 ms
[2024-05-28 19:25:54] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-28 19:25:54] [INFO ] Invariant cache hit.
[2024-05-28 19:25:54] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2024-05-28 19:25:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-28 19:25:54] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:25:54] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:25:54] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:25:54] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:25:54] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 19:25:54] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:25:55] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-28 19:25:55] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:25:55] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:25:55] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 60/125 variables, 65/85 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 0/125 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 85 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1224 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-28 19:25:55] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 60/125 variables, 65/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 59/145 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-28 19:25:56] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:25:56] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:25:56] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:25:56] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 1 ms to minimize.
[2024-05-28 19:25:56] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 5/150 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-28 19:25:56] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-28 19:25:56] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:25:56] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:25:56] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-28 19:25:57] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-28 19:25:57] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/125 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-28 19:25:58] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:25:58] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/125 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/125 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 14 (OVERLAPS) 0/125 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 158 constraints, problems are : Problem set: 0 solved, 59 unsolved in 3423 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 24/24 constraints]
After SMT, in 4657ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 4659ms
Starting structural reductions in LTL mode, iteration 1 : 65/73 places, 60/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4751 ms. Remains : 65/73 places, 60/68 transitions.
[2024-05-28 19:25:59] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:25:59] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:25:59] [INFO ] Input system was already deterministic with 60 transitions.
[2024-05-28 19:25:59] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:25:59] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:25:59] [INFO ] Time to serialize gal into /tmp/CTLFireability963569898087848240.gal : 1 ms
[2024-05-28 19:25:59] [INFO ] Time to serialize properties into /tmp/CTLFireability4579119045219228312.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/CTLFireability963569898087848240.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4579119045219228312.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: ((AX((p64==0)) * AG((EF(EG((p32==0))) * (((p12==1)&&(p66==1)) + AG(AF((p52==1))))))) * (EG((EX((p33==1)) * ((p68==1)||(p38==1)))) + EG(EF...168
=> equivalent forward existential formula: (([(EY(Init) * !((p64==0)))] = FALSE * ([(FwdU(Init,TRUE) * !(E(TRUE U EG((p32==0)))))] = FALSE * [FwdG(FwdU((Fw...322
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t10, t14, t18, t20, t24, t28, t33, t38, t40, t41, t42, t43, t44, t46, t47, t48, Inte...248
Using saturation style SCC detection
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 58/0/2
(forward)formula 0,0,3.05635,117916,1,0,363,616670,166,203,2014,732659,403
FORMULA ShieldIIPt-PT-001B-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 68/68 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 72 transition count 50
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 55 transition count 50
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 34 place count 55 transition count 45
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 44 place count 50 transition count 45
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 50 place count 44 transition count 39
Iterating global reduction 2 with 6 rules applied. Total rules applied 56 place count 44 transition count 39
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 56 place count 44 transition count 36
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 41 transition count 36
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 92 place count 26 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 25 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 24 transition count 20
Applied a total of 94 rules in 13 ms. Remains 24 /73 variables (removed 49) and now considering 20/68 (removed 48) transitions.
// Phase 1: matrix 20 rows 24 cols
[2024-05-28 19:26:02] [INFO ] Computed 9 invariants in 0 ms
[2024-05-28 19:26:02] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-28 19:26:02] [INFO ] Invariant cache hit.
[2024-05-28 19:26:02] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-28 19:26:02] [INFO ] Redundant transitions in 1 ms returned []
Running 19 sub problems to find dead transitions.
[2024-05-28 19:26:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 20/44 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 0/44 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 33 constraints, problems are : Problem set: 0 solved, 19 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 20/44 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 19/52 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 0/44 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 52 constraints, problems are : Problem set: 0 solved, 19 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 237ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 237ms
Starting structural reductions in SI_CTL mode, iteration 1 : 24/73 places, 20/68 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 317 ms. Remains : 24/73 places, 20/68 transitions.
[2024-05-28 19:26:02] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:26:02] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:26:02] [INFO ] Input system was already deterministic with 20 transitions.
[2024-05-28 19:26:02] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:26:02] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:26:02] [INFO ] Time to serialize gal into /tmp/CTLFireability12555275425657448684.gal : 1 ms
[2024-05-28 19:26:02] [INFO ] Time to serialize properties into /tmp/CTLFireability10784295547984848444.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/CTLFireability12555275425657448684.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10784295547984848444.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,4320,0.012304,4040,2,42,5,2643,6,0,119,4069,0


Converting to forward existential form...Done !
original formula: EG(AG(EF((p31==0))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(E(TRUE U (p31==0))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.022803,4304,1,0,8,3395,18,5,580,4921,10
FORMULA ShieldIIPt-PT-001B-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 62 transition count 57
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 61 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 60 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 60 transition count 55
Applied a total of 26 rules in 3 ms. Remains 60 /73 variables (removed 13) and now considering 55/68 (removed 13) transitions.
// Phase 1: matrix 55 rows 60 cols
[2024-05-28 19:26:02] [INFO ] Computed 10 invariants in 0 ms
[2024-05-28 19:26:02] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-28 19:26:02] [INFO ] Invariant cache hit.
[2024-05-28 19:26:02] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2024-05-28 19:26:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 19:26:02] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-28 19:26:03] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-28 19:26:03] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-28 19:26:03] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:26:03] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 19:26:03] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 19:26:03] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 55/115 variables, 60/77 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 0/115 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 115/115 variables, and 77 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1090 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 55/115 variables, 60/77 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 54/131 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 19:26:04] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:26:04] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:26:04] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 19:26:04] [INFO ] Deduced a trap composed of 16 places in 17 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/115 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 19:26:05] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/115 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/115 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 19:26:05] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/115 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/115 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 14 (OVERLAPS) 0/115 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 115/115 variables, and 137 constraints, problems are : Problem set: 0 solved, 54 unsolved in 2359 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 13/13 constraints]
After SMT, in 3457ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 3458ms
Starting structural reductions in LTL mode, iteration 1 : 60/73 places, 55/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3535 ms. Remains : 60/73 places, 55/68 transitions.
[2024-05-28 19:26:06] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:26:06] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:26:06] [INFO ] Input system was already deterministic with 55 transitions.
[2024-05-28 19:26:06] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:26:06] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:26:06] [INFO ] Time to serialize gal into /tmp/CTLFireability10556364792532494745.gal : 1 ms
[2024-05-28 19:26:06] [INFO ] Time to serialize properties into /tmp/CTLFireability9608681849262404058.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/CTLFireability10556364792532494745.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9608681849262404058.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.2467e+06,0.07508,7420,2,540,5,13903,6,0,297,25628,0


Converting to forward existential form...Done !
original formula: EF(((AX(EX((p8==1))) * EX((p0==1))) * ((p10==0) * AF(AG((p34==1))))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (!(EX(!(EX((p8==1))))) * EX((p0==1)))) * (p10==0)) * !(EG(!(!(E(TRUE U !((p34==1))))))))] ...163
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t13, t17, t22, t26, t31, t32, t35, t36, t37, t38, t39, t41, t42, t43, Intersection w...238
(forward)formula 0,0,1.17988,50436,1,0,284,244570,135,134,1692,283717,313
FORMULA ShieldIIPt-PT-001B-CTLFireability-2024-05 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 : 73/73 places, 68/68 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 64 transition count 59
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 64 transition count 59
Applied a total of 18 rules in 8 ms. Remains 64 /73 variables (removed 9) and now considering 59/68 (removed 9) transitions.
// Phase 1: matrix 59 rows 64 cols
[2024-05-28 19:26:07] [INFO ] Computed 10 invariants in 0 ms
[2024-05-28 19:26:07] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-28 19:26:07] [INFO ] Invariant cache hit.
[2024-05-28 19:26:07] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-05-28 19:26:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 19:26:07] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:26:07] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:26:07] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 1 ms to minimize.
[2024-05-28 19:26:07] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:26:07] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-28 19:26:07] [INFO ] Deduced a trap composed of 20 places in 18 ms of which 1 ms to minimize.
[2024-05-28 19:26:07] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 59/123 variables, 64/81 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 0/123 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 81 constraints, problems are : Problem set: 0 solved, 58 unsolved in 931 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 59/123 variables, 64/81 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 58/139 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 19:26:08] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 2 ms to minimize.
[2024-05-28 19:26:08] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:26:08] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:26:08] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 1 ms to minimize.
[2024-05-28 19:26:08] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 5/144 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 19:26:09] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-28 19:26:09] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/123 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 146 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1461 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 14/14 constraints]
After SMT, in 2397ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 2398ms
Starting structural reductions in LTL mode, iteration 1 : 64/73 places, 59/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2490 ms. Remains : 64/73 places, 59/68 transitions.
[2024-05-28 19:26:09] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:26:09] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:26:09] [INFO ] Input system was already deterministic with 59 transitions.
[2024-05-28 19:26:09] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:26:09] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:26:09] [INFO ] Time to serialize gal into /tmp/CTLFireability13093770844955166226.gal : 1 ms
[2024-05-28 19:26:09] [INFO ] Time to serialize properties into /tmp/CTLFireability11693696202002892994.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/CTLFireability13093770844955166226.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11693696202002892994.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.78002e+06,0.11194,9292,2,793,5,18644,6,0,317,37997,0


Converting to forward existential form...Done !
original formula: A(!((((p39==1) * !(EX(((p11==1)&&(p35==1))))) * !((EG((p41!=1)) + EX(((p30==1)&&(p57==1))))))) U (p55==1))
=> equivalent forward existential formula: [((Init * !(EG(!((p55==1))))) * !(E(!((p55==1)) U (!(!((((p39==1) * !(EX(((p11==1)&&(p35==1))))) * !((EG((p41!=1...217
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t13, t17, t22, t26, t28, t31, t37, t39, t40, t41, t42, t43, t45, t46, t47, t49, Inte...248
(forward)formula 0,0,4.19768,162968,1,0,1200,886892,149,590,1738,1.3768e+06,1282
FORMULA ShieldIIPt-PT-001B-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 64 transition count 59
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 64 transition count 59
Applied a total of 18 rules in 5 ms. Remains 64 /73 variables (removed 9) and now considering 59/68 (removed 9) transitions.
// Phase 1: matrix 59 rows 64 cols
[2024-05-28 19:26:14] [INFO ] Computed 10 invariants in 0 ms
[2024-05-28 19:26:14] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-28 19:26:14] [INFO ] Invariant cache hit.
[2024-05-28 19:26:14] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-05-28 19:26:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 19:26:14] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:26:14] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:26:14] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:26:14] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 1 ms to minimize.
[2024-05-28 19:26:14] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:26:14] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:26:14] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:26:14] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:26:14] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 19:26:14] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 59/123 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/123 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 84 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1153 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 59/123 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 58/142 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 19:26:15] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:26:15] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 19:26:16] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:26:16] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 19:26:16] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (OVERLAPS) 0/123 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 147 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1724 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 15/15 constraints]
After SMT, in 2884ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 2889ms
Starting structural reductions in LTL mode, iteration 1 : 64/73 places, 59/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2965 ms. Remains : 64/73 places, 59/68 transitions.
[2024-05-28 19:26:17] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:26:17] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:26:17] [INFO ] Input system was already deterministic with 59 transitions.
[2024-05-28 19:26:17] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:26:17] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:26:17] [INFO ] Time to serialize gal into /tmp/CTLFireability15955182024930819753.gal : 1 ms
[2024-05-28 19:26:17] [INFO ] Time to serialize properties into /tmp/CTLFireability4108079401890070457.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/CTLFireability15955182024930819753.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4108079401890070457.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.5898e+06,0.11505,9556,2,732,5,19199,6,0,317,40063,0


Converting to forward existential form...Done !
original formula: AF(EX(E((p38==1) U (p36==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(E((p38==1) U (p36==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t13, t17, t22, t26, t31, t37, t38, t39, t40, t41, t42, t43, t45, t46, t47, Intersect...243
(forward)formula 0,0,1.39698,59196,1,0,507,235093,144,323,1735,445552,411
FORMULA ShieldIIPt-PT-001B-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 64 transition count 59
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 64 transition count 59
Applied a total of 18 rules in 6 ms. Remains 64 /73 variables (removed 9) and now considering 59/68 (removed 9) transitions.
// Phase 1: matrix 59 rows 64 cols
[2024-05-28 19:26:18] [INFO ] Computed 10 invariants in 0 ms
[2024-05-28 19:26:18] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-28 19:26:18] [INFO ] Invariant cache hit.
[2024-05-28 19:26:18] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-05-28 19:26:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 19:26:18] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:26:18] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:26:18] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 1 ms to minimize.
[2024-05-28 19:26:18] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:26:19] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-28 19:26:19] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 19:26:19] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 59/123 variables, 64/81 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/123 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 81 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1041 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 59/123 variables, 64/81 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 58/139 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 19:26:20] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-28 19:26:20] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:26:20] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 19:26:20] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-28 19:26:20] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:26:20] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 19:26:20] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (OVERLAPS) 0/123 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 146 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1699 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 14/14 constraints]
After SMT, in 2749ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 2749ms
Starting structural reductions in LTL mode, iteration 1 : 64/73 places, 59/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2842 ms. Remains : 64/73 places, 59/68 transitions.
[2024-05-28 19:26:21] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:26:21] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:26:21] [INFO ] Input system was already deterministic with 59 transitions.
[2024-05-28 19:26:21] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:26:21] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:26:21] [INFO ] Time to serialize gal into /tmp/CTLFireability17517094663802716007.gal : 1 ms
[2024-05-28 19:26:21] [INFO ] Time to serialize properties into /tmp/CTLFireability6102197012507032561.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/CTLFireability17517094663802716007.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6102197012507032561.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.60039e+06,0.10334,8764,2,732,5,16865,6,0,317,33419,0


Converting to forward existential form...Done !
original formula: (E((!(AX((p31==1))) + (p68==1)) U AX((((p1==1)&&(p54==1))&&(!((p38==1)&&(p8==1)))))) * EX(AG(AF((p10==1)))))
=> equivalent forward existential formula: [(EY((Init * E((!(!(EX(!((p31==1))))) + (p68==1)) U !(EX(!((((p1==1)&&(p54==1))&&(!((p38==1)&&(p8==1)))))))))) *...201
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t13, t17, t22, t26, t31, t35, t37, t39, t40, t41, t42, t43, t45, t46, t47, Intersect...243
(forward)formula 0,0,4.19326,161656,1,0,768,851677,146,397,1797,1.39585e+06,865
FORMULA ShieldIIPt-PT-001B-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 64 transition count 59
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 64 transition count 59
Applied a total of 18 rules in 1 ms. Remains 64 /73 variables (removed 9) and now considering 59/68 (removed 9) transitions.
// Phase 1: matrix 59 rows 64 cols
[2024-05-28 19:26:25] [INFO ] Computed 10 invariants in 0 ms
[2024-05-28 19:26:25] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-28 19:26:25] [INFO ] Invariant cache hit.
[2024-05-28 19:26:25] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-05-28 19:26:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 19:26:25] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-28 19:26:26] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:26:26] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-28 19:26:26] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-28 19:26:26] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-28 19:26:26] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-28 19:26:26] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
[2024-05-28 19:26:26] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 19:26:26] [INFO ] Deduced a trap composed of 16 places in 17 ms of which 0 ms to minimize.
[2024-05-28 19:26:26] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:26:26] [INFO ] Deduced a trap composed of 19 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 19:26:26] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 59/123 variables, 64/86 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/123 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 86 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1233 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 59/123 variables, 64/86 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 58/144 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 19:26:27] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 19:26:27] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:26:27] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 0 ms to minimize.
[2024-05-28 19:26:27] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:26:27] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:26:27] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 5/150 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 19:26:28] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (OVERLAPS) 0/123 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 151 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1910 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 19/19 constraints]
After SMT, in 3154ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 3155ms
Starting structural reductions in LTL mode, iteration 1 : 64/73 places, 59/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3236 ms. Remains : 64/73 places, 59/68 transitions.
[2024-05-28 19:26:28] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:26:28] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:26:28] [INFO ] Input system was already deterministic with 59 transitions.
[2024-05-28 19:26:28] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:26:28] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:26:28] [INFO ] Time to serialize gal into /tmp/CTLFireability5699871618264968718.gal : 1 ms
[2024-05-28 19:26:28] [INFO ] Time to serialize properties into /tmp/CTLFireability10825288289461545258.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/CTLFireability5699871618264968718.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10825288289461545258.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.72746e+06,0.164767,11672,2,1016,5,26251,6,0,317,55720,0


Converting to forward existential form...Done !
original formula: E((EX((p61==1)) + !(AF(((E((p23==1) U (p2==1)) + E((p63==1) U (p67==1))) + (AF((p6==1)) * ((p39==1)||(p57==1))))))) U AX(!(EF((EF((p68==1...209
=> equivalent forward existential formula: [(FwdU(Init,(EX((p61==1)) + !(!(EG(!(((E((p23==1) U (p2==1)) + E((p63==1) U (p67==1))) + (!(EG(!((p6==1)))) * ((...285
Reverse transition relation is NOT exact ! Due to transitions t4, t9, t11, t14, t18, t23, t27, t31, t32, t36, t38, t39, t40, t41, t42, t43, t45, t46, t47, ...258
Using saturation style SCC detection
(forward)formula 0,0,8.89456,319624,1,0,1292,1.69973e+06,170,761,1884,2.55159e+06,1443
FORMULA ShieldIIPt-PT-001B-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 64 transition count 59
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 63 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 62 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 62 transition count 57
Applied a total of 22 rules in 7 ms. Remains 62 /73 variables (removed 11) and now considering 57/68 (removed 11) transitions.
// Phase 1: matrix 57 rows 62 cols
[2024-05-28 19:26:37] [INFO ] Computed 10 invariants in 1 ms
[2024-05-28 19:26:37] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-28 19:26:37] [INFO ] Invariant cache hit.
[2024-05-28 19:26:38] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 56 sub problems to find dead transitions.
[2024-05-28 19:26:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 19:26:38] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-28 19:26:38] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:26:38] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-28 19:26:38] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
[2024-05-28 19:26:38] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-28 19:26:38] [INFO ] Deduced a trap composed of 16 places in 16 ms of which 0 ms to minimize.
[2024-05-28 19:26:38] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:26:38] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:26:38] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 57/119 variables, 62/81 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 0/119 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 81 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1004 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 19:26:39] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:26:39] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-28 19:26:39] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 19:26:39] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 57/119 variables, 62/85 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 56/141 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 19:26:39] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 19:26:39] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 19:26:40] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/119 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 13 (OVERLAPS) 0/119 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 144 constraints, problems are : Problem set: 0 solved, 56 unsolved in 2123 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 16/16 constraints]
After SMT, in 3136ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 3136ms
Starting structural reductions in LTL mode, iteration 1 : 62/73 places, 57/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3240 ms. Remains : 62/73 places, 57/68 transitions.
[2024-05-28 19:26:41] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:26:41] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:26:41] [INFO ] Input system was already deterministic with 57 transitions.
[2024-05-28 19:26:41] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:26:41] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:26:41] [INFO ] Time to serialize gal into /tmp/CTLFireability17405241598761968950.gal : 1 ms
[2024-05-28 19:26:41] [INFO ] Time to serialize properties into /tmp/CTLFireability8485158249784764162.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/CTLFireability17405241598761968950.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8485158249784764162.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.41359e+06,0.106208,8748,2,562,5,17368,6,0,307,34190,0


Converting to forward existential form...Done !
original formula: EX((EG(AF(((p60==1)||(p45==1)))) + ((p36==1) * (AX(AF((p16==1))) + ((p14==1)&&(p47==1))))))
=> equivalent forward existential formula: ([FwdG(EY(Init),!(EG(!(((p60==1)||(p45==1))))))] != FALSE + ([((EY(Init) * (p36==1)) * !(EX(!(!(EG(!((p16==1))))...231
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t14, t19, t23, t27, t33, t34, t36, t37, t38, t39, t40, t41, t43, t44, t45, Intersect...243
(forward)formula 0,0,3.83927,153940,1,0,1451,831864,149,720,1693,1.29695e+06,1587
FORMULA ShieldIIPt-PT-001B-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 73 transition count 57
Reduce places removed 11 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 16 rules applied. Total rules applied 27 place count 62 transition count 52
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 33 place count 57 transition count 51
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 33 place count 57 transition count 45
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 45 place count 51 transition count 45
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 51 place count 45 transition count 39
Iterating global reduction 3 with 6 rules applied. Total rules applied 57 place count 45 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 57 place count 45 transition count 38
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 44 transition count 38
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 81 place count 33 transition count 27
Applied a total of 81 rules in 7 ms. Remains 33 /73 variables (removed 40) and now considering 27/68 (removed 41) transitions.
// Phase 1: matrix 27 rows 33 cols
[2024-05-28 19:26:45] [INFO ] Computed 10 invariants in 0 ms
[2024-05-28 19:26:45] [INFO ] Implicit Places using invariants in 23 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 32/73 places, 27/68 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 27/27 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 32 ms. Remains : 32/73 places, 27/68 transitions.
[2024-05-28 19:26:45] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:26:45] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:26:45] [INFO ] Input system was already deterministic with 27 transitions.
[2024-05-28 19:26:45] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:26:45] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:26:45] [INFO ] Time to serialize gal into /tmp/CTLFireability11796838407837633008.gal : 1 ms
[2024-05-28 19:26:45] [INFO ] Time to serialize properties into /tmp/CTLFireability13391820813927516195.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/CTLFireability11796838407837633008.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13391820813927516195.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,12514,0.022473,4340,2,137,5,4107,6,0,157,6769,0


Converting to forward existential form...Done !
original formula: AF(((EF(EG((p34==1))) * (p4==0)) * ((p56==0)&&(((p11==0)||(p38==0))||((p12==1)&&(p66==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(((E(TRUE U EG((p34==1))) * (p4==0)) * ((p56==0)&&(((p11==0)||(p38==0))||((p12==1)&&(p66==1)))))))] ...162
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t4, t5, t10, t16, t26, Intersection with reachable at each step enabled. (destroyed/...190
(forward)formula 0,1,0.079685,6980,1,0,149,18418,87,66,951,23716,168
FORMULA ShieldIIPt-PT-001B-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 65 transition count 60
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 65 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 64 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 63 transition count 58
Applied a total of 20 rules in 8 ms. Remains 63 /73 variables (removed 10) and now considering 58/68 (removed 10) transitions.
// Phase 1: matrix 58 rows 63 cols
[2024-05-28 19:26:45] [INFO ] Computed 10 invariants in 1 ms
[2024-05-28 19:26:45] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-28 19:26:45] [INFO ] Invariant cache hit.
[2024-05-28 19:26:45] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Running 57 sub problems to find dead transitions.
[2024-05-28 19:26:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-28 19:26:45] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:26:45] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:26:45] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-28 19:26:45] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-28 19:26:45] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:26:45] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:26:45] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:26:45] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-05-28 19:26:45] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
[2024-05-28 19:26:45] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2024-05-28 19:26:45] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-28 19:26:45] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 0 ms to minimize.
[2024-05-28 19:26:45] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:26:45] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-28 19:26:45] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 58/121 variables, 63/88 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 0/121 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 88 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1281 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 58/121 variables, 63/88 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 57/145 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-28 19:26:46] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-28 19:26:47] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:26:47] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (OVERLAPS) 0/121 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 148 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1553 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 18/18 constraints]
After SMT, in 2840ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 2842ms
Starting structural reductions in LTL mode, iteration 1 : 63/73 places, 58/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2927 ms. Remains : 63/73 places, 58/68 transitions.
[2024-05-28 19:26:48] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:26:48] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:26:48] [INFO ] Input system was already deterministic with 58 transitions.
[2024-05-28 19:26:48] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:26:48] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:26:48] [INFO ] Time to serialize gal into /tmp/CTLFireability7807436591076232043.gal : 1 ms
[2024-05-28 19:26:48] [INFO ] Time to serialize properties into /tmp/CTLFireability6178845200791910162.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/CTLFireability7807436591076232043.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6178845200791910162.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.816e+06,0.128324,9808,2,727,5,21592,6,0,312,41753,0


Converting to forward existential form...Done !
original formula: AF((AX(EX(EG((p30==1)))) * AX((((p51==0)&&((p30==0)||(p53==0)))&&(p5==0)))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(EX(EG((p30==1)))))) * !(EX(!((((p51==0)&&((p30==0)||(p53==0)))&&(p5==0))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t13, t18, t19, t21, t24, t28, t33, t36, t38, t39, t40, t41, t42, t44, t45, t46, Inte...248
(forward)formula 0,0,3.04584,115492,1,0,582,499087,144,382,1720,899074,581
FORMULA ShieldIIPt-PT-001B-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 64 transition count 59
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 64 transition count 59
Applied a total of 18 rules in 1 ms. Remains 64 /73 variables (removed 9) and now considering 59/68 (removed 9) transitions.
// Phase 1: matrix 59 rows 64 cols
[2024-05-28 19:26:51] [INFO ] Computed 10 invariants in 1 ms
[2024-05-28 19:26:51] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-28 19:26:51] [INFO ] Invariant cache hit.
[2024-05-28 19:26:51] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-05-28 19:26:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 19:26:51] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-28 19:26:51] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:26:51] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 0 ms to minimize.
[2024-05-28 19:26:51] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:26:51] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-28 19:26:51] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 59/123 variables, 64/80 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 19:26:51] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/123 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 81 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1089 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 19:26:52] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 19:26:52] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:26:52] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 59/123 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 58/142 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 19:26:53] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 19:26:53] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:26:53] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 19:26:53] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:26:53] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 12 (OVERLAPS) 0/123 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 147 constraints, problems are : Problem set: 0 solved, 58 unsolved in 2082 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 15/15 constraints]
After SMT, in 3180ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 3182ms
Starting structural reductions in LTL mode, iteration 1 : 64/73 places, 59/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3253 ms. Remains : 64/73 places, 59/68 transitions.
[2024-05-28 19:26:54] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:26:54] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:26:54] [INFO ] Input system was already deterministic with 59 transitions.
[2024-05-28 19:26:54] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:26:54] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:26:54] [INFO ] Time to serialize gal into /tmp/CTLFireability15434623307960170739.gal : 1 ms
[2024-05-28 19:26:54] [INFO ] Time to serialize properties into /tmp/CTLFireability5524286826657832392.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15434623307960170739.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5524286826657832392.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.62088e+06,0.120446,9560,2,916,5,19847,6,0,317,40487,0


Converting to forward existential form...Done !
original formula: (E((((!(EG((p68!=1))) * EG((p6==1))) * (!(AX((((p27==1)&&(p59==1))&&(p71==1)))) * (p46==1))) * (p26==1)) U ((AX(((p38==1)&&((p57==1)||(((...416
=> equivalent forward existential formula: ([((FwdU(EY((Init * !(E((((!(EG((p68!=1))) * EG((p6==1))) * (!(!(EX(!((((p27==1)&&(p59==1))&&(p71==1)))))) * (p4...970
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t13, t17, t18, t23, t27, t32, t37, t39, t40, t41, t42, t43, t45, t46, t47, Intersect...243
(forward)formula 0,1,5.85584,208716,1,0,861,1.09962e+06,172,429,1838,1.7222e+06,946
FORMULA ShieldIIPt-PT-001B-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-28 19:27:00] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:27:00] [INFO ] Flatten gal took : 3 ms
Total runtime 91056 ms.

BK_STOP 1716924420477

--------------------
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="ShieldIIPt-PT-001B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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