Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r058-smll-174854064500617.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is DiscoveryGPU-PT-06b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854064500617
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 46K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-2023-12
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-2023-13
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-2023-14
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-2023-15
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-2025-00
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-2025-01
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-2025-02
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-2025-03
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-2025-04
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-2025-05
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-2025-06
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-2025-07
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-2025-08
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-2025-09
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-2025-10
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748910503992

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-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-03 00:28: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]
[2025-06-03 00:28:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 00:28:26] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2025-06-03 00:28:26] [INFO ] Transformed 184 places.
[2025-06-03 00:28:26] [INFO ] Transformed 194 transitions.
[2025-06-03 00:28:26] [INFO ] Found NUPN structural information;
[2025-06-03 00:28:26] [INFO ] Parsed PT model containing 184 places and 194 transitions and 503 arcs in 244 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 23 ms.
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 68 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 178 transition count 194
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 15 place count 169 transition count 185
Iterating global reduction 1 with 9 rules applied. Total rules applied 24 place count 169 transition count 185
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 168 transition count 184
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 168 transition count 184
Applied a total of 26 rules in 61 ms. Remains 168 /184 variables (removed 16) and now considering 184/194 (removed 10) transitions.
// Phase 1: matrix 184 rows 168 cols
[2025-06-03 00:28:26] [INFO ] Computed 4 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:28:27] [INFO ] Implicit Places using invariants in 524 ms returned []
[2025-06-03 00:28:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:28:27] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 965 ms to find 0 implicit places.
Running 183 sub problems to find dead transitions.
[2025-06-03 00:28:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (OVERLAPS) 5/166 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:31] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:31] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 184/350 variables, 166/172 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:35] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:35] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:35] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:36] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:36] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:36] [INFO ] Deduced a trap composed of 105 places in 124 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:36] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 7/179 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (OVERLAPS) 2/352 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (OVERLAPS) 0/352 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 181 constraints, problems are : Problem set: 0 solved, 183 unsolved in 28025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (OVERLAPS) 5/166 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 184/350 variables, 166/179 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 181/360 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:29:01] [INFO ] Deduced a trap composed of 106 places in 147 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 2/352 variables, 2/363 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 2/365 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/352 variables, and 365 constraints, problems are : Problem set: 0 solved, 183 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58248ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 58273ms
Starting structural reductions in LTL mode, iteration 1 : 168/184 places, 184/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59331 ms. Remains : 168/184 places, 184/194 transitions.
Support contains 68 out of 168 places after structural reductions.
[2025-06-03 00:29:26] [INFO ] Flatten gal took : 58 ms
[2025-06-03 00:29:26] [INFO ] Flatten gal took : 23 ms
[2025-06-03 00:29:26] [INFO ] Input system was already deterministic with 184 transitions.
Support contains 62 out of 168 places (down from 68) after GAL structural reductions.
RANDOM walk for 5066 steps (23 resets) in 490 ms. (10 steps per ms) remains 0/47 properties
[2025-06-03 00:29:26] [INFO ] Flatten gal took : 25 ms
[2025-06-03 00:29:26] [INFO ] Flatten gal took : 25 ms
[2025-06-03 00:29:26] [INFO ] Input system was already deterministic with 184 transitions.
Computed a total of 25 stabilizing places and 25 stable transitions
Graph (complete) has 299 edges and 168 vertex of which 151 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.8 ms
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 184/184 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 163 transition count 184
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 27 place count 141 transition count 162
Iterating global reduction 1 with 22 rules applied. Total rules applied 49 place count 141 transition count 162
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 55 place count 135 transition count 156
Iterating global reduction 1 with 6 rules applied. Total rules applied 61 place count 135 transition count 156
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 65 place count 131 transition count 152
Iterating global reduction 1 with 4 rules applied. Total rules applied 69 place count 131 transition count 152
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 73 place count 127 transition count 148
Iterating global reduction 1 with 4 rules applied. Total rules applied 77 place count 127 transition count 148
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 81 place count 123 transition count 140
Iterating global reduction 1 with 4 rules applied. Total rules applied 85 place count 123 transition count 140
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 89 place count 119 transition count 136
Iterating global reduction 1 with 4 rules applied. Total rules applied 93 place count 119 transition count 136
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 96 place count 116 transition count 133
Iterating global reduction 1 with 3 rules applied. Total rules applied 99 place count 116 transition count 133
Applied a total of 99 rules in 54 ms. Remains 116 /168 variables (removed 52) and now considering 133/184 (removed 51) transitions.
// Phase 1: matrix 133 rows 116 cols
[2025-06-03 00:29:26] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:29:27] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-03 00:29:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:29:27] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2025-06-03 00:29:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (OVERLAPS) 133/248 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:29:31] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:29:31] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:29:31] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:29:31] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:29:31] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:29:31] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 6/123 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 1/249 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/249 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 124 constraints, problems are : Problem set: 0 solved, 132 unsolved in 12862 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/248 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 131/254 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 1/249 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 10 (OVERLAPS) 0/249 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 256 constraints, problems are : Problem set: 0 solved, 132 unsolved in 13767 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26659ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 26660ms
Starting structural reductions in LTL mode, iteration 1 : 116/168 places, 133/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26974 ms. Remains : 116/168 places, 133/184 transitions.
[2025-06-03 00:29:53] [INFO ] Flatten gal took : 18 ms
[2025-06-03 00:29:53] [INFO ] Flatten gal took : 18 ms
[2025-06-03 00:29:53] [INFO ] Input system was already deterministic with 133 transitions.
[2025-06-03 00:29:54] [INFO ] Flatten gal took : 16 ms
[2025-06-03 00:29:54] [INFO ] Flatten gal took : 16 ms
[2025-06-03 00:29:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality6886753853649825111.gal : 7 ms
[2025-06-03 00:29:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality116812923464645537.ctl : 10 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6886753853649825111.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality116812923464645537.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.02059e+08,12.0609,246220,2,28099,5,809000,6,0,594,1.45933e+06,0


Converting to forward existential form...Done !
original formula: EF((!(A(EG(((p98==0)&&(p164==0))) U EX(E((p34==1) U ((p160==0)||(p15==1)))))) + AX((A((p10==1) U (p159==1)) * AX((p162==0))))))
=> equivalent forward existential formula: (([((FwdU(FwdU(Init,TRUE),!(EX(E((p34==1) U ((p160==0)||(p15==1)))))) * !(EG(((p98==0)&&(p164==0))))) * !(EX(E((...418
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t14, t15, t17, t23, t26, t27, t29, t35, t39, t40, t42, t48, t51, t52, t54, t61, t...317
Detected timeout of ITS tools.
[2025-06-03 00:30:24] [INFO ] Flatten gal took : 19 ms
[2025-06-03 00:30:24] [INFO ] Applying decomposition
[2025-06-03 00:30:24] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4820744560308919900.txt' '-o' '/tmp/graph4820744560308919900.bin' '-w' '/tmp/graph4820744560308919900.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4820744560308919900.bin' '-l' '-1' '-v' '-w' '/tmp/graph4820744560308919900.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:30:24] [INFO ] Decomposing Gal with order
[2025-06-03 00:30:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:30:24] [INFO ] Removed a total of 45 redundant transitions.
[2025-06-03 00:30:24] [INFO ] Flatten gal took : 92 ms
[2025-06-03 00:30:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 12 ms.
[2025-06-03 00:30:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality6261670196815492730.gal : 13 ms
[2025-06-03 00:30:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality4450658384408205747.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6261670196815492730.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4450658384408205747.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,7.02059e+08,10.4119,215348,6450,94,332552,1377,333,1.40422e+06,50,7210,0


Converting to forward existential form...Done !
original formula: EF((!(A(EG(((i8.u24.p98==0)&&(i12.u37.p164==0))) U EX(E((i5.u11.p34==1) U ((i11.u35.p160==0)||(i14.u7.p15==1)))))) + AX((A((i14.u6.p10==1...205
=> equivalent forward existential formula: (([((FwdU(FwdU(Init,TRUE),!(EX(E((i5.u11.p34==1) U ((i11.u35.p160==0)||(i14.u7.p15==1)))))) * !(EG(((i8.u24.p98=...538
Reverse transition relation is NOT exact ! Due to transitions t125, u39.t4, u39.t5, i2.u5.t84, i3.t61, i3.t48, i3.t35, i3.t23, i3.u9.t76, i3.u9.t131, i4.u4...483
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 184/184 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 163 transition count 184
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 27 place count 141 transition count 162
Iterating global reduction 1 with 22 rules applied. Total rules applied 49 place count 141 transition count 162
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 55 place count 135 transition count 156
Iterating global reduction 1 with 6 rules applied. Total rules applied 61 place count 135 transition count 156
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 65 place count 131 transition count 152
Iterating global reduction 1 with 4 rules applied. Total rules applied 69 place count 131 transition count 152
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 73 place count 127 transition count 148
Iterating global reduction 1 with 4 rules applied. Total rules applied 77 place count 127 transition count 148
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 80 place count 124 transition count 142
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 124 transition count 142
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 85 place count 122 transition count 140
Iterating global reduction 1 with 2 rules applied. Total rules applied 87 place count 122 transition count 140
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 89 place count 120 transition count 138
Iterating global reduction 1 with 2 rules applied. Total rules applied 91 place count 120 transition count 138
Applied a total of 91 rules in 19 ms. Remains 120 /168 variables (removed 48) and now considering 138/184 (removed 46) transitions.
// Phase 1: matrix 138 rows 120 cols
[2025-06-03 00:30:54] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:30:54] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-06-03 00:30:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:30:55] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
Running 137 sub problems to find dead transitions.
[2025-06-03 00:30:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (OVERLAPS) 138/257 variables, 119/121 constraints. Problems are: Problem set: 0 solved, 137 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:30:58] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:30:58] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:30:59] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:30:59] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:30:59] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:30:59] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 6/127 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (OVERLAPS) 1/258 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (OVERLAPS) 0/258 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 128 constraints, problems are : Problem set: 0 solved, 137 unsolved in 11651 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 138/257 variables, 119/127 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 136/263 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 1/258 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 10 (OVERLAPS) 0/258 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 265 constraints, problems are : Problem set: 0 solved, 137 unsolved in 15826 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27520ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 27523ms
Starting structural reductions in LTL mode, iteration 1 : 120/168 places, 138/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28054 ms. Remains : 120/168 places, 138/184 transitions.
[2025-06-03 00:31:22] [INFO ] Flatten gal took : 8 ms
[2025-06-03 00:31:22] [INFO ] Flatten gal took : 8 ms
[2025-06-03 00:31:22] [INFO ] Input system was already deterministic with 138 transitions.
[2025-06-03 00:31:22] [INFO ] Flatten gal took : 7 ms
[2025-06-03 00:31:22] [INFO ] Flatten gal took : 8 ms
[2025-06-03 00:31:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality16638224786269828677.gal : 2 ms
[2025-06-03 00:31:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality13867145875209768982.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16638224786269828677.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13867145875209768982.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,7.87751e+08,16.0099,298052,2,42369,5,993389,6,0,615,1.74771e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-03 00:31:52] [INFO ] Flatten gal took : 15 ms
[2025-06-03 00:31:52] [INFO ] Applying decomposition
[2025-06-03 00:31:52] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17487039142176543143.txt' '-o' '/tmp/graph17487039142176543143.bin' '-w' '/tmp/graph17487039142176543143.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17487039142176543143.bin' '-l' '-1' '-v' '-w' '/tmp/graph17487039142176543143.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:31:52] [INFO ] Decomposing Gal with order
[2025-06-03 00:31:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:31:52] [INFO ] Removed a total of 47 redundant transitions.
[2025-06-03 00:31:52] [INFO ] Flatten gal took : 30 ms
[2025-06-03 00:31:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 5 ms.
[2025-06-03 00:31:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality5985576429362526655.gal : 6 ms
[2025-06-03 00:31:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality11265878384671225225.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5985576429362526655.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11265878384671225225.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,7.87751e+08,3.42135,78920,2850,127,123003,3407,336,494684,48,21627,0


Converting to forward existential form...Done !
original formula: AX((((i10.u33.p132==0)&&(i9.u30.p124==1)) * (EG((i16.u10.p37==0)) * EG((i0.u37.p144==0)))))
=> equivalent forward existential formula: ([(EY(Init) * !(((i10.u33.p132==0)&&(i9.u30.p124==1))))] = FALSE * ([(EY(Init) * !(EG((i16.u10.p37==0))))] = FAL...208
Reverse transition relation is NOT exact ! Due to transitions t97, t99, t132, u42.t4, u42.t5, i0.t16, i0.u6.t84, i0.u6.t85, i0.u37.t18, i0.u43.t2, i1.t82, ...498
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 184/184 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 163 transition count 184
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 27 place count 141 transition count 162
Iterating global reduction 1 with 22 rules applied. Total rules applied 49 place count 141 transition count 162
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 56 place count 134 transition count 155
Iterating global reduction 1 with 7 rules applied. Total rules applied 63 place count 134 transition count 155
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 68 place count 129 transition count 150
Iterating global reduction 1 with 5 rules applied. Total rules applied 73 place count 129 transition count 150
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 77 place count 125 transition count 146
Iterating global reduction 1 with 4 rules applied. Total rules applied 81 place count 125 transition count 146
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 85 place count 121 transition count 138
Iterating global reduction 1 with 4 rules applied. Total rules applied 89 place count 121 transition count 138
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 92 place count 118 transition count 135
Iterating global reduction 1 with 3 rules applied. Total rules applied 95 place count 118 transition count 135
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 98 place count 115 transition count 132
Iterating global reduction 1 with 3 rules applied. Total rules applied 101 place count 115 transition count 132
Applied a total of 101 rules in 21 ms. Remains 115 /168 variables (removed 53) and now considering 132/184 (removed 52) transitions.
// Phase 1: matrix 132 rows 115 cols
[2025-06-03 00:32:22] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:32:23] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-03 00:32:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:32:23] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2025-06-03 00:32:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 132/246 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:32:26] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:32:26] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:32:26] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:32:26] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:32:26] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:32:26] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 1/247 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 0/247 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 123 constraints, problems are : Problem set: 0 solved, 131 unsolved in 10342 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 132/246 variables, 114/122 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 130/252 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 1/247 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 0/247 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 254 constraints, problems are : Problem set: 0 solved, 131 unsolved in 13272 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23637ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 23637ms
Starting structural reductions in LTL mode, iteration 1 : 115/168 places, 132/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23861 ms. Remains : 115/168 places, 132/184 transitions.
[2025-06-03 00:32:46] [INFO ] Flatten gal took : 7 ms
[2025-06-03 00:32:46] [INFO ] Flatten gal took : 7 ms
[2025-06-03 00:32:46] [INFO ] Input system was already deterministic with 132 transitions.
[2025-06-03 00:32:46] [INFO ] Flatten gal took : 9 ms
[2025-06-03 00:32:46] [INFO ] Flatten gal took : 5 ms
[2025-06-03 00:32:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality90569719197197486.gal : 2 ms
[2025-06-03 00:32:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality5878086443230058969.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality90569719197197486.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5878086443230058969.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.05005e+08,15.0594,292808,2,35578,5,979415,6,0,589,1.69744e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-03 00:33:16] [INFO ] Flatten gal took : 6 ms
[2025-06-03 00:33:16] [INFO ] Applying decomposition
[2025-06-03 00:33:16] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17474921479396475173.txt' '-o' '/tmp/graph17474921479396475173.bin' '-w' '/tmp/graph17474921479396475173.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17474921479396475173.bin' '-l' '-1' '-v' '-w' '/tmp/graph17474921479396475173.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:33:16] [INFO ] Decomposing Gal with order
[2025-06-03 00:33:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:33:17] [INFO ] Removed a total of 45 redundant transitions.
[2025-06-03 00:33:17] [INFO ] Flatten gal took : 19 ms
[2025-06-03 00:33:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2025-06-03 00:33:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality7289076753768494798.gal : 5 ms
[2025-06-03 00:33:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality12534930628441525977.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7289076753768494798.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12534930628441525977.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,7.05005e+08,3.0821,65520,2812,106,112861,2279,321,293239,45,15230,0


Converting to forward existential form...Done !
original formula: AX((A(AF(((i7.u30.p126==0)||(i14.u37.p158==1))) U AX(((i7.u30.p126==0)||(i10.u20.p70==1)))) * EF(((i6.u4.p13==1)&&((i8.u17.p51==0)||(i15....172
=> equivalent forward existential formula: (([(EY((FwdU(EY(Init),!(!(EX(!(((i7.u30.p126==0)||(i10.u20.p70==1))))))) * !(!(EG(!(((i7.u30.p126==0)||(i14.u37....394
Reverse transition relation is NOT exact ! Due to transitions t90, t93, u41.t4, u41.t5, i3.u7.t83, i4.t47, i4.t35, i4.t23, i4.u8.t74, i4.u8.t131, i5.u10.t8...477
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
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
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 12
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
(forward)formula 0,1,26.6025,449748,1,0,634735,10731,1865,2.28695e+06,262,82271,552410
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 184/184 transitions.
Graph (complete) has 299 edges and 168 vertex of which 151 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.2 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 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 150 transition count 146
Reduce places removed 26 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 31 rules applied. Total rules applied 58 place count 124 transition count 141
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 63 place count 119 transition count 141
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 63 place count 119 transition count 129
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 87 place count 107 transition count 129
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 94 place count 100 transition count 122
Iterating global reduction 3 with 7 rules applied. Total rules applied 101 place count 100 transition count 122
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 106 place count 95 transition count 117
Iterating global reduction 3 with 5 rules applied. Total rules applied 111 place count 95 transition count 117
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 116 place count 90 transition count 112
Iterating global reduction 3 with 5 rules applied. Total rules applied 121 place count 90 transition count 112
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 125 place count 86 transition count 104
Iterating global reduction 3 with 4 rules applied. Total rules applied 129 place count 86 transition count 104
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 133 place count 82 transition count 100
Iterating global reduction 3 with 4 rules applied. Total rules applied 137 place count 82 transition count 100
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 159 place count 71 transition count 89
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 161 place count 71 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 70 transition count 88
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 5 rules applied. Total rules applied 167 place count 69 transition count 84
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 6 rules applied. Total rules applied 173 place count 65 transition count 82
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 175 place count 63 transition count 82
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 175 place count 63 transition count 81
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 177 place count 62 transition count 81
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 6 with 2 rules applied. Total rules applied 179 place count 61 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 181 place count 61 transition count 78
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 7 with 2 rules applied. Total rules applied 183 place count 60 transition count 77
Applied a total of 183 rules in 69 ms. Remains 60 /168 variables (removed 108) and now considering 77/184 (removed 107) transitions.
// Phase 1: matrix 77 rows 60 cols
[2025-06-03 00:33:43] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:33:43] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-03 00:33:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:33:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 00:33:43] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:33:43] [INFO ] Redundant transitions in 3 ms returned []
Running 76 sub problems to find dead transitions.
[2025-06-03 00:33:43] [INFO ] Invariant cache hit.
[2025-06-03 00:33:43] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 76/135 variables, 59/60 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 1/136 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:33:45] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 1/137 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/137 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 63 constraints, problems are : Problem set: 0 solved, 76 unsolved in 3966 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 76/135 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 76/137 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 1/136 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 1/137 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/137 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 139 constraints, problems are : Problem set: 0 solved, 76 unsolved in 4189 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8184ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 8185ms
Starting structural reductions in SI_CTL mode, iteration 1 : 60/168 places, 77/184 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8410 ms. Remains : 60/168 places, 77/184 transitions.
[2025-06-03 00:33:52] [INFO ] Flatten gal took : 3 ms
[2025-06-03 00:33:52] [INFO ] Flatten gal took : 3 ms
[2025-06-03 00:33:52] [INFO ] Input system was already deterministic with 77 transitions.
[2025-06-03 00:33:52] [INFO ] Flatten gal took : 3 ms
[2025-06-03 00:33:52] [INFO ] Flatten gal took : 3 ms
[2025-06-03 00:33:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality9201563205452733354.gal : 1 ms
[2025-06-03 00:33:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality13705387714753771726.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9201563205452733354.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13705387714753771726.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.46404e+06,0.247516,10860,2,1988,5,34679,6,0,314,34033,0


Converting to forward existential form...Done !
original formula: E((!((A(((p125==0)||(p69==1)) U (p56==1)) * (p173!=1))) + (EG(((p60==0)&&(p29==1))) * AF(!(EF((p2==0)))))) U (p49==1))
=> equivalent forward existential formula: [(FwdU(Init,(!((!((E(!((p56==1)) U (!(((p125==0)||(p69==1))) * !((p56==1)))) + EG(!((p56==1))))) * (p173!=1))) +...239
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t6, t7, t9, t12, t14, t16, t17, t20, t23, t24, t27, t28, t30, t35, t36, t58, t68, t71...280
(forward)formula 0,0,19.9181,426312,1,0,929,2.3139e+06,194,496,1947,3.28492e+06,975
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 184/184 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 163 transition count 184
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 26 place count 142 transition count 163
Iterating global reduction 1 with 21 rules applied. Total rules applied 47 place count 142 transition count 163
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 53 place count 136 transition count 157
Iterating global reduction 1 with 6 rules applied. Total rules applied 59 place count 136 transition count 157
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 63 place count 132 transition count 153
Iterating global reduction 1 with 4 rules applied. Total rules applied 67 place count 132 transition count 153
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 70 place count 129 transition count 150
Iterating global reduction 1 with 3 rules applied. Total rules applied 73 place count 129 transition count 150
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 127 transition count 146
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 127 transition count 146
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 79 place count 125 transition count 144
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 125 transition count 144
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 123 transition count 142
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 123 transition count 142
Applied a total of 85 rules in 20 ms. Remains 123 /168 variables (removed 45) and now considering 142/184 (removed 42) transitions.
// Phase 1: matrix 142 rows 123 cols
[2025-06-03 00:34:12] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:34:12] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-06-03 00:34:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:34:12] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Running 141 sub problems to find dead transitions.
[2025-06-03 00:34:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 142/264 variables, 122/124 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:34:16] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:34:16] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:34:16] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:34:16] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:34:16] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:34:16] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 6/130 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (OVERLAPS) 1/265 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (OVERLAPS) 0/265 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 131 constraints, problems are : Problem set: 0 solved, 141 unsolved in 13561 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (OVERLAPS) 142/264 variables, 122/130 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 140/270 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (OVERLAPS) 1/265 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 10 (OVERLAPS) 0/265 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 272 constraints, problems are : Problem set: 0 solved, 141 unsolved in 16638 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30223ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 30223ms
Starting structural reductions in LTL mode, iteration 1 : 123/168 places, 142/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30586 ms. Remains : 123/168 places, 142/184 transitions.
[2025-06-03 00:34:42] [INFO ] Flatten gal took : 9 ms
[2025-06-03 00:34:42] [INFO ] Flatten gal took : 8 ms
[2025-06-03 00:34:42] [INFO ] Input system was already deterministic with 142 transitions.
[2025-06-03 00:34:42] [INFO ] Flatten gal took : 11 ms
[2025-06-03 00:34:42] [INFO ] Flatten gal took : 7 ms
[2025-06-03 00:34:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality16948324610103285244.gal : 3 ms
[2025-06-03 00:34:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality241282523342971394.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16948324610103285244.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality241282523342971394.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.60856e+08,17.0857,336344,2,33376,5,1.08446e+06,6,0,632,2.06104e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-03 00:35:12] [INFO ] Flatten gal took : 6 ms
[2025-06-03 00:35:12] [INFO ] Applying decomposition
[2025-06-03 00:35:12] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8715323214283222847.txt' '-o' '/tmp/graph8715323214283222847.bin' '-w' '/tmp/graph8715323214283222847.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8715323214283222847.bin' '-l' '-1' '-v' '-w' '/tmp/graph8715323214283222847.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:35:13] [INFO ] Decomposing Gal with order
[2025-06-03 00:35:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:35:13] [INFO ] Removed a total of 50 redundant transitions.
[2025-06-03 00:35:13] [INFO ] Flatten gal took : 13 ms
[2025-06-03 00:35:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2025-06-03 00:35:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality11854892258141083235.gal : 3 ms
[2025-06-03 00:35:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality2864253316379916575.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11854892258141083235.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2864253316379916575.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,8.60856e+08,13.7988,314808,4051,69,530339,822,342,2.04046e+06,44,4835,0


Converting to forward existential form...Done !
original formula: EG((EF(AG(AF((i14.u37.p145==0)))) + AG((!(A((i2.u3.p40==0) U (i10.u29.p107==0))) * AX(AG(((i5.u10.p47==0)||(i2.u25.p90==1))))))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U !(E(TRUE U !(!(EG(!((i14.u37.p145==0)))))))) + !(E(TRUE U !((!(!((E(!((i10.u29.p107==0)) U ...307
Reverse transition relation is NOT exact ! Due to transitions t137, u44.t4, u44.t5, i2.t107, i2.t90, i2.t75, i2.t46, i2.t44, i2.u3.t74, i2.u4.t88, i2.u4.t8...513
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 184/184 transitions.
Graph (complete) has 299 edges and 168 vertex of which 152 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 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 151 transition count 143
Reduce places removed 30 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 121 transition count 141
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 119 transition count 141
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 65 place count 119 transition count 128
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 91 place count 106 transition count 128
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 97 place count 100 transition count 122
Iterating global reduction 3 with 6 rules applied. Total rules applied 103 place count 100 transition count 122
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 107 place count 96 transition count 118
Iterating global reduction 3 with 4 rules applied. Total rules applied 111 place count 96 transition count 118
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 115 place count 92 transition count 114
Iterating global reduction 3 with 4 rules applied. Total rules applied 119 place count 92 transition count 114
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 123 place count 88 transition count 106
Iterating global reduction 3 with 4 rules applied. Total rules applied 127 place count 88 transition count 106
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 131 place count 84 transition count 102
Iterating global reduction 3 with 4 rules applied. Total rules applied 135 place count 84 transition count 102
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 163 place count 70 transition count 88
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 165 place count 68 transition count 86
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 8 rules applied. Total rules applied 173 place count 67 transition count 79
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 11 rules applied. Total rules applied 184 place count 60 transition count 75
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 187 place count 58 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 188 place count 57 transition count 74
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 188 place count 57 transition count 73
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 190 place count 56 transition count 73
Applied a total of 190 rules in 40 ms. Remains 56 /168 variables (removed 112) and now considering 73/184 (removed 111) transitions.
// Phase 1: matrix 73 rows 56 cols
[2025-06-03 00:35:43] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:35:43] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-03 00:35:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:35:43] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-06-03 00:35:43] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:35:43] [INFO ] Redundant transitions in 1 ms returned []
Running 72 sub problems to find dead transitions.
[2025-06-03 00:35:43] [INFO ] Invariant cache hit.
[2025-06-03 00:35:43] [INFO ] State equation strengthened by 32 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 73/129 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 32/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/129 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 89 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2392 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 56/56 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 73/129 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 32/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 72/161 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 161 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2581 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 56/56 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4980ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 4980ms
Starting structural reductions in SI_CTL mode, iteration 1 : 56/168 places, 73/184 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5174 ms. Remains : 56/168 places, 73/184 transitions.
[2025-06-03 00:35:48] [INFO ] Flatten gal took : 3 ms
[2025-06-03 00:35:48] [INFO ] Flatten gal took : 8 ms
[2025-06-03 00:35:48] [INFO ] Input system was already deterministic with 73 transitions.
[2025-06-03 00:35:48] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:35:48] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:35:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality18274940730648813430.gal : 0 ms
[2025-06-03 00:35:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality16847150300300549285.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18274940730648813430.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16847150300300549285.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.21597e+06,0.059342,4832,2,346,5,5795,6,0,284,3987,0


Converting to forward existential form...Done !
original formula: !(E(!(AG((((p176==0)||(p92==1)) * A(((p53==0)||(p83==1)) U (p160==1))))) U (p111==1)))
=> equivalent forward existential formula: [(FwdU(Init,!(!(E(TRUE U !((((p176==0)||(p92==1)) * !((E(!((p160==1)) U (!(((p53==0)||(p83==1))) * !((p160==1)))...205
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t7, t9, t13, t19, t21, t25, t27, t31, t33, t36, t72, Intersection with reachable...225
(forward)formula 0,0,0.94587,26316,1,0,374,129427,181,209,1758,166292,454
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 184/184 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 163 transition count 184
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 28 place count 140 transition count 161
Iterating global reduction 1 with 23 rules applied. Total rules applied 51 place count 140 transition count 161
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 57 place count 134 transition count 155
Iterating global reduction 1 with 6 rules applied. Total rules applied 63 place count 134 transition count 155
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 67 place count 130 transition count 151
Iterating global reduction 1 with 4 rules applied. Total rules applied 71 place count 130 transition count 151
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 75 place count 126 transition count 147
Iterating global reduction 1 with 4 rules applied. Total rules applied 79 place count 126 transition count 147
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 83 place count 122 transition count 139
Iterating global reduction 1 with 4 rules applied. Total rules applied 87 place count 122 transition count 139
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 90 place count 119 transition count 136
Iterating global reduction 1 with 3 rules applied. Total rules applied 93 place count 119 transition count 136
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 96 place count 116 transition count 133
Iterating global reduction 1 with 3 rules applied. Total rules applied 99 place count 116 transition count 133
Applied a total of 99 rules in 16 ms. Remains 116 /168 variables (removed 52) and now considering 133/184 (removed 51) transitions.
// Phase 1: matrix 133 rows 116 cols
[2025-06-03 00:35:49] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:35:49] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-03 00:35:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:35:49] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2025-06-03 00:35:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (OVERLAPS) 133/248 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:35:52] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:35:52] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:35:52] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:35:52] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:35:53] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:35:53] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 6/123 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 1/249 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/249 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 124 constraints, problems are : Problem set: 0 solved, 132 unsolved in 10905 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/248 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 131/254 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 1/249 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 10 (OVERLAPS) 0/249 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 256 constraints, problems are : Problem set: 0 solved, 132 unsolved in 11565 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22490ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 22490ms
Starting structural reductions in LTL mode, iteration 1 : 116/168 places, 133/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22737 ms. Remains : 116/168 places, 133/184 transitions.
[2025-06-03 00:36:12] [INFO ] Flatten gal took : 4 ms
[2025-06-03 00:36:12] [INFO ] Flatten gal took : 4 ms
[2025-06-03 00:36:12] [INFO ] Input system was already deterministic with 133 transitions.
[2025-06-03 00:36:12] [INFO ] Flatten gal took : 5 ms
[2025-06-03 00:36:12] [INFO ] Flatten gal took : 4 ms
[2025-06-03 00:36:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality9451001586172369677.gal : 1 ms
[2025-06-03 00:36:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality18120332332875260552.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9451001586172369677.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18120332332875260552.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,6.95238e+08,19.2344,364052,2,34861,5,1.05478e+06,6,0,594,2.33456e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-03 00:36:42] [INFO ] Flatten gal took : 5 ms
[2025-06-03 00:36:42] [INFO ] Applying decomposition
[2025-06-03 00:36:42] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph17592965202806920274.txt' '-o' '/tmp/graph17592965202806920274.bin' '-w' '/tmp/graph17592965202806920274.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17592965202806920274.bin' '-l' '-1' '-v' '-w' '/tmp/graph17592965202806920274.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:36:42] [INFO ] Decomposing Gal with order
[2025-06-03 00:36:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:36:42] [INFO ] Removed a total of 47 redundant transitions.
[2025-06-03 00:36:42] [INFO ] Flatten gal took : 24 ms
[2025-06-03 00:36:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2025-06-03 00:36:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality2491156438976732709.gal : 2 ms
[2025-06-03 00:36:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality11803744375802167095.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2491156438976732709.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11803744375802167095.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,6.95238e+08,7.18175,153832,2438,131,280897,6752,321,913232,52,53911,0


Converting to forward existential form...Done !
original formula: AF((A((u17.p65==0) U (EG(AF((i12.u29.p124==1))) + EG((i1.u3.p32!=1)))) * EX(EF((i10.u24.p104==1)))))
=> equivalent forward existential formula: [FwdG(Init,!((!((E(!((EG(!(EG(!((i12.u29.p124==1))))) + EG((i1.u3.p32!=1)))) U (!((u17.p65==0)) * !((EG(!(EG(!((...312
Reverse transition relation is NOT exact ! Due to transitions t91, t94, t126, u17.t54, u17.t132, u39.t4, u39.t5, i2.u5.t81, i2.u40.t2, i3.t78, i3.t67, i3.t...467
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 184/184 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 162 transition count 184
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 31 place count 137 transition count 159
Iterating global reduction 1 with 25 rules applied. Total rules applied 56 place count 137 transition count 159
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 63 place count 130 transition count 152
Iterating global reduction 1 with 7 rules applied. Total rules applied 70 place count 130 transition count 152
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 75 place count 125 transition count 147
Iterating global reduction 1 with 5 rules applied. Total rules applied 80 place count 125 transition count 147
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 84 place count 121 transition count 143
Iterating global reduction 1 with 4 rules applied. Total rules applied 88 place count 121 transition count 143
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 92 place count 117 transition count 135
Iterating global reduction 1 with 4 rules applied. Total rules applied 96 place count 117 transition count 135
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 100 place count 113 transition count 131
Iterating global reduction 1 with 4 rules applied. Total rules applied 104 place count 113 transition count 131
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 108 place count 109 transition count 127
Iterating global reduction 1 with 4 rules applied. Total rules applied 112 place count 109 transition count 127
Applied a total of 112 rules in 14 ms. Remains 109 /168 variables (removed 59) and now considering 127/184 (removed 57) transitions.
// Phase 1: matrix 127 rows 109 cols
[2025-06-03 00:37:12] [INFO ] Computed 2 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:37:12] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-06-03 00:37:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:37:12] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2025-06-03 00:37:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 127/236 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:37:15] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:37:15] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:37:15] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:37:16] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:37:16] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:37:16] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 6/117 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 0/236 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 117 constraints, problems are : Problem set: 0 solved, 126 unsolved in 8739 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 127/236 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 126/243 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 0/236 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 243 constraints, problems are : Problem set: 0 solved, 126 unsolved in 8589 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17349ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 17351ms
Starting structural reductions in LTL mode, iteration 1 : 109/168 places, 127/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17678 ms. Remains : 109/168 places, 127/184 transitions.
[2025-06-03 00:37:29] [INFO ] Flatten gal took : 7 ms
[2025-06-03 00:37:29] [INFO ] Flatten gal took : 6 ms
[2025-06-03 00:37:29] [INFO ] Input system was already deterministic with 127 transitions.
[2025-06-03 00:37:29] [INFO ] Flatten gal took : 6 ms
[2025-06-03 00:37:29] [INFO ] Flatten gal took : 6 ms
[2025-06-03 00:37:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality761912891823470020.gal : 1 ms
[2025-06-03 00:37:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality17433442629157269337.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality761912891823470020.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17433442629157269337.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.40633e+08,20.2151,326108,2,31483,5,1.07251e+06,6,0,564,1.87962e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-03 00:38:00] [INFO ] Flatten gal took : 5 ms
[2025-06-03 00:38:00] [INFO ] Applying decomposition
[2025-06-03 00:38:00] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph4769536232370404091.txt' '-o' '/tmp/graph4769536232370404091.bin' '-w' '/tmp/graph4769536232370404091.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4769536232370404091.bin' '-l' '-1' '-v' '-w' '/tmp/graph4769536232370404091.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:38:00] [INFO ] Decomposing Gal with order
[2025-06-03 00:38:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:38:00] [INFO ] Removed a total of 47 redundant transitions.
[2025-06-03 00:38:00] [INFO ] Flatten gal took : 8 ms
[2025-06-03 00:38:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 1 ms.
[2025-06-03 00:38:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality11839379328639099583.gal : 3 ms
[2025-06-03 00:38:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality15896033303538252706.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11839379328639099583.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15896033303538252706.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
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,5.40633e+08,16.2874,333216,3292,121,580991,6512,301,2.19931e+06,44,53529,0


Converting to forward existential form...Done !
original formula: AF(EX(AG(((i5.u10.p41==1)||(i5.u10.p42==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(E(TRUE U !(((i5.u10.p41==1)||(i5.u10.p42==0))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions u37.t4, u37.t5, i2.t76, i2.t50, i2.t38, i2.t26, i2.t14, i2.u5.t81, i2.u17.t51, i2.u22.t39, i2...470
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 184/184 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 162 transition count 184
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 31 place count 137 transition count 159
Iterating global reduction 1 with 25 rules applied. Total rules applied 56 place count 137 transition count 159
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 63 place count 130 transition count 152
Iterating global reduction 1 with 7 rules applied. Total rules applied 70 place count 130 transition count 152
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 75 place count 125 transition count 147
Iterating global reduction 1 with 5 rules applied. Total rules applied 80 place count 125 transition count 147
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 85 place count 120 transition count 142
Iterating global reduction 1 with 5 rules applied. Total rules applied 90 place count 120 transition count 142
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 95 place count 115 transition count 132
Iterating global reduction 1 with 5 rules applied. Total rules applied 100 place count 115 transition count 132
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 105 place count 110 transition count 127
Iterating global reduction 1 with 5 rules applied. Total rules applied 110 place count 110 transition count 127
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 115 place count 105 transition count 122
Iterating global reduction 1 with 5 rules applied. Total rules applied 120 place count 105 transition count 122
Applied a total of 120 rules in 14 ms. Remains 105 /168 variables (removed 63) and now considering 122/184 (removed 62) transitions.
// Phase 1: matrix 122 rows 105 cols
[2025-06-03 00:38:30] [INFO ] Computed 2 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:38:30] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-06-03 00:38:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:38:30] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2025-06-03 00:38:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 122/227 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:34] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:34] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:34] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:34] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:34] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:34] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 6/113 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 0/227 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 113 constraints, problems are : Problem set: 0 solved, 121 unsolved in 9895 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/227 variables, 105/113 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 121/234 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 234 constraints, problems are : Problem set: 0 solved, 121 unsolved in 9117 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19041ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 19042ms
Starting structural reductions in LTL mode, iteration 1 : 105/168 places, 122/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19433 ms. Remains : 105/168 places, 122/184 transitions.
[2025-06-03 00:38:49] [INFO ] Flatten gal took : 4 ms
[2025-06-03 00:38:49] [INFO ] Flatten gal took : 3 ms
[2025-06-03 00:38:49] [INFO ] Input system was already deterministic with 122 transitions.
[2025-06-03 00:38:49] [INFO ] Flatten gal took : 4 ms
[2025-06-03 00:38:49] [INFO ] Flatten gal took : 6 ms
[2025-06-03 00:38:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality16168584208075799512.gal : 1 ms
[2025-06-03 00:38:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality6006947155253034328.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16168584208075799512.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6006947155253034328.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.70015e+08,16.1209,288376,2,27997,5,939100,6,0,543,1.7306e+06,0


Converting to forward existential form...Done !
original formula: AG(EX((p154==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((p154==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t11, t14, t15, t17, t23, t26, t27, t29, t35, t38, t39, t41, t47, t50, t51, t53, t...304
(forward)formula 0,0,29.3708,420128,1,0,273,1.84549e+06,260,127,3195,2.979e+06,251
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 184/184 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 163 transition count 184
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 26 place count 142 transition count 163
Iterating global reduction 1 with 21 rules applied. Total rules applied 47 place count 142 transition count 163
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 54 place count 135 transition count 156
Iterating global reduction 1 with 7 rules applied. Total rules applied 61 place count 135 transition count 156
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 66 place count 130 transition count 151
Iterating global reduction 1 with 5 rules applied. Total rules applied 71 place count 130 transition count 151
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 75 place count 126 transition count 147
Iterating global reduction 1 with 4 rules applied. Total rules applied 79 place count 126 transition count 147
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 83 place count 122 transition count 139
Iterating global reduction 1 with 4 rules applied. Total rules applied 87 place count 122 transition count 139
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 90 place count 119 transition count 136
Iterating global reduction 1 with 3 rules applied. Total rules applied 93 place count 119 transition count 136
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 96 place count 116 transition count 133
Iterating global reduction 1 with 3 rules applied. Total rules applied 99 place count 116 transition count 133
Applied a total of 99 rules in 13 ms. Remains 116 /168 variables (removed 52) and now considering 133/184 (removed 51) transitions.
// Phase 1: matrix 133 rows 116 cols
[2025-06-03 00:39:19] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:39:19] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-06-03 00:39:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:39:19] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2025-06-03 00:39:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (OVERLAPS) 133/248 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:23] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:23] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:23] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:23] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:24] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:24] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 6/123 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 1/249 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/249 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 124 constraints, problems are : Problem set: 0 solved, 132 unsolved in 13812 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/248 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 131/254 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:36] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:36] [INFO ] Deduced a trap composed of 73 places in 84 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 1/249 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 11 (OVERLAPS) 0/249 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 258 constraints, problems are : Problem set: 0 solved, 132 unsolved in 18329 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32167ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 32168ms
Starting structural reductions in LTL mode, iteration 1 : 116/168 places, 133/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32413 ms. Remains : 116/168 places, 133/184 transitions.
[2025-06-03 00:39:51] [INFO ] Flatten gal took : 5 ms
[2025-06-03 00:39:51] [INFO ] Flatten gal took : 4 ms
[2025-06-03 00:39:51] [INFO ] Input system was already deterministic with 133 transitions.
[2025-06-03 00:39:51] [INFO ] Flatten gal took : 4 ms
[2025-06-03 00:39:51] [INFO ] Flatten gal took : 4 ms
[2025-06-03 00:39:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality11934870016885114246.gal : 1 ms
[2025-06-03 00:39:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality14329934529701009493.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11934870016885114246.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14329934529701009493.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,9.28723e+08,21.1992,395052,2,47917,5,1.15901e+06,6,0,595,2.51757e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-03 00:40:21] [INFO ] Flatten gal took : 4 ms
[2025-06-03 00:40:21] [INFO ] Applying decomposition
[2025-06-03 00:40:21] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph18002634033596094004.txt' '-o' '/tmp/graph18002634033596094004.bin' '-w' '/tmp/graph18002634033596094004.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18002634033596094004.bin' '-l' '-1' '-v' '-w' '/tmp/graph18002634033596094004.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:40:21] [INFO ] Decomposing Gal with order
[2025-06-03 00:40:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:40:21] [INFO ] Removed a total of 46 redundant transitions.
[2025-06-03 00:40:21] [INFO ] Flatten gal took : 10 ms
[2025-06-03 00:40:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 1 ms.
[2025-06-03 00:40:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality14402106804646964469.gal : 2 ms
[2025-06-03 00:40:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality16464152651273996667.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14402106804646964469.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16464152651273996667.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
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,9.28723e+08,14.0435,305548,4484,147,572409,6510,322,1.83376e+06,52,61677,0


Converting to forward existential form...Done !
original formula: EF((AG((((i6.u12.p43==0)&&(i5.u9.p22==0))&&((i3.u5.p121==0)||(i12.u36.p158==1)))) * AX(EG(((u40.p172==0)||(i4.u34.p155==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(E(TRUE U !((((i6.u12.p43==0)&&(i5.u9.p22==0))&&((i3.u5.p121==0)||(i12.u36.p158==1))))))) ...215
Reverse transition relation is NOT exact ! Due to transitions t92, t94, u40.t4, u40.t5, u40.t7, i2.u4.t87, i3.t84, i3.t32, i3.u5.t31, i3.u6.t83, i3.u41.t2,...488
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
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 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 184/184 transitions.
Graph (complete) has 299 edges and 168 vertex of which 151 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 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 150 transition count 139
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 117 transition count 139
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 67 place count 117 transition count 127
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 91 place count 105 transition count 127
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 99 place count 97 transition count 119
Iterating global reduction 2 with 8 rules applied. Total rules applied 107 place count 97 transition count 119
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 107 place count 97 transition count 118
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 109 place count 96 transition count 118
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 113 place count 92 transition count 114
Iterating global reduction 2 with 4 rules applied. Total rules applied 117 place count 92 transition count 114
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 121 place count 88 transition count 110
Iterating global reduction 2 with 4 rules applied. Total rules applied 125 place count 88 transition count 110
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 129 place count 84 transition count 102
Iterating global reduction 2 with 4 rules applied. Total rules applied 133 place count 84 transition count 102
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 137 place count 80 transition count 98
Iterating global reduction 2 with 4 rules applied. Total rules applied 141 place count 80 transition count 98
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 165 place count 68 transition count 86
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 167 place count 66 transition count 84
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 77 edges and 64 vertex of which 60 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 61 edges and 60 vertex of which 22 / 60 are part of one of the 11 SCC in 3 ms
Free SCC test removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 2 with 22 rules applied. Total rules applied 189 place count 49 transition count 61
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 218 place count 31 transition count 50
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 222 place count 27 transition count 42
Iterating global reduction 4 with 4 rules applied. Total rules applied 226 place count 27 transition count 42
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 228 place count 25 transition count 38
Iterating global reduction 4 with 2 rules applied. Total rules applied 230 place count 25 transition count 38
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 232 place count 23 transition count 34
Iterating global reduction 4 with 2 rules applied. Total rules applied 234 place count 23 transition count 34
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 236 place count 21 transition count 32
Iterating global reduction 4 with 2 rules applied. Total rules applied 238 place count 21 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 239 place count 21 transition count 31
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 1 rules applied. Total rules applied 240 place count 21 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 241 place count 20 transition count 30
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 245 place count 16 transition count 26
Applied a total of 245 rules in 62 ms. Remains 16 /168 variables (removed 152) and now considering 26/184 (removed 158) transitions.
[2025-06-03 00:40:51] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
// Phase 1: matrix 21 rows 16 cols
[2025-06-03 00:40:51] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:40:51] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-03 00:40:51] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
[2025-06-03 00:40:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:40:51] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:40:51] [INFO ] Redundant transitions in 0 ms returned []
Running 18 sub problems to find dead transitions.
[2025-06-03 00:40:51] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
[2025-06-03 00:40:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 20/32 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 4/36 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 0/36 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/37 variables, and 16 constraints, problems are : Problem set: 0 solved, 18 unsolved in 309 ms.
Refiners :[State Equation: 16/16 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 20/32 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 18/30 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 4/36 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/37 variables, and 34 constraints, problems are : Problem set: 0 solved, 18 unsolved in 329 ms.
Refiners :[State Equation: 16/16 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 651ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 651ms
Starting structural reductions in SI_CTL mode, iteration 1 : 16/168 places, 26/184 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 788 ms. Remains : 16/168 places, 26/184 transitions.
[2025-06-03 00:40:52] [INFO ] Flatten gal took : 1 ms
[2025-06-03 00:40:52] [INFO ] Flatten gal took : 1 ms
[2025-06-03 00:40:52] [INFO ] Input system was already deterministic with 26 transitions.
[2025-06-03 00:40:52] [INFO ] Flatten gal took : 1 ms
[2025-06-03 00:40:52] [INFO ] Flatten gal took : 1 ms
[2025-06-03 00:40:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality4546582710569303301.gal : 0 ms
[2025-06-03 00:40:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality884393624184656772.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4546582710569303301.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality884393624184656772.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1890,0.015005,3780,2,39,5,199,6,0,77,189,0


Converting to forward existential form...Done !
original formula: AG(EF(EG(!(E((p73==0) U ((p156==0)||(p13==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U EG(!(E((p73==0) U ((p156==0)||(p13==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t9, t11, t15, t16, t24, Intersection with reachable at each step enabled. (destroyed...191
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.034479,4292,1,0,78,2538,79,46,457,2849,91
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 184/184 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 162 transition count 184
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 30 place count 138 transition count 160
Iterating global reduction 1 with 24 rules applied. Total rules applied 54 place count 138 transition count 160
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 61 place count 131 transition count 153
Iterating global reduction 1 with 7 rules applied. Total rules applied 68 place count 131 transition count 153
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 73 place count 126 transition count 148
Iterating global reduction 1 with 5 rules applied. Total rules applied 78 place count 126 transition count 148
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 83 place count 121 transition count 143
Iterating global reduction 1 with 5 rules applied. Total rules applied 88 place count 121 transition count 143
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 93 place count 116 transition count 133
Iterating global reduction 1 with 5 rules applied. Total rules applied 98 place count 116 transition count 133
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 102 place count 112 transition count 129
Iterating global reduction 1 with 4 rules applied. Total rules applied 106 place count 112 transition count 129
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 110 place count 108 transition count 125
Iterating global reduction 1 with 4 rules applied. Total rules applied 114 place count 108 transition count 125
Applied a total of 114 rules in 13 ms. Remains 108 /168 variables (removed 60) and now considering 125/184 (removed 59) transitions.
// Phase 1: matrix 125 rows 108 cols
[2025-06-03 00:40:52] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:40:52] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-06-03 00:40:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:40:53] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2025-06-03 00:40:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 125/233 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:40:56] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:40:56] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:40:56] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:40:56] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:40:56] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:40:56] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 0/233 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 116 constraints, problems are : Problem set: 0 solved, 124 unsolved in 8953 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 125/233 variables, 108/116 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 124/240 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (OVERLAPS) 0/233 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 240 constraints, problems are : Problem set: 0 solved, 124 unsolved in 7720 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16692ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 16693ms
Starting structural reductions in LTL mode, iteration 1 : 108/168 places, 125/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17055 ms. Remains : 108/168 places, 125/184 transitions.
[2025-06-03 00:41:09] [INFO ] Flatten gal took : 6 ms
[2025-06-03 00:41:09] [INFO ] Flatten gal took : 4 ms
[2025-06-03 00:41:09] [INFO ] Input system was already deterministic with 125 transitions.
[2025-06-03 00:41:09] [INFO ] Flatten gal took : 5 ms
[2025-06-03 00:41:09] [INFO ] Flatten gal took : 4 ms
[2025-06-03 00:41:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality15876843173626257201.gal : 2 ms
[2025-06-03 00:41:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality4707462302970884465.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15876843173626257201.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4707462302970884465.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,5.33696e+08,12.5883,214416,2,29798,5,680028,6,0,557,1.34496e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-03 00:41:39] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:41:39] [INFO ] Applying decomposition
[2025-06-03 00:41:39] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9732080989977811418.txt' '-o' '/tmp/graph9732080989977811418.bin' '-w' '/tmp/graph9732080989977811418.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9732080989977811418.bin' '-l' '-1' '-v' '-w' '/tmp/graph9732080989977811418.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:41:39] [INFO ] Decomposing Gal with order
[2025-06-03 00:41:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:41:39] [INFO ] Removed a total of 45 redundant transitions.
[2025-06-03 00:41:39] [INFO ] Flatten gal took : 7 ms
[2025-06-03 00:41:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 2 ms.
[2025-06-03 00:41:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality4504578223079180798.gal : 2 ms
[2025-06-03 00:41:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality763046891999173261.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4504578223079180798.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality763046891999173261.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
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,5.33696e+08,3.74272,85724,1872,119,114977,3376,313,683012,46,20844,0


Converting to forward existential form...Done !
original formula: EF(AG((AF(EX(((i2.u9.p24==0)||(i6.u16.p56==1)))) + EF((i1.u6.p16==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(EG(!(EX(((i2.u9.p24==0)||(i6.u16.p56==1)))))) + E(TRUE U (i1.u6.p16==0))))))...166
Reverse transition relation is NOT exact ! Due to transitions t86, t88, u37.t4, u37.t5, i1.u7.t79, i2.u9.t123, i3.u4.t81, i4.t62, i4.t50, i4.t38, i4.t26, i...464
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,10.9567,202040,1,0,236156,3376,1882,1.68483e+06,292,21935,182415
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 184/184 transitions.
Graph (complete) has 299 edges and 168 vertex of which 153 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
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 153 transition count 146
Reduce places removed 28 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 30 rules applied. Total rules applied 59 place count 125 transition count 144
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 123 transition count 144
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 61 place count 123 transition count 133
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 83 place count 112 transition count 133
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 90 place count 105 transition count 126
Iterating global reduction 3 with 7 rules applied. Total rules applied 97 place count 105 transition count 126
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 97 place count 105 transition count 125
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 99 place count 104 transition count 125
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 103 place count 100 transition count 121
Iterating global reduction 3 with 4 rules applied. Total rules applied 107 place count 100 transition count 121
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 111 place count 96 transition count 117
Iterating global reduction 3 with 4 rules applied. Total rules applied 115 place count 96 transition count 117
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 119 place count 92 transition count 109
Iterating global reduction 3 with 4 rules applied. Total rules applied 123 place count 92 transition count 109
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 127 place count 88 transition count 105
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 88 transition count 105
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 155 place count 76 transition count 93
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 157 place count 76 transition count 93
Applied a total of 157 rules in 22 ms. Remains 76 /168 variables (removed 92) and now considering 93/184 (removed 91) transitions.
// Phase 1: matrix 93 rows 76 cols
[2025-06-03 00:41:50] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:41:50] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-03 00:41:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:41:51] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-03 00:41:51] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:41:51] [INFO ] Redundant transitions in 3 ms returned []
Running 92 sub problems to find dead transitions.
[2025-06-03 00:41:51] [INFO ] Invariant cache hit.
[2025-06-03 00:41:51] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 93/168 variables, 75/77 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 44/121 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 1/169 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 0/169 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 122 constraints, problems are : Problem set: 0 solved, 92 unsolved in 4170 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 93/168 variables, 75/77 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 44/121 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 91/212 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 1/169 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (OVERLAPS) 0/169 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 214 constraints, problems are : Problem set: 0 solved, 92 unsolved in 6725 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10903ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 10904ms
Starting structural reductions in SI_CTL mode, iteration 1 : 76/168 places, 93/184 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11165 ms. Remains : 76/168 places, 93/184 transitions.
[2025-06-03 00:42:02] [INFO ] Flatten gal took : 4 ms
[2025-06-03 00:42:02] [INFO ] Flatten gal took : 3 ms
[2025-06-03 00:42:02] [INFO ] Input system was already deterministic with 93 transitions.
[2025-06-03 00:42:02] [INFO ] Flatten gal took : 3 ms
[2025-06-03 00:42:02] [INFO ] Flatten gal took : 3 ms
[2025-06-03 00:42:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality9659147180687213829.gal : 1 ms
[2025-06-03 00:42:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality5016201107733129249.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9659147180687213829.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5016201107733129249.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.03661e+07,0.139914,6712,2,1219,5,16224,6,0,387,11221,0


Converting to forward existential form...Done !
original formula: AG(A(!((EG((((p37==0)||(p86==1))||(p43==1))) + AG(((p25==0)||(p130==1))))) U ((A((((p75==0)||(p168==1))||(p139==1)) U (p7!=0)) * (p47==1)...195
=> equivalent forward existential formula: (((([(FwdU((FwdU(FwdU(Init,TRUE),!(((!((E(!((p7!=0)) U (!((((p75==0)||(p168==1))||(p139==1))) * !((p7!=0)))) + E...1481
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t14, t21, t24, t28, t37, t38, t46, t72, t88, t91, Intersection with reachable a...223
(forward)formula 0,0,6.79761,169780,1,0,966,990708,229,501,2280,1.23491e+06,1129
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 184/184 transitions.
Graph (complete) has 299 edges and 168 vertex of which 151 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 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 150 transition count 140
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 118 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 117 transition count 139
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 67 place count 117 transition count 126
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 93 place count 104 transition count 126
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 100 place count 97 transition count 119
Iterating global reduction 3 with 7 rules applied. Total rules applied 107 place count 97 transition count 119
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 112 place count 92 transition count 114
Iterating global reduction 3 with 5 rules applied. Total rules applied 117 place count 92 transition count 114
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 122 place count 87 transition count 109
Iterating global reduction 3 with 5 rules applied. Total rules applied 127 place count 87 transition count 109
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 132 place count 82 transition count 99
Iterating global reduction 3 with 5 rules applied. Total rules applied 137 place count 82 transition count 99
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 142 place count 77 transition count 94
Iterating global reduction 3 with 5 rules applied. Total rules applied 147 place count 77 transition count 94
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 169 place count 66 transition count 83
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 170 place count 65 transition count 82
Applied a total of 170 rules in 21 ms. Remains 65 /168 variables (removed 103) and now considering 82/184 (removed 102) transitions.
// Phase 1: matrix 82 rows 65 cols
[2025-06-03 00:42:08] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:42:08] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-03 00:42:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:42:09] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-03 00:42:09] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:42:09] [INFO ] Redundant transitions in 2 ms returned []
Running 80 sub problems to find dead transitions.
[2025-06-03 00:42:09] [INFO ] Invariant cache hit.
[2025-06-03 00:42:09] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 82/146 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 39/105 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 80 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/147 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/147 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 106 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2901 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 82/146 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 39/105 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 80/185 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 1/147 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 0/147 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 186 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3805 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6713ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 6714ms
Starting structural reductions in SI_CTL mode, iteration 1 : 65/168 places, 82/184 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6917 ms. Remains : 65/168 places, 82/184 transitions.
[2025-06-03 00:42:15] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:42:15] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:42:15] [INFO ] Input system was already deterministic with 82 transitions.
[2025-06-03 00:42:15] [INFO ] Flatten gal took : 1 ms
[2025-06-03 00:42:15] [INFO ] Flatten gal took : 1 ms
[2025-06-03 00:42:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality210958043828869633.gal : 1 ms
[2025-06-03 00:42:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality18322118766816289608.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality210958043828869633.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18322118766816289608.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.74576e+06,0.122886,7568,2,960,5,24852,6,0,332,13325,0


Converting to forward existential form...Done !
original formula: !(A(!(AF(!(((p3==0)||(p169==1))))) U !(E((p80==0) U (p27==1)))))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,!(!(E((p80==0) U (p27==1))))) * !(!(!(EG(!(!(((p3==0)||(p169==1))))))))),(p80==0)) * (p27==1)...220
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t10, t14, t16, t20, t22, t26, t28, t33, t35, t40, t62, Intersection with reachab...227
Hit Full ! (commute/partial/dont) 80/0/2
(forward)formula 0,1,7.06813,156444,1,0,700,885009,201,414,1987,1.06093e+06,835
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2025-06-03 00:42:22] [INFO ] Flatten gal took : 5 ms
[2025-06-03 00:42:22] [INFO ] Flatten gal took : 5 ms
[2025-06-03 00:42:22] [INFO ] Applying decomposition
[2025-06-03 00:42:22] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15497541783891752510.txt' '-o' '/tmp/graph15497541783891752510.bin' '-w' '/tmp/graph15497541783891752510.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15497541783891752510.bin' '-l' '-1' '-v' '-w' '/tmp/graph15497541783891752510.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:42:22] [INFO ] Decomposing Gal with order
[2025-06-03 00:42:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:42:22] [INFO ] Removed a total of 49 redundant transitions.
[2025-06-03 00:42:23] [INFO ] Flatten gal took : 10 ms
[2025-06-03 00:42:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-03 00:42:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality12960486912086152801.gal : 2 ms
[2025-06-03 00:42:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality13163583123424191292.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12960486912086152801.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13163583123424191292.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.71131e+09,1.31437,28396,3184,57,51165,321,395,73803,61,1212,0


Converting to forward existential form...Done !
original formula: EF((!(A(EG(((i13.u36.p98==0)&&(i24.u50.p164==0))) U EX(E((i8.u22.p34==1) U ((i23.u57.p160==0)||(i2.u6.p15==1)))))) + AX((A((i2.u4.p10==1)...204
=> equivalent forward existential formula: (([((FwdU(FwdU(Init,TRUE),!(EX(E((i8.u22.p34==1) U ((i23.u57.p160==0)||(i2.u6.p15==1)))))) * !(EG(((i13.u36.p98=...535
Reverse transition relation is NOT exact ! Due to transitions t6, t171, u60.t8, u60.t9, u60.t11, i1.u3.t103, i1.u3.t118, i2.u5.t114, i3.u8.t115, i5.u14.t91...594
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
Using saturation style SCC detection
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
(forward)formula 0,1,16.4694,386836,1,0,761753,602,2484,1.08797e+06,296,2168,1505513
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX((((i19.u46.p132==0)&&(i18.u44.p124==1)) * (EG((i6.u15.p37==0)) * EG((i21.u53.p144==0)))))
=> equivalent forward existential formula: ([(EY(Init) * !(((i19.u46.p132==0)&&(i18.u44.p124==1))))] = FALSE * ([(EY(Init) * !(EG((i6.u15.p37==0))))] = FAL...209
(forward)formula 1,0,30.7111,714284,1,0,1.39278e+06,616,2606,2.01265e+06,297,2335,2575526
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG((EF(AG(AF((i21.u52.p145==0)))) + AG((!(A((i6.u16.p40==0) U (i16.u39.p107==0))) * AX(AG(((i5.u14.p47==0)||(i14.u35.p90==1))))))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U !(E(TRUE U !(!(EG(!((i21.u52.p145==0)))))))) + !(E(TRUE U !((!(!((E(!((i16.u39.p107==0)) U ...309
(forward)formula 2,1,72.319,1554300,1,0,3.06284e+06,628,2681,4.41262e+06,300,3151,4525751
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF((A((i9.u24.p65==0) U (EG(AF((i18.u44.p124==1))) + EG((i12.i0.u12.p32!=1)))) * EX(EF((i15.u38.p104==1)))))
=> equivalent forward existential formula: [FwdG(Init,!((!((E(!((EG(!(EG(!((i18.u44.p124==1))))) + EG((i12.i0.u12.p32!=1)))) U (!((i9.u24.p65==0)) * !((EG(...330
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 3,1,118.502,2198632,1,0,4.40331e+06,667,813,6.16472e+06,127,3202,149616
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(EX(AG(((i6.u17.p41==1)||(i6.u17.p42==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(E(TRUE U !(((i6.u17.p41==1)||(i6.u17.p42==0))))))))] = FALSE
(forward)formula 4,0,154.491,2198632,1,0,4.40331e+06,667,1434,6.16472e+06,155,3202,2332381
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((AG((((i5.u18.p43==0)&&(i4.u9.p22==0))&&((i17.u42.p121==0)||(i23.u57.p158==1)))) * AX(EG(((u60.p172==0)||(i22.u51.p155==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(E(TRUE U !((((i5.u18.p43==0)&&(i4.u9.p22==0))&&((i17.u42.p121==0)||(i23.u57.p158==1))))))...218
(forward)formula 5,1,186.188,2198632,1,0,4.40331e+06,667,1498,6.16472e+06,158,3202,3962583
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 1023357 ms.

BK_STOP 1748911529794

--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-06b"
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-5832"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-06b, 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 r058-smll-174854064500617"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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