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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 01:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 01:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 01:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 01:57 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 54K 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 DiscoveryGPU-PT-07b-CTLCardinality-2024-00
FORMULA_NAME DiscoveryGPU-PT-07b-CTLCardinality-2024-01
FORMULA_NAME DiscoveryGPU-PT-07b-CTLCardinality-2024-02
FORMULA_NAME DiscoveryGPU-PT-07b-CTLCardinality-2024-03
FORMULA_NAME DiscoveryGPU-PT-07b-CTLCardinality-2024-04
FORMULA_NAME DiscoveryGPU-PT-07b-CTLCardinality-2024-05
FORMULA_NAME DiscoveryGPU-PT-07b-CTLCardinality-2024-06
FORMULA_NAME DiscoveryGPU-PT-07b-CTLCardinality-2024-07
FORMULA_NAME DiscoveryGPU-PT-07b-CTLCardinality-2024-08
FORMULA_NAME DiscoveryGPU-PT-07b-CTLCardinality-2024-09
FORMULA_NAME DiscoveryGPU-PT-07b-CTLCardinality-2024-10
FORMULA_NAME DiscoveryGPU-PT-07b-CTLCardinality-2024-11
FORMULA_NAME DiscoveryGPU-PT-07b-CTLCardinality-2023-12
FORMULA_NAME DiscoveryGPU-PT-07b-CTLCardinality-2023-13
FORMULA_NAME DiscoveryGPU-PT-07b-CTLCardinality-2023-14
FORMULA_NAME DiscoveryGPU-PT-07b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716374485172

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-07b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-22 10:41:26] [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 10:41:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 10:41:26] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-05-22 10:41:26] [INFO ] Transformed 212 places.
[2024-05-22 10:41:26] [INFO ] Transformed 224 transitions.
[2024-05-22 10:41:26] [INFO ] Found NUPN structural information;
[2024-05-22 10:41:26] [INFO ] Parsed PT model containing 212 places and 224 transitions and 582 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
FORMULA DiscoveryGPU-PT-07b-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 86 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 224/224 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 204 transition count 224
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 18 place count 194 transition count 214
Iterating global reduction 1 with 10 rules applied. Total rules applied 28 place count 194 transition count 214
Applied a total of 28 rules in 33 ms. Remains 194 /212 variables (removed 18) and now considering 214/224 (removed 10) transitions.
// Phase 1: matrix 214 rows 194 cols
[2024-05-22 10:41:26] [INFO ] Computed 3 invariants in 8 ms
[2024-05-22 10:41:26] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-22 10:41:26] [INFO ] Invariant cache hit.
[2024-05-22 10:41:27] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2024-05-22 10:41:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 3/190 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 10:41:28] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 8 ms to minimize.
[2024-05-22 10:41:28] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/404 variables, 190/195 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 10:41:31] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-05-22 10:41:31] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 2 ms to minimize.
[2024-05-22 10:41:31] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 2 ms to minimize.
[2024-05-22 10:41:31] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 2 ms to minimize.
[2024-05-22 10:41:31] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
[2024-05-22 10:41:31] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
[2024-05-22 10:41:31] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-22 10:41:31] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
[2024-05-22 10:41:31] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 2 ms to minimize.
[2024-05-22 10:41:31] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 2 ms to minimize.
[2024-05-22 10:41:31] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-22 10:41:31] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-22 10:41:31] [INFO ] Deduced a trap composed of 131 places in 63 ms of which 1 ms to minimize.
[2024-05-22 10:41:31] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 2 ms to minimize.
[2024-05-22 10:41:32] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 2 ms to minimize.
[2024-05-22 10:41:32] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 16/211 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 10:41:33] [INFO ] Deduced a trap composed of 119 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 4/408 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (OVERLAPS) 0/408 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 216 constraints, problems are : Problem set: 0 solved, 213 unsolved in 13432 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 194/194 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 3/190 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/404 variables, 190/212 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 209/421 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 4/408 variables, 4/425 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 4/429 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (OVERLAPS) 0/408 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 429 constraints, problems are : Problem set: 0 solved, 213 unsolved in 15919 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 194/194 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 19/19 constraints]
After SMT, in 29466ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 29485ms
Starting structural reductions in LTL mode, iteration 1 : 194/212 places, 214/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29928 ms. Remains : 194/212 places, 214/224 transitions.
Support contains 86 out of 194 places after structural reductions.
[2024-05-22 10:41:56] [INFO ] Flatten gal took : 44 ms
[2024-05-22 10:41:56] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DiscoveryGPU-PT-07b-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 10:41:56] [INFO ] Flatten gal took : 15 ms
[2024-05-22 10:41:56] [INFO ] Input system was already deterministic with 214 transitions.
Support contains 74 out of 194 places (down from 86) after GAL structural reductions.
FORMULA DiscoveryGPU-PT-07b-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (171 resets) in 1230 ms. (32 steps per ms) remains 2/53 properties
BEST_FIRST walk for 40003 steps (35 resets) in 233 ms. (170 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (37 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
[2024-05-22 10:41:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/15 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 91/106 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/116 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/146 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/146 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 219/365 variables, 133/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp49 is UNSAT
After SMT solving in domain Real declared 407/408 variables, and 196 constraints, problems are : Problem set: 1 solved, 0 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 193/194 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 114ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2024-05-22 10:41:57] [INFO ] Flatten gal took : 10 ms
[2024-05-22 10:41:57] [INFO ] Flatten gal took : 11 ms
[2024-05-22 10:41:57] [INFO ] Input system was already deterministic with 214 transitions.
Computed a total of 32 stabilizing places and 32 stable transitions
Graph (complete) has 348 edges and 194 vertex of which 177 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 214/214 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 188 transition count 214
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 35 place count 159 transition count 185
Iterating global reduction 1 with 29 rules applied. Total rules applied 64 place count 159 transition count 185
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 72 place count 151 transition count 177
Iterating global reduction 1 with 8 rules applied. Total rules applied 80 place count 151 transition count 177
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 86 place count 145 transition count 171
Iterating global reduction 1 with 6 rules applied. Total rules applied 92 place count 145 transition count 171
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 98 place count 139 transition count 165
Iterating global reduction 1 with 6 rules applied. Total rules applied 104 place count 139 transition count 165
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 110 place count 133 transition count 153
Iterating global reduction 1 with 6 rules applied. Total rules applied 116 place count 133 transition count 153
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 122 place count 127 transition count 147
Iterating global reduction 1 with 6 rules applied. Total rules applied 128 place count 127 transition count 147
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 134 place count 121 transition count 141
Iterating global reduction 1 with 6 rules applied. Total rules applied 140 place count 121 transition count 141
Applied a total of 140 rules in 35 ms. Remains 121 /194 variables (removed 73) and now considering 141/214 (removed 73) transitions.
// Phase 1: matrix 141 rows 121 cols
[2024-05-22 10:41:57] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 10:41:57] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-22 10:41:57] [INFO ] Invariant cache hit.
[2024-05-22 10:41:57] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Running 140 sub problems to find dead transitions.
[2024-05-22 10:41:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 141/262 variables, 121/123 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-22 10:41:59] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-22 10:41:59] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-22 10:41:59] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-22 10:41:59] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-22 10:41:59] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-22 10:41:59] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-22 10:41:59] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-22 10:41:59] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-22 10:41:59] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-22 10:41:59] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-22 10:41:59] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-22 10:41:59] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-22 10:41:59] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-22 10:41:59] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 14/137 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (OVERLAPS) 0/262 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 137 constraints, problems are : Problem set: 0 solved, 140 unsolved in 4115 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 141/262 variables, 121/137 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 140/277 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 0/262 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 277 constraints, problems are : Problem set: 0 solved, 140 unsolved in 3802 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 14/14 constraints]
After SMT, in 7959ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 7961ms
Starting structural reductions in LTL mode, iteration 1 : 121/194 places, 141/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8160 ms. Remains : 121/194 places, 141/214 transitions.
[2024-05-22 10:42:05] [INFO ] Flatten gal took : 11 ms
[2024-05-22 10:42:05] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:42:05] [INFO ] Input system was already deterministic with 141 transitions.
[2024-05-22 10:42:05] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:42:05] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:42:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality3280437973233773310.gal : 3 ms
[2024-05-22 10:42:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality9057716116869016166.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/CTLCardinality3280437973233773310.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9057716116869016166.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.
Detected timeout of ITS tools.
[2024-05-22 10:42:35] [INFO ] Flatten gal took : 9 ms
[2024-05-22 10:42:35] [INFO ] Applying decomposition
[2024-05-22 10:42:35] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12371621165676386316.txt' '-o' '/tmp/graph12371621165676386316.bin' '-w' '/tmp/graph12371621165676386316.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12371621165676386316.bin' '-l' '-1' '-v' '-w' '/tmp/graph12371621165676386316.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:42:35] [INFO ] Decomposing Gal with order
[2024-05-22 10:42:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:42:36] [INFO ] Removed a total of 53 redundant transitions.
[2024-05-22 10:42:36] [INFO ] Flatten gal took : 85 ms
[2024-05-22 10:42:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 5 ms.
[2024-05-22 10:42:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality5273293573280782539.gal : 4 ms
[2024-05-22 10:42:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality14196350246525767992.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/CTLCardinality5273293573280782539.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14196350246525767992.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 214/214 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 188 transition count 214
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 36 place count 158 transition count 184
Iterating global reduction 1 with 30 rules applied. Total rules applied 66 place count 158 transition count 184
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 74 place count 150 transition count 176
Iterating global reduction 1 with 8 rules applied. Total rules applied 82 place count 150 transition count 176
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 88 place count 144 transition count 170
Iterating global reduction 1 with 6 rules applied. Total rules applied 94 place count 144 transition count 170
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 100 place count 138 transition count 164
Iterating global reduction 1 with 6 rules applied. Total rules applied 106 place count 138 transition count 164
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 112 place count 132 transition count 152
Iterating global reduction 1 with 6 rules applied. Total rules applied 118 place count 132 transition count 152
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 124 place count 126 transition count 146
Iterating global reduction 1 with 6 rules applied. Total rules applied 130 place count 126 transition count 146
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 135 place count 121 transition count 141
Iterating global reduction 1 with 5 rules applied. Total rules applied 140 place count 121 transition count 141
Applied a total of 140 rules in 20 ms. Remains 121 /194 variables (removed 73) and now considering 141/214 (removed 73) transitions.
// Phase 1: matrix 141 rows 121 cols
[2024-05-22 10:43:06] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 10:43:06] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 10:43:06] [INFO ] Invariant cache hit.
[2024-05-22 10:43:06] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 140 sub problems to find dead transitions.
[2024-05-22 10:43:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 141/262 variables, 121/123 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-22 10:43:07] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 3 ms to minimize.
[2024-05-22 10:43:07] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-22 10:43:07] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-22 10:43:07] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-22 10:43:07] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-22 10:43:07] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-22 10:43:08] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-22 10:43:08] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2024-05-22 10:43:08] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-22 10:43:08] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 4 ms to minimize.
[2024-05-22 10:43:08] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-22 10:43:08] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-22 10:43:08] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-22 10:43:08] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 14/137 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (OVERLAPS) 0/262 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 137 constraints, problems are : Problem set: 0 solved, 140 unsolved in 4010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 141/262 variables, 121/137 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 140/277 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 0/262 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 277 constraints, problems are : Problem set: 0 solved, 140 unsolved in 3876 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 14/14 constraints]
After SMT, in 7920ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 7921ms
Starting structural reductions in LTL mode, iteration 1 : 121/194 places, 141/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8097 ms. Remains : 121/194 places, 141/214 transitions.
[2024-05-22 10:43:14] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:43:14] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:43:14] [INFO ] Input system was already deterministic with 141 transitions.
[2024-05-22 10:43:14] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:43:14] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:43:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality702390649158193845.gal : 1 ms
[2024-05-22 10:43:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality17861453305772921852.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/CTLCardinality702390649158193845.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17861453305772921852.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.
Detected timeout of ITS tools.
[2024-05-22 10:43:44] [INFO ] Flatten gal took : 8 ms
[2024-05-22 10:43:44] [INFO ] Applying decomposition
[2024-05-22 10:43:44] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16600058682355638743.txt' '-o' '/tmp/graph16600058682355638743.bin' '-w' '/tmp/graph16600058682355638743.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16600058682355638743.bin' '-l' '-1' '-v' '-w' '/tmp/graph16600058682355638743.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:43:44] [INFO ] Decomposing Gal with order
[2024-05-22 10:43:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:43:44] [INFO ] Removed a total of 52 redundant transitions.
[2024-05-22 10:43:44] [INFO ] Flatten gal took : 21 ms
[2024-05-22 10:43:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2024-05-22 10:43:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality10286171511172985531.gal : 4 ms
[2024-05-22 10:43:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality6540912250187613436.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/CTLCardinality10286171511172985531.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6540912250187613436.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 214/214 transitions.
Graph (complete) has 348 edges and 194 vertex of which 178 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Discarding 16 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 177 transition count 169
Reduce places removed 34 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 143 transition count 167
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 141 transition count 167
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 73 place count 141 transition count 154
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 99 place count 128 transition count 154
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 110 place count 117 transition count 143
Iterating global reduction 3 with 11 rules applied. Total rules applied 121 place count 117 transition count 143
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 121 place count 117 transition count 141
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 125 place count 115 transition count 141
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 129 place count 111 transition count 137
Iterating global reduction 3 with 4 rules applied. Total rules applied 133 place count 111 transition count 137
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 136 place count 108 transition count 133
Iterating global reduction 3 with 3 rules applied. Total rules applied 139 place count 108 transition count 133
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 142 place count 105 transition count 128
Iterating global reduction 3 with 3 rules applied. Total rules applied 145 place count 105 transition count 128
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 147 place count 103 transition count 126
Iterating global reduction 3 with 2 rules applied. Total rules applied 149 place count 103 transition count 126
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 181 place count 87 transition count 110
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 182 place count 86 transition count 109
Iterating global reduction 3 with 1 rules applied. Total rules applied 183 place count 86 transition count 109
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 184 place count 85 transition count 107
Iterating global reduction 3 with 1 rules applied. Total rules applied 185 place count 85 transition count 107
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 186 place count 84 transition count 106
Iterating global reduction 3 with 1 rules applied. Total rules applied 187 place count 84 transition count 106
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 192 place count 84 transition count 106
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 194 place count 82 transition count 104
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 96 edges and 80 vertex of which 76 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 67 edges and 76 vertex of which 18 / 76 are part of one of the 9 SCC in 2 ms
Free SCC test removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 3 with 21 rules applied. Total rules applied 215 place count 67 transition count 82
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 4 with 29 rules applied. Total rules applied 244 place count 50 transition count 70
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 247 place count 47 transition count 70
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 250 place count 44 transition count 64
Iterating global reduction 6 with 3 rules applied. Total rules applied 253 place count 44 transition count 64
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 256 place count 44 transition count 61
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 6 with 2 rules applied. Total rules applied 258 place count 44 transition count 59
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 260 place count 42 transition count 59
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 8 with 7 rules applied. Total rules applied 267 place count 35 transition count 52
Applied a total of 267 rules in 68 ms. Remains 35 /194 variables (removed 159) and now considering 52/214 (removed 162) transitions.
[2024-05-22 10:44:14] [INFO ] Flow matrix only has 44 transitions (discarded 8 similar events)
// Phase 1: matrix 44 rows 35 cols
[2024-05-22 10:44:14] [INFO ] Computed 0 invariants in 1 ms
[2024-05-22 10:44:14] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-22 10:44:14] [INFO ] Flow matrix only has 44 transitions (discarded 8 similar events)
[2024-05-22 10:44:14] [INFO ] Invariant cache hit.
[2024-05-22 10:44:14] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-22 10:44:14] [INFO ] Redundant transitions in 1 ms returned []
Running 38 sub problems to find dead transitions.
[2024-05-22 10:44:14] [INFO ] Flow matrix only has 44 transitions (discarded 8 similar events)
[2024-05-22 10:44:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 43/71 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 7/78 variables, 7/35 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 0/78 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/79 variables, and 35 constraints, problems are : Problem set: 0 solved, 38 unsolved in 414 ms.
Refiners :[State Equation: 35/35 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 43/71 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 38/66 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 7/78 variables, 7/73 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/79 variables, and 73 constraints, problems are : Problem set: 0 solved, 38 unsolved in 243 ms.
Refiners :[State Equation: 35/35 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
After SMT, in 664ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 665ms
Starting structural reductions in SI_CTL mode, iteration 1 : 35/194 places, 52/214 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 815 ms. Remains : 35/194 places, 52/214 transitions.
[2024-05-22 10:44:15] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:44:15] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:44:15] [INFO ] Input system was already deterministic with 52 transitions.
[2024-05-22 10:44:15] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:44:15] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:44:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality13658000001180591884.gal : 0 ms
[2024-05-22 10:44:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality10475476274764318297.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/CTLCardinality13658000001180591884.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10475476274764318297.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,233730,0.005593,3560,2,102,5,480,6,0,169,400,0


Converting to forward existential form...Done !
original formula: EG(A((A(EG((p107==1)) U !(((p164==0)||(p63==1)))) + (p25==1)) U ((p42==0)||(((p63==0)&&((p68==0)||(p43==1)))&&(((p29==0)||(p117==1))||(p1...166
=> equivalent forward existential formula: [FwdG(Init,!((E(!(((p42==0)||(((p63==0)&&((p68==0)||(p43==1)))&&(((p29==0)||(p117==1))||(p155==1))))) U (!((!((E...479
Reverse transition relation is NOT exact ! Due to transitions t2, t10, t13, t14, t18, t24, t25, t26, t43, t45, t47, t50, Intersection with reachable at ea...219
(forward)formula 0,1,0.184673,12580,1,0,433,50581,133,266,904,80462,516
FORMULA DiscoveryGPU-PT-07b-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 214/214 transitions.
Graph (complete) has 348 edges and 194 vertex of which 178 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 177 transition count 164
Reduce places removed 39 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 40 rules applied. Total rules applied 80 place count 138 transition count 163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 137 transition count 163
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 81 place count 137 transition count 149
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 109 place count 123 transition count 149
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 119 place count 113 transition count 139
Iterating global reduction 3 with 10 rules applied. Total rules applied 129 place count 113 transition count 139
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 129 place count 113 transition count 137
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 133 place count 111 transition count 137
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 137 place count 107 transition count 133
Iterating global reduction 3 with 4 rules applied. Total rules applied 141 place count 107 transition count 133
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 145 place count 103 transition count 129
Iterating global reduction 3 with 4 rules applied. Total rules applied 149 place count 103 transition count 129
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 153 place count 99 transition count 121
Iterating global reduction 3 with 4 rules applied. Total rules applied 157 place count 99 transition count 121
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 161 place count 95 transition count 117
Iterating global reduction 3 with 4 rules applied. Total rules applied 165 place count 95 transition count 117
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 197 place count 79 transition count 101
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 198 place count 78 transition count 100
Iterating global reduction 3 with 1 rules applied. Total rules applied 199 place count 78 transition count 100
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 200 place count 77 transition count 98
Iterating global reduction 3 with 1 rules applied. Total rules applied 201 place count 77 transition count 98
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 202 place count 76 transition count 97
Iterating global reduction 3 with 1 rules applied. Total rules applied 203 place count 76 transition count 97
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 205 place count 74 transition count 95
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 86 edges and 72 vertex of which 68 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 73 edges and 68 vertex of which 28 / 68 are part of one of the 14 SCC in 0 ms
Free SCC test removed 14 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 3 with 25 rules applied. Total rules applied 230 place count 54 transition count 69
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 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 4 with 37 rules applied. Total rules applied 267 place count 33 transition count 53
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 269 place count 32 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 270 place count 31 transition count 52
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 275 place count 26 transition count 42
Iterating global reduction 7 with 5 rules applied. Total rules applied 280 place count 26 transition count 42
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 284 place count 22 transition count 34
Iterating global reduction 7 with 4 rules applied. Total rules applied 288 place count 22 transition count 34
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 292 place count 18 transition count 26
Iterating global reduction 7 with 4 rules applied. Total rules applied 296 place count 18 transition count 26
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 300 place count 14 transition count 22
Iterating global reduction 7 with 4 rules applied. Total rules applied 304 place count 14 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 306 place count 14 transition count 20
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 7 with 1 rules applied. Total rules applied 307 place count 14 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 308 place count 13 transition count 19
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 311 place count 10 transition count 16
Applied a total of 311 rules in 33 ms. Remains 10 /194 variables (removed 184) and now considering 16/214 (removed 198) transitions.
[2024-05-22 10:44:15] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
// Phase 1: matrix 12 rows 10 cols
[2024-05-22 10:44:15] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 10:44:15] [INFO ] Implicit Places using invariants in 12 ms returned []
[2024-05-22 10:44:15] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
[2024-05-22 10:44:15] [INFO ] Invariant cache hit.
[2024-05-22 10:44:15] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2024-05-22 10:44:15] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2024-05-22 10:44:15] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
[2024-05-22 10:44:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 11/18 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 3/21 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/22 variables, and 10 constraints, problems are : Problem set: 0 solved, 10 unsolved in 52 ms.
Refiners :[State Equation: 10/10 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 11/18 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 3/21 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/21 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/22 variables, and 20 constraints, problems are : Problem set: 0 solved, 10 unsolved in 60 ms.
Refiners :[State Equation: 10/10 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 115ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 115ms
Starting structural reductions in SI_CTL mode, iteration 1 : 10/194 places, 16/214 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 219 ms. Remains : 10/194 places, 16/214 transitions.
[2024-05-22 10:44:15] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:44:15] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:44:15] [INFO ] Input system was already deterministic with 16 transitions.
[2024-05-22 10:44:15] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:44:15] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:44:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality1685227549320751941.gal : 0 ms
[2024-05-22 10:44:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality15671197270705222857.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/CTLCardinality1685227549320751941.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15671197270705222857.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,540,0.002291,3376,2,23,5,174,6,0,48,173,0


Converting to forward existential form...Done !
original formula: AG((AF((p12==1)) + (p161==1)))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !((p161==1))),!((p12==1)))] = FALSE
Hit Full ! (commute/partial/dont) 14/0/2
(forward)formula 0,0,0.004038,3696,1,0,11,429,22,6,235,409,9
FORMULA DiscoveryGPU-PT-07b-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 214/214 transitions.
Graph (complete) has 348 edges and 194 vertex of which 177 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 176 transition count 165
Reduce places removed 37 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 40 rules applied. Total rules applied 78 place count 139 transition count 162
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 81 place count 136 transition count 162
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 81 place count 136 transition count 148
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 109 place count 122 transition count 148
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 120 place count 111 transition count 137
Iterating global reduction 3 with 11 rules applied. Total rules applied 131 place count 111 transition count 137
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 131 place count 111 transition count 135
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 135 place count 109 transition count 135
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 140 place count 104 transition count 130
Iterating global reduction 3 with 5 rules applied. Total rules applied 145 place count 104 transition count 130
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 150 place count 99 transition count 124
Iterating global reduction 3 with 5 rules applied. Total rules applied 155 place count 99 transition count 124
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 160 place count 94 transition count 115
Iterating global reduction 3 with 5 rules applied. Total rules applied 165 place count 94 transition count 115
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 169 place count 90 transition count 111
Iterating global reduction 3 with 4 rules applied. Total rules applied 173 place count 90 transition count 111
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 205 place count 74 transition count 95
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 206 place count 73 transition count 94
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 73 transition count 94
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 208 place count 72 transition count 92
Iterating global reduction 3 with 1 rules applied. Total rules applied 209 place count 72 transition count 92
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 210 place count 71 transition count 91
Iterating global reduction 3 with 1 rules applied. Total rules applied 211 place count 71 transition count 91
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 213 place count 69 transition count 89
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 81 edges and 67 vertex of which 63 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 66 edges and 63 vertex of which 26 / 63 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 3 with 23 rules applied. Total rules applied 236 place count 50 transition count 65
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 33 rules applied. Total rules applied 269 place count 31 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 270 place count 30 transition count 51
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 275 place count 25 transition count 41
Iterating global reduction 6 with 5 rules applied. Total rules applied 280 place count 25 transition count 41
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 284 place count 21 transition count 33
Iterating global reduction 6 with 4 rules applied. Total rules applied 288 place count 21 transition count 33
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 292 place count 17 transition count 25
Iterating global reduction 6 with 4 rules applied. Total rules applied 296 place count 17 transition count 25
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 300 place count 13 transition count 21
Iterating global reduction 6 with 4 rules applied. Total rules applied 304 place count 13 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 306 place count 13 transition count 19
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 6 with 1 rules applied. Total rules applied 307 place count 13 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 308 place count 12 transition count 18
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 311 place count 9 transition count 15
Applied a total of 311 rules in 25 ms. Remains 9 /194 variables (removed 185) and now considering 15/214 (removed 199) transitions.
[2024-05-22 10:44:15] [INFO ] Flow matrix only has 12 transitions (discarded 3 similar events)
// Phase 1: matrix 12 rows 9 cols
[2024-05-22 10:44:15] [INFO ] Computed 0 invariants in 1 ms
[2024-05-22 10:44:15] [INFO ] Implicit Places using invariants in 12 ms returned []
[2024-05-22 10:44:15] [INFO ] Flow matrix only has 12 transitions (discarded 3 similar events)
[2024-05-22 10:44:15] [INFO ] Invariant cache hit.
[2024-05-22 10:44:15] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-05-22 10:44:15] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-22 10:44:15] [INFO ] Flow matrix only has 12 transitions (discarded 3 similar events)
[2024-05-22 10:44:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 3/20 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/21 variables, and 9 constraints, problems are : Problem set: 0 solved, 9 unsolved in 54 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 3/20 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/21 variables, and 18 constraints, problems are : Problem set: 0 solved, 9 unsolved in 57 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 112ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 113ms
Starting structural reductions in SI_CTL mode, iteration 1 : 9/194 places, 15/214 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 176 ms. Remains : 9/194 places, 15/214 transitions.
[2024-05-22 10:44:15] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:44:15] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:44:15] [INFO ] Input system was already deterministic with 15 transitions.
[2024-05-22 10:44:15] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:44:15] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:44:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality4552587848371656588.gal : 0 ms
[2024-05-22 10:44:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality14932259748832214797.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/CTLCardinality4552587848371656588.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14932259748832214797.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,450,0.002966,3372,2,31,5,178,6,0,44,162,0


Converting to forward existential form...Done !
original formula: EG(((p46==0)||(p26==1)))
=> equivalent forward existential formula: [FwdG(Init,((p46==0)||(p26==1)))] != FALSE
Hit Full ! (commute/partial/dont) 10/0/5
(forward)formula 0,1,0.00628,3692,1,0,8,588,19,4,211,717,8
FORMULA DiscoveryGPU-PT-07b-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 214/214 transitions.
Graph (complete) has 348 edges and 194 vertex of which 177 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 176 transition count 163
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 137 transition count 163
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 79 place count 137 transition count 149
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 107 place count 123 transition count 149
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 118 place count 112 transition count 138
Iterating global reduction 2 with 11 rules applied. Total rules applied 129 place count 112 transition count 138
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 129 place count 112 transition count 136
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 133 place count 110 transition count 136
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 138 place count 105 transition count 131
Iterating global reduction 2 with 5 rules applied. Total rules applied 143 place count 105 transition count 131
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 147 place count 101 transition count 126
Iterating global reduction 2 with 4 rules applied. Total rules applied 151 place count 101 transition count 126
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 155 place count 97 transition count 119
Iterating global reduction 2 with 4 rules applied. Total rules applied 159 place count 97 transition count 119
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 162 place count 94 transition count 116
Iterating global reduction 2 with 3 rules applied. Total rules applied 165 place count 94 transition count 116
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 195 place count 79 transition count 101
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 196 place count 78 transition count 100
Iterating global reduction 2 with 1 rules applied. Total rules applied 197 place count 78 transition count 100
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 198 place count 77 transition count 98
Iterating global reduction 2 with 1 rules applied. Total rules applied 199 place count 77 transition count 98
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 200 place count 76 transition count 97
Iterating global reduction 2 with 1 rules applied. Total rules applied 201 place count 76 transition count 97
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 202 place count 76 transition count 97
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 204 place count 74 transition count 95
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 87 edges and 72 vertex of which 68 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 70 edges and 68 vertex of which 28 / 68 are part of one of the 14 SCC in 0 ms
Free SCC test removed 14 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 2 with 23 rules applied. Total rules applied 227 place count 54 transition count 71
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 34 rules applied. Total rules applied 261 place count 35 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 262 place count 34 transition count 56
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 267 place count 29 transition count 46
Iterating global reduction 5 with 5 rules applied. Total rules applied 272 place count 29 transition count 46
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 277 place count 24 transition count 36
Iterating global reduction 5 with 5 rules applied. Total rules applied 282 place count 24 transition count 36
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 286 place count 20 transition count 28
Iterating global reduction 5 with 4 rules applied. Total rules applied 290 place count 20 transition count 28
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 294 place count 16 transition count 24
Iterating global reduction 5 with 4 rules applied. Total rules applied 298 place count 16 transition count 24
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 299 place count 16 transition count 23
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 5 with 2 rules applied. Total rules applied 301 place count 15 transition count 22
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 303 place count 13 transition count 20
Applied a total of 303 rules in 22 ms. Remains 13 /194 variables (removed 181) and now considering 20/214 (removed 194) transitions.
[2024-05-22 10:44:15] [INFO ] Flow matrix only has 16 transitions (discarded 4 similar events)
// Phase 1: matrix 16 rows 13 cols
[2024-05-22 10:44:15] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 10:44:16] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-22 10:44:16] [INFO ] Flow matrix only has 16 transitions (discarded 4 similar events)
[2024-05-22 10:44:16] [INFO ] Invariant cache hit.
[2024-05-22 10:44:16] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-05-22 10:44:16] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-22 10:44:16] [INFO ] Flow matrix only has 16 transitions (discarded 4 similar events)
[2024-05-22 10:44:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 15/25 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 3/28 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 0/28 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 28/29 variables, and 13 constraints, problems are : Problem set: 0 solved, 15 unsolved in 99 ms.
Refiners :[State Equation: 13/13 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 15/25 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 3/28 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 28/29 variables, and 28 constraints, problems are : Problem set: 0 solved, 15 unsolved in 79 ms.
Refiners :[State Equation: 13/13 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 180ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 181ms
Starting structural reductions in SI_CTL mode, iteration 1 : 13/194 places, 20/214 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 241 ms. Remains : 13/194 places, 20/214 transitions.
[2024-05-22 10:44:16] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:44:16] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:44:16] [INFO ] Input system was already deterministic with 20 transitions.
[2024-05-22 10:44:16] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:44:16] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:44:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality18354818682150011730.gal : 1 ms
[2024-05-22 10:44:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality15066023348570474153.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/CTLCardinality18354818682150011730.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15066023348570474153.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,924,0.003023,3404,2,40,5,246,6,0,63,238,0


Converting to forward existential form...Done !
original formula: EG(!(E(((p194==0)||(p190==1)) U EG((p42!=0)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(((p194==0)||(p190==1)) U EG((p42!=0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t16, t17, t19, Intersection with reachable at each step enabled. (destroyed/reverse/...182
(forward)formula 0,0,0.011326,3724,1,0,76,2168,65,41,331,2379,87
FORMULA DiscoveryGPU-PT-07b-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 214/214 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 189 transition count 214
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 34 place count 160 transition count 185
Iterating global reduction 1 with 29 rules applied. Total rules applied 63 place count 160 transition count 185
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 70 place count 153 transition count 178
Iterating global reduction 1 with 7 rules applied. Total rules applied 77 place count 153 transition count 178
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 82 place count 148 transition count 173
Iterating global reduction 1 with 5 rules applied. Total rules applied 87 place count 148 transition count 173
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 92 place count 143 transition count 168
Iterating global reduction 1 with 5 rules applied. Total rules applied 97 place count 143 transition count 168
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 101 place count 139 transition count 160
Iterating global reduction 1 with 4 rules applied. Total rules applied 105 place count 139 transition count 160
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 109 place count 135 transition count 156
Iterating global reduction 1 with 4 rules applied. Total rules applied 113 place count 135 transition count 156
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 117 place count 131 transition count 152
Iterating global reduction 1 with 4 rules applied. Total rules applied 121 place count 131 transition count 152
Applied a total of 121 rules in 8 ms. Remains 131 /194 variables (removed 63) and now considering 152/214 (removed 62) transitions.
// Phase 1: matrix 152 rows 131 cols
[2024-05-22 10:44:16] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:44:16] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 10:44:16] [INFO ] Invariant cache hit.
[2024-05-22 10:44:16] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Running 151 sub problems to find dead transitions.
[2024-05-22 10:44:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (OVERLAPS) 152/282 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-22 10:44:17] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-22 10:44:18] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-22 10:44:18] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-22 10:44:18] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-22 10:44:18] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-22 10:44:18] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2024-05-22 10:44:18] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-22 10:44:18] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-22 10:44:18] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-22 10:44:18] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-22 10:44:18] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 11/143 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (OVERLAPS) 1/283 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 8 (OVERLAPS) 0/283 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 144 constraints, problems are : Problem set: 0 solved, 151 unsolved in 5072 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (OVERLAPS) 152/282 variables, 130/143 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 150/293 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (OVERLAPS) 1/283 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 10 (OVERLAPS) 0/283 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 295 constraints, problems are : Problem set: 0 solved, 151 unsolved in 7079 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 11/11 constraints]
After SMT, in 12192ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 12193ms
Starting structural reductions in LTL mode, iteration 1 : 131/194 places, 152/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12317 ms. Remains : 131/194 places, 152/214 transitions.
[2024-05-22 10:44:28] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:44:28] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:44:28] [INFO ] Input system was already deterministic with 152 transitions.
[2024-05-22 10:44:28] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:44:28] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:44:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality9648335771698311053.gal : 1 ms
[2024-05-22 10:44:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality15327255762642136725.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/CTLCardinality9648335771698311053.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15327255762642136725.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.
Detected timeout of ITS tools.
[2024-05-22 10:44:58] [INFO ] Flatten gal took : 8 ms
[2024-05-22 10:44:58] [INFO ] Applying decomposition
[2024-05-22 10:44:58] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5727326482998102225.txt' '-o' '/tmp/graph5727326482998102225.bin' '-w' '/tmp/graph5727326482998102225.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5727326482998102225.bin' '-l' '-1' '-v' '-w' '/tmp/graph5727326482998102225.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:44:58] [INFO ] Decomposing Gal with order
[2024-05-22 10:44:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:44:58] [INFO ] Removed a total of 55 redundant transitions.
[2024-05-22 10:44:58] [INFO ] Flatten gal took : 10 ms
[2024-05-22 10:44:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 1 ms.
[2024-05-22 10:44:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality8731032404140256592.gal : 9 ms
[2024-05-22 10:44:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality13756585532027501001.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/CTLCardinality8731032404140256592.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13756585532027501001.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 214/214 transitions.
Graph (complete) has 348 edges and 194 vertex of which 179 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 178 transition count 164
Reduce places removed 39 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 40 rules applied. Total rules applied 80 place count 139 transition count 163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 138 transition count 163
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 81 place count 138 transition count 149
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 109 place count 124 transition count 149
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 119 place count 114 transition count 139
Iterating global reduction 3 with 10 rules applied. Total rules applied 129 place count 114 transition count 139
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 129 place count 114 transition count 137
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 133 place count 112 transition count 137
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 137 place count 108 transition count 133
Iterating global reduction 3 with 4 rules applied. Total rules applied 141 place count 108 transition count 133
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 145 place count 104 transition count 128
Iterating global reduction 3 with 4 rules applied. Total rules applied 149 place count 104 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 153 place count 100 transition count 121
Iterating global reduction 3 with 4 rules applied. Total rules applied 157 place count 100 transition count 121
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 160 place count 97 transition count 118
Iterating global reduction 3 with 3 rules applied. Total rules applied 163 place count 97 transition count 118
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 197 place count 80 transition count 101
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 198 place count 79 transition count 100
Iterating global reduction 3 with 1 rules applied. Total rules applied 199 place count 79 transition count 100
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 200 place count 78 transition count 98
Iterating global reduction 3 with 1 rules applied. Total rules applied 201 place count 78 transition count 98
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 202 place count 77 transition count 97
Iterating global reduction 3 with 1 rules applied. Total rules applied 203 place count 77 transition count 97
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 205 place count 75 transition count 95
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 87 edges and 73 vertex of which 69 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 74 edges and 69 vertex of which 28 / 69 are part of one of the 14 SCC in 0 ms
Free SCC test removed 14 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 3 with 25 rules applied. Total rules applied 230 place count 55 transition count 69
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 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 4 with 38 rules applied. Total rules applied 268 place count 34 transition count 52
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 271 place count 32 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 272 place count 31 transition count 51
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 277 place count 26 transition count 41
Iterating global reduction 7 with 5 rules applied. Total rules applied 282 place count 26 transition count 41
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 287 place count 21 transition count 31
Iterating global reduction 7 with 5 rules applied. Total rules applied 292 place count 21 transition count 31
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 297 place count 16 transition count 21
Iterating global reduction 7 with 5 rules applied. Total rules applied 302 place count 16 transition count 21
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 307 place count 11 transition count 16
Iterating global reduction 7 with 5 rules applied. Total rules applied 312 place count 11 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 313 place count 11 transition count 15
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 7 with 1 rules applied. Total rules applied 314 place count 11 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 315 place count 10 transition count 14
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 317 place count 8 transition count 12
Applied a total of 317 rules in 23 ms. Remains 8 /194 variables (removed 186) and now considering 12/214 (removed 202) transitions.
[2024-05-22 10:45:28] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
// Phase 1: matrix 9 rows 8 cols
[2024-05-22 10:45:28] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 10:45:28] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-22 10:45:28] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2024-05-22 10:45:28] [INFO ] Invariant cache hit.
[2024-05-22 10:45:28] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-05-22 10:45:28] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-22 10:45:28] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2024-05-22 10:45:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 3/16 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/17 variables, and 8 constraints, problems are : Problem set: 0 solved, 8 unsolved in 43 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 3/16 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/17 variables, and 16 constraints, problems are : Problem set: 0 solved, 8 unsolved in 43 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 116ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 116ms
Starting structural reductions in SI_CTL mode, iteration 1 : 8/194 places, 12/214 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 179 ms. Remains : 8/194 places, 12/214 transitions.
[2024-05-22 10:45:28] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:45:28] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:45:28] [INFO ] Input system was already deterministic with 12 transitions.
[2024-05-22 10:45:28] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:45:28] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:45:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality18119127242306868950.gal : 0 ms
[2024-05-22 10:45:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality10218100658342427687.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/CTLCardinality18119127242306868950.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10218100658342427687.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,196,0.00237,3356,2,20,5,114,6,0,36,101,0


Converting to forward existential form...Done !
original formula: AF(AG(((p119==0)&&(p134==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((p119==0)&&(p134==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t4, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total...167
(forward)formula 0,0,0.004704,3676,1,0,26,362,46,16,218,421,35
FORMULA DiscoveryGPU-PT-07b-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 214/214 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 189 transition count 214
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 32 place count 162 transition count 187
Iterating global reduction 1 with 27 rules applied. Total rules applied 59 place count 162 transition count 187
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 65 place count 156 transition count 181
Iterating global reduction 1 with 6 rules applied. Total rules applied 71 place count 156 transition count 181
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 75 place count 152 transition count 177
Iterating global reduction 1 with 4 rules applied. Total rules applied 79 place count 152 transition count 177
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 83 place count 148 transition count 173
Iterating global reduction 1 with 4 rules applied. Total rules applied 87 place count 148 transition count 173
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 91 place count 144 transition count 165
Iterating global reduction 1 with 4 rules applied. Total rules applied 95 place count 144 transition count 165
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 99 place count 140 transition count 161
Iterating global reduction 1 with 4 rules applied. Total rules applied 103 place count 140 transition count 161
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 107 place count 136 transition count 157
Iterating global reduction 1 with 4 rules applied. Total rules applied 111 place count 136 transition count 157
Applied a total of 111 rules in 6 ms. Remains 136 /194 variables (removed 58) and now considering 157/214 (removed 57) transitions.
// Phase 1: matrix 157 rows 136 cols
[2024-05-22 10:45:28] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 10:45:29] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 10:45:29] [INFO ] Invariant cache hit.
[2024-05-22 10:45:29] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2024-05-22 10:45:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 157/292 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-22 10:45:30] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-22 10:45:30] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-22 10:45:30] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-22 10:45:31] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-22 10:45:31] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-22 10:45:31] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-22 10:45:31] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-22 10:45:31] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-05-22 10:45:31] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-22 10:45:31] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-22 10:45:31] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-22 10:45:31] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-22 10:45:31] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-22 10:45:31] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 14/151 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 1/293 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (OVERLAPS) 0/293 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 152 constraints, problems are : Problem set: 0 solved, 156 unsolved in 5531 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 157/292 variables, 135/151 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 155/306 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 1/293 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (OVERLAPS) 0/293 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 308 constraints, problems are : Problem set: 0 solved, 156 unsolved in 7311 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 14/14 constraints]
After SMT, in 12887ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 12889ms
Starting structural reductions in LTL mode, iteration 1 : 136/194 places, 157/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13017 ms. Remains : 136/194 places, 157/214 transitions.
[2024-05-22 10:45:41] [INFO ] Flatten gal took : 9 ms
[2024-05-22 10:45:41] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:45:42] [INFO ] Input system was already deterministic with 157 transitions.
[2024-05-22 10:45:42] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:45:42] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:45:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality3448727481192005624.gal : 1 ms
[2024-05-22 10:45:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality9671596412630727130.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/CTLCardinality3448727481192005624.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9671596412630727130.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.
Detected timeout of ITS tools.
[2024-05-22 10:46:12] [INFO ] Flatten gal took : 8 ms
[2024-05-22 10:46:12] [INFO ] Applying decomposition
[2024-05-22 10:46:12] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18204452863182498208.txt' '-o' '/tmp/graph18204452863182498208.bin' '-w' '/tmp/graph18204452863182498208.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18204452863182498208.bin' '-l' '-1' '-v' '-w' '/tmp/graph18204452863182498208.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:46:12] [INFO ] Decomposing Gal with order
[2024-05-22 10:46:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:46:12] [INFO ] Removed a total of 57 redundant transitions.
[2024-05-22 10:46:12] [INFO ] Flatten gal took : 23 ms
[2024-05-22 10:46:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 11 ms.
[2024-05-22 10:46:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality4875304750183439657.gal : 2 ms
[2024-05-22 10:46:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality1827522536820271201.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/CTLCardinality4875304750183439657.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1827522536820271201.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.52304e+10,20.7067,550244,6010,139,1.12739e+06,11689,383,3.67437e+06,55,112028,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 214/214 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 191 transition count 214
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 21 place count 173 transition count 196
Iterating global reduction 1 with 18 rules applied. Total rules applied 39 place count 173 transition count 196
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 170 transition count 193
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 170 transition count 193
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 167 transition count 190
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 167 transition count 190
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 165 transition count 188
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 165 transition count 188
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 164 transition count 186
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 164 transition count 186
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 163 transition count 185
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 163 transition count 185
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 162 transition count 184
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 162 transition count 184
Applied a total of 61 rules in 21 ms. Remains 162 /194 variables (removed 32) and now considering 184/214 (removed 30) transitions.
// Phase 1: matrix 184 rows 162 cols
[2024-05-22 10:46:42] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 10:46:42] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-22 10:46:42] [INFO ] Invariant cache hit.
[2024-05-22 10:46:42] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 183 sub problems to find dead transitions.
[2024-05-22 10:46:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (OVERLAPS) 184/343 variables, 159/161 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 10:46:44] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-22 10:46:44] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-22 10:46:44] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-22 10:46:44] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-22 10:46:44] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-22 10:46:45] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-22 10:46:45] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-22 10:46:45] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 2 ms to minimize.
[2024-05-22 10:46:45] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-22 10:46:45] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-22 10:46:45] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-22 10:46:45] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-22 10:46:45] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-22 10:46:45] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-22 10:46:45] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-22 10:46:45] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 16/177 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (OVERLAPS) 3/346 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 0/346 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 346/346 variables, and 180 constraints, problems are : Problem set: 0 solved, 183 unsolved in 7621 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 184/343 variables, 159/177 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 180/357 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (OVERLAPS) 3/346 variables, 3/360 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 3/363 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 10 (OVERLAPS) 0/346 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Int declared 346/346 variables, and 363 constraints, problems are : Problem set: 0 solved, 183 unsolved in 10594 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 16/16 constraints]
After SMT, in 18262ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 18264ms
Starting structural reductions in LTL mode, iteration 1 : 162/194 places, 184/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18423 ms. Remains : 162/194 places, 184/214 transitions.
[2024-05-22 10:47:00] [INFO ] Flatten gal took : 8 ms
[2024-05-22 10:47:00] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:47:00] [INFO ] Input system was already deterministic with 184 transitions.
[2024-05-22 10:47:00] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:47:00] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:47:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality17221776303968146735.gal : 1 ms
[2024-05-22 10:47:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality14248053056012763701.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/CTLCardinality17221776303968146735.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14248053056012763701.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.
Detected timeout of ITS tools.
[2024-05-22 10:47:30] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:47:30] [INFO ] Applying decomposition
[2024-05-22 10:47:30] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph127771141348385855.txt' '-o' '/tmp/graph127771141348385855.bin' '-w' '/tmp/graph127771141348385855.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph127771141348385855.bin' '-l' '-1' '-v' '-w' '/tmp/graph127771141348385855.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:47:30] [INFO ] Decomposing Gal with order
[2024-05-22 10:47:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:47:30] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-22 10:47:30] [INFO ] Flatten gal took : 9 ms
[2024-05-22 10:47:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-22 10:47:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality14176941154257907898.gal : 2 ms
[2024-05-22 10:47:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality14586757581480510291.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/CTLCardinality14176941154257907898.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14586757581480510291.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 214/214 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 189 transition count 214
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 31 place count 163 transition count 188
Iterating global reduction 1 with 26 rules applied. Total rules applied 57 place count 163 transition count 188
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 63 place count 157 transition count 182
Iterating global reduction 1 with 6 rules applied. Total rules applied 69 place count 157 transition count 182
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 73 place count 153 transition count 178
Iterating global reduction 1 with 4 rules applied. Total rules applied 77 place count 153 transition count 178
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 81 place count 149 transition count 174
Iterating global reduction 1 with 4 rules applied. Total rules applied 85 place count 149 transition count 174
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 89 place count 145 transition count 166
Iterating global reduction 1 with 4 rules applied. Total rules applied 93 place count 145 transition count 166
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 97 place count 141 transition count 162
Iterating global reduction 1 with 4 rules applied. Total rules applied 101 place count 141 transition count 162
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 104 place count 138 transition count 159
Iterating global reduction 1 with 3 rules applied. Total rules applied 107 place count 138 transition count 159
Applied a total of 107 rules in 6 ms. Remains 138 /194 variables (removed 56) and now considering 159/214 (removed 55) transitions.
// Phase 1: matrix 159 rows 138 cols
[2024-05-22 10:48:00] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:48:00] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-22 10:48:00] [INFO ] Invariant cache hit.
[2024-05-22 10:48:00] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Running 158 sub problems to find dead transitions.
[2024-05-22 10:48:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (OVERLAPS) 159/296 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-22 10:48:02] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-22 10:48:02] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-22 10:48:02] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-22 10:48:02] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-22 10:48:02] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 4 ms to minimize.
[2024-05-22 10:48:02] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-22 10:48:02] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-22 10:48:02] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-22 10:48:03] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-05-22 10:48:03] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-22 10:48:03] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-22 10:48:03] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-22 10:48:03] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 13/152 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (OVERLAPS) 1/297 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 8 (OVERLAPS) 0/297 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 153 constraints, problems are : Problem set: 0 solved, 158 unsolved in 5630 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (OVERLAPS) 159/296 variables, 137/152 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 157/309 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (OVERLAPS) 1/297 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 10 (OVERLAPS) 0/297 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 311 constraints, problems are : Problem set: 0 solved, 158 unsolved in 7719 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 13/13 constraints]
After SMT, in 13380ms problems are : Problem set: 0 solved, 158 unsolved
Search for dead transitions found 0 dead transitions in 13383ms
Starting structural reductions in LTL mode, iteration 1 : 138/194 places, 159/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13535 ms. Remains : 138/194 places, 159/214 transitions.
[2024-05-22 10:48:14] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:48:14] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:48:14] [INFO ] Input system was already deterministic with 159 transitions.
[2024-05-22 10:48:14] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:48:14] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:48:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality14622917632849582677.gal : 1 ms
[2024-05-22 10:48:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality844594962380700575.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/CTLCardinality14622917632849582677.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality844594962380700575.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.
Detected timeout of ITS tools.
[2024-05-22 10:48:44] [INFO ] Flatten gal took : 11 ms
[2024-05-22 10:48:44] [INFO ] Applying decomposition
[2024-05-22 10:48:44] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2139982321102807427.txt' '-o' '/tmp/graph2139982321102807427.bin' '-w' '/tmp/graph2139982321102807427.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2139982321102807427.bin' '-l' '-1' '-v' '-w' '/tmp/graph2139982321102807427.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:48:44] [INFO ] Decomposing Gal with order
[2024-05-22 10:48:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:48:44] [INFO ] Removed a total of 56 redundant transitions.
[2024-05-22 10:48:44] [INFO ] Flatten gal took : 11 ms
[2024-05-22 10:48:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 1 ms.
[2024-05-22 10:48:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality5747846659358429304.gal : 2 ms
[2024-05-22 10:48:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality7172011694039912565.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/CTLCardinality5747846659358429304.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7172011694039912565.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 214/214 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 188 transition count 214
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 32 place count 162 transition count 188
Iterating global reduction 1 with 26 rules applied. Total rules applied 58 place count 162 transition count 188
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 64 place count 156 transition count 182
Iterating global reduction 1 with 6 rules applied. Total rules applied 70 place count 156 transition count 182
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 75 place count 151 transition count 177
Iterating global reduction 1 with 5 rules applied. Total rules applied 80 place count 151 transition count 177
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 85 place count 146 transition count 172
Iterating global reduction 1 with 5 rules applied. Total rules applied 90 place count 146 transition count 172
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 94 place count 142 transition count 164
Iterating global reduction 1 with 4 rules applied. Total rules applied 98 place count 142 transition count 164
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 102 place count 138 transition count 160
Iterating global reduction 1 with 4 rules applied. Total rules applied 106 place count 138 transition count 160
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 110 place count 134 transition count 156
Iterating global reduction 1 with 4 rules applied. Total rules applied 114 place count 134 transition count 156
Applied a total of 114 rules in 11 ms. Remains 134 /194 variables (removed 60) and now considering 156/214 (removed 58) transitions.
// Phase 1: matrix 156 rows 134 cols
[2024-05-22 10:49:14] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:49:14] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 10:49:14] [INFO ] Invariant cache hit.
[2024-05-22 10:49:14] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 155 sub problems to find dead transitions.
[2024-05-22 10:49:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 156/290 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-22 10:49:16] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-22 10:49:16] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-22 10:49:16] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-22 10:49:16] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-22 10:49:16] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-22 10:49:16] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-22 10:49:16] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-22 10:49:16] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-22 10:49:16] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-22 10:49:16] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-22 10:49:16] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-22 10:49:16] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-22 10:49:16] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-22 10:49:17] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-22 10:49:17] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 15/151 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 0/290 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 151 constraints, problems are : Problem set: 0 solved, 155 unsolved in 4804 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (OVERLAPS) 156/290 variables, 134/151 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 155/306 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 0/290 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/290 variables, and 306 constraints, problems are : Problem set: 0 solved, 155 unsolved in 4791 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 15/15 constraints]
After SMT, in 9623ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 9625ms
Starting structural reductions in LTL mode, iteration 1 : 134/194 places, 156/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9773 ms. Remains : 134/194 places, 156/214 transitions.
[2024-05-22 10:49:24] [INFO ] Flatten gal took : 8 ms
[2024-05-22 10:49:24] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:49:24] [INFO ] Input system was already deterministic with 156 transitions.
[2024-05-22 10:49:24] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:49:24] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:49:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality13197589853349021472.gal : 1 ms
[2024-05-22 10:49:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality15978533372250213040.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/CTLCardinality13197589853349021472.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15978533372250213040.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.
Detected timeout of ITS tools.
[2024-05-22 10:49:54] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:49:54] [INFO ] Applying decomposition
[2024-05-22 10:49:54] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3162110830387745194.txt' '-o' '/tmp/graph3162110830387745194.bin' '-w' '/tmp/graph3162110830387745194.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3162110830387745194.bin' '-l' '-1' '-v' '-w' '/tmp/graph3162110830387745194.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:49:54] [INFO ] Decomposing Gal with order
[2024-05-22 10:49:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:49:54] [INFO ] Removed a total of 55 redundant transitions.
[2024-05-22 10:49:54] [INFO ] Flatten gal took : 9 ms
[2024-05-22 10:49:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 1 ms.
[2024-05-22 10:49:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality1901122017625001124.gal : 2 ms
[2024-05-22 10:49:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality16454195259471783414.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/CTLCardinality1901122017625001124.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16454195259471783414.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.98427e+10,10.575,319896,3315,153,594453,6680,371,2.3879e+06,55,66498,0


Converting to forward existential form...Done !
original formula: E((!(((i2.u16.p74==0)||(i7.u25.p106==1))) + ((i6.u19.p85==1) * (EG((((u45.p202==0)||(i16.u46.p207==1)) * AF(((i16.u35.p151==0)||(i1.u5.p1...308
=> equivalent forward existential formula: [((FwdU(Init,(!(((i2.u16.p74==0)||(i7.u25.p106==1))) + ((i6.u19.p85==1) * (EG((((u45.p202==0)||(i16.u46.p207==1)...506
Reverse transition relation is NOT exact ! Due to transitions t148, t152, u45.t6, u45.t7, u45.t8, i1.t100, i1.t19, i1.u4.t98, i1.u4.t99, i1.u5.t21, i2.t96,...581
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 214/214 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 188 transition count 214
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 36 place count 158 transition count 184
Iterating global reduction 1 with 30 rules applied. Total rules applied 66 place count 158 transition count 184
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 74 place count 150 transition count 176
Iterating global reduction 1 with 8 rules applied. Total rules applied 82 place count 150 transition count 176
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 88 place count 144 transition count 170
Iterating global reduction 1 with 6 rules applied. Total rules applied 94 place count 144 transition count 170
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 100 place count 138 transition count 164
Iterating global reduction 1 with 6 rules applied. Total rules applied 106 place count 138 transition count 164
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 112 place count 132 transition count 152
Iterating global reduction 1 with 6 rules applied. Total rules applied 118 place count 132 transition count 152
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 124 place count 126 transition count 146
Iterating global reduction 1 with 6 rules applied. Total rules applied 130 place count 126 transition count 146
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 136 place count 120 transition count 140
Iterating global reduction 1 with 6 rules applied. Total rules applied 142 place count 120 transition count 140
Applied a total of 142 rules in 14 ms. Remains 120 /194 variables (removed 74) and now considering 140/214 (removed 74) transitions.
// Phase 1: matrix 140 rows 120 cols
[2024-05-22 10:50:24] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:50:24] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-22 10:50:24] [INFO ] Invariant cache hit.
[2024-05-22 10:50:24] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 139 sub problems to find dead transitions.
[2024-05-22 10:50:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (OVERLAPS) 140/260 variables, 120/122 constraints. Problems are: Problem set: 0 solved, 139 unsolved
[2024-05-22 10:50:26] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-22 10:50:26] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-22 10:50:26] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-22 10:50:26] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-22 10:50:26] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-22 10:50:26] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-22 10:50:26] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-22 10:50:26] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-22 10:50:26] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-22 10:50:26] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-22 10:50:26] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-22 10:50:26] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-22 10:50:26] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-22 10:50:26] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-22 10:50:26] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 15/137 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (OVERLAPS) 0/260 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 137 constraints, problems are : Problem set: 0 solved, 139 unsolved in 3969 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 140/260 variables, 120/137 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 139/276 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (OVERLAPS) 0/260 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 276 constraints, problems are : Problem set: 0 solved, 139 unsolved in 3695 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 15/15 constraints]
After SMT, in 7722ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 7724ms
Starting structural reductions in LTL mode, iteration 1 : 120/194 places, 140/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7861 ms. Remains : 120/194 places, 140/214 transitions.
[2024-05-22 10:50:32] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:50:32] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:50:32] [INFO ] Input system was already deterministic with 140 transitions.
[2024-05-22 10:50:32] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:50:32] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:50:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality9954834477528986508.gal : 0 ms
[2024-05-22 10:50:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality14634221446863364330.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/CTLCardinality9954834477528986508.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14634221446863364330.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.
Detected timeout of ITS tools.
[2024-05-22 10:51:02] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:51:02] [INFO ] Applying decomposition
[2024-05-22 10:51:02] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18088554842581747563.txt' '-o' '/tmp/graph18088554842581747563.bin' '-w' '/tmp/graph18088554842581747563.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18088554842581747563.bin' '-l' '-1' '-v' '-w' '/tmp/graph18088554842581747563.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:51:02] [INFO ] Decomposing Gal with order
[2024-05-22 10:51:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:51:02] [INFO ] Removed a total of 53 redundant transitions.
[2024-05-22 10:51:02] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:51:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 1 ms.
[2024-05-22 10:51:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality10849256140491724270.gal : 12 ms
[2024-05-22 10:51:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality12770753097846737547.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/CTLCardinality10849256140491724270.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12770753097846737547.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 10:51:32] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:51:32] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:51:32] [INFO ] Applying decomposition
[2024-05-22 10:51:32] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14980487068353379465.txt' '-o' '/tmp/graph14980487068353379465.bin' '-w' '/tmp/graph14980487068353379465.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14980487068353379465.bin' '-l' '-1' '-v' '-w' '/tmp/graph14980487068353379465.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:51:32] [INFO ] Decomposing Gal with order
[2024-05-22 10:51:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:51:32] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-22 10:51:32] [INFO ] Flatten gal took : 12 ms
[2024-05-22 10:51:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-22 10:51:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality6476195822796312780.gal : 8 ms
[2024-05-22 10:51:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality9655918436789418790.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/CTLCardinality6476195822796312780.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9655918436789418790.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 8 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.1347e+11,9.57662,303812,12113,54,509175,542,448,1.30644e+06,56,2821,0


Converting to forward existential form...Done !
original formula: EF(AG(AX(((i10.u27.p77==0) + EF(((i18.u46.p135==0)||(i18.u47.p140==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EX(!(((i10.u27.p77==0) + E(TRUE U ((i18.u46.p135==0)||(i18.u47.p140==1)))))))...169
Reverse transition relation is NOT exact ! Due to transitions t9, t190, u68.t10, u68.t11, u68.t12, u68.t13, i2.i0.u4.t136, i2.i1.u9.t207, i3.u6.t134, i4.u1...811
(forward)formula 0,1,17.1452,364560,1,0,801082,542,2378,1.30644e+06,236,2821,2128516
FORMULA DiscoveryGPU-PT-07b-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(EX((i20.i0.u51.p153==1)))
=> equivalent forward existential formula: [FwdG(Init,!(EX((i20.i0.u51.p153==1))))] = FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
(forward)formula 1,0,607.537,3406492,1,0,6.36852e+06,542,891,1.08826e+07,111,2821,4754340
FORMULA DiscoveryGPU-PT-07b-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX(AG((((AF(((i0.u58.p169==0)&&(i1.i1.u3.p5==1))) + EX((i9.u24.p67==0))) + (AX(((i17.u45.p132==0)||(i23.u62.p182==1))) + (i19.u50.p151==0...184
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((((!(EG(!(((i0.u58.p169==0)&&(i1.i1.u3.p5==1))))) + EX((i9.u24.p67==0))) + (!(EX(!(((i...253
(forward)formula 2,0,799.946,5668396,1,0,1.04943e+07,542,1542,1.96695e+07,139,2821,2239697
FORMULA DiscoveryGPU-PT-07b-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((EX(AX(FALSE)) + AX((AG(((i14.i0.u35.p105==0)||(i15.u40.p120==1))) * (((i19.u50.p148==0)||(i0.u58.p169==1))||((i1.i1.u12.p33==0)||(i21...174
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * !(EX(!(FALSE))))] != FALSE + [(FwdU(Init,TRUE) * !(EX(!((!(E(TRUE U !(((i14.i0.u35.p105...281
(forward)formula 3,1,801.07,5668396,1,0,1.04943e+07,542,1569,1.96695e+07,139,2821,2417355
FORMULA DiscoveryGPU-PT-07b-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
Detected timeout of ITS tools.
[2024-05-22 11:14:54] [INFO ] Applying decomposition
[2024-05-22 11:14:54] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:14:54] [INFO ] Decomposing Gal with order
[2024-05-22 11:14:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 11:14:54] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-22 11:14:54] [INFO ] Flatten gal took : 8 ms
[2024-05-22 11:14:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 296 labels/synchronizations in 5 ms.
[2024-05-22 11:14:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality16167570839420008446.gal : 1 ms
[2024-05-22 11:14:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality15651049134111110606.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/CTLCardinality16167570839420008446.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15651049134111110606.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 4 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.1347e+11,34.0968,799908,818,2458,1.10096e+06,268224,253,3.57348e+06,229,3.31924e+06,0


Converting to forward existential form...Done !
original formula: (!(E((((((EF(((i0.i0.i0.u11.p119==0)||(i0.i0.i0.i0.i0.i0.u7.p27==1))) * ((i0.i0.i0.u11.p120==0)||(i0.i0.u12.p152==1))) + (i0.i0.i0.u11.p1...1012
=> equivalent forward existential formula: ([((FwdU(Init,(((((E(TRUE U ((i0.i0.i0.u11.p119==0)||(i0.i0.i0.i0.i0.i0.u7.p27==1))) * ((i0.i0.i0.u11.p120==0)||...1587
Reverse transition relation is NOT exact ! Due to transitions t190, i0.t19, i0.u13.t16, i0.u13.t22, i0.u13.t26, i0.u13.t28, i0.u13.t30, i0.u13.t32, i0.i0.u...1163
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
(forward)formula 0,0,697.697,2990432,1,0,2.9539e+06,2.74962e+06,497,1.05869e+07,605,1.59012e+07,391186
FORMULA DiscoveryGPU-PT-07b-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX(E((i0.i0.i0.i0.i0.i0.u7.p11!=1) U !((((i0.i0.u12.p153==1) + EF(((i0.i0.i0.i0.i0.i0.u7.p27==0)||(i0.i0.i0.i0.i0.i0.u7.p11==1)))) + (AX(...290
=> equivalent forward existential formula: [(EY(Init) * !(E((i0.i0.i0.i0.i0.i0.u7.p11!=1) U !((((i0.i0.u12.p153==1) + E(TRUE U ((i0.i0.i0.i0.i0.i0.u7.p27==...349
(forward)formula 1,0,698.588,2990432,1,0,2.9539e+06,2.74962e+06,756,1.05869e+07,823,1.59012e+07,411047
FORMULA DiscoveryGPU-PT-07b-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E((!(((i0.i0.i0.i0.i0.u9.p74==0)||(i0.i0.i0.i0.u10.p106==1))) + ((i0.i0.i0.i0.i0.u9.p85==1) * (EG((((i1.u15.p202==0)||(i1.u16.p207==1)) *...358
=> equivalent forward existential formula: [((FwdU(Init,(!(((i0.i0.i0.i0.i0.u9.p74==0)||(i0.i0.i0.i0.u10.p106==1))) + ((i0.i0.i0.i0.i0.u9.p85==1) * (EG((((...574
(forward)formula 2,0,733.116,2990432,1,0,2.9539e+06,2.75683e+06,785,1.05869e+07,828,1.98729e+07,708236
FORMULA DiscoveryGPU-PT-07b-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(AF(AX(EX((i0.i0.i0.i0.u10.p103==0)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(!(EX(!(EX((i0.i0.i0.i0.u10.p103==0)))))))] = FALSE
(forward)formula 3,0,783.901,3289408,1,0,3.1928e+06,2.97402e+06,494,1.15668e+07,605,2.23396e+07,74849
FORMULA DiscoveryGPU-PT-07b-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 2793771 ms.

BK_STOP 1716377280138

--------------------
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="DiscoveryGPU-PT-07b"
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 DiscoveryGPU-PT-07b, 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-171631132500385"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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