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-171683760200009.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ShieldIIPs-PT-001B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760200009
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 14:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 187K Apr 11 14:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 14:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 14:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 17K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716876383178

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-001B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-28 06:06:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 06:06:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 06:06:24] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2024-05-28 06:06:24] [INFO ] Transformed 63 places.
[2024-05-28 06:06:24] [INFO ] Transformed 62 transitions.
[2024-05-28 06:06:24] [INFO ] Found NUPN structural information;
[2024-05-28 06:06:24] [INFO ] Parsed PT model containing 63 places and 62 transitions and 184 arcs in 132 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
FORMULA ShieldIIPs-PT-001B-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-001B-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 62 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 61
Applied a total of 2 rules in 17 ms. Remains 62 /63 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 62 cols
[2024-05-28 06:06:24] [INFO ] Computed 10 invariants in 6 ms
[2024-05-28 06:06:24] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-28 06:06:24] [INFO ] Invariant cache hit.
[2024-05-28 06:06:24] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-28 06:06:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 7 ms to minimize.
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 2 ms to minimize.
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 18 places in 16 ms of which 1 ms to minimize.
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 17 places in 16 ms of which 1 ms to minimize.
[2024-05-28 06:06:25] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:06:26] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 9/35 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:06:26] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/123 variables, 62/98 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:06:26] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:06:26] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:06:26] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:06:26] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:06:26] [INFO ] Deduced a trap composed of 23 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:06:26] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:06:26] [INFO ] Deduced a trap composed of 25 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:06:27] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:06:27] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 4 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/123 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:06:27] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:06:27] [INFO ] Deduced a trap composed of 21 places in 18 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/123 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/123 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:06:28] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:06:28] [INFO ] Deduced a trap composed of 22 places in 18 ms of which 0 ms to minimize.
[2024-05-28 06:06:28] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:06:28] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:06:28] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/123 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:06:28] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:06:28] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:06:28] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/123 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:06:28] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:06:28] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:06:28] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/123 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/123 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:06:29] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:06:29] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/123 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/123 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 20 (OVERLAPS) 0/123 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 122 constraints, problems are : Problem set: 0 solved, 60 unsolved in 4888 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 61/123 variables, 62/122 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 60/182 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:06:30] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 4 ms to minimize.
[2024-05-28 06:06:30] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:06:30] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 5 ms to minimize.
[2024-05-28 06:06:30] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 2/186 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/123 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 186 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2498 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 54/54 constraints]
After SMT, in 7435ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 7445ms
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 61/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7727 ms. Remains : 62/63 places, 61/62 transitions.
Support contains 58 out of 62 places after structural reductions.
[2024-05-28 06:06:32] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-28 06:06:32] [INFO ] Flatten gal took : 23 ms
FORMULA ShieldIIPs-PT-001B-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 06:06:32] [INFO ] Flatten gal took : 8 ms
[2024-05-28 06:06:32] [INFO ] Input system was already deterministic with 61 transitions.
Support contains 54 out of 62 places (down from 58) after GAL structural reductions.
RANDOM walk for 23473 steps (7 resets) in 492 ms. (47 steps per ms) remains 0/54 properties
[2024-05-28 06:06:32] [INFO ] Flatten gal took : 7 ms
[2024-05-28 06:06:32] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:06:32] [INFO ] Input system was already deterministic with 61 transitions.
Computed a total of 15 stabilizing places and 15 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 61/61 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 55 transition count 54
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 55 transition count 54
Applied a total of 14 rules in 4 ms. Remains 55 /62 variables (removed 7) and now considering 54/61 (removed 7) transitions.
// Phase 1: matrix 54 rows 55 cols
[2024-05-28 06:06:32] [INFO ] Computed 10 invariants in 3 ms
[2024-05-28 06:06:32] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-28 06:06:32] [INFO ] Invariant cache hit.
[2024-05-28 06:06:32] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 53 sub problems to find dead transitions.
[2024-05-28 06:06:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:06:33] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:06:33] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:06:33] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 8 ms to minimize.
[2024-05-28 06:06:33] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-28 06:06:33] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:06:33] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:06:33] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:06:33] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:06:33] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:06:33] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:06:33] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:06:33] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 54/109 variables, 55/77 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:06:34] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:06:34] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 0/109 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 79 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1563 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:06:34] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:06:34] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:06:34] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 54/109 variables, 55/82 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 53/135 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:06:34] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:06:34] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:06:34] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:06:35] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:06:35] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:06:35] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:06:35] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:06:35] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/109 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (OVERLAPS) 0/109 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 143 constraints, problems are : Problem set: 0 solved, 53 unsolved in 2033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 25/25 constraints]
After SMT, in 3612ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 3613ms
Starting structural reductions in LTL mode, iteration 1 : 55/62 places, 54/61 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3708 ms. Remains : 55/62 places, 54/61 transitions.
[2024-05-28 06:06:36] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:06:36] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:06:36] [INFO ] Input system was already deterministic with 54 transitions.
[2024-05-28 06:06:36] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:06:36] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:06:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality14048993147911707525.gal : 2 ms
[2024-05-28 06:06:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality5144480185986936111.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/CTLCardinality14048993147911707525.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5144480185986936111.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,606789,0.587301,23236,2,4634,5,65066,6,0,276,119239,0


Converting to forward existential form...Done !
original formula: EF(EX((EF((p40==1)) * EX((p42==1)))))
=> equivalent forward existential formula: [(EY((EY(FwdU(Init,TRUE)) * E(TRUE U (p40==1)))) * (p42==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t13, t18, t27, t28, t29, t30, t31, t33, t34, t35, Inters...246
(forward)formula 0,1,1.99505,56212,1,0,157,241438,130,71,1712,270290,149
FORMULA ShieldIIPs-PT-001B-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,606789,0.512629,23308,2,4634,5,65066,6,0,276,119239,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.513581,23308,1,0,6,65066,7,1,347,119239,1
FORMULA ShieldIIPs-PT-001B-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 61/61 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 60 transition count 59
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 60 transition count 59
Applied a total of 4 rules in 6 ms. Remains 60 /62 variables (removed 2) and now considering 59/61 (removed 2) transitions.
// Phase 1: matrix 59 rows 60 cols
[2024-05-28 06:06:42] [INFO ] Computed 10 invariants in 3 ms
[2024-05-28 06:06:42] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-28 06:06:42] [INFO ] Invariant cache hit.
[2024-05-28 06:06:42] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-05-28 06:06:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 06:06:42] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:06:42] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:06:42] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:06:42] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-05-28 06:06:43] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:06:43] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:06:43] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:06:43] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:06:43] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 0 ms to minimize.
[2024-05-28 06:06:43] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:06:43] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:06:43] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 1 ms to minimize.
[2024-05-28 06:06:43] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:06:43] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:06:43] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 06:06:43] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:06:43] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:06:43] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 59/119 variables, 60/88 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 06:06:43] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:06:43] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:06:43] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:06:43] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 06:06:44] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:06:44] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 06:06:44] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:06:44] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 06:06:44] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 06:06:44] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 06:06:44] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 06:06:45] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:06:45] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/119 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 06:06:45] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/119 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/119 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 16 (OVERLAPS) 0/119 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 102 constraints, problems are : Problem set: 0 solved, 58 unsolved in 3174 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 32/42 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 59/119 variables, 60/102 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 58/160 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 06:06:46] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:06:46] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:06:46] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 3/163 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 06:06:46] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:06:46] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 06:06:47] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:06:47] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:06:47] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/119 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 06:06:48] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-28 06:06:48] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/119 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/119 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 14 (OVERLAPS) 0/119 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 170 constraints, problems are : Problem set: 0 solved, 58 unsolved in 4014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 42/42 constraints]
After SMT, in 7199ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 7199ms
Starting structural reductions in LTL mode, iteration 1 : 60/62 places, 59/61 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7295 ms. Remains : 60/62 places, 59/61 transitions.
[2024-05-28 06:06:49] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:06:49] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:06:49] [INFO ] Input system was already deterministic with 59 transitions.
[2024-05-28 06:06:49] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:06:49] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:06:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality7132411735288919158.gal : 1 ms
[2024-05-28 06:06:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality950569288859012237.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/CTLCardinality7132411735288919158.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality950569288859012237.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,781104,0.63604,25840,2,5874,5,80023,6,0,301,133535,0


Converting to forward existential form...Done !
original formula: ((EF(((!(A((p13==1) U ((p7==0)||(p50==1)))) * (p23==0)) * ((p31==1)&&(p53==0)))) * EX(((((p36==0)&&(p18==1)) + EX((p39==0))) + ((p18==1) ...299
=> equivalent forward existential formula: [(FwdU(FwdU((Init * (E(TRUE U ((!(!((E(!(((p7==0)||(p50==1))) U (!((p13==1)) * !(((p7==0)||(p50==1))))) + EG(!((...492
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t16, t19, t21, t25, t26, t28, t31, t32, t33, t3...281
(forward)formula 0,0,8.05359,254980,1,0,494,1.55057e+06,181,188,1864,1.56931e+06,559
FORMULA ShieldIIPs-PT-001B-CTLCardinality-2024-03 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 : 62/62 places, 61/61 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 61 transition count 56
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 57 transition count 56
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 8 place count 57 transition count 50
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 20 place count 51 transition count 50
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 27 place count 44 transition count 43
Iterating global reduction 2 with 7 rules applied. Total rules applied 34 place count 44 transition count 43
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 34 place count 44 transition count 41
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 38 place count 42 transition count 41
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 66 place count 28 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 27 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 26 transition count 26
Applied a total of 68 rules in 31 ms. Remains 26 /62 variables (removed 36) and now considering 26/61 (removed 35) transitions.
// Phase 1: matrix 26 rows 26 cols
[2024-05-28 06:06:58] [INFO ] Computed 9 invariants in 0 ms
[2024-05-28 06:06:58] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-28 06:06:58] [INFO ] Invariant cache hit.
[2024-05-28 06:06:58] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-28 06:06:58] [INFO ] Redundant transitions in 12 ms returned [25]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 24 sub problems to find dead transitions.
// Phase 1: matrix 25 rows 26 cols
[2024-05-28 06:06:58] [INFO ] Computed 9 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 1/26 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-28 06:06:58] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:06:58] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 25/51 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 37 constraints, problems are : Problem set: 0 solved, 24 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 1/26 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 25/51 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 24/61 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/51 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 61 constraints, problems are : Problem set: 0 solved, 24 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 2/2 constraints]
After SMT, in 457ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 458ms
Starting structural reductions in SI_CTL mode, iteration 1 : 26/62 places, 25/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 26 /26 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 564 ms. Remains : 26/62 places, 25/61 transitions.
[2024-05-28 06:06:58] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:06:58] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:06:58] [INFO ] Input system was already deterministic with 25 transitions.
[2024-05-28 06:06:58] [INFO ] Flatten gal took : 1 ms
[2024-05-28 06:06:58] [INFO ] Flatten gal took : 1 ms
[2024-05-28 06:06:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality637304920560681527.gal : 1 ms
[2024-05-28 06:06:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality11813569738005354862.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/CTLCardinality637304920560681527.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11813569738005354862.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,5096,0.031331,4892,2,375,5,6540,6,0,132,11100,0


Converting to forward existential form...Done !
original formula: AG(((p16==1) + AF((AF(((p49==0)||(p32==1))) * AG((p21==0))))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !((p16==1))),!((!(EG(!(((p49==0)||(p32==1))))) * !(E(TRUE U !((p21==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t20, t21, t22, t23, t24, Intersection with reachable at each ste...213
(forward)formula 0,0,0.11752,8324,1,0,179,27197,86,80,883,30873,195
FORMULA ShieldIIPs-PT-001B-CTLCardinality-2024-04 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 : 62/62 places, 61/61 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 61 transition count 57
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 58 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 57 transition count 56
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 8 place count 57 transition count 51
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 18 place count 52 transition count 51
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 24 place count 46 transition count 45
Iterating global reduction 3 with 6 rules applied. Total rules applied 30 place count 46 transition count 45
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 30 place count 46 transition count 43
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 34 place count 44 transition count 43
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 56 place count 33 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 32 transition count 31
Applied a total of 57 rules in 13 ms. Remains 32 /62 variables (removed 30) and now considering 31/61 (removed 30) transitions.
// Phase 1: matrix 31 rows 32 cols
[2024-05-28 06:06:58] [INFO ] Computed 10 invariants in 1 ms
[2024-05-28 06:06:58] [INFO ] Implicit Places using invariants in 35 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 31/62 places, 31/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 31/31 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 51 ms. Remains : 31/62 places, 31/61 transitions.
[2024-05-28 06:06:58] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:06:58] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:06:58] [INFO ] Input system was already deterministic with 31 transitions.
[2024-05-28 06:06:58] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:06:58] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:06:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality13918082953896341602.gal : 1 ms
[2024-05-28 06:06:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality17466534976342582000.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/CTLCardinality13918082953896341602.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17466534976342582000.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,9199,0.036226,5188,2,483,5,6760,6,0,157,11336,0


Converting to forward existential form...Done !
original formula: A(((p16!=0) + EG((!((!(((p55==0)||(p42==1))) * EG(((p44==0)||(p34==1))))) * AG(((p18==0)||(p17==1)))))) U AF((AG((p20!=0)) * EG((p55==1))...158
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!((!(E(TRUE U !((p20!=0)))) * EG((p55==1)))))))))) * !(E(!(!(EG(!((!(E(TRUE U !((p20!=0)))...367
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t11, t15, Intersection with reachable at each step enabled. ...202
Using saturation style SCC detection
(forward)formula 0,0,0.633954,27672,1,0,486,143390,108,230,1122,159140,571
FORMULA ShieldIIPs-PT-001B-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

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


Converting to forward existential form...Done !
original formula: (EX(EG(AF((p38==1)))) + (AF(AX((p40==0))) * AF(((p16==0)||(p6==1)))))
=> equivalent forward existential formula: ([FwdG((Init * !(EX(EG(!(EG(!((p38==1)))))))),!(!(EX(!((p40==0))))))] = FALSE * [FwdG((Init * !(EX(EG(!(EG(!((p3...201
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t13, t18, t22, t23, t28, t29, t30, t31, t32, t34, t35, t3...256
Using saturation style SCC detection
(forward)formula 0,1,6.20349,217288,1,0,930,1.10455e+06,152,504,1775,1.81865e+06,1046
FORMULA ShieldIIPs-PT-001B-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,686430,0.601006,26172,2,4745,5,76494,6,0,281,134356,0


Converting to forward existential form...Done !
original formula: EX((AG(A((((p47==1)||(p10==0))||(p60==1)) U (((p61==0)||(p4==1))||(p25==1)))) + ((EG(((p44==0)||(p25==1))) * (p5==0)) * (p36==1))))
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U !(!((E(!((((p61==0)||(p4==1))||(p25==1))) U (!((((p47==1)||(p10==0))||(p60==1))) * !(((...319
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t14, t19, t28, t29, t30, t31, t32, t34, t35, t36, I...251
(forward)formula 0,0,2.27095,74036,1,0,443,372561,151,175,1782,383087,498
FORMULA ShieldIIPs-PT-001B-CTLCardinality-2024-07 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 : 62/62 places, 61/61 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 61 transition count 56
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 57 transition count 56
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 8 place count 57 transition count 50
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 20 place count 51 transition count 50
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 46 transition count 45
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 46 transition count 45
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 30 place count 46 transition count 43
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 44 transition count 43
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 60 place count 31 transition count 30
Applied a total of 60 rules in 6 ms. Remains 31 /62 variables (removed 31) and now considering 30/61 (removed 31) transitions.
// Phase 1: matrix 30 rows 31 cols
[2024-05-28 06:07:15] [INFO ] Computed 10 invariants in 0 ms
[2024-05-28 06:07:15] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-28 06:07:15] [INFO ] Invariant cache hit.
[2024-05-28 06:07:15] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-28 06:07:15] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-28 06:07:15] [INFO ] Redundant transitions in 10 ms returned [29]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 28 sub problems to find dead transitions.
// Phase 1: matrix 29 rows 31 cols
[2024-05-28 06:07:15] [INFO ] Computed 10 invariants in 1 ms
[2024-05-28 06:07:15] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 29/60 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 49 constraints, problems are : Problem set: 0 solved, 28 unsolved in 420 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 31/31 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 1/31 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 29/60 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 28/77 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/60 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 77 constraints, problems are : Problem set: 0 solved, 28 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 31/31 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 5/5 constraints]
After SMT, in 757ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 759ms
Starting structural reductions in SI_CTL mode, iteration 1 : 31/62 places, 29/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 31 /31 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 845 ms. Remains : 31/62 places, 29/61 transitions.
[2024-05-28 06:07:16] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:07:16] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:07:16] [INFO ] Input system was already deterministic with 29 transitions.
[2024-05-28 06:07:16] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:07:16] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:07:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality9673567863531224732.gal : 0 ms
[2024-05-28 06:07:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality51652207216233324.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/CTLCardinality9673567863531224732.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality51652207216233324.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7572,0.038945,5452,2,578,5,7856,6,0,153,11888,0


Converting to forward existential form...Done !
original formula: AF((((p39==0)&&(p40==1))||(((p7==0)&&(p58==1))&&((p6==0)||(p60==1)))))
=> equivalent forward existential formula: [FwdG(Init,!((((p39==0)&&(p40==1))||(((p7==0)&&(p58==1))&&((p6==0)||(p60==1))))))] = FALSE
Hit Full ! (commute/partial/dont) 15/4/14
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
(forward)formula 0,1,0.071995,5980,1,0,15,12222,20,3,844,11888,14
FORMULA ShieldIIPs-PT-001B-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,606789,0.588222,25392,2,4541,5,73210,6,0,281,129601,0


Converting to forward existential form...Done !
original formula: E(((p57!=1) + (AG(!(AF((p59==1)))) * EF(((p24==0)||(p48==1))))) U (EG((p25==1)) + AX(AX((p62==1)))))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,((p57!=1) + (!(E(TRUE U !(!(!(EG(!((p59==1)))))))) * E(TRUE U ((p24==0)||(p48==1)))))),(p25==1)...310
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t14, t17, t19, t28, t29, t30, t31, t32, t34, t35, t36, I...251
Hit Full ! (commute/partial/dont) 52/0/3
(forward)formula 0,1,19.1198,592168,1,0,1808,2.9326e+06,152,961,1846,4.39682e+06,1898
FORMULA ShieldIIPs-PT-001B-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 61/61 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 61 transition count 55
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 56 transition count 55
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 10 place count 56 transition count 50
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 51 transition count 50
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 46 transition count 45
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 46 transition count 45
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 30 place count 46 transition count 43
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 44 transition count 43
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 60 place count 31 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 30 transition count 29
Applied a total of 61 rules in 9 ms. Remains 30 /62 variables (removed 32) and now considering 29/61 (removed 32) transitions.
// Phase 1: matrix 29 rows 30 cols
[2024-05-28 06:07:39] [INFO ] Computed 10 invariants in 0 ms
[2024-05-28 06:07:39] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-28 06:07:39] [INFO ] Invariant cache hit.
[2024-05-28 06:07:39] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-28 06:07:39] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-28 06:07:39] [INFO ] Redundant transitions in 11 ms returned [28]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 27 sub problems to find dead transitions.
// Phase 1: matrix 28 rows 30 cols
[2024-05-28 06:07:39] [INFO ] Computed 10 invariants in 0 ms
[2024-05-28 06:07:39] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-28 06:07:39] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:07:39] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
[2024-05-28 06:07:39] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 28/58 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 0/58 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 58/58 variables, and 46 constraints, problems are : Problem set: 0 solved, 27 unsolved in 315 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 30/30 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 1/30 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 28/58 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/58 variables, 27/73 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-28 06:07:39] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/58 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/58 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (OVERLAPS) 0/58 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 58/58 variables, and 74 constraints, problems are : Problem set: 0 solved, 27 unsolved in 362 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 30/30 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 4/4 constraints]
After SMT, in 684ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 685ms
Starting structural reductions in SI_CTL mode, iteration 1 : 30/62 places, 28/61 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 777 ms. Remains : 30/62 places, 28/61 transitions.
[2024-05-28 06:07:40] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:07:40] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:07:40] [INFO ] Input system was already deterministic with 28 transitions.
[2024-05-28 06:07:40] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:07:40] [INFO ] Flatten gal took : 1 ms
[2024-05-28 06:07:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality15377564664039754295.gal : 1 ms
[2024-05-28 06:07:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality13527759660123212636.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/CTLCardinality15377564664039754295.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13527759660123212636.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,7759,0.028073,4652,2,473,5,5455,6,0,148,7931,0


Converting to forward existential form...Done !
original formula: EF((AG(((p12==0)||(p28==1))) * EG(((p24==1)&&(p39==0)))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(E(TRUE U !(((p12==0)||(p28==1)))))),((p24==1)&&(p39==0)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t15, t19, t20, t23, t24, t25, t26, t27, Intersection wit...236
Hit Full ! (commute/partial/dont) 21/7/7
(forward)formula 0,1,0.143188,9668,1,0,126,33330,88,45,1043,37616,119
FORMULA ShieldIIPs-PT-001B-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 61/61 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 61 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 60
Applied a total of 2 rules in 2 ms. Remains 61 /62 variables (removed 1) and now considering 60/61 (removed 1) transitions.
// Phase 1: matrix 60 rows 61 cols
[2024-05-28 06:07:40] [INFO ] Computed 10 invariants in 1 ms
[2024-05-28 06:07:40] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-28 06:07:40] [INFO ] Invariant cache hit.
[2024-05-28 06:07:40] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2024-05-28 06:07:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-28 06:07:40] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:07:40] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:07:40] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:07:40] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:07:40] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:07:40] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 0 ms to minimize.
[2024-05-28 06:07:40] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:07:40] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:07:40] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:07:40] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:07:40] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:07:40] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-28 06:07:40] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 2 ms to minimize.
[2024-05-28 06:07:40] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:07:40] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:07:41] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-28 06:07:41] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:07:41] [INFO ] Deduced a trap composed of 21 places in 17 ms of which 0 ms to minimize.
[2024-05-28 06:07:41] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:07:41] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 5 ms to minimize.
[2024-05-28 06:07:41] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:07:41] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:07:41] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 7/33 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-28 06:07:41] [INFO ] Deduced a trap composed of 10 places in 14 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 60/121 variables, 61/95 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-28 06:07:41] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 0 ms to minimize.
[2024-05-28 06:07:41] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:07:41] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:07:41] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-28 06:07:41] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 5/100 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/121 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 100 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2078 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 29/39 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-28 06:07:42] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:07:42] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-28 06:07:42] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:07:42] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 60/121 variables, 61/104 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 59/163 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-28 06:07:43] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:07:43] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-28 06:07:43] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:07:43] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:07:43] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/121 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 168 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2173 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 38/38 constraints]
After SMT, in 4261ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 4262ms
Starting structural reductions in LTL mode, iteration 1 : 61/62 places, 60/61 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4338 ms. Remains : 61/62 places, 60/61 transitions.
[2024-05-28 06:07:44] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:07:44] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:07:44] [INFO ] Input system was already deterministic with 60 transitions.
[2024-05-28 06:07:44] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:07:44] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:07:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality8280941146529535827.gal : 1 ms
[2024-05-28 06:07:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality4003176555052775123.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/CTLCardinality8280941146529535827.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4003176555052775123.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,781104,0.378788,19644,2,2572,5,51923,6,0,306,107110,0


Converting to forward existential form...Done !
original formula: (!(E((E((((((p41==0)&&((p26==0)||(p62==1)))||(p13==0))||((p45==1)||(p20==0)))||(p4==1)) U AF((p38==0))) + AX((p30!=1))) U EG(!(((((p62==0...311
=> equivalent forward existential formula: ([(FwdU((EY((Init * !(!(E((E((((((p41==0)&&((p26==0)||(p62==1)))||(p13==0))||((p45==1)||(p20==0)))||(p4==1)) U !...675
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t16, t19, t22, t24, t26, t27, t29, t32, t33, t3...286
(forward)formula 0,1,1.48595,55736,1,0,212,242731,150,93,1851,355268,196
FORMULA ShieldIIPs-PT-001B-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 61/61 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 56 transition count 55
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 56 transition count 55
Applied a total of 12 rules in 5 ms. Remains 56 /62 variables (removed 6) and now considering 55/61 (removed 6) transitions.
// Phase 1: matrix 55 rows 56 cols
[2024-05-28 06:07:46] [INFO ] Computed 10 invariants in 0 ms
[2024-05-28 06:07:46] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-28 06:07:46] [INFO ] Invariant cache hit.
[2024-05-28 06:07:46] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2024-05-28 06:07:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 06:07:46] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:07:46] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:07:46] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:07:46] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:07:46] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
[2024-05-28 06:07:46] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:07:46] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 06:07:46] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 06:07:46] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:07:46] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 55/111 variables, 56/76 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 06:07:46] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:07:46] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 06:07:47] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/111 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 06:07:47] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:07:47] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/111 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 06:07:47] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/111 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/111 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 13 (OVERLAPS) 0/111 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 82 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1920 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 55/111 variables, 56/82 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 54/136 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 06:07:48] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:07:48] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:07:48] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 06:07:48] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 06:07:49] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 0/111 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 141 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1798 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 21/21 constraints]
After SMT, in 3723ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 3724ms
Starting structural reductions in LTL mode, iteration 1 : 56/62 places, 55/61 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3797 ms. Remains : 56/62 places, 55/61 transitions.
[2024-05-28 06:07:49] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:07:49] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:07:49] [INFO ] Input system was already deterministic with 55 transitions.
[2024-05-28 06:07:49] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:07:49] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:07:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality3218641831655308892.gal : 1 ms
[2024-05-28 06:07:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality14745264861868176571.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/CTLCardinality3218641831655308892.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14745264861868176571.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,665241,0.510281,25860,2,4859,5,82415,6,0,281,130680,0


Converting to forward existential form...Done !
original formula: EF((AX(((p56==1) * EX((p26==0)))) * !(A(AX((p34==1)) U (((EX((p35==1)) + (p60==0)) + ((p41==1)||(p19==0))) + ((p52==1) + EG((p55==0))))))...157
=> equivalent forward existential formula: ([(((((FwdU((FwdU(Init,TRUE) * !(EX(!(((p56==1) * EX((p26==0))))))),!((((EX((p35==1)) + (p60==0)) + ((p41==1)||(...483
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t14, t19, t28, t29, t30, t31, t32, t34, t35, t36, I...251
(forward)formula 0,0,10.1535,325048,1,0,696,2.07787e+06,150,293,1722,1.88341e+06,780
FORMULA ShieldIIPs-PT-001B-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

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


Converting to forward existential form...Done !
original formula: A(E(EG(((p9==0)||(p52==1))) U ((p15==0)||(p32==1))) U EX((p40==1)))
=> equivalent forward existential formula: [((Init * !(EG(!(EX((p40==1)))))) * !(E(!(EX((p40==1))) U (!(E(EG(((p9==0)||(p52==1))) U ((p15==0)||(p32==1)))) ...186
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t13, t18, t27, t28, t29, t30, t31, t33, t34, t35, Inters...246
Using saturation style SCC detection
(forward)formula 0,1,20.5994,620288,1,0,1095,3.49099e+06,141,612,1749,4.38609e+06,1172
FORMULA ShieldIIPs-PT-001B-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-28 06:08:24] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:08:24] [INFO ] Flatten gal took : 2 ms
Total runtime 120320 ms.

BK_STOP 1716876504681

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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