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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 03:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 12 03:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 03:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 125K Apr 12 03:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 33K May 18 16:42 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 DoubleExponent-PT-002-CTLCardinality-2024-00
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2024-01
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2024-02
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2024-03
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2024-04
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2024-05
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2024-06
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2024-07
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2024-08
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2024-09
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2024-10
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2024-11
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2023-12
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2023-13
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2023-14
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716384923217

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-22 13:35: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-22 13:35:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 13:35:24] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2024-05-22 13:35:24] [INFO ] Transformed 110 places.
[2024-05-22 13:35:24] [INFO ] Transformed 98 transitions.
[2024-05-22 13:35:24] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 144 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Support contains 75 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 108 transition count 98
Applied a total of 2 rules in 26 ms. Remains 108 /110 variables (removed 2) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 108 cols
[2024-05-22 13:35:24] [INFO ] Computed 12 invariants in 11 ms
[2024-05-22 13:35:24] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-22 13:35:24] [INFO ] Invariant cache hit.
[2024-05-22 13:35:24] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-22 13:35:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 2/107 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-22 13:35:25] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 14 ms to minimize.
[2024-05-22 13:35:25] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-22 13:35:25] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2024-05-22 13:35:25] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2024-05-22 13:35:25] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 2 ms to minimize.
[2024-05-22 13:35:25] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-22 13:35:26] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 1 ms to minimize.
[2024-05-22 13:35:26] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2024-05-22 13:35:26] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-22 13:35:26] [INFO ] Deduced a trap composed of 55 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-22 13:35:26] [INFO ] Deduced a trap composed of 61 places in 35 ms of which 1 ms to minimize.
[2024-05-22 13:35:26] [INFO ] Deduced a trap composed of 69 places in 37 ms of which 1 ms to minimize.
[2024-05-22 13:35:26] [INFO ] Deduced a trap composed of 47 places in 35 ms of which 1 ms to minimize.
[2024-05-22 13:35:26] [INFO ] Deduced a trap composed of 69 places in 44 ms of which 1 ms to minimize.
[2024-05-22 13:35:26] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/205 variables, 107/134 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 1/206 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-22 13:35:28] [INFO ] Deduced a trap composed of 74 places in 47 ms of which 1 ms to minimize.
[2024-05-22 13:35:28] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-22 13:35:28] [INFO ] Deduced a trap composed of 66 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (OVERLAPS) 0/206 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 138 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5068 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 2/107 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 18/30 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 98/205 variables, 107/137 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 95/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 1/206 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-22 13:35:33] [INFO ] Deduced a trap composed of 67 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/206 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 236 constraints, problems are : Problem set: 0 solved, 97 unsolved in 6941 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 19/19 constraints]
After SMT, in 12054ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 12085ms
Starting structural reductions in LTL mode, iteration 1 : 108/110 places, 98/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12476 ms. Remains : 108/110 places, 98/98 transitions.
Support contains 75 out of 108 places after structural reductions.
[2024-05-22 13:35:37] [INFO ] Flatten gal took : 27 ms
[2024-05-22 13:35:37] [INFO ] Flatten gal took : 11 ms
[2024-05-22 13:35:37] [INFO ] Input system was already deterministic with 98 transitions.
RANDOM walk for 40000 steps (1321 resets) in 1833 ms. (21 steps per ms) remains 39/68 properties
BEST_FIRST walk for 4001 steps (118 resets) in 103 ms. (38 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (113 resets) in 109 ms. (36 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (115 resets) in 36 ms. (108 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (113 resets) in 40 ms. (97 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (110 resets) in 31 ms. (125 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (107 resets) in 33 ms. (117 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (113 resets) in 23 ms. (166 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (114 resets) in 30 ms. (129 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (105 resets) in 31 ms. (125 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (112 resets) in 23 ms. (166 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (110 resets) in 24 ms. (160 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (112 resets) in 30 ms. (129 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (141 resets) in 23 ms. (166 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (109 resets) in 29 ms. (133 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (108 resets) in 22 ms. (173 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (105 resets) in 21 ms. (181 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (112 resets) in 35 ms. (111 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (117 resets) in 25 ms. (153 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (117 resets) in 31 ms. (125 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (114 resets) in 23 ms. (166 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (117 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (108 resets) in 24 ms. (160 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (112 resets) in 22 ms. (173 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (114 resets) in 32 ms. (121 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (114 resets) in 27 ms. (142 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (113 resets) in 23 ms. (166 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (110 resets) in 34 ms. (114 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (109 resets) in 25 ms. (153 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (114 resets) in 39 ms. (100 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (103 resets) in 25 ms. (153 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (120 resets) in 25 ms. (153 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (107 resets) in 24 ms. (160 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (113 resets) in 33 ms. (117 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (115 resets) in 32 ms. (121 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (109 resets) in 22 ms. (173 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (113 resets) in 23 ms. (166 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (110 resets) in 22 ms. (173 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (113 resets) in 38 ms. (102 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (109 resets) in 29 ms. (133 steps per ms) remains 39/39 properties
[2024-05-22 13:35:38] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp67 is UNSAT
At refinement iteration 1 (OVERLAPS) 54/101 variables, 5/5 constraints. Problems are: Problem set: 8 solved, 31 unsolved
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp62 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 2/7 constraints. Problems are: Problem set: 10 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 10 solved, 29 unsolved
Problem AtomicPropp32 is UNSAT
At refinement iteration 4 (OVERLAPS) 6/107 variables, 5/12 constraints. Problems are: Problem set: 11 solved, 28 unsolved
[2024-05-22 13:35:38] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-22 13:35:38] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-22 13:35:38] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 3/15 constraints. Problems are: Problem set: 11 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/15 constraints. Problems are: Problem set: 11 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 98/205 variables, 107/122 constraints. Problems are: Problem set: 11 solved, 28 unsolved
[2024-05-22 13:35:39] [INFO ] Deduced a trap composed of 56 places in 41 ms of which 1 ms to minimize.
[2024-05-22 13:35:39] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 2 ms to minimize.
[2024-05-22 13:35:39] [INFO ] Deduced a trap composed of 64 places in 37 ms of which 1 ms to minimize.
[2024-05-22 13:35:39] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 1 ms to minimize.
[2024-05-22 13:35:39] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 1 ms to minimize.
[2024-05-22 13:35:39] [INFO ] Deduced a trap composed of 54 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 6/128 constraints. Problems are: Problem set: 11 solved, 28 unsolved
[2024-05-22 13:35:39] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 1/129 constraints. Problems are: Problem set: 11 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/129 constraints. Problems are: Problem set: 11 solved, 28 unsolved
At refinement iteration 11 (OVERLAPS) 1/206 variables, 1/130 constraints. Problems are: Problem set: 11 solved, 28 unsolved
[2024-05-22 13:35:39] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 1/131 constraints. Problems are: Problem set: 11 solved, 28 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/206 variables, 0/131 constraints. Problems are: Problem set: 11 solved, 28 unsolved
At refinement iteration 14 (OVERLAPS) 0/206 variables, 0/131 constraints. Problems are: Problem set: 11 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 131 constraints, problems are : Problem set: 11 solved, 28 unsolved in 1640 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 11 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 28 unsolved
Problem AtomicPropp49 is UNSAT
At refinement iteration 1 (OVERLAPS) 57/101 variables, 5/5 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 2/7 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 4/11 constraints. Problems are: Problem set: 12 solved, 27 unsolved
[2024-05-22 13:35:40] [INFO ] Deduced a trap composed of 53 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 1/12 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/12 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 6/107 variables, 5/17 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 7/24 constraints. Problems are: Problem set: 12 solved, 27 unsolved
[2024-05-22 13:35:40] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-22 13:35:40] [INFO ] Deduced a trap composed of 77 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 2/26 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/26 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 98/205 variables, 107/133 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 25/158 constraints. Problems are: Problem set: 12 solved, 27 unsolved
[2024-05-22 13:35:40] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2024-05-22 13:35:40] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 5 ms to minimize.
[2024-05-22 13:35:41] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 3/161 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/205 variables, 0/161 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 14 (OVERLAPS) 1/206 variables, 1/162 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/206 variables, 2/164 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/206 variables, 0/164 constraints. Problems are: Problem set: 12 solved, 27 unsolved
At refinement iteration 17 (OVERLAPS) 0/206 variables, 0/164 constraints. Problems are: Problem set: 12 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 164 constraints, problems are : Problem set: 12 solved, 27 unsolved in 2062 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 27/39 constraints, Known Traps: 17/17 constraints]
After SMT, in 3712ms problems are : Problem set: 12 solved, 27 unsolved
Fused 27 Parikh solutions to 24 different solutions.
Parikh walk visited 0 properties in 1754 ms.
Support contains 42 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 98/98 transitions.
Graph (complete) has 176 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 107 transition count 96
Reduce places removed 2 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 7 rules applied. Total rules applied 10 place count 105 transition count 91
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 15 place count 100 transition count 91
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 15 place count 100 transition count 90
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 99 transition count 90
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 31 place count 92 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 91 transition count 83
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 37 place count 91 transition count 79
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 41 place count 87 transition count 79
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 45 place count 87 transition count 79
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 46 place count 86 transition count 78
Applied a total of 46 rules in 38 ms. Remains 86 /108 variables (removed 22) and now considering 78/98 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 86/108 places, 78/98 transitions.
RANDOM walk for 40000 steps (2243 resets) in 562 ms. (71 steps per ms) remains 5/27 properties
BEST_FIRST walk for 40000 steps (1846 resets) in 396 ms. (100 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1857 resets) in 90 ms. (439 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1813 resets) in 82 ms. (481 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1814 resets) in 128 ms. (310 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1819 resets) in 126 ms. (314 steps per ms) remains 5/5 properties
// Phase 1: matrix 78 rows 86 cols
[2024-05-22 13:35:44] [INFO ] Computed 12 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 60/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 13:35:44] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 4/71 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 15/86 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 13:35:44] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-22 13:35:44] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-22 13:35:44] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-05-22 13:35:44] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-05-22 13:35:44] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 13:35:44] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 78/164 variables, 86/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/164 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 105 constraints, problems are : Problem set: 0 solved, 5 unsolved in 371 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 60/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 4/71 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 15/86 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 13:35:44] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 78/164 variables, 86/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 5/111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/164 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 111 constraints, problems are : Problem set: 0 solved, 5 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 8/8 constraints]
After SMT, in 596ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 942 ms.
Support contains 7 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 78/78 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 86 transition count 69
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 77 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 76 transition count 68
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 20 place count 76 transition count 66
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 74 transition count 66
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 50 place count 61 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 60 transition count 54
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 55 place count 60 transition count 51
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 58 place count 57 transition count 51
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 61 place count 57 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 56 transition count 50
Applied a total of 62 rules in 34 ms. Remains 56 /86 variables (removed 30) and now considering 50/78 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 56/86 places, 50/78 transitions.
RANDOM walk for 40000 steps (5519 resets) in 687 ms. (58 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (3530 resets) in 442 ms. (90 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (3569 resets) in 82 ms. (481 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3522 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (3539 resets) in 57 ms. (689 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (3525 resets) in 54 ms. (727 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 2430 steps, run visited all 5 properties in 23 ms. (steps per millisecond=105 )
Probabilistic random walk after 2430 steps, saw 1244 distinct states, run finished after 27 ms. (steps per millisecond=90 ) properties seen :5
Successfully simplified 12 atomic propositions for a total of 16 simplifications.
FORMULA DoubleExponent-PT-002-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 13:35:46] [INFO ] Flatten gal took : 7 ms
[2024-05-22 13:35:46] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DoubleExponent-PT-002-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 13:35:46] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:35:46] [INFO ] Input system was already deterministic with 98 transitions.
Support contains 66 out of 108 places (down from 71) after GAL structural reductions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 176 edges and 108 vertex of which 104 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 98
Applied a total of 1 rules in 4 ms. Remains 107 /108 variables (removed 1) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 107 cols
[2024-05-22 13:35:46] [INFO ] Computed 12 invariants in 4 ms
[2024-05-22 13:35:46] [INFO ] Implicit Places using invariants in 61 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 64 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/108 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 97
Applied a total of 2 rules in 6 ms. Remains 104 /105 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 104 cols
[2024-05-22 13:35:46] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 13:35:46] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-22 13:35:46] [INFO ] Invariant cache hit.
[2024-05-22 13:35:46] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 104/108 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 218 ms. Remains : 104/108 places, 97/98 transitions.
[2024-05-22 13:35:46] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:35:46] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:35:46] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-22 13:35:46] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:35:46] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:35:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality1100358489080070068.gal : 3 ms
[2024-05-22 13:35:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality667122587963923189.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1100358489080070068.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality667122587963923189.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,3708,0.10351,7876,2,4635,5,17605,6,0,512,14028,0


Converting to forward existential form...Done !
original formula: EG((E((((E((p2<=p80) U (p22>=1)) + EF((p9<=0))) * (AG((p46<=p11)) + (p68>p21))) * AG((p72>0))) U AX(AF((p99<=p6)))) + E(AX(AF((p16<=p93))...179
=> equivalent forward existential formula: [FwdG(Init,(E((((E((p2<=p80) U (p22>=1)) + E(TRUE U (p9<=0))) * (!(E(TRUE U !((p46<=p11)))) + (p68>p21))) * !(E(...276
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12, t17, t23, t30, t36, t46, t53, t62, t65, t68, t69, t74, t75, t81, t82, t85, t87,...264
(forward)formula 0,1,3.26663,120048,1,0,1207,540650,242,195,3313,407930,1323
FORMULA DoubleExponent-PT-002-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 98
Applied a total of 2 rules in 11 ms. Remains 106 /108 variables (removed 2) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2024-05-22 13:35:50] [INFO ] Computed 11 invariants in 3 ms
[2024-05-22 13:35:50] [INFO ] Implicit Places using invariants in 57 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 57 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/108 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 6 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2024-05-22 13:35:50] [INFO ] Computed 9 invariants in 1 ms
[2024-05-22 13:35:50] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 13:35:50] [INFO ] Invariant cache hit.
[2024-05-22 13:35:50] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/108 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 210 ms. Remains : 103/108 places, 97/98 transitions.
[2024-05-22 13:35:50] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:35:50] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:35:50] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-22 13:35:50] [INFO ] Flatten gal took : 4 ms
[2024-05-22 13:35:50] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:35:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality13260741573846234872.gal : 2 ms
[2024-05-22 13:35:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality1323421267578112470.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/CTLCardinality13260741573846234872.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1323421267578112470.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,3708,0.09787,8200,2,4197,5,18582,6,0,510,16252,0


Converting to forward existential form...Done !
original formula: AG(A(!((!(EX((p83<=0))) + (p5>=1))) U E((EF((p60<=p49)) + ((p54<=0)&&((p19>=1)||(p66>=1)))) U EF((p49<=p21)))))
=> equivalent forward existential formula: ([((FwdU(FwdU(Init,TRUE),!(E((E(TRUE U (p60<=p49)) + ((p54<=0)&&((p19>=1)||(p66>=1)))) U E(TRUE U (p49<=p21)))))...413
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12, t17, t23, t30, t36, t46, t53, t57, t62, t65, t68, t69, t74, t75, t81, t82, t85,...269
dead was empty
(forward)formula 0,1,2.14962,85156,1,0,1104,325671,222,125,3118,265850,1145
FORMULA DoubleExponent-PT-002-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Graph (complete) has 176 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 105 transition count 75
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 83 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 82 transition count 74
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 47 place count 82 transition count 71
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 53 place count 79 transition count 71
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 83 place count 64 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 63 transition count 55
Applied a total of 84 rules in 17 ms. Remains 63 /108 variables (removed 45) and now considering 55/98 (removed 43) transitions.
// Phase 1: matrix 55 rows 63 cols
[2024-05-22 13:35:52] [INFO ] Computed 11 invariants in 1 ms
[2024-05-22 13:35:52] [INFO ] Implicit Places using invariants in 58 ms returned [41, 42]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 59 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 61/108 places, 55/98 transitions.
Graph (complete) has 142 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 59 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 58 transition count 52
Applied a total of 5 rules in 5 ms. Remains 58 /61 variables (removed 3) and now considering 52/55 (removed 3) transitions.
// Phase 1: matrix 52 rows 58 cols
[2024-05-22 13:35:52] [INFO ] Computed 9 invariants in 1 ms
[2024-05-22 13:35:52] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-22 13:35:52] [INFO ] Invariant cache hit.
[2024-05-22 13:35:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 13:35:52] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 58/108 places, 52/98 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 192 ms. Remains : 58/108 places, 52/98 transitions.
[2024-05-22 13:35:52] [INFO ] Flatten gal took : 3 ms
[2024-05-22 13:35:52] [INFO ] Flatten gal took : 3 ms
[2024-05-22 13:35:52] [INFO ] Input system was already deterministic with 52 transitions.
[2024-05-22 13:35:52] [INFO ] Flatten gal took : 3 ms
[2024-05-22 13:35:52] [INFO ] Flatten gal took : 3 ms
[2024-05-22 13:35:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality11411852413733652444.gal : 1 ms
[2024-05-22 13:35:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality5869776912631718623.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/CTLCardinality11411852413733652444.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5869776912631718623.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,2259,0.039686,5100,2,1422,5,7225,6,0,287,6970,0


Converting to forward existential form...Done !
original formula: EG((p63<=p27))
=> equivalent forward existential formula: [FwdG(Init,(p63<=p27))] != FALSE
Hit Full ! (commute/partial/dont) 46/0/6
(forward)formula 0,1,0.362225,19152,1,0,478,73336,18,4,1496,58353,475
FORMULA DoubleExponent-PT-002-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 98
Applied a total of 1 rules in 2 ms. Remains 107 /108 variables (removed 1) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 107 cols
[2024-05-22 13:35:53] [INFO ] Computed 12 invariants in 1 ms
[2024-05-22 13:35:53] [INFO ] Implicit Places using invariants in 47 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 47 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/108 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 105 /105 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51 ms. Remains : 105/108 places, 98/98 transitions.
[2024-05-22 13:35:53] [INFO ] Flatten gal took : 4 ms
[2024-05-22 13:35:53] [INFO ] Flatten gal took : 4 ms
[2024-05-22 13:35:53] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-22 13:35:53] [INFO ] Flatten gal took : 4 ms
[2024-05-22 13:35:53] [INFO ] Flatten gal took : 4 ms
[2024-05-22 13:35:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality6248439037585846876.gal : 1 ms
[2024-05-22 13:35:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality1386838409609515138.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/CTLCardinality6248439037585846876.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1386838409609515138.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,3708,0.079724,6888,2,3592,5,13943,6,0,517,11167,0


Converting to forward existential form...Done !
original formula: EX(EX(EX(((EG((p72<1)) * (p89<1)) * (p85<1)))))
=> equivalent forward existential formula: [FwdG(((EY(EY(EY(Init))) * (p85<1)) * (p89<1)),(p72<1))] != FALSE
Hit Full ! (commute/partial/dont) 97/0/1
(forward)formula 0,1,1.23627,52028,1,0,900,201244,20,6,2533,154476,897
FORMULA DoubleExponent-PT-002-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 98
Applied a total of 2 rules in 1 ms. Remains 106 /108 variables (removed 2) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2024-05-22 13:35:54] [INFO ] Computed 11 invariants in 3 ms
[2024-05-22 13:35:54] [INFO ] Implicit Places using invariants in 55 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 56 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/108 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 3 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2024-05-22 13:35:54] [INFO ] Computed 9 invariants in 1 ms
[2024-05-22 13:35:54] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-22 13:35:54] [INFO ] Invariant cache hit.
[2024-05-22 13:35:54] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/108 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 191 ms. Remains : 103/108 places, 97/98 transitions.
[2024-05-22 13:35:54] [INFO ] Flatten gal took : 5 ms
[2024-05-22 13:35:54] [INFO ] Flatten gal took : 4 ms
[2024-05-22 13:35:54] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-22 13:35:54] [INFO ] Flatten gal took : 4 ms
[2024-05-22 13:35:54] [INFO ] Flatten gal took : 4 ms
[2024-05-22 13:35:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality12567487467966054016.gal : 1 ms
[2024-05-22 13:35:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality14998203879169048387.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/CTLCardinality12567487467966054016.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14998203879169048387.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,3708,0.103105,8200,2,4197,5,18582,6,0,510,16252,0


Converting to forward existential form...Done !
original formula: EX(E((!(((EX((p38>=1)) * (p41<=p42)) * !(EG((p58<=p70))))) + (((A((p78<=p87) U (p81<=p28)) + EX(TRUE)) + (p21>=1)) * (EF((p8<=p21)) + (p4...180
=> equivalent forward existential formula: [FwdG(FwdU(EY(Init),(!(((EX((p38>=1)) * (p41<=p42)) * !(EG((p58<=p70))))) + (((!((E(!((p81<=p28)) U (!((p78<=p87...279
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12, t17, t23, t30, t36, t46, t53, t57, t62, t65, t68, t69, t74, t75, t81, t82, t85,...269
dead was empty
(forward)formula 0,0,2.79522,103412,1,0,1235,465692,236,206,3281,376050,1301
FORMULA DoubleExponent-PT-002-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Graph (complete) has 176 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 105 transition count 75
Reduce places removed 22 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 24 rules applied. Total rules applied 47 place count 83 transition count 73
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 49 place count 81 transition count 73
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 49 place count 81 transition count 69
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 57 place count 77 transition count 69
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 83 place count 64 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 63 transition count 55
Applied a total of 84 rules in 9 ms. Remains 63 /108 variables (removed 45) and now considering 55/98 (removed 43) transitions.
// Phase 1: matrix 55 rows 63 cols
[2024-05-22 13:35:57] [INFO ] Computed 11 invariants in 1 ms
[2024-05-22 13:35:57] [INFO ] Implicit Places using invariants in 37 ms returned [41, 42]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 61/108 places, 55/98 transitions.
Graph (complete) has 141 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 59 transition count 53
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 57 transition count 51
Applied a total of 7 rules in 4 ms. Remains 57 /61 variables (removed 4) and now considering 51/55 (removed 4) transitions.
// Phase 1: matrix 51 rows 57 cols
[2024-05-22 13:35:57] [INFO ] Computed 9 invariants in 0 ms
[2024-05-22 13:35:57] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-22 13:35:57] [INFO ] Invariant cache hit.
[2024-05-22 13:35:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 13:35:57] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 57/108 places, 51/98 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 139 ms. Remains : 57/108 places, 51/98 transitions.
[2024-05-22 13:35:57] [INFO ] Flatten gal took : 2 ms
[2024-05-22 13:35:57] [INFO ] Flatten gal took : 2 ms
[2024-05-22 13:35:57] [INFO ] Input system was already deterministic with 51 transitions.
[2024-05-22 13:35:57] [INFO ] Flatten gal took : 2 ms
[2024-05-22 13:35:57] [INFO ] Flatten gal took : 2 ms
[2024-05-22 13:35:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality15304206185482342288.gal : 1 ms
[2024-05-22 13:35:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality3000892829830662543.ctl : 4 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/CTLCardinality15304206185482342288.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3000892829830662543.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,2323,0.038321,5096,2,1440,5,7092,6,0,282,6715,0


Converting to forward existential form...Done !
original formula: AF(AG((p12<=p34)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((p12<=p34))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t8, t15, t18, t20, t21, t23, t25, t26, t27, t28, t30, t32, t37, t39, t41, t43, t4...261
(forward)formula 0,0,0.792715,36784,1,0,1986,171722,129,992,1798,185156,1529
FORMULA DoubleExponent-PT-002-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Graph (complete) has 176 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 105 transition count 75
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 83 transition count 75
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 45 place count 83 transition count 71
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 53 place count 79 transition count 71
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 83 place count 64 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 63 transition count 55
Applied a total of 84 rules in 8 ms. Remains 63 /108 variables (removed 45) and now considering 55/98 (removed 43) transitions.
// Phase 1: matrix 55 rows 63 cols
[2024-05-22 13:35:58] [INFO ] Computed 11 invariants in 1 ms
[2024-05-22 13:35:58] [INFO ] Implicit Places using invariants in 39 ms returned [41, 42]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 61/108 places, 55/98 transitions.
Graph (complete) has 140 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 59 transition count 53
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 57 transition count 51
Applied a total of 7 rules in 4 ms. Remains 57 /61 variables (removed 4) and now considering 51/55 (removed 4) transitions.
// Phase 1: matrix 51 rows 57 cols
[2024-05-22 13:35:58] [INFO ] Computed 9 invariants in 1 ms
[2024-05-22 13:35:58] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 13:35:58] [INFO ] Invariant cache hit.
[2024-05-22 13:35:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 13:35:58] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 57/108 places, 51/98 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 172 ms. Remains : 57/108 places, 51/98 transitions.
[2024-05-22 13:35:58] [INFO ] Flatten gal took : 2 ms
[2024-05-22 13:35:58] [INFO ] Flatten gal took : 2 ms
[2024-05-22 13:35:58] [INFO ] Input system was already deterministic with 51 transitions.
[2024-05-22 13:35:58] [INFO ] Flatten gal took : 2 ms
[2024-05-22 13:35:58] [INFO ] Flatten gal took : 2 ms
[2024-05-22 13:35:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality8396761685757614983.gal : 15 ms
[2024-05-22 13:35:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality2446406621804868974.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/CTLCardinality8396761685757614983.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2446406621804868974.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,2306,0.038618,5088,2,1724,5,7390,6,0,282,6377,0


Converting to forward existential form...Done !
original formula: AF(EG(EF((p29<=p102))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(E(TRUE U (p29<=p102)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t7, t12, t17, t19, t20, t22, t24, t25, t26, t27, t30, t32, t35, t37, t39, t40, t4...261
dead was empty
(forward)formula 0,1,0.540459,26200,1,0,598,106685,125,64,1809,84848,594
FORMULA DoubleExponent-PT-002-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 98
Applied a total of 2 rules in 2 ms. Remains 106 /108 variables (removed 2) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2024-05-22 13:35:59] [INFO ] Computed 11 invariants in 2 ms
[2024-05-22 13:35:59] [INFO ] Implicit Places using invariants in 54 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 61 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/108 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 2 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2024-05-22 13:35:59] [INFO ] Computed 9 invariants in 1 ms
[2024-05-22 13:35:59] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-22 13:35:59] [INFO ] Invariant cache hit.
[2024-05-22 13:35:59] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/108 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 205 ms. Remains : 103/108 places, 97/98 transitions.
[2024-05-22 13:35:59] [INFO ] Flatten gal took : 4 ms
[2024-05-22 13:35:59] [INFO ] Flatten gal took : 4 ms
[2024-05-22 13:35:59] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-22 13:35:59] [INFO ] Flatten gal took : 3 ms
[2024-05-22 13:35:59] [INFO ] Flatten gal took : 3 ms
[2024-05-22 13:35:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality13029557862956962755.gal : 1 ms
[2024-05-22 13:35:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality10424922275078775049.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/CTLCardinality13029557862956962755.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10424922275078775049.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,3708,0.102748,8204,2,4197,5,18582,6,0,510,16252,0


Converting to forward existential form...Done !
original formula: EF(((AX(A((p101>=1) U (p100>=1))) * AG((p66<=p9))) * ((p68>p13)||(p15>p4))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * ((p68>p13)||(p15>p4))) * !(EX(!(!((E(!((p100>=1)) U (!((p101>=1)) * !((p100>=1)))) + EG(!(...211
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12, t17, t23, t30, t36, t46, t53, t57, t62, t65, t68, t69, t74, t75, t81, t82, t85,...269
(forward)formula 0,0,3.20069,119824,1,0,1291,578680,228,232,3121,458308,1361
FORMULA DoubleExponent-PT-002-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 98
Applied a total of 2 rules in 4 ms. Remains 106 /108 variables (removed 2) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2024-05-22 13:36:02] [INFO ] Computed 11 invariants in 2 ms
[2024-05-22 13:36:02] [INFO ] Implicit Places using invariants in 69 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 79 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/108 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 2 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2024-05-22 13:36:02] [INFO ] Computed 9 invariants in 1 ms
[2024-05-22 13:36:02] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-22 13:36:02] [INFO ] Invariant cache hit.
[2024-05-22 13:36:02] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/108 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 215 ms. Remains : 103/108 places, 97/98 transitions.
[2024-05-22 13:36:02] [INFO ] Flatten gal took : 3 ms
[2024-05-22 13:36:02] [INFO ] Flatten gal took : 3 ms
[2024-05-22 13:36:02] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-22 13:36:02] [INFO ] Flatten gal took : 3 ms
[2024-05-22 13:36:02] [INFO ] Flatten gal took : 4 ms
[2024-05-22 13:36:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality6922151297931016373.gal : 0 ms
[2024-05-22 13:36:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality18134127946685820641.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/CTLCardinality6922151297931016373.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18134127946685820641.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,3708,0.099574,8196,2,4197,5,18582,6,0,510,16252,0


Converting to forward existential form...Done !
original formula: AG(E((EF(AX((p22>=1))) + (p79<1)) U EX(EF((p12>1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((E(TRUE U !(EX(!((p22>=1))))) + (p79<1)) U EX(E(TRUE U (p12>1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12, t17, t23, t30, t36, t46, t53, t57, t62, t65, t68, t69, t74, t75, t81, t82, t85,...269
(forward)formula 0,0,1.5374,66540,1,0,246,279947,218,139,3031,174637,291
FORMULA DoubleExponent-PT-002-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Graph (complete) has 176 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 105 transition count 82
Reduce places removed 15 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 18 rules applied. Total rules applied 34 place count 90 transition count 79
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 37 place count 87 transition count 79
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 37 place count 87 transition count 75
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 45 place count 83 transition count 75
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 63 place count 74 transition count 66
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 73 transition count 65
Applied a total of 64 rules in 16 ms. Remains 73 /108 variables (removed 35) and now considering 65/98 (removed 33) transitions.
// Phase 1: matrix 65 rows 73 cols
[2024-05-22 13:36:04] [INFO ] Computed 11 invariants in 1 ms
[2024-05-22 13:36:04] [INFO ] Implicit Places using invariants in 43 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 72/108 places, 65/98 transitions.
Graph (complete) has 154 edges and 72 vertex of which 71 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 70 transition count 63
Applied a total of 3 rules in 2 ms. Remains 70 /72 variables (removed 2) and now considering 63/65 (removed 2) transitions.
// Phase 1: matrix 63 rows 70 cols
[2024-05-22 13:36:04] [INFO ] Computed 10 invariants in 0 ms
[2024-05-22 13:36:04] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-22 13:36:04] [INFO ] Invariant cache hit.
[2024-05-22 13:36:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 13:36:04] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 70/108 places, 63/98 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 169 ms. Remains : 70/108 places, 63/98 transitions.
[2024-05-22 13:36:04] [INFO ] Flatten gal took : 3 ms
[2024-05-22 13:36:04] [INFO ] Flatten gal took : 3 ms
[2024-05-22 13:36:04] [INFO ] Input system was already deterministic with 63 transitions.
[2024-05-22 13:36:04] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:36:04] [INFO ] Flatten gal took : 6 ms
[2024-05-22 13:36:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality15593220446407934610.gal : 1 ms
[2024-05-22 13:36:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality7841862775682089268.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/CTLCardinality15593220446407934610.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7841862775682089268.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,2555,0.055085,6232,2,1925,5,11698,6,0,345,10998,0


Converting to forward existential form...Done !
original formula: AF((((p49>p99)&&(p106<=p23))&&((p26<1)||((((p94<1)&&(p74>p41))&&((p92<1)&&(p95>p69)))&&(p5>0)))))
=> equivalent forward existential formula: [FwdG(Init,!((((p49>p99)&&(p106<=p23))&&((p26<1)||((((p94<1)&&(p74>p41))&&((p92<1)&&(p95>p69)))&&(p5>0))))))] = ...160
Hit Full ! (commute/partial/dont) 34/0/29
(forward)formula 0,0,0.516461,26336,1,0,568,103645,19,4,1815,81702,565
FORMULA DoubleExponent-PT-002-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 98
Applied a total of 2 rules in 3 ms. Remains 106 /108 variables (removed 2) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2024-05-22 13:36:05] [INFO ] Computed 11 invariants in 1 ms
[2024-05-22 13:36:05] [INFO ] Implicit Places using invariants in 54 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 55 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/108 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 1 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2024-05-22 13:36:05] [INFO ] Computed 9 invariants in 1 ms
[2024-05-22 13:36:05] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-22 13:36:05] [INFO ] Invariant cache hit.
[2024-05-22 13:36:05] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/108 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 214 ms. Remains : 103/108 places, 97/98 transitions.
[2024-05-22 13:36:05] [INFO ] Flatten gal took : 4 ms
[2024-05-22 13:36:05] [INFO ] Flatten gal took : 3 ms
[2024-05-22 13:36:05] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-22 13:36:05] [INFO ] Flatten gal took : 3 ms
[2024-05-22 13:36:05] [INFO ] Flatten gal took : 3 ms
[2024-05-22 13:36:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality5617494366119826042.gal : 1 ms
[2024-05-22 13:36:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality9674890430041513971.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/CTLCardinality5617494366119826042.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9674890430041513971.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,3708,0.097221,8196,2,4197,5,18582,6,0,510,16252,0


Converting to forward existential form...Done !
original formula: AF((EG(EX((p76<1))) * EX(AX(EF((p44<1))))))
=> equivalent forward existential formula: [FwdG(Init,!((EG(EX((p76<1))) * EX(!(EX(!(E(TRUE U (p44<1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12, t17, t23, t30, t36, t46, t53, t57, t62, t65, t68, t69, t74, t75, t81, t82, t85,...269
(forward)formula 0,0,2.04202,81068,1,0,1069,287830,222,107,3252,253611,1100
FORMULA DoubleExponent-PT-002-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Graph (complete) has 176 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 105 transition count 73
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 49 place count 81 transition count 73
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 49 place count 81 transition count 69
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 57 place count 77 transition count 69
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 87 place count 62 transition count 54
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 62 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 61 transition count 53
Applied a total of 90 rules in 15 ms. Remains 61 /108 variables (removed 47) and now considering 53/98 (removed 45) transitions.
// Phase 1: matrix 53 rows 61 cols
[2024-05-22 13:36:07] [INFO ] Computed 11 invariants in 0 ms
[2024-05-22 13:36:07] [INFO ] Implicit Places using invariants in 35 ms returned [39, 40]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 59/108 places, 53/98 transitions.
Graph (complete) has 143 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 58 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 57 transition count 51
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 55 transition count 49
Applied a total of 7 rules in 3 ms. Remains 55 /59 variables (removed 4) and now considering 49/53 (removed 4) transitions.
// Phase 1: matrix 49 rows 55 cols
[2024-05-22 13:36:07] [INFO ] Computed 9 invariants in 0 ms
[2024-05-22 13:36:07] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-22 13:36:07] [INFO ] Invariant cache hit.
[2024-05-22 13:36:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 13:36:07] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 55/108 places, 49/98 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 150 ms. Remains : 55/108 places, 49/98 transitions.
[2024-05-22 13:36:07] [INFO ] Flatten gal took : 2 ms
[2024-05-22 13:36:07] [INFO ] Flatten gal took : 2 ms
[2024-05-22 13:36:07] [INFO ] Input system was already deterministic with 49 transitions.
[2024-05-22 13:36:07] [INFO ] Flatten gal took : 2 ms
[2024-05-22 13:36:07] [INFO ] Flatten gal took : 2 ms
[2024-05-22 13:36:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality4106797422752050238.gal : 1 ms
[2024-05-22 13:36:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality6026424815414418216.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/CTLCardinality4106797422752050238.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6026424815414418216.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,2139,0.03383,5088,2,1403,5,6903,6,0,272,6392,0


Converting to forward existential form...Done !
original formula: E((p48<=0) U (p83>0))
=> equivalent forward existential formula: [(FwdU(Init,(p48<=0)) * (p83>0))] != FALSE
Hit Full ! (commute/partial/dont) 47/0/2
(forward)formula 0,0,0.037265,5352,1,0,8,6903,15,1,484,6392,4
FORMULA DoubleExponent-PT-002-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 98
Applied a total of 2 rules in 2 ms. Remains 106 /108 variables (removed 2) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2024-05-22 13:36:07] [INFO ] Computed 11 invariants in 1 ms
[2024-05-22 13:36:07] [INFO ] Implicit Places using invariants in 41 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/108 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 1 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2024-05-22 13:36:07] [INFO ] Computed 9 invariants in 1 ms
[2024-05-22 13:36:07] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 13:36:07] [INFO ] Invariant cache hit.
[2024-05-22 13:36:07] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/108 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 180 ms. Remains : 103/108 places, 97/98 transitions.
[2024-05-22 13:36:07] [INFO ] Flatten gal took : 4 ms
[2024-05-22 13:36:07] [INFO ] Flatten gal took : 3 ms
[2024-05-22 13:36:07] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-22 13:36:07] [INFO ] Flatten gal took : 3 ms
[2024-05-22 13:36:07] [INFO ] Flatten gal took : 3 ms
[2024-05-22 13:36:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality6879003125922880595.gal : 1 ms
[2024-05-22 13:36:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality13378904136770317249.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/CTLCardinality6879003125922880595.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13378904136770317249.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,3708,0.101456,8200,2,4197,5,18582,6,0,510,16252,0


Converting to forward existential form...Done !
original formula: EF(EX(AF(!(E((p47<=0) U (p19<=p87))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(EG(!(!(E((p47<=0) U (p19<=p87)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12, t17, t23, t30, t36, t46, t53, t57, t62, t65, t68, t69, t74, t75, t81, t82, t85,...269
(forward)formula 0,0,2.22498,87980,1,0,1085,345436,221,115,3108,279131,1121
FORMULA DoubleExponent-PT-002-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 98
Applied a total of 1 rules in 3 ms. Remains 107 /108 variables (removed 1) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 107 cols
[2024-05-22 13:36:10] [INFO ] Computed 11 invariants in 1 ms
[2024-05-22 13:36:10] [INFO ] Implicit Places using invariants in 46 ms returned [77]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 106/108 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 97
Applied a total of 2 rules in 1 ms. Remains 105 /106 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 105 cols
[2024-05-22 13:36:10] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 13:36:10] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-22 13:36:10] [INFO ] Invariant cache hit.
[2024-05-22 13:36:10] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 105/108 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 181 ms. Remains : 105/108 places, 97/98 transitions.
[2024-05-22 13:36:10] [INFO ] Flatten gal took : 3 ms
[2024-05-22 13:36:10] [INFO ] Flatten gal took : 3 ms
[2024-05-22 13:36:10] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-22 13:36:10] [INFO ] Flatten gal took : 3 ms
[2024-05-22 13:36:10] [INFO ] Flatten gal took : 2 ms
[2024-05-22 13:36:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality8068273167147349531.gal : 0 ms
[2024-05-22 13:36:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality10995908309709308350.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/CTLCardinality8068273167147349531.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10995908309709308350.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,3708,0.091367,7416,2,5666,5,16332,6,0,515,10467,0


Converting to forward existential form...Done !
original formula: E(E(!(A((p74<1) U !(A((p64<=p103) U (p35<=p99))))) U (E(AF((p53>=1)) U EG((p38>=1))) * E((p67>=1) U AX((p4<=0))))) U AG(AF(((p3<=p106)||(...197
=> equivalent forward existential formula: [(FwdU(Init,E(!(!((E(!(!(!((E(!((p35<=p99)) U (!((p64<=p103)) * !((p35<=p99)))) + EG(!((p35<=p99))))))) U (!((p7...509
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12, t17, t23, t30, t36, t46, t53, t57, t62, t65, t68, t69, t74, t75, t81, t82, t85,...269
(forward)formula 0,1,4.1513,151148,1,0,1277,712552,254,227,3211,531092,1360
FORMULA DoubleExponent-PT-002-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-22 13:36:14] [INFO ] Flatten gal took : 3 ms
[2024-05-22 13:36:14] [INFO ] Flatten gal took : 3 ms
Total runtime 50259 ms.

BK_STOP 1716384974615

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="DoubleExponent-PT-002"
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 DoubleExponent-PT-002, 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 r136-tall-171631132900529"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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