Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028400434.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 CO4-PT-08, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028400434
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 138K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748606097829

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-30 11:54:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 11:54:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:54:59] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2025-05-30 11:54:59] [INFO ] Transformed 467 places.
[2025-05-30 11:54:59] [INFO ] Transformed 600 transitions.
[2025-05-30 11:54:59] [INFO ] Found NUPN structural information;
[2025-05-30 11:54:59] [INFO ] Parsed PT model containing 467 places and 600 transitions and 1596 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Deduced a syphon composed of 108 places in 6 ms
Reduce places removed 108 places and 155 transitions.
Support contains 53 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 445/445 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 346 transition count 443
Discarding 75 places :
Symmetric choice reduction at 1 with 75 rule applications. Total rules 90 place count 271 transition count 367
Iterating global reduction 1 with 75 rules applied. Total rules applied 165 place count 271 transition count 367
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 167 place count 271 transition count 365
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 199 place count 239 transition count 323
Iterating global reduction 2 with 32 rules applied. Total rules applied 231 place count 239 transition count 323
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 235 place count 235 transition count 316
Iterating global reduction 2 with 4 rules applied. Total rules applied 239 place count 235 transition count 316
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 242 place count 232 transition count 313
Iterating global reduction 2 with 3 rules applied. Total rules applied 245 place count 232 transition count 313
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 247 place count 230 transition count 311
Iterating global reduction 2 with 2 rules applied. Total rules applied 249 place count 230 transition count 311
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 251 place count 230 transition count 309
Applied a total of 251 rules in 81 ms. Remains 230 /359 variables (removed 129) and now considering 309/445 (removed 136) transitions.
// Phase 1: matrix 309 rows 230 cols
[2025-05-30 11:54:59] [INFO ] Computed 6 invariants in 29 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:54:59] [INFO ] Implicit Places using invariants in 258 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 287 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 229/359 places, 309/445 transitions.
Applied a total of 0 rules in 4 ms. Remains 229 /229 variables (removed 0) and now considering 309/309 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 385 ms. Remains : 229/359 places, 309/445 transitions.
Support contains 53 out of 229 places after structural reductions.
[2025-05-30 11:54:59] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2025-05-30 11:54:59] [INFO ] Flatten gal took : 54 ms
[2025-05-30 11:54:59] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA CO4-PT-08-CTLFireability-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-CTLFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-CTLFireability-2025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-CTLFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-CTLFireability-2025-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 11:54:59] [INFO ] Flatten gal took : 28 ms
[2025-05-30 11:54:59] [INFO ] Input system was already deterministic with 309 transitions.
Support contains 40 out of 229 places (down from 53) after GAL structural reductions.
RANDOM walk for 40000 steps (292 resets) in 2097 ms. (19 steps per ms) remains 18/34 properties
BEST_FIRST walk for 4001 steps (27 resets) in 22 ms. (173 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (29 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (33 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (28 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (32 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (34 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (31 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (26 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (28 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (33 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (31 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (30 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (27 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (30 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (33 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (32 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (26 resets) in 17 ms. (222 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4003 steps (29 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
// Phase 1: matrix 309 rows 229 cols
[2025-05-30 11:55:00] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 28/49 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 107/156 variables, 49/54 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 205/361 variables, 76/130 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 151/512 variables, 83/213 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 25/537 variables, 20/233 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/537 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 11 (OVERLAPS) 1/538 variables, 1/234 constraints. Problems are: Problem set: 1 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:55:01] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 18 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/538 variables, 1/235 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/538 variables, 0/235 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 0/538 variables, 0/235 constraints. Problems are: Problem set: 1 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 538/538 variables, and 235 constraints, problems are : Problem set: 1 solved, 16 unsolved in 1607 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 16 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 24/43 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 16 unsolved
Problem AtomicPropp24 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 1/5 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 5/48 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 105/153 variables, 48/54 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 4/58 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/58 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 201/354 variables, 74/132 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 11/143 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 0/143 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 151/505 variables, 83/226 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/505 variables, 0/226 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 28/533 variables, 21/247 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/533 variables, 0/247 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 16 (OVERLAPS) 5/538 variables, 3/250 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/538 variables, 0/250 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 18 (OVERLAPS) 0/538 variables, 0/250 constraints. Problems are: Problem set: 2 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 538/538 variables, and 250 constraints, problems are : Problem set: 2 solved, 15 unsolved in 2579 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 15/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4228ms problems are : Problem set: 2 solved, 15 unsolved
Fused 15 Parikh solutions to 13 different solutions.
Finished Parikh walk after 163 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=81 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 15 properties in 347 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2025-05-30 11:55:05] [INFO ] Flatten gal took : 13 ms
[2025-05-30 11:55:05] [INFO ] Flatten gal took : 14 ms
[2025-05-30 11:55:05] [INFO ] Input system was already deterministic with 309 transitions.
Computed a total of 18 stabilizing places and 32 stable transitions
Graph (complete) has 441 edges and 229 vertex of which 224 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 309/309 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 211 transition count 280
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 211 transition count 280
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 42 place count 211 transition count 274
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 49 place count 204 transition count 267
Iterating global reduction 1 with 7 rules applied. Total rules applied 56 place count 204 transition count 267
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 201 transition count 263
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 201 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 201 transition count 262
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 200 transition count 261
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 200 transition count 261
Applied a total of 65 rules in 15 ms. Remains 200 /229 variables (removed 29) and now considering 261/309 (removed 48) transitions.
// Phase 1: matrix 261 rows 200 cols
[2025-05-30 11:55:05] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:55:05] [INFO ] Implicit Places using invariants in 125 ms returned [138]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 127 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 199/229 places, 261/309 transitions.
Applied a total of 0 rules in 3 ms. Remains 199 /199 variables (removed 0) and now considering 261/261 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 145 ms. Remains : 199/229 places, 261/309 transitions.
[2025-05-30 11:55:05] [INFO ] Flatten gal took : 13 ms
[2025-05-30 11:55:05] [INFO ] Flatten gal took : 10 ms
[2025-05-30 11:55:05] [INFO ] Input system was already deterministic with 261 transitions.
[2025-05-30 11:55:05] [INFO ] Flatten gal took : 10 ms
[2025-05-30 11:55:05] [INFO ] Flatten gal took : 11 ms
[2025-05-30 11:55:05] [INFO ] Time to serialize gal into /tmp/CTLFireability4567538842477136958.gal : 4 ms
[2025-05-30 11:55:05] [INFO ] Time to serialize properties into /tmp/CTLFireability9810124459129598479.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/CTLFireability4567538842477136958.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9810124459129598479.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.04612e+07,0.188585,7472,2,1713,5,13468,6,0,1053,14348,0


Converting to forward existential form...Done !
original formula: AX(E((p244==1) U A((p241!=1) U (p7==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E((p244==1) U !((E(!((p7==1)) U (!((p241!=1)) * !((p7==1)))) + EG(!((p7==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t12, t19, t28, t33, t34, t36, t37, t41, t42, t50, t59, t64, t65, t67,...322
(forward)formula 0,1,27.7229,880864,1,0,1341,5.01767e+06,553,648,6011,6.83332e+06,1686
FORMULA CO4-PT-08-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 229/229 places, 309/309 transitions.
Graph (trivial) has 233 edges and 229 vertex of which 2 / 229 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 440 edges and 228 vertex of which 223 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 79 place count 222 transition count 223
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 80 rules applied. Total rules applied 159 place count 145 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 160 place count 144 transition count 220
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 160 place count 144 transition count 203
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 194 place count 127 transition count 203
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 204 place count 117 transition count 184
Iterating global reduction 3 with 10 rules applied. Total rules applied 214 place count 117 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 215 place count 117 transition count 183
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 215 place count 117 transition count 180
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 221 place count 114 transition count 180
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 224 place count 111 transition count 177
Iterating global reduction 4 with 3 rules applied. Total rules applied 227 place count 111 transition count 177
Performed 13 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 253 place count 98 transition count 163
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 258 place count 98 transition count 158
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 260 place count 97 transition count 157
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 262 place count 95 transition count 155
Iterating global reduction 6 with 2 rules applied. Total rules applied 264 place count 95 transition count 155
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 276 place count 95 transition count 143
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 6 with 5 rules applied. Total rules applied 281 place count 95 transition count 138
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 286 place count 90 transition count 138
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 286 place count 90 transition count 136
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 290 place count 88 transition count 136
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 8 with 2 rules applied. Total rules applied 292 place count 87 transition count 135
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 293 place count 87 transition count 135
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 295 place count 85 transition count 133
Applied a total of 295 rules in 67 ms. Remains 85 /229 variables (removed 144) and now considering 133/309 (removed 176) transitions.
// Phase 1: matrix 133 rows 85 cols
[2025-05-30 11:55:33] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:55:33] [INFO ] Implicit Places using invariants in 48 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 84/229 places, 133/309 transitions.
Applied a total of 0 rules in 4 ms. Remains 84 /84 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 120 ms. Remains : 84/229 places, 133/309 transitions.
[2025-05-30 11:55:33] [INFO ] Flatten gal took : 6 ms
[2025-05-30 11:55:33] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:55:33] [INFO ] Input system was already deterministic with 133 transitions.
[2025-05-30 11:55:33] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:55:33] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:55:33] [INFO ] Time to serialize gal into /tmp/CTLFireability1862130129914308989.gal : 1 ms
[2025-05-30 11:55:33] [INFO ] Time to serialize properties into /tmp/CTLFireability5201876912317328228.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/CTLFireability1862130129914308989.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5201876912317328228.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,211897,0.023348,4588,2,316,5,2944,6,0,462,2398,0


Converting to forward existential form...Done !
original formula: EF(((p413==1) + E((p344!=1) U (p459==1))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (p413==1))] != FALSE + [(FwdU(FwdU(Init,TRUE),(p344!=1)) * (p459==1))] != FALSE)
(forward)formula 0,1,0.0239,4844,1,0,7,2944,8,1,465,2398,1
FORMULA CO4-PT-08-CTLFireability-2025-03 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 : 229/229 places, 309/309 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 209 transition count 278
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 209 transition count 278
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 46 place count 209 transition count 272
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 53 place count 202 transition count 265
Iterating global reduction 1 with 7 rules applied. Total rules applied 60 place count 202 transition count 265
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 199 transition count 261
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 199 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 67 place count 199 transition count 260
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 198 transition count 259
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 198 transition count 259
Applied a total of 69 rules in 20 ms. Remains 198 /229 variables (removed 31) and now considering 259/309 (removed 50) transitions.
// Phase 1: matrix 259 rows 198 cols
[2025-05-30 11:55:33] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:55:33] [INFO ] Implicit Places using invariants in 60 ms returned [136]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 197/229 places, 259/309 transitions.
Applied a total of 0 rules in 3 ms. Remains 197 /197 variables (removed 0) and now considering 259/259 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 84 ms. Remains : 197/229 places, 259/309 transitions.
[2025-05-30 11:55:33] [INFO ] Flatten gal took : 8 ms
[2025-05-30 11:55:33] [INFO ] Flatten gal took : 8 ms
[2025-05-30 11:55:33] [INFO ] Input system was already deterministic with 259 transitions.
[2025-05-30 11:55:33] [INFO ] Flatten gal took : 8 ms
[2025-05-30 11:55:34] [INFO ] Flatten gal took : 8 ms
[2025-05-30 11:55:34] [INFO ] Time to serialize gal into /tmp/CTLFireability9427543831889879549.gal : 1 ms
[2025-05-30 11:55:34] [INFO ] Time to serialize properties into /tmp/CTLFireability9395801945580215455.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/CTLFireability9427543831889879549.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9395801945580215455.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.03512e+07,0.089756,7384,2,1527,5,12482,6,0,1043,13510,0


Converting to forward existential form...Done !
original formula: EF((AX(FALSE) * (p202!=1)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (p202!=1)) * !(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t12, t19, t28, t33, t34, t36, t37, t41, t42, t50, t59, t64, t65, t67,...382
(forward)formula 0,1,1.09313,48956,1,0,366,168084,534,223,5777,193682,525
FORMULA CO4-PT-08-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 309/309 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 211 transition count 280
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 211 transition count 280
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 42 place count 211 transition count 274
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 205 transition count 268
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 205 transition count 268
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 202 transition count 264
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 202 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 61 place count 202 transition count 263
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 201 transition count 262
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 201 transition count 262
Applied a total of 63 rules in 12 ms. Remains 201 /229 variables (removed 28) and now considering 262/309 (removed 47) transitions.
// Phase 1: matrix 262 rows 201 cols
[2025-05-30 11:55:35] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:55:35] [INFO ] Implicit Places using invariants in 113 ms returned [139]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 114 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/229 places, 262/309 transitions.
Applied a total of 0 rules in 3 ms. Remains 200 /200 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 129 ms. Remains : 200/229 places, 262/309 transitions.
[2025-05-30 11:55:35] [INFO ] Flatten gal took : 8 ms
[2025-05-30 11:55:35] [INFO ] Flatten gal took : 8 ms
[2025-05-30 11:55:35] [INFO ] Input system was already deterministic with 262 transitions.
[2025-05-30 11:55:35] [INFO ] Flatten gal took : 19 ms
[2025-05-30 11:55:35] [INFO ] Flatten gal took : 8 ms
[2025-05-30 11:55:35] [INFO ] Time to serialize gal into /tmp/CTLFireability17414895765546550911.gal : 6 ms
[2025-05-30 11:55:35] [INFO ] Time to serialize properties into /tmp/CTLFireability2690139432216219171.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/CTLFireability17414895765546550911.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2690139432216219171.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,1.49044e+07,0.12102,7904,2,1576,5,13968,6,0,1058,15798,0


Converting to forward existential form...Done !
original formula: AX(AF(AG(EF(((p303==1)||(p220==1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(!(E(TRUE U !(E(TRUE U ((p303==1)||(p220==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t12, t13, t19, t28, t33, t34, t36, t37, t41, t42, t44, t50, t59, t64,...397
(forward)formula 0,0,3.4689,136060,1,0,439,705228,549,248,6489,686627,610
FORMULA CO4-PT-08-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 229/229 places, 309/309 transitions.
Graph (trivial) has 225 edges and 229 vertex of which 2 / 229 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 440 edges and 228 vertex of which 226 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 74 rules applied. Total rules applied 76 place count 225 transition count 231
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 76 rules applied. Total rules applied 152 place count 152 transition count 228
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 156 place count 151 transition count 225
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 159 place count 148 transition count 225
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 159 place count 148 transition count 211
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 187 place count 134 transition count 211
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 199 place count 122 transition count 188
Iterating global reduction 4 with 12 rules applied. Total rules applied 211 place count 122 transition count 188
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 214 place count 122 transition count 185
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 214 place count 122 transition count 182
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 220 place count 119 transition count 182
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 223 place count 116 transition count 179
Iterating global reduction 5 with 3 rules applied. Total rules applied 226 place count 116 transition count 179
Performed 13 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 252 place count 103 transition count 165
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 256 place count 103 transition count 161
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 259 place count 102 transition count 159
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 262 place count 101 transition count 157
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 265 place count 100 transition count 155
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 267 place count 99 transition count 154
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 269 place count 97 transition count 152
Iterating global reduction 10 with 2 rules applied. Total rules applied 271 place count 97 transition count 152
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 275 place count 95 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 3 rules applied. Total rules applied 278 place count 95 transition count 147
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 11 with 3 rules applied. Total rules applied 281 place count 94 transition count 145
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 283 place count 93 transition count 144
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 13 with 5 rules applied. Total rules applied 288 place count 93 transition count 139
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 13 with 1 rules applied. Total rules applied 289 place count 93 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 290 place count 92 transition count 138
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 15 with 2 rules applied. Total rules applied 292 place count 91 transition count 137
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 293 place count 91 transition count 137
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 295 place count 89 transition count 135
Applied a total of 295 rules in 57 ms. Remains 89 /229 variables (removed 140) and now considering 135/309 (removed 174) transitions.
// Phase 1: matrix 135 rows 89 cols
[2025-05-30 11:55:38] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:55:38] [INFO ] Implicit Places using invariants in 70 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 88/229 places, 135/309 transitions.
Applied a total of 0 rules in 4 ms. Remains 88 /88 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 131 ms. Remains : 88/229 places, 135/309 transitions.
[2025-05-30 11:55:38] [INFO ] Flatten gal took : 8 ms
[2025-05-30 11:55:38] [INFO ] Flatten gal took : 4 ms
[2025-05-30 11:55:38] [INFO ] Input system was already deterministic with 135 transitions.
[2025-05-30 11:55:38] [INFO ] Flatten gal took : 3 ms
[2025-05-30 11:55:38] [INFO ] Flatten gal took : 3 ms
[2025-05-30 11:55:38] [INFO ] Time to serialize gal into /tmp/CTLFireability8755544209576567633.gal : 0 ms
[2025-05-30 11:55:38] [INFO ] Time to serialize properties into /tmp/CTLFireability15150557232328639396.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/CTLFireability8755544209576567633.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15150557232328639396.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,179361,0.023299,4696,2,304,5,2815,6,0,478,2264,0


Converting to forward existential form...Done !
original formula: E(EF(!(AF((p335==1)))) U EG(A(((p283==1) * (E((p366==1) U (p186==1)) + (p110==1))) U ((p215==1)&&(p300==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,E(TRUE U !(!(EG(!((p335==1))))))),!((E(!(((p215==1)&&(p300==1))) U (!(((p283==1) * (E((p366==1) ...257
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t40, t42, t50, t56, t134, Intersection with reachable at each step enabled. (destro...196
(forward)formula 0,0,1.12837,52544,1,0,852,289150,315,451,3271,313496,1208
FORMULA CO4-PT-08-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 309/309 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 211 transition count 280
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 211 transition count 280
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 42 place count 211 transition count 274
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 205 transition count 268
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 205 transition count 268
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 202 transition count 264
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 202 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 61 place count 202 transition count 263
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 201 transition count 262
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 201 transition count 262
Applied a total of 63 rules in 10 ms. Remains 201 /229 variables (removed 28) and now considering 262/309 (removed 47) transitions.
// Phase 1: matrix 262 rows 201 cols
[2025-05-30 11:55:40] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:55:40] [INFO ] Implicit Places using invariants in 58 ms returned [139]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/229 places, 262/309 transitions.
Applied a total of 0 rules in 2 ms. Remains 200 /200 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 81 ms. Remains : 200/229 places, 262/309 transitions.
[2025-05-30 11:55:40] [INFO ] Flatten gal took : 7 ms
[2025-05-30 11:55:40] [INFO ] Flatten gal took : 7 ms
[2025-05-30 11:55:40] [INFO ] Input system was already deterministic with 262 transitions.
[2025-05-30 11:55:40] [INFO ] Flatten gal took : 7 ms
[2025-05-30 11:55:40] [INFO ] Flatten gal took : 7 ms
[2025-05-30 11:55:40] [INFO ] Time to serialize gal into /tmp/CTLFireability5742914651729698668.gal : 2 ms
[2025-05-30 11:55:40] [INFO ] Time to serialize properties into /tmp/CTLFireability6317531479536832442.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/CTLFireability5742914651729698668.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6317531479536832442.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.49044e+07,0.10879,8024,2,1614,5,14568,6,0,1058,16877,0


Converting to forward existential form...Done !
original formula: A(EF(((EG((p244==1)) * (p285!=1)) * E(((p227==1)&&(p300==1)) U (p142==1)))) U (A(((p303==1) + EG(EX((p349==1)))) U !(EX(EG((p162==1))))) ...172
=> equivalent forward existential formula: [((Init * !(EG(!((!((E(!(!(EX(EG((p162==1))))) U (!(((p303==1) + EG(EX((p349==1))))) * !(!(EX(EG((p162==1)))))))...630
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t12, t13, t19, t28, t33, t34, t36, t37, t41, t42, t44, t50, t59, t64,...403
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2025-05-30 11:56:10] [INFO ] Flatten gal took : 19 ms
[2025-05-30 11:56:10] [INFO ] Applying decomposition
[2025-05-30 11:56:10] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11844773837721885045.txt' '-o' '/tmp/graph11844773837721885045.bin' '-w' '/tmp/graph11844773837721885045.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11844773837721885045.bin' '-l' '-1' '-v' '-w' '/tmp/graph11844773837721885045.weights' '-q' '0' '-e' '0.001'
[2025-05-30 11:56:10] [INFO ] Decomposing Gal with order
[2025-05-30 11:56:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 11:56:10] [INFO ] Removed a total of 97 redundant transitions.
[2025-05-30 11:56:10] [INFO ] Flatten gal took : 72 ms
[2025-05-30 11:56:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 14 ms.
[2025-05-30 11:56:10] [INFO ] Time to serialize gal into /tmp/CTLFireability15128339974517268117.gal : 4 ms
[2025-05-30 11:56:10] [INFO ] Time to serialize properties into /tmp/CTLFireability7381267030906924079.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/CTLFireability15128339974517268117.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7381267030906924079.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,1.49044e+07,0.073605,6548,293,51,4354,545,583,7044,75,1951,0


Converting to forward existential form...Done !
original formula: A(EF(((EG((i1.i2.u38.p244==1)) * (i7.i0.u46.p285!=1)) * E(((i3.i2.u33.p227==1)&&(i5.u52.p300==1)) U (i2.i1.u15.p142==1)))) U (A(((i8.i1.u...253
=> equivalent forward existential formula: [((Init * !(EG(!((!((E(!(!(EX(EG((i3.i0.u22.p162==1))))) U (!(((i8.i1.u53.p303==1) + EG(EX((i9.u58.p349==1))))) ...839
Reverse transition relation is NOT exact ! Due to transitions t12, t78, t91, t111, t162, t177, t211, t235, t238, t257, i0.i1.u6.t210, i1.t189, i1.t120, i1....626
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 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
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found 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
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
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 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
Fast SCC detection found an SCC at level 12
(forward)formula 0,1,3.66261,167316,1,0,313888,811,3787,690075,376,2419,306710
FORMULA CO4-PT-08-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 229/229 places, 309/309 transitions.
Graph (trivial) has 229 edges and 229 vertex of which 2 / 229 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 440 edges and 228 vertex of which 223 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 75 place count 222 transition count 227
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 76 rules applied. Total rules applied 151 place count 149 transition count 224
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 156 place count 148 transition count 220
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 160 place count 144 transition count 220
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 160 place count 144 transition count 204
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 192 place count 128 transition count 204
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 205 place count 115 transition count 180
Iterating global reduction 4 with 13 rules applied. Total rules applied 218 place count 115 transition count 180
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 223 place count 115 transition count 175
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 226 place count 114 transition count 173
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 229 place count 113 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 230 place count 112 transition count 171
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 3 Pre rules applied. Total rules applied 230 place count 112 transition count 168
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 236 place count 109 transition count 168
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 240 place count 105 transition count 163
Iterating global reduction 8 with 4 rules applied. Total rules applied 244 place count 105 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 245 place count 105 transition count 162
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 267 place count 94 transition count 151
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 4 rules applied. Total rules applied 271 place count 94 transition count 147
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 273 place count 93 transition count 146
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 275 place count 91 transition count 144
Iterating global reduction 11 with 2 rules applied. Total rules applied 277 place count 91 transition count 144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 281 place count 89 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 11 with 3 rules applied. Total rules applied 284 place count 89 transition count 139
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 12 with 3 rules applied. Total rules applied 287 place count 88 transition count 137
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 289 place count 87 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 291 place count 86 transition count 135
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 14 with 5 rules applied. Total rules applied 296 place count 86 transition count 130
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 14 with 1 rules applied. Total rules applied 297 place count 86 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 298 place count 85 transition count 129
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 16 with 2 rules applied. Total rules applied 300 place count 84 transition count 128
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 302 place count 82 transition count 126
Applied a total of 302 rules in 30 ms. Remains 82 /229 variables (removed 147) and now considering 126/309 (removed 183) transitions.
// Phase 1: matrix 126 rows 82 cols
[2025-05-30 11:56:14] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:56:14] [INFO ] Implicit Places using invariants in 49 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 81/229 places, 126/309 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 88 ms. Remains : 81/229 places, 126/309 transitions.
[2025-05-30 11:56:14] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:56:14] [INFO ] Flatten gal took : 3 ms
[2025-05-30 11:56:14] [INFO ] Input system was already deterministic with 126 transitions.
[2025-05-30 11:56:14] [INFO ] Flatten gal took : 3 ms
[2025-05-30 11:56:14] [INFO ] Flatten gal took : 3 ms
[2025-05-30 11:56:14] [INFO ] Time to serialize gal into /tmp/CTLFireability11977866679016873035.gal : 0 ms
[2025-05-30 11:56:14] [INFO ] Time to serialize properties into /tmp/CTLFireability9810804886955493531.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/CTLFireability11977866679016873035.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9810804886955493531.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,124961,0.021019,4456,2,285,5,2353,6,0,442,1940,0


Converting to forward existential form...Done !
original formula: AF(((EF((p453==0)) * (p159==1)) * (p300==1)))
=> equivalent forward existential formula: [FwdG(Init,!(((E(TRUE U (p453==0)) * (p159==1)) * (p300==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t7, t32, t41, t46, t84, Intersection with reachable at each step enabled. (destroyed/rev...189
(forward)formula 0,0,0.218546,14696,1,0,215,53022,280,148,2849,60851,323
FORMULA CO4-PT-08-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 309/309 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 210 transition count 280
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 210 transition count 280
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 210 transition count 274
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 204 transition count 268
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 204 transition count 268
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 202 transition count 265
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 202 transition count 265
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 201 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 201 transition count 264
Applied a total of 62 rules in 14 ms. Remains 201 /229 variables (removed 28) and now considering 264/309 (removed 45) transitions.
// Phase 1: matrix 264 rows 201 cols
[2025-05-30 11:56:14] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:56:14] [INFO ] Implicit Places using invariants in 74 ms returned [136]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 76 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/229 places, 264/309 transitions.
Applied a total of 0 rules in 2 ms. Remains 200 /200 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 92 ms. Remains : 200/229 places, 264/309 transitions.
[2025-05-30 11:56:14] [INFO ] Flatten gal took : 6 ms
[2025-05-30 11:56:14] [INFO ] Flatten gal took : 6 ms
[2025-05-30 11:56:14] [INFO ] Input system was already deterministic with 264 transitions.
[2025-05-30 11:56:14] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:56:14] [INFO ] Flatten gal took : 6 ms
[2025-05-30 11:56:14] [INFO ] Time to serialize gal into /tmp/CTLFireability7024011054716960076.gal : 6 ms
[2025-05-30 11:56:14] [INFO ] Time to serialize properties into /tmp/CTLFireability7080091547007322090.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/CTLFireability7024011054716960076.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7080091547007322090.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.1569e+07,0.084713,7124,2,1472,5,11362,6,0,1060,12747,0


Converting to forward existential form...Done !
original formula: EF(AX(AG(EF((p388==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(E(TRUE U !(E(TRUE U (p388==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t12, t19, t28, t33, t34, t36, t37, t41, t42, t46, t47, t55, t64, t69,...392
(forward)formula 0,1,1.73922,76800,1,0,417,359953,549,251,6180,353737,599
FORMULA CO4-PT-08-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 229/229 places, 309/309 transitions.
Graph (trivial) has 235 edges and 229 vertex of which 2 / 229 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 440 edges and 228 vertex of which 223 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 78 place count 222 transition count 224
Reduce places removed 76 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 79 rules applied. Total rules applied 157 place count 146 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 158 place count 145 transition count 221
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 158 place count 145 transition count 204
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 192 place count 128 transition count 204
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 204 place count 116 transition count 181
Iterating global reduction 3 with 12 rules applied. Total rules applied 216 place count 116 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 219 place count 116 transition count 178
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 219 place count 116 transition count 175
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 225 place count 113 transition count 175
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 228 place count 110 transition count 172
Iterating global reduction 4 with 3 rules applied. Total rules applied 231 place count 110 transition count 172
Performed 13 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 257 place count 97 transition count 158
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 262 place count 97 transition count 153
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 265 place count 96 transition count 151
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 268 place count 95 transition count 149
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 271 place count 94 transition count 147
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 273 place count 93 transition count 146
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 275 place count 91 transition count 144
Iterating global reduction 9 with 2 rules applied. Total rules applied 277 place count 91 transition count 144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 281 place count 89 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 3 rules applied. Total rules applied 284 place count 89 transition count 139
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 286 place count 88 transition count 138
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 291 place count 88 transition count 133
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 11 with 1 rules applied. Total rules applied 292 place count 88 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 293 place count 87 transition count 132
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 13 with 2 rules applied. Total rules applied 295 place count 86 transition count 131
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 297 place count 84 transition count 129
Applied a total of 297 rules in 29 ms. Remains 84 /229 variables (removed 145) and now considering 129/309 (removed 180) transitions.
// Phase 1: matrix 129 rows 84 cols
[2025-05-30 11:56:16] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:56:16] [INFO ] Implicit Places using invariants in 45 ms returned [60]
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 : 83/229 places, 129/309 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 129/129 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 78 ms. Remains : 83/229 places, 129/309 transitions.
[2025-05-30 11:56:16] [INFO ] Flatten gal took : 4 ms
[2025-05-30 11:56:16] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:56:16] [INFO ] Input system was already deterministic with 129 transitions.
[2025-05-30 11:56:16] [INFO ] Flatten gal took : 4 ms
[2025-05-30 11:56:16] [INFO ] Flatten gal took : 2 ms
[2025-05-30 11:56:16] [INFO ] Time to serialize gal into /tmp/CTLFireability10786076024963572325.gal : 1 ms
[2025-05-30 11:56:16] [INFO ] Time to serialize properties into /tmp/CTLFireability18262368296265799779.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/CTLFireability10786076024963572325.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18262368296265799779.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,116929,0.022074,4604,2,291,5,2587,6,0,453,2159,0


Converting to forward existential form...Done !
original formula: (AF((p347==1)) + AG((p257==1)))
=> equivalent forward existential formula: [(FwdU((Init * !(!(EG(!((p347==1)))))),TRUE) * !((p257==1)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t36, t44, t49, t64, Intersection with reachable at each step enabled. (destroyed/re...190
(forward)formula 0,0,0.365822,21768,1,0,448,103064,283,233,2813,104487,661
FORMULA CO4-PT-08-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 309/309 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 211 transition count 280
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 211 transition count 280
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 41 place count 211 transition count 275
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 205 transition count 269
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 205 transition count 269
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 203 transition count 266
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 203 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 203 transition count 265
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 202 transition count 264
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 202 transition count 264
Applied a total of 60 rules in 8 ms. Remains 202 /229 variables (removed 27) and now considering 264/309 (removed 45) transitions.
// Phase 1: matrix 264 rows 202 cols
[2025-05-30 11:56:17] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:56:17] [INFO ] Implicit Places using invariants in 58 ms returned [140]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 201/229 places, 264/309 transitions.
Applied a total of 0 rules in 2 ms. Remains 201 /201 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 69 ms. Remains : 201/229 places, 264/309 transitions.
[2025-05-30 11:56:17] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:56:17] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:56:17] [INFO ] Input system was already deterministic with 264 transitions.
[2025-05-30 11:56:17] [INFO ] Flatten gal took : 4 ms
[2025-05-30 11:56:17] [INFO ] Flatten gal took : 6 ms
[2025-05-30 11:56:17] [INFO ] Time to serialize gal into /tmp/CTLFireability14970800594441198234.gal : 1 ms
[2025-05-30 11:56:17] [INFO ] Time to serialize properties into /tmp/CTLFireability6868302753975667807.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/CTLFireability14970800594441198234.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6868302753975667807.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,1.0684e+07,0.091239,7520,2,1560,5,12929,6,0,1063,13584,0


Converting to forward existential form...Done !
original formula: EX(AG(E(((p183==1) + EF((((p302==1)&&(p357==1))&&(p457==1)))) U EG(AG((p99==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(((p183==1) + E(TRUE U (((p302==1)&&(p357==1))&&(p457==1)))) U EG(!(E(TRUE U !((p99==...176
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t12, t19, t28, t33, t34, t36, t37, t41, t42, t50, t59, t64, t65, t67,...388
(forward)formula 0,0,2.18897,90172,1,0,447,429867,562,250,6189,417486,630
FORMULA CO4-PT-08-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 309/309 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 209 transition count 278
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 209 transition count 278
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 46 place count 209 transition count 272
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 53 place count 202 transition count 265
Iterating global reduction 1 with 7 rules applied. Total rules applied 60 place count 202 transition count 265
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 199 transition count 261
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 199 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 67 place count 199 transition count 260
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 198 transition count 259
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 198 transition count 259
Applied a total of 69 rules in 9 ms. Remains 198 /229 variables (removed 31) and now considering 259/309 (removed 50) transitions.
// Phase 1: matrix 259 rows 198 cols
[2025-05-30 11:56:19] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:56:19] [INFO ] Implicit Places using invariants in 66 ms returned [136]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 197/229 places, 259/309 transitions.
Applied a total of 0 rules in 2 ms. Remains 197 /197 variables (removed 0) and now considering 259/259 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 78 ms. Remains : 197/229 places, 259/309 transitions.
[2025-05-30 11:56:19] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:56:19] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:56:19] [INFO ] Input system was already deterministic with 259 transitions.
[2025-05-30 11:56:19] [INFO ] Flatten gal took : 15 ms
[2025-05-30 11:56:19] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:56:19] [INFO ] Time to serialize gal into /tmp/CTLFireability9776939568180940905.gal : 1 ms
[2025-05-30 11:56:19] [INFO ] Time to serialize properties into /tmp/CTLFireability18241431521520682806.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/CTLFireability9776939568180940905.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18241431521520682806.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,1.03512e+07,0.088936,7388,2,1527,5,12482,6,0,1043,13510,0


Converting to forward existential form...Done !
original formula: EX(E(EF((p346==1)) U (EF((p218==1)) + (p242==1))))
=> equivalent forward existential formula: ([(FwdU(FwdU(EY(Init),E(TRUE U (p346==1))),TRUE) * (p218==1))] != FALSE + [(FwdU(EY(Init),E(TRUE U (p346==1))) *...177
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t12, t19, t28, t33, t34, t36, t37, t41, t42, t50, t59, t64, t65, t67,...382
(forward)formula 0,1,7.31436,259804,1,0,655,1.0472e+06,545,413,6449,1.90046e+06,839
FORMULA CO4-PT-08-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2025-05-30 11:56:26] [INFO ] Flatten gal took : 6 ms
[2025-05-30 11:56:26] [INFO ] Flatten gal took : 6 ms
Total runtime 87887 ms.

BK_STOP 1748606186989

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="CO4-PT-08"
export BK_EXAMINATION="CTLFireability"
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 CO4-PT-08, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r044-tall-174854028400434"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-08.tgz
mv CO4-PT-08 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;