fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r254-tall-174931339600305
Last Updated
June 24, 2025

About the Execution of ITS-Tools for ErlangenMainframeV0-PT-0909

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 420335.00 0.00 0.00 TTFFFTFTTTTFFTFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339600305.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 ErlangenMainframeV0-PT-0909, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339600305
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 62M
-rw-r--r-- 1 mcc users 6.9K Jun 6 09:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Jun 6 09:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 6 09:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 6 09:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 11:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 11:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 11:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 11:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 9.3K Jun 6 09:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Jun 6 09:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Jun 6 09:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Jun 6 09:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 11:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 11:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 61M Jun 5 20:08 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 ErlangenMainframeV0-PT-0909-CTLCardinality-2025-00
FORMULA_NAME ErlangenMainframeV0-PT-0909-CTLCardinality-2025-01
FORMULA_NAME ErlangenMainframeV0-PT-0909-CTLCardinality-2025-02
FORMULA_NAME ErlangenMainframeV0-PT-0909-CTLCardinality-2025-03
FORMULA_NAME ErlangenMainframeV0-PT-0909-CTLCardinality-2025-04
FORMULA_NAME ErlangenMainframeV0-PT-0909-CTLCardinality-2025-05
FORMULA_NAME ErlangenMainframeV0-PT-0909-CTLCardinality-2025-06
FORMULA_NAME ErlangenMainframeV0-PT-0909-CTLCardinality-2025-07
FORMULA_NAME ErlangenMainframeV0-PT-0909-CTLCardinality-2025-08
FORMULA_NAME ErlangenMainframeV0-PT-0909-CTLCardinality-2025-09
FORMULA_NAME ErlangenMainframeV0-PT-0909-CTLCardinality-2025-10
FORMULA_NAME ErlangenMainframeV0-PT-0909-CTLCardinality-2025-11
FORMULA_NAME ErlangenMainframeV0-PT-0909-CTLCardinality-2025-12
FORMULA_NAME ErlangenMainframeV0-PT-0909-CTLCardinality-2025-13
FORMULA_NAME ErlangenMainframeV0-PT-0909-CTLCardinality-2025-14
FORMULA_NAME ErlangenMainframeV0-PT-0909-CTLCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749357717040

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV0-PT-0909
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-08 04:41:58] [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-08 04:41:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 04:42:00] [INFO ] Load time of PNML (sax parser for PT used): 2244 ms
[2025-06-08 04:42:00] [INFO ] Transformed 283 places.
[2025-06-08 04:42:01] [INFO ] Transformed 59341 transitions.
[2025-06-08 04:42:01] [INFO ] Found NUPN structural information;
[2025-06-08 04:42:01] [INFO ] Parsed PT model containing 283 places and 59341 transitions and 1260524 arcs in 2783 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Initial state reduction rules removed 1 formulas.
FORMULA ErlangenMainframeV0-PT-0909-CTLCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 94 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 59341/59341 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 238 transition count 59296
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 238 transition count 59296
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 105 place count 223 transition count 59281
Iterating global reduction 0 with 15 rules applied. Total rules applied 120 place count 223 transition count 59281
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 124 place count 219 transition count 42514
Ensure Unique test removed 1 places
Iterating global reduction 0 with 5 rules applied. Total rules applied 129 place count 218 transition count 42514
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 132 place count 215 transition count 11896
Iterating global reduction 0 with 3 rules applied. Total rules applied 135 place count 215 transition count 11896
Applied a total of 135 rules in 4269 ms. Remains 215 /283 variables (removed 68) and now considering 11896/59341 (removed 47445) transitions.
// Phase 1: matrix 11896 rows 215 cols
[2025-06-08 04:42:06] [INFO ] Computed 23 invariants in 241 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:42:12] [INFO ] Implicit Places using invariants in 5985 ms returned [162]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 6047 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 214/283 places, 11896/59341 transitions.
Applied a total of 0 rules in 61 ms. Remains 214 /214 variables (removed 0) and now considering 11896/11896 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10397 ms. Remains : 214/283 places, 11896/59341 transitions.
Support contains 94 out of 214 places after structural reductions.
[2025-06-08 04:42:14] [INFO ] Flatten gal took : 1732 ms
[2025-06-08 04:42:15] [INFO ] Flatten gal took : 1380 ms
[2025-06-08 04:42:18] [INFO ] Input system was already deterministic with 11896 transitions.
Support contains 87 out of 214 places (down from 94) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 3194 ms. (12 steps per ms) remains 0/55 properties
[2025-06-08 04:42:20] [INFO ] Flatten gal took : 1245 ms
[2025-06-08 04:42:21] [INFO ] Flatten gal took : 1164 ms
[2025-06-08 04:42:23] [INFO ] Input system was already deterministic with 11896 transitions.
Computed a total of 32 stabilizing places and 32 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 214/214 places, 11896/11896 transitions.
Graph (trivial) has 164 edges and 214 vertex of which 4 / 214 are part of one of the 2 SCC in 8 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 211 transition count 11856
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 174 transition count 11856
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 75 place count 174 transition count 11844
Deduced a syphon composed of 12 places in 7 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 99 place count 162 transition count 11844
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 131 place count 130 transition count 6632
Iterating global reduction 2 with 32 rules applied. Total rules applied 163 place count 130 transition count 6632
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 163 place count 130 transition count 6626
Deduced a syphon composed of 6 places in 6 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 175 place count 124 transition count 6626
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 184 place count 115 transition count 1474
Ensure Unique test removed 2 places
Iterating global reduction 2 with 11 rules applied. Total rules applied 195 place count 113 transition count 1474
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 202 place count 106 transition count 240
Iterating global reduction 2 with 7 rules applied. Total rules applied 209 place count 106 transition count 240
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 210 place count 105 transition count 238
Iterating global reduction 2 with 1 rules applied. Total rules applied 211 place count 105 transition count 238
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 275 place count 73 transition count 206
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 284 place count 64 transition count 119
Ensure Unique test removed 4 places
Iterating global reduction 2 with 13 rules applied. Total rules applied 297 place count 60 transition count 119
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 300 place count 60 transition count 116
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 304 place count 56 transition count 86
Iterating global reduction 3 with 4 rules applied. Total rules applied 308 place count 56 transition count 86
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 311 place count 53 transition count 80
Iterating global reduction 3 with 3 rules applied. Total rules applied 314 place count 53 transition count 80
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 323 place count 53 transition count 71
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 341 place count 44 transition count 62
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 342 place count 44 transition count 62
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 343 place count 43 transition count 61
Applied a total of 343 rules in 887 ms. Remains 43 /214 variables (removed 171) and now considering 61/11896 (removed 11835) transitions.
[2025-06-08 04:42:25] [INFO ] Flow matrix only has 46 transitions (discarded 15 similar events)
// Phase 1: matrix 46 rows 43 cols
[2025-06-08 04:42:25] [INFO ] Computed 16 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:42:25] [INFO ] Implicit Places using invariants in 45 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 42/214 places, 61/11896 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 41 transition count 60
Applied a total of 2 rules in 3 ms. Remains 41 /42 variables (removed 1) and now considering 60/61 (removed 1) transitions.
[2025-06-08 04:42:25] [INFO ] Flow matrix only has 45 transitions (discarded 15 similar events)
// Phase 1: matrix 45 rows 41 cols
[2025-06-08 04:42:25] [INFO ] Computed 15 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:42:25] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-08 04:42:25] [INFO ] Flow matrix only has 45 transitions (discarded 15 similar events)
[2025-06-08 04:42:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:42:25] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-08 04:42:25] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 41/214 places, 60/11896 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1030 ms. Remains : 41/214 places, 60/11896 transitions.
[2025-06-08 04:42:25] [INFO ] Flatten gal took : 3 ms
[2025-06-08 04:42:25] [INFO ] Flatten gal took : 2 ms
[2025-06-08 04:42:25] [INFO ] Input system was already deterministic with 60 transitions.
[2025-06-08 04:42:25] [INFO ] Flatten gal took : 2 ms
[2025-06-08 04:42:25] [INFO ] Flatten gal took : 3 ms
[2025-06-08 04:42:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality17478340454671469330.gal : 1 ms
[2025-06-08 04:42:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality17374548195660594626.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/CTLCardinality17478340454671469330.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17374548195660594626.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.32743e+06,0.033913,4892,2,1496,5,5311,6,0,225,4163,0


Converting to forward existential form...Done !
original formula: EF(EG((((p205==0)&&(p139==1))||((p179==0)&&(p217==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(((p205==0)&&(p139==1))||((p179==0)&&(p217==1))))] != FALSE
Hit Full ! (commute/partial/dont) 52/0/8
(forward)formula 0,1,0.096324,7836,1,0,6,17616,19,0,1329,7008,8
FORMULA ErlangenMainframeV0-PT-0909-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 11896/11896 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 175 transition count 6677
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 175 transition count 6677
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 98 place count 155 transition count 1670
Iterating global reduction 0 with 20 rules applied. Total rules applied 118 place count 155 transition count 1670
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 129 place count 144 transition count 567
Ensure Unique test removed 5 places
Iterating global reduction 0 with 16 rules applied. Total rules applied 145 place count 139 transition count 567
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 152 place count 132 transition count 189
Iterating global reduction 0 with 7 rules applied. Total rules applied 159 place count 132 transition count 189
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 163 place count 128 transition count 181
Iterating global reduction 0 with 4 rules applied. Total rules applied 167 place count 128 transition count 181
Applied a total of 167 rules in 165 ms. Remains 128 /214 variables (removed 86) and now considering 181/11896 (removed 11715) transitions.
// Phase 1: matrix 181 rows 128 cols
[2025-06-08 04:42:25] [INFO ] Computed 17 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:42:25] [INFO ] Implicit Places using invariants in 75 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 127/214 places, 181/11896 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 181/181 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 245 ms. Remains : 127/214 places, 181/11896 transitions.
[2025-06-08 04:42:25] [INFO ] Flatten gal took : 7 ms
[2025-06-08 04:42:25] [INFO ] Flatten gal took : 5 ms
[2025-06-08 04:42:25] [INFO ] Input system was already deterministic with 181 transitions.
[2025-06-08 04:42:25] [INFO ] Flatten gal took : 5 ms
[2025-06-08 04:42:25] [INFO ] Flatten gal took : 5 ms
[2025-06-08 04:42:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality9919932399508795830.gal : 3 ms
[2025-06-08 04:42:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality18279820103860082632.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/CTLCardinality9919932399508795830.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18279820103860082632.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,8.09807e+11,4.63348,134156,2,40622,5,492767,6,0,691,565738,0


Converting to forward existential form...Done !
original formula: ((EF(((EX(TRUE) * ((p138==1) + !(A(((p6==0)||(p122==1)) U ((p191==0)||(p225==1)))))) * AX(AG(AF(((p255==0)||(p116==1))))))) * EF(((p110==...188
=> equivalent forward existential formula: (([(Init * !(E(TRUE U ((EX(TRUE) * ((p138==1) + !(!((E(!(((p191==0)||(p225==1))) U (!(((p6==0)||(p122==1))) * !(...386
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t8, t10, t14, t16, t22, t25, t31, t33, t35, t37, t43, t46, t51, t54, t56, t59, t60, t...417
Detected timeout of ITS tools.
[2025-06-08 04:42:55] [INFO ] Flatten gal took : 11 ms
[2025-06-08 04:42:55] [INFO ] Applying decomposition
[2025-06-08 04:42:55] [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/graph9629483808512454495.txt' '-o' '/tmp/graph9629483808512454495.bin' '-w' '/tmp/graph9629483808512454495.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9629483808512454495.bin' '-l' '-1' '-v' '-w' '/tmp/graph9629483808512454495.weights' '-q' '0' '-e' '0.001'
[2025-06-08 04:42:55] [INFO ] Decomposing Gal with order
[2025-06-08 04:42:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 04:42:55] [INFO ] Removed a total of 287 redundant transitions.
[2025-06-08 04:42:55] [INFO ] Flatten gal took : 44 ms
[2025-06-08 04:42:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 9 ms.
[2025-06-08 04:42:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality17528135603405795631.gal : 4 ms
[2025-06-08 04:42:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality14891588965058246161.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/CTLCardinality17528135603405795631.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14891588965058246161.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,8.09807e+11,0.055256,6208,378,42,4411,462,387,6534,69,1055,0


Converting to forward existential form...Done !
original formula: ((EF(((EX(TRUE) * ((i5.u13.p138==1) + !(A(((i8.u2.p6==0)||(i4.u12.p122==1)) U ((i7.u20.p191==0)||(i9.i0.u25.p225==1)))))) * AX(AG(AF(((i9...265
=> equivalent forward existential formula: (([(Init * !(E(TRUE U ((EX(TRUE) * ((i5.u13.p138==1) + !(!((E(!(((i7.u20.p191==0)||(i9.i0.u25.p225==1))) U (!(((...497
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 a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
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
Reverse transition relation is NOT exact ! Due to transitions t16, t150, t151, u17.t59, u17.t60, u17.t131, u7.t93, u7.t94, u7.t127, u16.t64, u16.t65, u16.t...665
(forward)formula 0,0,1.86898,65728,1,0,100547,846,2776,272230,356,1704,157191
FORMULA ErlangenMainframeV0-PT-0909-CTLCardinality-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 11896/11896 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 175 transition count 6677
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 175 transition count 6677
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 99 place count 154 transition count 2221
Ensure Unique test removed 1 places
Iterating global reduction 0 with 22 rules applied. Total rules applied 121 place count 153 transition count 2221
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 134 place count 140 transition count 466
Ensure Unique test removed 5 places
Iterating global reduction 0 with 18 rules applied. Total rules applied 152 place count 135 transition count 466
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 160 place count 127 transition count 182
Iterating global reduction 0 with 8 rules applied. Total rules applied 168 place count 127 transition count 182
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 170 place count 125 transition count 178
Iterating global reduction 0 with 2 rules applied. Total rules applied 172 place count 125 transition count 178
Applied a total of 172 rules in 203 ms. Remains 125 /214 variables (removed 89) and now considering 178/11896 (removed 11718) transitions.
// Phase 1: matrix 178 rows 125 cols
[2025-06-08 04:42:58] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:42:58] [INFO ] Implicit Places using invariants in 63 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/214 places, 178/11896 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 269 ms. Remains : 124/214 places, 178/11896 transitions.
[2025-06-08 04:42:58] [INFO ] Flatten gal took : 5 ms
[2025-06-08 04:42:58] [INFO ] Flatten gal took : 6 ms
[2025-06-08 04:42:58] [INFO ] Input system was already deterministic with 178 transitions.
[2025-06-08 04:42:58] [INFO ] Flatten gal took : 5 ms
[2025-06-08 04:42:58] [INFO ] Flatten gal took : 5 ms
[2025-06-08 04:42:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality5855911536326745793.gal : 2 ms
[2025-06-08 04:42:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality5364688703922399565.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/CTLCardinality5855911536326745793.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5364688703922399565.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,9.97165e+11,9.33267,195708,2,70830,5,698918,6,0,676,863911,0


Converting to forward existential form...Done !
original formula: AG((EG((EX(EX((p169==0))) + AG(((p190==1)||(p92==1))))) * EF(AG((AF((p214==1)) * (p59==0))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EG((EX(EX((p169==0))) + !(E(TRUE U !(((p190==1)||(p92==1)))))))))] = FALSE * [(FwdU(Init,...235
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t12, t15, t40, t41, t44, t49, t53, t55, t58, t59, t61, t65, t66, t70, t71, t75, t76,...396
Detected timeout of ITS tools.
[2025-06-08 04:43:28] [INFO ] Flatten gal took : 11 ms
[2025-06-08 04:43:28] [INFO ] Applying decomposition
[2025-06-08 04:43:28] [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/graph6626423067135762949.txt' '-o' '/tmp/graph6626423067135762949.bin' '-w' '/tmp/graph6626423067135762949.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6626423067135762949.bin' '-l' '-1' '-v' '-w' '/tmp/graph6626423067135762949.weights' '-q' '0' '-e' '0.001'
[2025-06-08 04:43:28] [INFO ] Decomposing Gal with order
[2025-06-08 04:43:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 04:43:28] [INFO ] Removed a total of 264 redundant transitions.
[2025-06-08 04:43:28] [INFO ] Flatten gal took : 13 ms
[2025-06-08 04:43:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 5 ms.
[2025-06-08 04:43:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality13291923138352760874.gal : 2 ms
[2025-06-08 04:43:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality13214820018708492873.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/CTLCardinality13291923138352760874.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13214820018708492873.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.97165e+11,0.098975,8396,768,66,10382,629,423,10716,73,1727,0


Converting to forward existential form...Done !
original formula: AG((EG((EX(EX((i8.u17.p169==0))) + AG(((i9.u21.p190==1)||(i7.u12.p92==1))))) * EF(AG((AF((i9.u23.p214==1)) * (i5.u8.p59==0))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EG((EX(EX((i8.u17.p169==0))) + !(E(TRUE U !(((i9.u21.p190==1)||(i7.u12.p92==1)))))))))] =...269
Reverse transition relation is NOT exact ! Due to transitions t15, t96, t106, t110, t149, u14.t70, u14.t71, u14.t128, u6.t97, u6.t98, u6.t123, u22.t44, i1....612
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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local 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
(forward)formula 0,0,0.348009,17612,1,0,30411,891,2977,39883,405,2707,89892
FORMULA ErlangenMainframeV0-PT-0909-CTLCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 11896/11896 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 174 transition count 6999
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 174 transition count 6999
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 101 place count 153 transition count 2410
Iterating global reduction 0 with 21 rules applied. Total rules applied 122 place count 153 transition count 2410
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 135 place count 140 transition count 753
Ensure Unique test removed 5 places
Iterating global reduction 0 with 18 rules applied. Total rules applied 153 place count 135 transition count 753
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 162 place count 126 transition count 181
Iterating global reduction 0 with 9 rules applied. Total rules applied 171 place count 126 transition count 181
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 174 place count 123 transition count 175
Iterating global reduction 0 with 3 rules applied. Total rules applied 177 place count 123 transition count 175
Applied a total of 177 rules in 199 ms. Remains 123 /214 variables (removed 91) and now considering 175/11896 (removed 11721) transitions.
// Phase 1: matrix 175 rows 123 cols
[2025-06-08 04:43:28] [INFO ] Computed 17 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:43:28] [INFO ] Implicit Places using invariants in 71 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 73 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/214 places, 175/11896 transitions.
Applied a total of 0 rules in 1 ms. Remains 122 /122 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 274 ms. Remains : 122/214 places, 175/11896 transitions.
[2025-06-08 04:43:28] [INFO ] Flatten gal took : 5 ms
[2025-06-08 04:43:28] [INFO ] Flatten gal took : 5 ms
[2025-06-08 04:43:28] [INFO ] Input system was already deterministic with 175 transitions.
[2025-06-08 04:43:28] [INFO ] Flatten gal took : 4 ms
[2025-06-08 04:43:28] [INFO ] Flatten gal took : 5 ms
[2025-06-08 04:43:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality2034075467890944847.gal : 1 ms
[2025-06-08 04:43:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality10512907473368718463.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/CTLCardinality2034075467890944847.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10512907473368718463.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.13797e+11,3.80024,118760,2,54287,5,440571,6,0,665,461354,0


Converting to forward existential form...Done !
original formula: (AX(AX(A((p128==0) U (p238==1)))) + !(E(((p260==0)||(p91==1)) U (EG(!((((p174==0)||(p188==1))&&(p237==0)))) + EF((p236!=0))))))
=> equivalent forward existential formula: ([FwdG(FwdU((Init * !(!(EX(!(!(EX(!(!((E(!((p238==1)) U (!((p128==0)) * !((p238==1)))) + EG(!((p238==1))))))))))...400
Reverse transition relation is NOT exact ! Due to transitions t0, t8, t10, t12, t15, t31, t41, t44, t49, t52, t54, t57, t58, t59, t63, t64, t68, t73, t74, ...389
Detected timeout of ITS tools.
[2025-06-08 04:43:59] [INFO ] Flatten gal took : 13 ms
[2025-06-08 04:43:59] [INFO ] Applying decomposition
[2025-06-08 04:43:59] [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/graph14172766635604986869.txt' '-o' '/tmp/graph14172766635604986869.bin' '-w' '/tmp/graph14172766635604986869.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14172766635604986869.bin' '-l' '-1' '-v' '-w' '/tmp/graph14172766635604986869.weights' '-q' '0' '-e' '0.001'
[2025-06-08 04:43:59] [INFO ] Decomposing Gal with order
[2025-06-08 04:43:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 04:43:59] [INFO ] Removed a total of 265 redundant transitions.
[2025-06-08 04:43:59] [INFO ] Flatten gal took : 10 ms
[2025-06-08 04:43:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2025-06-08 04:43:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality2230409743012808956.gal : 2 ms
[2025-06-08 04:43:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality13907202683443216874.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/CTLCardinality2230409743012808956.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13907202683443216874.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,5.13797e+11,0.128821,10472,573,52,15982,851,396,17077,69,2025,0


Converting to forward existential form...Done !
original formula: (AX(AX(A((i5.u14.p128==0) U (i8.u28.p238==1)))) + !(E(((i8.u34.p260==0)||(i1.u17.p91==1)) U (EG(!((((u18.p174==0)||(i7.u21.p188==1))&&(i8...198
=> equivalent forward existential formula: ([FwdG(FwdU((Init * !(!(EX(!(!(EX(!(!((E(!((i8.u28.p238==1)) U (!((i5.u14.p128==0)) * !((i8.u28.p238==1)))) + EG...509
Reverse transition relation is NOT exact ! Due to transitions t15, t92, t144, t145, t146, t147, u6.t97, u6.t98, u6.t120, u18.t57, u18.t58, u18.t59, u18.t12...588
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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,0,2.73097,131912,1,0,230894,1242,3174,876711,404,3704,264997
FORMULA ErlangenMainframeV0-PT-0909-CTLCardinality-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 11896/11896 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 171 transition count 6673
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 171 transition count 6673
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 110 place count 147 transition count 1567
Ensure Unique test removed 1 places
Iterating global reduction 0 with 25 rules applied. Total rules applied 135 place count 146 transition count 1567
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 149 place count 132 transition count 363
Ensure Unique test removed 6 places
Iterating global reduction 0 with 20 rules applied. Total rules applied 169 place count 126 transition count 363
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 178 place count 117 transition count 169
Iterating global reduction 0 with 9 rules applied. Total rules applied 187 place count 117 transition count 169
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 191 place count 113 transition count 161
Iterating global reduction 0 with 4 rules applied. Total rules applied 195 place count 113 transition count 161
Applied a total of 195 rules in 203 ms. Remains 113 /214 variables (removed 101) and now considering 161/11896 (removed 11735) transitions.
// Phase 1: matrix 161 rows 113 cols
[2025-06-08 04:44:02] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:44:02] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-08 04:44:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:44:02] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2025-06-08 04:44:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:03] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:03] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 161/274 variables, 113/130 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/274 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 130 constraints, problems are : Problem set: 0 solved, 160 unsolved in 6187 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:09] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (OVERLAPS) 161/274 variables, 113/131 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 160/291 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:10] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:10] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:10] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:10] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:10] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:10] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:10] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:10] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:10] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:10] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:10] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 11/302 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:12] [INFO ] Deduced a trap along path composed of 11 places in 46 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:16] [INFO ] Deduced a trap along path composed of 6 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:19] [INFO ] Deduced a trap along path composed of 5 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 12 (OVERLAPS) 0/274 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 305 constraints, problems are : Problem set: 0 solved, 160 unsolved in 21444 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 27722ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 27739ms
Starting structural reductions in LTL mode, iteration 1 : 113/214 places, 161/11896 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28093 ms. Remains : 113/214 places, 161/11896 transitions.
[2025-06-08 04:44:29] [INFO ] Flatten gal took : 4 ms
[2025-06-08 04:44:29] [INFO ] Flatten gal took : 5 ms
[2025-06-08 04:44:29] [INFO ] Input system was already deterministic with 161 transitions.
[2025-06-08 04:44:29] [INFO ] Flatten gal took : 4 ms
[2025-06-08 04:44:29] [INFO ] Flatten gal took : 3 ms
[2025-06-08 04:44:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality14305258367060837551.gal : 1 ms
[2025-06-08 04:44:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality3068463802351147002.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/CTLCardinality14305258367060837551.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3068463802351147002.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,2.20805e+11,0.853781,37312,2,26800,5,158714,6,0,615,112765,0


Converting to forward existential form...Done !
original formula: AG(EX((p162==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((p162==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t11, t14, t39, t47, t55, t60, t65, t70, t75, t80, t85, t90, t94, t106, t107, t108, t1...295
(forward)formula 0,1,6.92457,204980,1,0,260,922178,338,145,4306,658648,329
FORMULA ErlangenMainframeV0-PT-0909-CTLCardinality-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 11896/11896 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 171 transition count 6673
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 171 transition count 6673
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 109 place count 148 transition count 1568
Ensure Unique test removed 1 places
Iterating global reduction 0 with 24 rules applied. Total rules applied 133 place count 147 transition count 1568
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 146 place count 134 transition count 365
Ensure Unique test removed 6 places
Iterating global reduction 0 with 19 rules applied. Total rules applied 165 place count 128 transition count 365
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 174 place count 119 transition count 171
Iterating global reduction 0 with 9 rules applied. Total rules applied 183 place count 119 transition count 171
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 187 place count 115 transition count 163
Iterating global reduction 0 with 4 rules applied. Total rules applied 191 place count 115 transition count 163
Applied a total of 191 rules in 207 ms. Remains 115 /214 variables (removed 99) and now considering 163/11896 (removed 11733) transitions.
// Phase 1: matrix 163 rows 115 cols
[2025-06-08 04:44:37] [INFO ] Computed 15 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:44:37] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-08 04:44:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:44:37] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2025-06-08 04:44:37] [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, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 162 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:38] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:38] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 163/278 variables, 115/132 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 0/278 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/278 variables, and 132 constraints, problems are : Problem set: 0 solved, 162 unsolved in 5868 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 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, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 162 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:43] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (OVERLAPS) 163/278 variables, 115/133 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 162/295 constraints. Problems are: Problem set: 0 solved, 162 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:45] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:45] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:45] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:45] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:45] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:45] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:45] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:45] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:45] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:45] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:45] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:45] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:45] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:45] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:45] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 15/310 constraints. Problems are: Problem set: 0 solved, 162 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:48] [INFO ] Deduced a trap along path composed of 6 places in 48 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:48] [INFO ] Deduced a trap along path composed of 11 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:48] [INFO ] Deduced a trap along path composed of 6 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 3/313 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 162 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:44:56] [INFO ] Deduced a trap along path composed of 6 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/278 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/278 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 12 (OVERLAPS) 0/278 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 278/278 variables, and 314 constraints, problems are : Problem set: 0 solved, 162 unsolved in 25055 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 30958ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 30960ms
Starting structural reductions in LTL mode, iteration 1 : 115/214 places, 163/11896 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31331 ms. Remains : 115/214 places, 163/11896 transitions.
[2025-06-08 04:45:08] [INFO ] Flatten gal took : 6 ms
[2025-06-08 04:45:08] [INFO ] Flatten gal took : 5 ms
[2025-06-08 04:45:08] [INFO ] Input system was already deterministic with 163 transitions.
[2025-06-08 04:45:08] [INFO ] Flatten gal took : 3 ms
[2025-06-08 04:45:08] [INFO ] Flatten gal took : 3 ms
[2025-06-08 04:45:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality4572604582409949074.gal : 1 ms
[2025-06-08 04:45:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality13353539904520784486.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/CTLCardinality4572604582409949074.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13353539904520784486.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,2.60592e+11,0.867256,37188,2,26823,5,158866,6,0,625,112934,0


Converting to forward existential form...Done !
original formula: AG(AX((p274==0)))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !((p274==0)))] = FALSE
(forward)formula 0,0,1.34018,38724,1,0,8,173654,9,2,1164,127554,2
FORMULA ErlangenMainframeV0-PT-0909-CTLCardinality-2025-06 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 : 214/214 places, 11896/11896 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 178 transition count 7327
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 178 transition count 7327
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 92 place count 158 transition count 3063
Iterating global reduction 0 with 20 rules applied. Total rules applied 112 place count 158 transition count 3063
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 121 place count 149 transition count 770
Ensure Unique test removed 4 places
Iterating global reduction 0 with 13 rules applied. Total rules applied 134 place count 145 transition count 770
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 140 place count 139 transition count 226
Iterating global reduction 0 with 6 rules applied. Total rules applied 146 place count 139 transition count 226
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 148 place count 137 transition count 222
Iterating global reduction 0 with 2 rules applied. Total rules applied 150 place count 137 transition count 222
Applied a total of 150 rules in 186 ms. Remains 137 /214 variables (removed 77) and now considering 222/11896 (removed 11674) transitions.
// Phase 1: matrix 222 rows 137 cols
[2025-06-08 04:45:09] [INFO ] Computed 18 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:45:10] [INFO ] Implicit Places using invariants in 81 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 82 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/214 places, 222/11896 transitions.
Applied a total of 0 rules in 1 ms. Remains 136 /136 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 269 ms. Remains : 136/214 places, 222/11896 transitions.
[2025-06-08 04:45:10] [INFO ] Flatten gal took : 9 ms
[2025-06-08 04:45:10] [INFO ] Flatten gal took : 8 ms
[2025-06-08 04:45:10] [INFO ] Input system was already deterministic with 222 transitions.
[2025-06-08 04:45:10] [INFO ] Flatten gal took : 8 ms
[2025-06-08 04:45:10] [INFO ] Flatten gal took : 8 ms
[2025-06-08 04:45:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality6739505006851845496.gal : 2 ms
[2025-06-08 04:45:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality14044588140500535667.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/CTLCardinality6739505006851845496.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14044588140500535667.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,2.08473e+12,12.0656,325152,2,68764,5,1.08254e+06,6,0,768,1.45662e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-08 04:45:40] [INFO ] Flatten gal took : 7 ms
[2025-06-08 04:45:40] [INFO ] Applying decomposition
[2025-06-08 04:45:40] [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/graph13421987264490188883.txt' '-o' '/tmp/graph13421987264490188883.bin' '-w' '/tmp/graph13421987264490188883.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13421987264490188883.bin' '-l' '-1' '-v' '-w' '/tmp/graph13421987264490188883.weights' '-q' '0' '-e' '0.001'
[2025-06-08 04:45:40] [INFO ] Decomposing Gal with order
[2025-06-08 04:45:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 04:45:40] [INFO ] Removed a total of 659 redundant transitions.
[2025-06-08 04:45:40] [INFO ] Flatten gal took : 18 ms
[2025-06-08 04:45:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 14 ms.
[2025-06-08 04:45:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality12468729414257248883.gal : 3 ms
[2025-06-08 04:45:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality13919683219986658553.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/CTLCardinality12468729414257248883.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13919683219986658553.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,2.08473e+12,0.129789,9948,569,75,12984,1121,485,18328,83,3059,0


Converting to forward existential form...Done !
original formula: EF(((AX((E(((i7.i0.u21.p187==0)||(i4.u8.p52==1)) U ((i3.u5.p10==0)||(i8.i0.u33.p248==1))) + ((E(((i6.u18.p176==0)||(i1.u14.p117==1)) U (i...399
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (!(EX(!((E(((i7.i0.u21.p187==0)||(i4.u8.p52==1)) U ((i3.u5.p10==0)||(i8.i0.u33.p248==1))) ...475
Reverse transition relation is NOT exact ! Due to transitions t16, t131, t143, t183, t184, t186, t187, t188, t189, t190, t191, t192, u16.t68, u16.t69, u16....727
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 1
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
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 1
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,1,0.392153,19164,1,0,30641,1137,4126,57021,483,3177,81550
FORMULA ErlangenMainframeV0-PT-0909-CTLCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 214/214 places, 11896/11896 transitions.
Graph (trivial) has 159 edges and 214 vertex of which 6 / 214 are part of one of the 3 SCC in 3 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 210 transition count 11859
Reduce places removed 33 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 35 rules applied. Total rules applied 69 place count 177 transition count 11857
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 175 transition count 11857
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 71 place count 175 transition count 11845
Deduced a syphon composed of 12 places in 7 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 95 place count 163 transition count 11845
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 123 place count 135 transition count 6637
Iterating global reduction 3 with 28 rules applied. Total rules applied 151 place count 135 transition count 6637
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 151 place count 135 transition count 6632
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 161 place count 130 transition count 6632
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 169 place count 122 transition count 1496
Ensure Unique test removed 2 places
Iterating global reduction 3 with 10 rules applied. Total rules applied 179 place count 120 transition count 1496
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 185 place count 114 transition count 294
Iterating global reduction 3 with 6 rules applied. Total rules applied 191 place count 114 transition count 294
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 192 place count 113 transition count 292
Iterating global reduction 3 with 1 rules applied. Total rules applied 193 place count 113 transition count 292
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 255 place count 82 transition count 261
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 262 place count 75 transition count 198
Ensure Unique test removed 3 places
Iterating global reduction 3 with 10 rules applied. Total rules applied 272 place count 72 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 274 place count 72 transition count 196
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 278 place count 68 transition count 108
Iterating global reduction 4 with 4 rules applied. Total rules applied 282 place count 68 transition count 108
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 285 place count 65 transition count 102
Iterating global reduction 4 with 3 rules applied. Total rules applied 288 place count 65 transition count 102
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 297 place count 65 transition count 93
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 313 place count 57 transition count 85
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 314 place count 57 transition count 85
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 315 place count 56 transition count 84
Applied a total of 315 rules in 686 ms. Remains 56 /214 variables (removed 158) and now considering 84/11896 (removed 11812) transitions.
[2025-06-08 04:45:41] [INFO ] Flow matrix only has 67 transitions (discarded 17 similar events)
// Phase 1: matrix 67 rows 56 cols
[2025-06-08 04:45:41] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:45:41] [INFO ] Implicit Places using invariants in 53 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 55/214 places, 84/11896 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 743 ms. Remains : 55/214 places, 84/11896 transitions.
[2025-06-08 04:45:41] [INFO ] Flatten gal took : 2 ms
[2025-06-08 04:45:41] [INFO ] Flatten gal took : 3 ms
[2025-06-08 04:45:41] [INFO ] Input system was already deterministic with 84 transitions.
[2025-06-08 04:45:41] [INFO ] Flatten gal took : 2 ms
[2025-06-08 04:45:41] [INFO ] Flatten gal took : 2 ms
[2025-06-08 04:45:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality4389254661202935453.gal : 1 ms
[2025-06-08 04:45:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality10899785528330309642.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/CTLCardinality4389254661202935453.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10899785528330309642.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,7.3067e+06,0.048007,5812,2,800,5,9069,6,0,303,8064,0


Converting to forward existential form...Done !
original formula: EF((EF(((p3==0)&&(p108==1))) + (EG((p24!=0)) * (AG(((p275==0)&&(p199==1))) + ((p154==0)&&(p142==1))))))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),TRUE) * ((p3==0)&&(p108==1)))] != FALSE + ([((FwdU(Init,TRUE) * EG((p24!=0))) * !(E(TRUE...271
(forward)formula 0,1,0.056369,6068,1,0,7,9069,9,1,674,8064,3
FORMULA ErlangenMainframeV0-PT-0909-CTLCardinality-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 11896/11896 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 173 transition count 6675
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 173 transition count 6675
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 104 place count 151 transition count 1571
Ensure Unique test removed 1 places
Iterating global reduction 0 with 23 rules applied. Total rules applied 127 place count 150 transition count 1571
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 139 place count 138 transition count 370
Ensure Unique test removed 4 places
Iterating global reduction 0 with 16 rules applied. Total rules applied 155 place count 134 transition count 370
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 161 place count 128 transition count 190
Iterating global reduction 0 with 6 rules applied. Total rules applied 167 place count 128 transition count 190
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 169 place count 126 transition count 186
Iterating global reduction 0 with 2 rules applied. Total rules applied 171 place count 126 transition count 186
Applied a total of 171 rules in 211 ms. Remains 126 /214 variables (removed 88) and now considering 186/11896 (removed 11710) transitions.
// Phase 1: matrix 186 rows 126 cols
[2025-06-08 04:45:41] [INFO ] Computed 17 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:45:41] [INFO ] Implicit Places using invariants in 59 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 68 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/214 places, 186/11896 transitions.
Applied a total of 0 rules in 1 ms. Remains 125 /125 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 280 ms. Remains : 125/214 places, 186/11896 transitions.
[2025-06-08 04:45:41] [INFO ] Flatten gal took : 4 ms
[2025-06-08 04:45:41] [INFO ] Flatten gal took : 5 ms
[2025-06-08 04:45:41] [INFO ] Input system was already deterministic with 186 transitions.
[2025-06-08 04:45:41] [INFO ] Flatten gal took : 4 ms
[2025-06-08 04:45:41] [INFO ] Flatten gal took : 4 ms
[2025-06-08 04:45:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality11073566924643757335.gal : 1 ms
[2025-06-08 04:45:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality538960879697123196.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/CTLCardinality11073566924643757335.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality538960879697123196.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,6.91578e+11,11.869,310140,2,100976,5,1.14303e+06,6,0,688,1.33007e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-08 04:46:11] [INFO ] Flatten gal took : 4 ms
[2025-06-08 04:46:11] [INFO ] Applying decomposition
[2025-06-08 04:46:11] [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/graph17744138686605728072.txt' '-o' '/tmp/graph17744138686605728072.bin' '-w' '/tmp/graph17744138686605728072.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17744138686605728072.bin' '-l' '-1' '-v' '-w' '/tmp/graph17744138686605728072.weights' '-q' '0' '-e' '0.001'
[2025-06-08 04:46:11] [INFO ] Decomposing Gal with order
[2025-06-08 04:46:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 04:46:11] [INFO ] Removed a total of 351 redundant transitions.
[2025-06-08 04:46:11] [INFO ] Flatten gal took : 11 ms
[2025-06-08 04:46:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2025-06-08 04:46:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality2449505842965123954.gal : 2 ms
[2025-06-08 04:46:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality5657879335432726715.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/CTLCardinality2449505842965123954.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5657879335432726715.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,6.91578e+11,0.078548,7564,525,68,7992,773,386,8443,72,2082,0


Converting to forward existential form...Done !
original formula: AF(EX(EF((((i6.u13.p99==1)&&((i0.u24.p221==0)||(u10.p67==1)))||((i3.u6.p14==1)&&((i9.u22.p219==0)||(u9.p45==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(E(TRUE U (((i6.u13.p99==1)&&((i0.u24.p221==0)||(u10.p67==1)))||((i3.u6.p14==1)&&((i9.u22.p219==0...185
Reverse transition relation is NOT exact ! Due to transitions t16, t93, t112, t155, u9.t94, u9.t96, u9.t129, u9.t130, u10.t89, u10.t90, u10.t132, u16.t62, ...567
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
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
(forward)formula 0,1,0.433699,22924,1,0,39040,1050,2780,68929,386,3036,94185
FORMULA ErlangenMainframeV0-PT-0909-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 11896/11896 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 175 transition count 6677
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 175 transition count 6677
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 99 place count 154 transition count 1575
Ensure Unique test removed 1 places
Iterating global reduction 0 with 22 rules applied. Total rules applied 121 place count 153 transition count 1575
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 133 place count 141 transition count 374
Ensure Unique test removed 5 places
Iterating global reduction 0 with 17 rules applied. Total rules applied 150 place count 136 transition count 374
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 157 place count 129 transition count 186
Iterating global reduction 0 with 7 rules applied. Total rules applied 164 place count 129 transition count 186
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 165 place count 128 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 166 place count 128 transition count 184
Applied a total of 166 rules in 206 ms. Remains 128 /214 variables (removed 86) and now considering 184/11896 (removed 11712) transitions.
// Phase 1: matrix 184 rows 128 cols
[2025-06-08 04:46:12] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:46:12] [INFO ] Implicit Places using invariants in 64 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 127/214 places, 184/11896 transitions.
Applied a total of 0 rules in 1 ms. Remains 127 /127 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 279 ms. Remains : 127/214 places, 184/11896 transitions.
[2025-06-08 04:46:12] [INFO ] Flatten gal took : 4 ms
[2025-06-08 04:46:12] [INFO ] Flatten gal took : 4 ms
[2025-06-08 04:46:12] [INFO ] Input system was already deterministic with 184 transitions.
[2025-06-08 04:46:12] [INFO ] Flatten gal took : 4 ms
[2025-06-08 04:46:12] [INFO ] Flatten gal took : 4 ms
[2025-06-08 04:46:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality6182813288200686530.gal : 1 ms
[2025-06-08 04:46:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality2131764353287182066.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/CTLCardinality6182813288200686530.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2131764353287182066.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.27552e+12,17.0446,418604,2,95303,5,1.54926e+06,6,0,694,1.92081e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-08 04:46:42] [INFO ] Flatten gal took : 9 ms
[2025-06-08 04:46:42] [INFO ] Applying decomposition
[2025-06-08 04:46:42] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3809844975706110539.txt' '-o' '/tmp/graph3809844975706110539.bin' '-w' '/tmp/graph3809844975706110539.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3809844975706110539.bin' '-l' '-1' '-v' '-w' '/tmp/graph3809844975706110539.weights' '-q' '0' '-e' '0.001'
[2025-06-08 04:46:42] [INFO ] Decomposing Gal with order
[2025-06-08 04:46:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 04:46:42] [INFO ] Removed a total of 242 redundant transitions.
[2025-06-08 04:46:42] [INFO ] Flatten gal took : 9 ms
[2025-06-08 04:46:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 2 ms.
[2025-06-08 04:46:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality7606940008741912212.gal : 1 ms
[2025-06-08 04:46:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality4711896689823020096.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/CTLCardinality7606940008741912212.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4711896689823020096.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,1.27552e+12,0.110693,8880,469,102,9543,1971,433,14028,84,6555,0


Converting to forward existential form...Done !
original formula: AX((EF((EF(((u12.p98==0)&&(i4.u6.p57==1))) + (EF((u11.p84==1)) * EG(((i11.i0.u26.p231==0)&&(i5.u7.p49==1)))))) + A(!(((i10.i1.u21.p208==0...223
=> equivalent forward existential formula: [((EY(Init) * !(!((E(!(!(!(EX(!(!(EX(!(((u12.p102==0)||(i9.u17.p173==1)))))))))) U (!(!(((i10.i1.u21.p208==0)||(...444
Reverse transition relation is NOT exact ! Due to transitions t15, t108, t156, u15.t64, u15.t65, u15.t123, u13.t74, u13.t75, u13.t76, u13.t124, u13.t125, u...663
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
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
(forward)formula 0,1,0.979814,41008,1,0,73396,1971,2982,150576,462,6555,130602
FORMULA ErlangenMainframeV0-PT-0909-CTLCardinality-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 11896/11896 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 176 transition count 9916
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 176 transition count 9916
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 97 place count 155 transition count 4283
Ensure Unique test removed 1 places
Iterating global reduction 0 with 22 rules applied. Total rules applied 119 place count 154 transition count 4283
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 130 place count 143 transition count 1046
Ensure Unique test removed 4 places
Iterating global reduction 0 with 15 rules applied. Total rules applied 145 place count 139 transition count 1046
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 154 place count 130 transition count 194
Iterating global reduction 0 with 9 rules applied. Total rules applied 163 place count 130 transition count 194
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 167 place count 126 transition count 186
Iterating global reduction 0 with 4 rules applied. Total rules applied 171 place count 126 transition count 186
Applied a total of 171 rules in 218 ms. Remains 126 /214 variables (removed 88) and now considering 186/11896 (removed 11710) transitions.
// Phase 1: matrix 186 rows 126 cols
[2025-06-08 04:46:43] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:46:43] [INFO ] Implicit Places using invariants in 56 ms returned [67]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 57 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/214 places, 186/11896 transitions.
Applied a total of 0 rules in 1 ms. Remains 125 /125 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 276 ms. Remains : 125/214 places, 186/11896 transitions.
[2025-06-08 04:46:44] [INFO ] Flatten gal took : 6 ms
[2025-06-08 04:46:44] [INFO ] Flatten gal took : 5 ms
[2025-06-08 04:46:44] [INFO ] Input system was already deterministic with 186 transitions.
[2025-06-08 04:46:44] [INFO ] Flatten gal took : 5 ms
[2025-06-08 04:46:44] [INFO ] Flatten gal took : 4 ms
[2025-06-08 04:46:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality15697313171973402592.gal : 1 ms
[2025-06-08 04:46:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality4180065962663564400.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/CTLCardinality15697313171973402592.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4180065962663564400.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,7.78271e+11,2.37178,81568,2,25612,5,303630,6,0,688,353002,0


Converting to forward existential form...Done !
original formula: ((AG(AX(!(E((((p5==0)||(p260==1))&&(p52==1)) U E((p126==1) U (p159==1)))))) + AG((p30==1))) + AF(((p8==0)&&(p120==1))))
=> equivalent forward existential formula: [FwdG((Init * !((!(E(TRUE U !(!(EX(!(!(E((((p5==0)||(p260==1))&&(p52==1)) U E((p126==1) U (p159==1)))))))))) + !...215
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t10, t12, t14, t17, t42, t45, t50, t54, t57, t58, t62, t64, t68, t69, t73, t75, t...390
Detected timeout of ITS tools.
[2025-06-08 04:47:14] [INFO ] Flatten gal took : 14 ms
[2025-06-08 04:47:14] [INFO ] Applying decomposition
[2025-06-08 04:47:14] [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/graph7578864778304614486.txt' '-o' '/tmp/graph7578864778304614486.bin' '-w' '/tmp/graph7578864778304614486.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7578864778304614486.bin' '-l' '-1' '-v' '-w' '/tmp/graph7578864778304614486.weights' '-q' '0' '-e' '0.001'
[2025-06-08 04:47:14] [INFO ] Decomposing Gal with order
[2025-06-08 04:47:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 04:47:14] [INFO ] Removed a total of 349 redundant transitions.
[2025-06-08 04:47:14] [INFO ] Flatten gal took : 11 ms
[2025-06-08 04:47:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 1 ms.
[2025-06-08 04:47:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality4867271505996515038.gal : 1 ms
[2025-06-08 04:47:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality15460280730805077878.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/CTLCardinality4867271505996515038.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15460280730805077878.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.78271e+11,0.084057,7824,597,88,8414,918,377,8607,80,2591,0


Converting to forward existential form...Done !
original formula: ((AG(AX(!(E((((i0.u2.p5==0)||(i11.u31.p260==1))&&(i5.u8.p52==1)) U E((i8.u12.p126==1) U (u14.p159==1)))))) + AG((i3.u6.p30==1))) + AF(((i...183
=> equivalent forward existential formula: [FwdG((Init * !((!(E(TRUE U !(!(EX(!(!(E((((i0.u2.p5==0)||(i11.u31.p260==1))&&(i5.u8.p52==1)) U E((i8.u12.p126==...261
Reverse transition relation is NOT exact ! Due to transitions t17, t113, t155, u14.t62, u14.t64, u14.t126, u14.t127, u11.t73, u11.t75, u11.t128, u11.t129, ...567
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 a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 6
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
(forward)formula 0,0,1.66606,80912,1,0,148723,1668,3141,369658,489,5669,253048
FORMULA ErlangenMainframeV0-PT-0909-CTLCardinality-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 11896/11896 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 173 transition count 9590
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 173 transition count 9590
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 105 place count 150 transition count 2865
Ensure Unique test removed 1 places
Iterating global reduction 0 with 24 rules applied. Total rules applied 129 place count 149 transition count 2865
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 142 place count 136 transition count 558
Ensure Unique test removed 6 places
Iterating global reduction 0 with 19 rules applied. Total rules applied 161 place count 130 transition count 558
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 170 place count 121 transition count 174
Iterating global reduction 0 with 9 rules applied. Total rules applied 179 place count 121 transition count 174
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 183 place count 117 transition count 166
Iterating global reduction 0 with 4 rules applied. Total rules applied 187 place count 117 transition count 166
Applied a total of 187 rules in 235 ms. Remains 117 /214 variables (removed 97) and now considering 166/11896 (removed 11730) transitions.
// Phase 1: matrix 166 rows 117 cols
[2025-06-08 04:47:16] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:47:16] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-08 04:47:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:47:16] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2025-06-08 04:47:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:47:17] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:47:17] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 166/283 variables, 117/134 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 0/283 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 134 constraints, problems are : Problem set: 0 solved, 165 unsolved in 5916 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:47:22] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 166/283 variables, 117/135 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 165/300 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:47:24] [INFO ] Deduced a trap along path composed of 6 places in 36 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:47:24] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:47:24] [INFO ] Deduced a trap along path composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 3/303 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/283 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 303 constraints, problems are : Problem set: 0 solved, 165 unsolved in 13316 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 19257ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 19258ms
Starting structural reductions in LTL mode, iteration 1 : 117/214 places, 166/11896 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19636 ms. Remains : 117/214 places, 166/11896 transitions.
[2025-06-08 04:47:35] [INFO ] Flatten gal took : 7 ms
[2025-06-08 04:47:35] [INFO ] Flatten gal took : 5 ms
[2025-06-08 04:47:35] [INFO ] Input system was already deterministic with 166 transitions.
[2025-06-08 04:47:35] [INFO ] Flatten gal took : 4 ms
[2025-06-08 04:47:35] [INFO ] Flatten gal took : 3 ms
[2025-06-08 04:47:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality4814187932375853943.gal : 1 ms
[2025-06-08 04:47:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality14470126233487368675.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/CTLCardinality4814187932375853943.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14470126233487368675.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.30866e+11,1.43661,53072,2,33912,5,226799,6,0,636,178192,0


Converting to forward existential form...Done !
original formula: EX(AG((AF((p273==0)) + AF((p149==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((!(EG(!((p273==0)))) + !(EG(!((p149==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t11, t12, t14, t17, t42, t50, t58, t68, t73, t78, t83, t88, t93, t97, t100, t102, t111, t...308
(forward)formula 0,0,17.3133,490064,1,0,373,2.32901e+06,366,181,4794,1.76662e+06,465
FORMULA ErlangenMainframeV0-PT-0909-CTLCardinality-2025-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 11896/11896 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 176 transition count 7001
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 176 transition count 7001
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 97 place count 155 transition count 2270
Ensure Unique test removed 1 places
Iterating global reduction 0 with 22 rules applied. Total rules applied 119 place count 154 transition count 2270
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 131 place count 142 transition count 470
Ensure Unique test removed 4 places
Iterating global reduction 0 with 16 rules applied. Total rules applied 147 place count 138 transition count 470
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 153 place count 132 transition count 202
Iterating global reduction 0 with 6 rules applied. Total rules applied 159 place count 132 transition count 202
Applied a total of 159 rules in 194 ms. Remains 132 /214 variables (removed 82) and now considering 202/11896 (removed 11694) transitions.
// Phase 1: matrix 202 rows 132 cols
[2025-06-08 04:47:53] [INFO ] Computed 17 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:47:53] [INFO ] Implicit Places using invariants in 73 ms returned [67]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 131/214 places, 202/11896 transitions.
Applied a total of 0 rules in 1 ms. Remains 131 /131 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 272 ms. Remains : 131/214 places, 202/11896 transitions.
[2025-06-08 04:47:53] [INFO ] Flatten gal took : 6 ms
[2025-06-08 04:47:53] [INFO ] Flatten gal took : 5 ms
[2025-06-08 04:47:53] [INFO ] Input system was already deterministic with 202 transitions.
[2025-06-08 04:47:53] [INFO ] Flatten gal took : 5 ms
[2025-06-08 04:47:53] [INFO ] Flatten gal took : 5 ms
[2025-06-08 04:47:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality12765892456765063994.gal : 2 ms
[2025-06-08 04:47:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality11939351469799829774.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/CTLCardinality12765892456765063994.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11939351469799829774.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,2.14066e+12,13.693,370048,2,81329,5,1.37338e+06,6,0,728,1.53331e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-08 04:48:23] [INFO ] Flatten gal took : 5 ms
[2025-06-08 04:48:23] [INFO ] Applying decomposition
[2025-06-08 04:48:23] [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/graph16255516326854075680.txt' '-o' '/tmp/graph16255516326854075680.bin' '-w' '/tmp/graph16255516326854075680.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16255516326854075680.bin' '-l' '-1' '-v' '-w' '/tmp/graph16255516326854075680.weights' '-q' '0' '-e' '0.001'
[2025-06-08 04:48:23] [INFO ] Decomposing Gal with order
[2025-06-08 04:48:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 04:48:23] [INFO ] Removed a total of 465 redundant transitions.
[2025-06-08 04:48:23] [INFO ] Flatten gal took : 12 ms
[2025-06-08 04:48:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 2 ms.
[2025-06-08 04:48:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality8820069703283067765.gal : 1 ms
[2025-06-08 04:48:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality12574239053492450894.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/CTLCardinality8820069703283067765.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12574239053492450894.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,2.14066e+12,0.097491,7968,550,101,8400,910,455,11765,89,2988,0


Converting to forward existential form...Done !
original formula: E(!((EX((((A(((i6.u20.p192==0)||(i6.u19.p188==1)) U (i0.u15.p91==1)) + (i8.u6.p110==0)) + (i6.u22.p212==1)) * !(AF(((i4.u11.p96==0)||(u9....390
=> equivalent forward existential formula: [(FwdU(Init,!((EX((((!((E(!((i0.u15.p91==1)) U (!(((i6.u20.p192==0)||(i6.u19.p188==1))) * !((i0.u15.p91==1)))) +...604
Reverse transition relation is NOT exact ! Due to transitions t16, t98, t108, t110, t114, t116, t120, t122, t126, t128, t171, t172, t173, t174, u9.t87, u9....741
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 a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
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
(forward)formula 0,1,28.5317,467760,1,0,798539,1901,3543,2.03998e+06,524,7286,578670
FORMULA ErlangenMainframeV0-PT-0909-CTLCardinality-2025-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 214/214 places, 11896/11896 transitions.
Graph (trivial) has 164 edges and 214 vertex of which 4 / 214 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 211 transition count 11856
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 174 transition count 11856
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 75 place count 174 transition count 11844
Deduced a syphon composed of 12 places in 6 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 99 place count 162 transition count 11844
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 130 place count 131 transition count 6633
Iterating global reduction 2 with 31 rules applied. Total rules applied 161 place count 131 transition count 6633
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 161 place count 131 transition count 6628
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 171 place count 126 transition count 6628
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 181 place count 116 transition count 1460
Ensure Unique test removed 3 places
Iterating global reduction 2 with 13 rules applied. Total rules applied 194 place count 113 transition count 1460
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 201 place count 106 transition count 226
Iterating global reduction 2 with 7 rules applied. Total rules applied 208 place count 106 transition count 226
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 210 place count 104 transition count 222
Iterating global reduction 2 with 2 rules applied. Total rules applied 212 place count 104 transition count 222
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 278 place count 71 transition count 189
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 287 place count 62 transition count 117
Ensure Unique test removed 4 places
Iterating global reduction 2 with 13 rules applied. Total rules applied 300 place count 58 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 303 place count 58 transition count 114
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 307 place count 54 transition count 84
Iterating global reduction 3 with 4 rules applied. Total rules applied 311 place count 54 transition count 84
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 314 place count 51 transition count 78
Iterating global reduction 3 with 3 rules applied. Total rules applied 317 place count 51 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 3 with 2 rules applied. Total rules applied 319 place count 50 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 328 place count 50 transition count 68
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 346 place count 41 transition count 59
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 347 place count 41 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 348 place count 40 transition count 58
Applied a total of 348 rules in 568 ms. Remains 40 /214 variables (removed 174) and now considering 58/11896 (removed 11838) transitions.
[2025-06-08 04:48:52] [INFO ] Flow matrix only has 41 transitions (discarded 17 similar events)
// Phase 1: matrix 41 rows 40 cols
[2025-06-08 04:48:52] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:48:52] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-08 04:48:52] [INFO ] Flow matrix only has 41 transitions (discarded 17 similar events)
[2025-06-08 04:48:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:48:52] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-08 04:48:52] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 04:48:52] [INFO ] Redundant transitions in 0 ms returned []
Running 35 sub problems to find dead transitions.
[2025-06-08 04:48:52] [INFO ] Flow matrix only has 41 transitions (discarded 17 similar events)
[2025-06-08 04:48:52] [INFO ] Invariant cache hit.
[2025-06-08 04:48:52] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (OVERLAPS) 5/40 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 40/80 variables, 40/55 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 0/80 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/81 variables, and 59 constraints, problems are : Problem set: 0 solved, 35 unsolved in 485 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 40/40 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (OVERLAPS) 5/40 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 40/80 variables, 40/55 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 35/94 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 0/80 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/81 variables, and 94 constraints, problems are : Problem set: 0 solved, 35 unsolved in 566 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 40/40 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1058ms problems are : Problem set: 0 solved, 35 unsolved
Search for dead transitions found 0 dead transitions in 1059ms
Starting structural reductions in SI_CTL mode, iteration 1 : 40/214 places, 58/11896 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1725 ms. Remains : 40/214 places, 58/11896 transitions.
[2025-06-08 04:48:53] [INFO ] Flatten gal took : 4 ms
[2025-06-08 04:48:53] [INFO ] Flatten gal took : 1 ms
[2025-06-08 04:48:53] [INFO ] Input system was already deterministic with 58 transitions.
[2025-06-08 04:48:53] [INFO ] Flatten gal took : 2 ms
[2025-06-08 04:48:53] [INFO ] Flatten gal took : 1 ms
[2025-06-08 04:48:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality13982784333177295433.gal : 0 ms
[2025-06-08 04:48:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality11854532752105226037.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/CTLCardinality13982784333177295433.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11854532752105226037.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.10592e+06,0.028402,4668,2,1302,5,4429,6,0,219,3138,0


Converting to forward existential form...Done !
original formula: AF(AG((EF(((p224==0)||(p217==1))) * (p178==0))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((E(TRUE U ((p224==0)||(p217==1))) * (p178==0)))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.092048,7740,1,0,8,17444,19,3,1298,8519,13
FORMULA ErlangenMainframeV0-PT-0909-CTLCardinality-2025-14 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 : 214/214 places, 11896/11896 transitions.
Graph (trivial) has 167 edges and 214 vertex of which 6 / 214 are part of one of the 3 SCC in 2 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 210 transition count 11855
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 173 transition count 11855
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 75 place count 173 transition count 11843
Deduced a syphon composed of 12 places in 6 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 99 place count 161 transition count 11843
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 130 place count 130 transition count 6632
Iterating global reduction 2 with 31 rules applied. Total rules applied 161 place count 130 transition count 6632
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 161 place count 130 transition count 6627
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 171 place count 125 transition count 6627
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 181 place count 115 transition count 1459
Ensure Unique test removed 3 places
Iterating global reduction 2 with 13 rules applied. Total rules applied 194 place count 112 transition count 1459
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 202 place count 104 transition count 193
Iterating global reduction 2 with 8 rules applied. Total rules applied 210 place count 104 transition count 193
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 213 place count 101 transition count 187
Iterating global reduction 2 with 3 rules applied. Total rules applied 216 place count 101 transition count 187
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 282 place count 68 transition count 154
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 290 place count 60 transition count 99
Ensure Unique test removed 3 places
Iterating global reduction 2 with 11 rules applied. Total rules applied 301 place count 57 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 304 place count 57 transition count 96
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 307 place count 54 transition count 82
Iterating global reduction 3 with 3 rules applied. Total rules applied 310 place count 54 transition count 82
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 313 place count 51 transition count 76
Iterating global reduction 3 with 3 rules applied. Total rules applied 316 place count 51 transition count 76
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 324 place count 51 transition count 68
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 340 place count 43 transition count 60
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 341 place count 42 transition count 59
Applied a total of 341 rules in 590 ms. Remains 42 /214 variables (removed 172) and now considering 59/11896 (removed 11837) transitions.
[2025-06-08 04:48:54] [INFO ] Flow matrix only has 43 transitions (discarded 16 similar events)
// Phase 1: matrix 43 rows 42 cols
[2025-06-08 04:48:54] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:48:54] [INFO ] Implicit Places using invariants in 40 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 41/214 places, 59/11896 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 38 transition count 57
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 38 transition count 55
Applied a total of 7 rules in 2 ms. Remains 38 /41 variables (removed 3) and now considering 55/59 (removed 4) transitions.
[2025-06-08 04:48:54] [INFO ] Flow matrix only has 41 transitions (discarded 14 similar events)
// Phase 1: matrix 41 rows 38 cols
[2025-06-08 04:48:54] [INFO ] Computed 14 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:48:54] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-08 04:48:54] [INFO ] Flow matrix only has 41 transitions (discarded 14 similar events)
[2025-06-08 04:48:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:48:54] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-08 04:48:54] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 38/214 places, 55/11896 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 706 ms. Remains : 38/214 places, 55/11896 transitions.
[2025-06-08 04:48:54] [INFO ] Flatten gal took : 2 ms
[2025-06-08 04:48:54] [INFO ] Flatten gal took : 1 ms
[2025-06-08 04:48:54] [INFO ] Input system was already deterministic with 55 transitions.
RANDOM walk for 114 steps (0 resets) in 6 ms. (16 steps per ms) remains 0/1 properties
FORMULA ErlangenMainframeV0-PT-0909-CTLCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-08 04:48:54] [INFO ] Flatten gal took : 2 ms
[2025-06-08 04:48:54] [INFO ] Flatten gal took : 2 ms
[2025-06-08 04:48:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13674424367054767978.gal : 0 ms
[2025-06-08 04:48:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4591959576432076685.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13674424367054767978.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4591959576432076685.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-08 04:48:56] [INFO ] Flatten gal took : 1285 ms
[2025-06-08 04:48:57] [INFO ] Flatten gal took : 1289 ms
Total runtime 419085 ms.

BK_STOP 1749358137375

--------------------
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="ErlangenMainframeV0-PT-0909"
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 ErlangenMainframeV0-PT-0909, 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 r254-tall-174931339600305"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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