Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K 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.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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.6K 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 144K 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 NoC3x3-PT-4A-CTLFireability-2023-12
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2023-13
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2023-14
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2023-15
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2025-00
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2025-01
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2025-02
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2025-03
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2025-04
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2025-05
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2025-06
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2025-07
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2025-08
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2025-09
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2025-10
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748822014129

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-4A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-01 23:53:35] [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-06-01 23:53:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 23:53:35] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2025-06-01 23:53:35] [INFO ] Transformed 293 places.
[2025-06-01 23:53:35] [INFO ] Transformed 608 transitions.
[2025-06-01 23:53:35] [INFO ] Found NUPN structural information;
[2025-06-01 23:53:35] [INFO ] Parsed PT model containing 293 places and 608 transitions and 1905 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Ensure Unique test removed 155 transitions
Reduce redundant transitions removed 155 transitions.
Support contains 109 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 453/453 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 253 transition count 395
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 253 transition count 395
Drop transitions (Redundant composition of simpler transitions.) removed 54 transitions
Redundant transition composition rules discarded 54 transitions
Iterating global reduction 0 with 54 rules applied. Total rules applied 134 place count 253 transition count 341
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 141 place count 246 transition count 341
Applied a total of 141 rules in 55 ms. Remains 246 /293 variables (removed 47) and now considering 341/453 (removed 112) transitions.
// Phase 1: matrix 341 rows 246 cols
[2025-06-01 23:53:35] [INFO ] Computed 59 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:53:35] [INFO ] Implicit Places using invariants in 302 ms returned []
[2025-06-01 23:53:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:53:36] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
Running 340 sub problems to find dead transitions.
[2025-06-01 23:53:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (OVERLAPS) 1/244 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (OVERLAPS) 2/246 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (OVERLAPS) 341/587 variables, 246/305 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/587 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 7 (OVERLAPS) 0/587 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 340 unsolved
No progress, stopping.
After SMT solving in domain Real declared 587/587 variables, and 305 constraints, problems are : Problem set: 0 solved, 340 unsolved in 24865 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 340 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (OVERLAPS) 1/244 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (OVERLAPS) 2/246 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (OVERLAPS) 341/587 variables, 246/305 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/587 variables, 340/645 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/587 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 8 (OVERLAPS) 0/587 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 340 unsolved
No progress, stopping.
After SMT solving in domain Int declared 587/587 variables, and 645 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54991ms problems are : Problem set: 0 solved, 340 unsolved
Search for dead transitions found 0 dead transitions in 55005ms
Starting structural reductions in LTL mode, iteration 1 : 246/293 places, 341/453 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55648 ms. Remains : 246/293 places, 341/453 transitions.
Support contains 109 out of 246 places after structural reductions.
[2025-06-01 23:54:31] [INFO ] Flatten gal took : 83 ms
[2025-06-01 23:54:31] [INFO ] Flatten gal took : 40 ms
[2025-06-01 23:54:31] [INFO ] Input system was already deterministic with 341 transitions.
RANDOM walk for 40000 steps (8 resets) in 2677 ms. (14 steps per ms) remains 4/80 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
[2025-06-01 23:54:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 26/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 214/246 variables, 53/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 341/587 variables, 246/305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/587 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/587 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 587/587 variables, and 305 constraints, problems are : Problem set: 0 solved, 3 unsolved in 538 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 26/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 214/246 variables, 53/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 341/587 variables, 246/305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/587 variables, 3/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/587 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/587 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 587/587 variables, and 308 constraints, problems are : Problem set: 0 solved, 3 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 892ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 262 steps, including 6 resets, run visited all 3 properties in 6 ms. (steps per millisecond=43 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 9 ms.
[2025-06-01 23:54:33] [INFO ] Flatten gal took : 20 ms
[2025-06-01 23:54:33] [INFO ] Flatten gal took : 19 ms
[2025-06-01 23:54:33] [INFO ] Input system was already deterministic with 341 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Graph (complete) has 807 edges and 246 vertex of which 244 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 246/246 places, 341/341 transitions.
Graph (trivial) has 109 edges and 246 vertex of which 60 / 246 are part of one of the 27 SCC in 1 ms
Free SCC test removed 33 places
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Graph (complete) has 742 edges and 213 vertex of which 211 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 15 place count 198 transition count 263
Iterating global reduction 0 with 13 rules applied. Total rules applied 28 place count 198 transition count 263
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 198 transition count 257
Applied a total of 34 rules in 38 ms. Remains 198 /246 variables (removed 48) and now considering 257/341 (removed 84) transitions.
[2025-06-01 23:54:33] [INFO ] Flow matrix only has 231 transitions (discarded 26 similar events)
// Phase 1: matrix 231 rows 198 cols
[2025-06-01 23:54:33] [INFO ] Computed 57 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:54:34] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-06-01 23:54:34] [INFO ] Flow matrix only has 231 transitions (discarded 26 similar events)
[2025-06-01 23:54:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:54:34] [INFO ] State equation strengthened by 79 read => feed constraints.
[2025-06-01 23:54:34] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 23:54:34] [INFO ] Redundant transitions in 15 ms returned []
Running 256 sub problems to find dead transitions.
[2025-06-01 23:54:34] [INFO ] Flow matrix only has 231 transitions (discarded 26 similar events)
[2025-06-01 23:54:34] [INFO ] Invariant cache hit.
[2025-06-01 23:54:34] [INFO ] State equation strengthened by 79 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 230/428 variables, 198/255 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 78/333 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 1/429 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/429 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (OVERLAPS) 0/429 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 334 constraints, problems are : Problem set: 0 solved, 256 unsolved in 18077 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 198/198 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 230/428 variables, 198/255 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 78/333 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 256/589 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 1/429 variables, 1/590 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/429 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (OVERLAPS) 0/429 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Int declared 429/429 variables, and 590 constraints, problems are : Problem set: 0 solved, 256 unsolved in 21374 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 198/198 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39491ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 39493ms
Starting structural reductions in SI_CTL mode, iteration 1 : 198/246 places, 257/341 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39904 ms. Remains : 198/246 places, 257/341 transitions.
[2025-06-01 23:55:13] [INFO ] Flatten gal took : 18 ms
[2025-06-01 23:55:13] [INFO ] Flatten gal took : 11 ms
[2025-06-01 23:55:13] [INFO ] Input system was already deterministic with 257 transitions.
[2025-06-01 23:55:13] [INFO ] Flatten gal took : 11 ms
[2025-06-01 23:55:13] [INFO ] Flatten gal took : 11 ms
[2025-06-01 23:55:13] [INFO ] Time to serialize gal into /tmp/CTLFireability927906934408565457.gal : 6 ms
[2025-06-01 23:55:13] [INFO ] Time to serialize properties into /tmp/CTLFireability13425858269584150137.ctl : 8 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/CTLFireability927906934408565457.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13425858269584150137.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.49984e+26,0.347594,17744,2,536,5,73974,6,0,1012,72721,0


Converting to forward existential form...Done !
original formula: !(E(A(((A((p114==1) U ((p255==1)&&(p266==1))) * (p285==1)) * EG((((p239==1)&&(p266==1))||(p230==1)))) U EG((EG(((p60==1)&&(p75==1))) + ((...290
=> equivalent forward existential formula: [(FwdU(FwdU(Init,!((E(!(EG((EG(((p60==1)&&(p75==1))) + (((p48==1)&&(p11==1))&&(p55==1))))) U (!(((!((E(!(((p255=...583
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 250/6/7
Detected timeout of ITS tools.
[2025-06-01 23:55:44] [INFO ] Flatten gal took : 12 ms
[2025-06-01 23:55:44] [INFO ] Applying decomposition
[2025-06-01 23:55:44] [INFO ] Flatten gal took : 18 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/graph12348776270406930376.txt' '-o' '/tmp/graph12348776270406930376.bin' '-w' '/tmp/graph12348776270406930376.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12348776270406930376.bin' '-l' '-1' '-v' '-w' '/tmp/graph12348776270406930376.weights' '-q' '0' '-e' '0.001'
[2025-06-01 23:55:44] [INFO ] Decomposing Gal with order
[2025-06-01 23:55:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 23:55:44] [INFO ] Removed a total of 64 redundant transitions.
[2025-06-01 23:55:44] [INFO ] Flatten gal took : 111 ms
[2025-06-01 23:55:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 15 ms.
[2025-06-01 23:55:44] [INFO ] Time to serialize gal into /tmp/CTLFireability14140793650586783818.gal : 16 ms
[2025-06-01 23:55:44] [INFO ] Time to serialize properties into /tmp/CTLFireability14987168864230410723.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/CTLFireability14140793650586783818.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14987168864230410723.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.49984e+26,0.096257,8240,229,45,9908,537,577,9885,81,1916,0


Converting to forward existential form...Done !
original formula: !(E(A(((A((i3.u20.p114==1) U ((i7.u42.p255==1)&&(i7.u46.p266==1))) * (i8.u48.p285==1)) * EG((((i7.u40.p239==1)&&(i7.u46.p266==1))||(i6.u3...428
=> equivalent forward existential formula: [(FwdU(FwdU(Init,!((E(!(EG((EG(((i2.u13.p60==1)&&(i2.u13.p75==1))) + (((i1.u8.p48==1)&&(i0.i1.u4.p11==1))&&(i1.u...821
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 341/341 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 245 transition count 341
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 229 transition count 325
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 229 transition count 325
Applied a total of 33 rules in 10 ms. Remains 229 /246 variables (removed 17) and now considering 325/341 (removed 16) transitions.
// Phase 1: matrix 325 rows 229 cols
[2025-06-01 23:56:14] [INFO ] Computed 58 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:56:14] [INFO ] Implicit Places using invariants in 115 ms returned []
[2025-06-01 23:56:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:56:14] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2025-06-01 23:56:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 1/229 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 325/554 variables, 229/287 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (OVERLAPS) 0/554 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 554/554 variables, and 287 constraints, problems are : Problem set: 0 solved, 324 unsolved in 21018 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 1/229 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 325/554 variables, 229/287 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 324/611 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/554 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 8 (OVERLAPS) 0/554 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Int declared 554/554 variables, and 611 constraints, problems are : Problem set: 0 solved, 324 unsolved in 27253 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48332ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 48334ms
Starting structural reductions in LTL mode, iteration 1 : 229/246 places, 325/341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48661 ms. Remains : 229/246 places, 325/341 transitions.
[2025-06-01 23:57:03] [INFO ] Flatten gal took : 13 ms
[2025-06-01 23:57:03] [INFO ] Flatten gal took : 12 ms
[2025-06-01 23:57:03] [INFO ] Input system was already deterministic with 325 transitions.
[2025-06-01 23:57:03] [INFO ] Flatten gal took : 11 ms
[2025-06-01 23:57:03] [INFO ] Flatten gal took : 11 ms
[2025-06-01 23:57:03] [INFO ] Time to serialize gal into /tmp/CTLFireability16522252333786506530.gal : 3 ms
[2025-06-01 23:57:03] [INFO ] Time to serialize properties into /tmp/CTLFireability14694677583725865830.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/CTLFireability16522252333786506530.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14694677583725865830.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.36774e+33,0.343488,17908,2,626,5,69448,6,0,1240,78743,0


Converting to forward existential form...Done !
original formula: AG(AX(!(E(((EF(((p221==1)&&(p225==1))) + (p113==1)) + ((p12==1)&&(p20==1))) U ((p278==1)&&(p284==1))))))
=> equivalent forward existential formula: [(FwdU(EY(FwdU(Init,TRUE)),((E(TRUE U ((p221==1)&&(p225==1))) + (p113==1)) + ((p12==1)&&(p20==1)))) * ((p278==1)...177
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-01 23:57:33] [INFO ] Flatten gal took : 13 ms
[2025-06-01 23:57:33] [INFO ] Applying decomposition
[2025-06-01 23:57:33] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4171335986516382133.txt' '-o' '/tmp/graph4171335986516382133.bin' '-w' '/tmp/graph4171335986516382133.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4171335986516382133.bin' '-l' '-1' '-v' '-w' '/tmp/graph4171335986516382133.weights' '-q' '0' '-e' '0.001'
[2025-06-01 23:57:33] [INFO ] Decomposing Gal with order
[2025-06-01 23:57:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 23:57:33] [INFO ] Removed a total of 86 redundant transitions.
[2025-06-01 23:57:33] [INFO ] Flatten gal took : 20 ms
[2025-06-01 23:57:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2025-06-01 23:57:33] [INFO ] Time to serialize gal into /tmp/CTLFireability18371024555305793382.gal : 3 ms
[2025-06-01 23:57:33] [INFO ] Time to serialize properties into /tmp/CTLFireability7264920880688424432.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/CTLFireability18371024555305793382.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7264920880688424432.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.36774e+33,0.094023,7352,105,29,6752,493,495,9041,67,2458,0


Converting to forward existential form...Done !
original formula: AG(AX(!(E(((EF(((i0.i0.u40.p221==1)&&(i6.u42.p225==1))) + (i3.u21.p113==1)) + ((i0.i1.u1.p12==1)&&(i0.i0.u4.p20==1))) U ((i8.u52.p278==1)...178
=> equivalent forward existential formula: [(FwdU(EY(FwdU(Init,TRUE)),((E(TRUE U ((i0.i0.u40.p221==1)&&(i6.u42.p225==1))) + (i3.u21.p113==1)) + ((i0.i1.u1....233
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 341/341 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 244 transition count 341
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 18 place count 228 transition count 325
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 228 transition count 325
Applied a total of 34 rules in 8 ms. Remains 228 /246 variables (removed 18) and now considering 325/341 (removed 16) transitions.
// Phase 1: matrix 325 rows 228 cols
[2025-06-01 23:58:03] [INFO ] Computed 57 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:58:03] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-01 23:58:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:58:03] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2025-06-01 23:58:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 285 constraints, problems are : Problem set: 0 solved, 324 unsolved in 17436 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 324/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (OVERLAPS) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 609 constraints, problems are : Problem set: 0 solved, 324 unsolved in 23371 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40838ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 40839ms
Starting structural reductions in LTL mode, iteration 1 : 228/246 places, 325/341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41133 ms. Remains : 228/246 places, 325/341 transitions.
[2025-06-01 23:58:44] [INFO ] Flatten gal took : 10 ms
[2025-06-01 23:58:44] [INFO ] Flatten gal took : 19 ms
[2025-06-01 23:58:44] [INFO ] Input system was already deterministic with 325 transitions.
[2025-06-01 23:58:44] [INFO ] Flatten gal took : 14 ms
[2025-06-01 23:58:44] [INFO ] Flatten gal took : 9 ms
[2025-06-01 23:58:44] [INFO ] Time to serialize gal into /tmp/CTLFireability45975778692034009.gal : 2 ms
[2025-06-01 23:58:44] [INFO ] Time to serialize properties into /tmp/CTLFireability11312994185338244206.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/CTLFireability45975778692034009.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11312994185338244206.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.36774e+33,0.444618,17904,2,624,5,69292,6,0,1239,78552,0


Converting to forward existential form...Done !
original formula: E((p48==1) U AF(AX(E((p204!=1) U EX((p263==1))))))
=> equivalent forward existential formula: [(FwdU(Init,(p48==1)) * !(EG(!(!(EX(!(E((p204!=1) U EX((p263==1))))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 316/0/9
Detected timeout of ITS tools.
[2025-06-01 23:59:14] [INFO ] Flatten gal took : 9 ms
[2025-06-01 23:59:14] [INFO ] Applying decomposition
[2025-06-01 23:59:14] [INFO ] Flatten gal took : 21 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/graph16857279605692021996.txt' '-o' '/tmp/graph16857279605692021996.bin' '-w' '/tmp/graph16857279605692021996.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16857279605692021996.bin' '-l' '-1' '-v' '-w' '/tmp/graph16857279605692021996.weights' '-q' '0' '-e' '0.001'
[2025-06-01 23:59:14] [INFO ] Decomposing Gal with order
[2025-06-01 23:59:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 23:59:14] [INFO ] Removed a total of 84 redundant transitions.
[2025-06-01 23:59:14] [INFO ] Flatten gal took : 33 ms
[2025-06-01 23:59:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 10 ms.
[2025-06-01 23:59:14] [INFO ] Time to serialize gal into /tmp/CTLFireability5630663850117417213.gal : 4 ms
[2025-06-01 23:59:14] [INFO ] Time to serialize properties into /tmp/CTLFireability10064303180006542740.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/CTLFireability5630663850117417213.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10064303180006542740.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.36774e+33,0.091034,7408,115,32,7572,532,473,9073,68,2441,0


Converting to forward existential form...Done !
original formula: E((i1.u7.p48==1) U AF(AX(E((i5.u37.p204!=1) U EX((i7.u47.p263==1))))))
=> equivalent forward existential formula: [(FwdU(Init,(i1.u7.p48==1)) * !(EG(!(!(EX(!(E((i5.u37.p204!=1) U EX((i7.u47.p263==1))))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 246/246 places, 341/341 transitions.
Graph (trivial) has 116 edges and 246 vertex of which 61 / 246 are part of one of the 27 SCC in 0 ms
Free SCC test removed 34 places
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Graph (complete) has 740 edges and 212 vertex of which 210 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 16 place count 196 transition count 260
Iterating global reduction 0 with 14 rules applied. Total rules applied 30 place count 196 transition count 260
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 196 transition count 254
Applied a total of 36 rules in 27 ms. Remains 196 /246 variables (removed 50) and now considering 254/341 (removed 87) transitions.
[2025-06-01 23:59:45] [INFO ] Flow matrix only has 228 transitions (discarded 26 similar events)
// Phase 1: matrix 228 rows 196 cols
[2025-06-01 23:59:45] [INFO ] Computed 57 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:59:45] [INFO ] Implicit Places using invariants in 158 ms returned []
[2025-06-01 23:59:45] [INFO ] Flow matrix only has 228 transitions (discarded 26 similar events)
[2025-06-01 23:59:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:59:45] [INFO ] State equation strengthened by 87 read => feed constraints.
[2025-06-01 23:59:45] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 23:59:45] [INFO ] Redundant transitions in 3 ms returned []
Running 253 sub problems to find dead transitions.
[2025-06-01 23:59:45] [INFO ] Flow matrix only has 228 transitions (discarded 26 similar events)
[2025-06-01 23:59:45] [INFO ] Invariant cache hit.
[2025-06-01 23:59:45] [INFO ] State equation strengthened by 87 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (OVERLAPS) 227/423 variables, 196/253 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 86/339 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 1/424 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (OVERLAPS) 0/424 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 340 constraints, problems are : Problem set: 0 solved, 253 unsolved in 14840 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 196/196 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (OVERLAPS) 227/423 variables, 196/253 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 86/339 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 253/592 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (OVERLAPS) 1/424 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (OVERLAPS) 0/424 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 593 constraints, problems are : Problem set: 0 solved, 253 unsolved in 19380 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 196/196 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34265ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 34265ms
Starting structural reductions in SI_CTL mode, iteration 1 : 196/246 places, 254/341 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34853 ms. Remains : 196/246 places, 254/341 transitions.
[2025-06-02 00:00:19] [INFO ] Flatten gal took : 6 ms
[2025-06-02 00:00:19] [INFO ] Flatten gal took : 6 ms
[2025-06-02 00:00:19] [INFO ] Input system was already deterministic with 254 transitions.
[2025-06-02 00:00:19] [INFO ] Flatten gal took : 7 ms
[2025-06-02 00:00:19] [INFO ] Flatten gal took : 6 ms
[2025-06-02 00:00:19] [INFO ] Time to serialize gal into /tmp/CTLFireability13069804457027313862.gal : 1 ms
[2025-06-02 00:00:19] [INFO ] Time to serialize properties into /tmp/CTLFireability615430309828557946.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/CTLFireability13069804457027313862.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability615430309828557946.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,2.70827e+26,0.29879,16232,2,530,5,65508,6,0,999,63231,0


Converting to forward existential form...Done !
original formula: EF(AG(A((p288==1) U (((E(((p128==1)&&(p157==1)) U ((p208==1)&&(p223==1))) * A((p82==1) U (p58==1))) * ((!((p7==1)&&(p18==1)))&&(p196==1))...185
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!((E(!((((E(((p128==1)&&(p157==1)) U ((p208==1)&&(p223==1))) * !((E(!((p58==1))...701
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 248/0/6
Hit Full ! (commute/partial/dont) 243/10/11
Detected timeout of ITS tools.
[2025-06-02 00:00:50] [INFO ] Flatten gal took : 12 ms
[2025-06-02 00:00:50] [INFO ] Applying decomposition
[2025-06-02 00:00:50] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12098119800075624840.txt' '-o' '/tmp/graph12098119800075624840.bin' '-w' '/tmp/graph12098119800075624840.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12098119800075624840.bin' '-l' '-1' '-v' '-w' '/tmp/graph12098119800075624840.weights' '-q' '0' '-e' '0.001'
[2025-06-02 00:00:50] [INFO ] Decomposing Gal with order
[2025-06-02 00:00:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 00:00:50] [INFO ] Removed a total of 62 redundant transitions.
[2025-06-02 00:00:50] [INFO ] Flatten gal took : 20 ms
[2025-06-02 00:00:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 4 ms.
[2025-06-02 00:00:50] [INFO ] Time to serialize gal into /tmp/CTLFireability6540039925784819465.gal : 3 ms
[2025-06-02 00:00:50] [INFO ] Time to serialize properties into /tmp/CTLFireability6022315021391851589.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/CTLFireability6540039925784819465.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6022315021391851589.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.70827e+26,0.091314,7668,212,48,8738,549,527,8377,87,1920,0


Converting to forward existential form...Done !
original formula: EF(AG(A((i8.u49.p288==1) U (((E(((i4.u23.p128==1)&&(i4.u26.p157==1)) U ((i6.u38.p208==1)&&(i6.u38.p223==1))) * A((i2.u15.p82==1) U (i1.u1...267
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!((E(!((((E(((i4.u23.p128==1)&&(i4.u26.p157==1)) U ((i6.u38.p208==1)&&(i6.u38.p...975
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 341/341 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 244 transition count 341
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 18 place count 228 transition count 325
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 228 transition count 325
Applied a total of 34 rules in 12 ms. Remains 228 /246 variables (removed 18) and now considering 325/341 (removed 16) transitions.
// Phase 1: matrix 325 rows 228 cols
[2025-06-02 00:01:20] [INFO ] Computed 57 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:01:20] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-02 00:01:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:01:20] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2025-06-02 00:01:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 285 constraints, problems are : Problem set: 0 solved, 324 unsolved in 17519 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 324/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (OVERLAPS) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 609 constraints, problems are : Problem set: 0 solved, 324 unsolved in 22621 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40181ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 40182ms
Starting structural reductions in LTL mode, iteration 1 : 228/246 places, 325/341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40463 ms. Remains : 228/246 places, 325/341 transitions.
[2025-06-02 00:02:00] [INFO ] Flatten gal took : 8 ms
[2025-06-02 00:02:00] [INFO ] Flatten gal took : 7 ms
[2025-06-02 00:02:00] [INFO ] Input system was already deterministic with 325 transitions.
[2025-06-02 00:02:00] [INFO ] Flatten gal took : 8 ms
[2025-06-02 00:02:00] [INFO ] Flatten gal took : 24 ms
[2025-06-02 00:02:00] [INFO ] Time to serialize gal into /tmp/CTLFireability11013519167360970261.gal : 1 ms
[2025-06-02 00:02:00] [INFO ] Time to serialize properties into /tmp/CTLFireability10208977344509306232.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/CTLFireability11013519167360970261.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10208977344509306232.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.36774e+33,0.389014,17904,2,624,5,69292,6,0,1239,78552,0


Converting to forward existential form...Done !
original formula: EX(A((p56==1) U AG(((!(AF((p74==1))) + AG((p264==1))) + ((p21==1)&&(p51==1))))))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(!(E(TRUE U !(((!(!(EG(!((p74==1))))) + !(E(TRUE U !((p264==1))))) + ((p21==1)&&(p51==1)))))...389
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-02 00:02:30] [INFO ] Flatten gal took : 12 ms
[2025-06-02 00:02:30] [INFO ] Applying decomposition
[2025-06-02 00:02:30] [INFO ] Flatten gal took : 8 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/graph7081190444698830972.txt' '-o' '/tmp/graph7081190444698830972.bin' '-w' '/tmp/graph7081190444698830972.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7081190444698830972.bin' '-l' '-1' '-v' '-w' '/tmp/graph7081190444698830972.weights' '-q' '0' '-e' '0.001'
[2025-06-02 00:02:30] [INFO ] Decomposing Gal with order
[2025-06-02 00:02:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 00:02:30] [INFO ] Removed a total of 88 redundant transitions.
[2025-06-02 00:02:30] [INFO ] Flatten gal took : 29 ms
[2025-06-02 00:02:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2025-06-02 00:02:31] [INFO ] Time to serialize gal into /tmp/CTLFireability7435227616331773565.gal : 2 ms
[2025-06-02 00:02:31] [INFO ] Time to serialize properties into /tmp/CTLFireability364466015755902155.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/CTLFireability7435227616331773565.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability364466015755902155.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.36774e+33,0.100898,8236,128,82,8379,1476,487,11570,99,5000,0


Converting to forward existential form...Done !
original formula: EX(A((i1.u11.p56==1) U AG(((!(AF((i2.u14.p74==1))) + AG((i7.u47.p264==1))) + ((i0.u4.p21==1)&&(i1.u9.p51==1))))))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(!(E(TRUE U !(((!(!(EG(!((i2.u14.p74==1))))) + !(E(TRUE U !((i7.u47.p264==1))))) + ((i0.u4.p...474
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 246/246 places, 341/341 transitions.
Graph (trivial) has 134 edges and 246 vertex of which 72 / 246 are part of one of the 32 SCC in 1 ms
Free SCC test removed 40 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Graph (complete) has 728 edges and 206 vertex of which 204 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 18 place count 188 transition count 246
Iterating global reduction 0 with 16 rules applied. Total rules applied 34 place count 188 transition count 246
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 35 place count 188 transition count 245
Applied a total of 35 rules in 28 ms. Remains 188 /246 variables (removed 58) and now considering 245/341 (removed 96) transitions.
[2025-06-02 00:03:01] [INFO ] Flow matrix only has 214 transitions (discarded 31 similar events)
// Phase 1: matrix 214 rows 188 cols
[2025-06-02 00:03:01] [INFO ] Computed 57 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:03:01] [INFO ] Implicit Places using invariants in 121 ms returned []
[2025-06-02 00:03:01] [INFO ] Flow matrix only has 214 transitions (discarded 31 similar events)
[2025-06-02 00:03:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:03:01] [INFO ] State equation strengthened by 99 read => feed constraints.
[2025-06-02 00:03:01] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 00:03:01] [INFO ] Redundant transitions in 3 ms returned []
Running 244 sub problems to find dead transitions.
[2025-06-02 00:03:01] [INFO ] Flow matrix only has 214 transitions (discarded 31 similar events)
[2025-06-02 00:03:01] [INFO ] Invariant cache hit.
[2025-06-02 00:03:01] [INFO ] State equation strengthened by 99 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (OVERLAPS) 1/188 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 213/401 variables, 188/245 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 98/343 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (OVERLAPS) 1/402 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (OVERLAPS) 0/402 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 344 constraints, problems are : Problem set: 0 solved, 244 unsolved in 13693 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 188/188 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (OVERLAPS) 1/188 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 213/401 variables, 188/245 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 98/343 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 244/587 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (OVERLAPS) 1/402 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 9 (OVERLAPS) 0/402 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Int declared 402/402 variables, and 588 constraints, problems are : Problem set: 0 solved, 244 unsolved in 17634 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 188/188 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31367ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 31367ms
Starting structural reductions in SI_CTL mode, iteration 1 : 188/246 places, 245/341 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31814 ms. Remains : 188/246 places, 245/341 transitions.
[2025-06-02 00:03:32] [INFO ] Flatten gal took : 5 ms
[2025-06-02 00:03:32] [INFO ] Flatten gal took : 6 ms
[2025-06-02 00:03:32] [INFO ] Input system was already deterministic with 245 transitions.
[2025-06-02 00:03:32] [INFO ] Flatten gal took : 5 ms
[2025-06-02 00:03:32] [INFO ] Flatten gal took : 8 ms
[2025-06-02 00:03:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18075585517694665054.gal : 1 ms
[2025-06-02 00:03:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3677215012792702334.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18075585517694665054.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3677215012792702334.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 721 steps (0 resets) in 23 ms. (30 steps per ms) remains 0/1 properties
FORMULA NoC3x3-PT-4A-CTLFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 246/246 places, 341/341 transitions.
Graph (trivial) has 124 edges and 246 vertex of which 65 / 246 are part of one of the 28 SCC in 0 ms
Free SCC test removed 37 places
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Graph (complete) has 734 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 18 place count 192 transition count 252
Iterating global reduction 0 with 16 rules applied. Total rules applied 34 place count 192 transition count 252
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 192 transition count 248
Applied a total of 38 rules in 33 ms. Remains 192 /246 variables (removed 54) and now considering 248/341 (removed 93) transitions.
[2025-06-02 00:03:33] [INFO ] Flow matrix only has 221 transitions (discarded 27 similar events)
// Phase 1: matrix 221 rows 192 cols
[2025-06-02 00:03:33] [INFO ] Computed 58 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:03:33] [INFO ] Implicit Places using invariants in 260 ms returned []
[2025-06-02 00:03:33] [INFO ] Flow matrix only has 221 transitions (discarded 27 similar events)
[2025-06-02 00:03:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:03:33] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 00:03:33] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 00:03:33] [INFO ] Redundant transitions in 2 ms returned []
Running 247 sub problems to find dead transitions.
[2025-06-02 00:03:33] [INFO ] Flow matrix only has 221 transitions (discarded 27 similar events)
[2025-06-02 00:03:33] [INFO ] Invariant cache hit.
[2025-06-02 00:03:33] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (OVERLAPS) 1/192 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (OVERLAPS) 220/412 variables, 192/250 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 93/343 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 8 (OVERLAPS) 1/413 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 10 (OVERLAPS) 0/413 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 344 constraints, problems are : Problem set: 0 solved, 247 unsolved in 17564 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 192/192 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (OVERLAPS) 1/192 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (OVERLAPS) 220/412 variables, 192/250 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 93/343 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 247/590 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 9 (OVERLAPS) 1/413 variables, 1/591 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/413 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 11 (OVERLAPS) 0/413 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 591 constraints, problems are : Problem set: 0 solved, 247 unsolved in 19984 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 192/192 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37579ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 37579ms
Starting structural reductions in SI_CTL mode, iteration 1 : 192/246 places, 248/341 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38125 ms. Remains : 192/246 places, 248/341 transitions.
[2025-06-02 00:04:11] [INFO ] Flatten gal took : 5 ms
[2025-06-02 00:04:11] [INFO ] Flatten gal took : 5 ms
[2025-06-02 00:04:11] [INFO ] Input system was already deterministic with 248 transitions.
[2025-06-02 00:04:11] [INFO ] Flatten gal took : 5 ms
[2025-06-02 00:04:11] [INFO ] Flatten gal took : 5 ms
[2025-06-02 00:04:11] [INFO ] Time to serialize gal into /tmp/CTLFireability4659995824805853784.gal : 1 ms
[2025-06-02 00:04:11] [INFO ] Time to serialize properties into /tmp/CTLFireability15056663632346090308.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/CTLFireability4659995824805853784.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15056663632346090308.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.13457e+25,0.271694,15360,2,517,5,62222,6,0,969,57569,0


Converting to forward existential form...Done !
original formula: AG((((p226==0) + !(A(((p221==1)&&(p225==1)) U (p53==1)))) + ((p74==0) + !(E(AF((p18==1)) U AG((p166==1)))))))
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !(((p226==0) + !(!((E(!((p53==1)) U (!(((p221==1)&&(p225==1))) * !((p53==1)))) + EG(!...245
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.355699,15488,1,0,6,62222,15,0,4665,57569,5
FORMULA NoC3x3-PT-4A-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 341/341 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 244 transition count 341
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 234 transition count 331
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 234 transition count 331
Applied a total of 22 rules in 6 ms. Remains 234 /246 variables (removed 12) and now considering 331/341 (removed 10) transitions.
// Phase 1: matrix 331 rows 234 cols
[2025-06-02 00:04:11] [INFO ] Computed 57 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:04:11] [INFO ] Implicit Places using invariants in 174 ms returned []
[2025-06-02 00:04:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:04:11] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
Running 330 sub problems to find dead transitions.
[2025-06-02 00:04:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (OVERLAPS) 331/565 variables, 234/291 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/565 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (OVERLAPS) 0/565 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 291 constraints, problems are : Problem set: 0 solved, 330 unsolved in 18169 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 330 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (OVERLAPS) 331/565 variables, 234/291 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/565 variables, 330/621 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (OVERLAPS) 0/565 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 621 constraints, problems are : Problem set: 0 solved, 330 unsolved in 24146 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42358ms problems are : Problem set: 0 solved, 330 unsolved
Search for dead transitions found 0 dead transitions in 42358ms
Starting structural reductions in LTL mode, iteration 1 : 234/246 places, 331/341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42755 ms. Remains : 234/246 places, 331/341 transitions.
[2025-06-02 00:04:54] [INFO ] Flatten gal took : 7 ms
[2025-06-02 00:04:54] [INFO ] Flatten gal took : 7 ms
[2025-06-02 00:04:54] [INFO ] Input system was already deterministic with 331 transitions.
[2025-06-02 00:04:54] [INFO ] Flatten gal took : 7 ms
[2025-06-02 00:04:54] [INFO ] Flatten gal took : 7 ms
[2025-06-02 00:04:54] [INFO ] Time to serialize gal into /tmp/CTLFireability404472494115321068.gal : 1 ms
[2025-06-02 00:04:54] [INFO ] Time to serialize properties into /tmp/CTLFireability3596053513225120381.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/CTLFireability404472494115321068.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3596053513225120381.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.47507e+33,0.398127,21796,2,642,5,88397,6,0,1269,102305,0


Converting to forward existential form...Done !
original formula: E(((AG(E(AX((p107==1)) U (p50==1))) + !(EX(((p107==1)&&(p75==1))))) + (EG(!((AF((p15==1)) * ((p284==1)||((p126==1)&&(p160==1)))))) + (E(!...617
=> equivalent forward existential formula: [FwdG((FwdU(Init,((!(E(TRUE U !(E(!(EX(!((p107==1)))) U (p50==1))))) + !(EX(((p107==1)&&(p75==1))))) + (EG(!((!(...782
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 322/0/9
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 322/8/9
Hit Full ! (commute/partial/dont) 324/0/7
Detected timeout of ITS tools.
[2025-06-02 00:05:24] [INFO ] Flatten gal took : 11 ms
[2025-06-02 00:05:24] [INFO ] Applying decomposition
[2025-06-02 00:05:24] [INFO ] Flatten gal took : 8 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/graph15420086602397581367.txt' '-o' '/tmp/graph15420086602397581367.bin' '-w' '/tmp/graph15420086602397581367.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15420086602397581367.bin' '-l' '-1' '-v' '-w' '/tmp/graph15420086602397581367.weights' '-q' '0' '-e' '0.001'
[2025-06-02 00:05:24] [INFO ] Decomposing Gal with order
[2025-06-02 00:05:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 00:05:24] [INFO ] Removed a total of 85 redundant transitions.
[2025-06-02 00:05:24] [INFO ] Flatten gal took : 17 ms
[2025-06-02 00:05:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2025-06-02 00:05:24] [INFO ] Time to serialize gal into /tmp/CTLFireability14788085896671163314.gal : 2 ms
[2025-06-02 00:05:24] [INFO ] Time to serialize properties into /tmp/CTLFireability5177567765004316568.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/CTLFireability14788085896671163314.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5177567765004316568.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,3.47507e+33,0.125492,9052,124,49,11247,729,530,13081,87,3671,0


Converting to forward existential form...Done !
original formula: E(((AG(E(AX((i3.u19.p107==1)) U (i1.u8.p50==1))) + !(EX(((i3.u19.p107==1)&&(i2.u13.p75==1))))) + (EG(!((AF((i0.u1.p15==1)) * ((i8.u51.p28...910
=> equivalent forward existential formula: [FwdG((FwdU(Init,((!(E(TRUE U !(E(!(EX(!((i3.u19.p107==1)))) U (i1.u8.p50==1))))) + !(EX(((i3.u19.p107==1)&&(i2....1103
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 341/341 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 230 transition count 325
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 230 transition count 325
Applied a total of 32 rules in 4 ms. Remains 230 /246 variables (removed 16) and now considering 325/341 (removed 16) transitions.
// Phase 1: matrix 325 rows 230 cols
[2025-06-02 00:05:54] [INFO ] Computed 59 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:05:54] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-06-02 00:05:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:05:54] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2025-06-02 00:05:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 2/230 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 325/555 variables, 230/289 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (OVERLAPS) 0/555 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 289 constraints, problems are : Problem set: 0 solved, 324 unsolved in 21513 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 2/230 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 325/555 variables, 230/289 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 324/613 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 8 (OVERLAPS) 0/555 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 613 constraints, problems are : Problem set: 0 solved, 324 unsolved in 26161 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47704ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 47706ms
Starting structural reductions in LTL mode, iteration 1 : 230/246 places, 325/341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48001 ms. Remains : 230/246 places, 325/341 transitions.
[2025-06-02 00:06:42] [INFO ] Flatten gal took : 8 ms
[2025-06-02 00:06:42] [INFO ] Flatten gal took : 7 ms
[2025-06-02 00:06:42] [INFO ] Input system was already deterministic with 325 transitions.
[2025-06-02 00:06:42] [INFO ] Flatten gal took : 8 ms
[2025-06-02 00:06:42] [INFO ] Flatten gal took : 7 ms
[2025-06-02 00:06:42] [INFO ] Time to serialize gal into /tmp/CTLFireability10428489094548120804.gal : 1 ms
[2025-06-02 00:06:42] [INFO ] Time to serialize properties into /tmp/CTLFireability17873490467099543288.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/CTLFireability10428489094548120804.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17873490467099543288.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.36774e+33,0.345,17908,2,628,5,69523,6,0,1241,78824,0


Converting to forward existential form...Done !
original formula: AX(((((p204==1) + EX(((p283==1)&&(p284==1)))) + (AG(((p292==0)||(p201==0))) + ((p214==1)&&(p229==1)))) + (((p275==1)&&(p290==1)) * AG((((...208
=> equivalent forward existential formula: ([((EY(Init) * !((((p204==1) + EX(((p283==1)&&(p284==1)))) + (!(E(TRUE U !(((p292==0)||(p201==0))))) + ((p214==1...582
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-02 00:07:12] [INFO ] Flatten gal took : 7 ms
[2025-06-02 00:07:12] [INFO ] Applying decomposition
[2025-06-02 00:07:12] [INFO ] Flatten gal took : 8 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/graph7498640023637281873.txt' '-o' '/tmp/graph7498640023637281873.bin' '-w' '/tmp/graph7498640023637281873.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7498640023637281873.bin' '-l' '-1' '-v' '-w' '/tmp/graph7498640023637281873.weights' '-q' '0' '-e' '0.001'
[2025-06-02 00:07:12] [INFO ] Decomposing Gal with order
[2025-06-02 00:07:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 00:07:12] [INFO ] Removed a total of 88 redundant transitions.
[2025-06-02 00:07:12] [INFO ] Flatten gal took : 14 ms
[2025-06-02 00:07:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-02 00:07:12] [INFO ] Time to serialize gal into /tmp/CTLFireability323127732030123494.gal : 2 ms
[2025-06-02 00:07:12] [INFO ] Time to serialize properties into /tmp/CTLFireability14792965632458770501.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/CTLFireability323127732030123494.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14792965632458770501.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.36774e+33,0.111629,8568,138,64,8966,2038,525,10445,91,8234,0


Converting to forward existential form...Done !
original formula: AX(((((i5.u38.p204==1) + EX(((i0.i1.u41.p283==1)&&(i8.u52.p284==1)))) + (AG(((i8.u54.p292==0)||(i5.u37.p201==0))) + ((i6.u40.p214==1)&&(i...305
=> equivalent forward existential formula: ([((EY(Init) * !((((i5.u38.p204==1) + EX(((i0.i1.u41.p283==1)&&(i8.u52.p284==1)))) + (!(E(TRUE U !(((i8.u54.p292...783
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 341/341 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 244 transition count 341
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 18 place count 228 transition count 325
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 228 transition count 325
Applied a total of 34 rules in 4 ms. Remains 228 /246 variables (removed 18) and now considering 325/341 (removed 16) transitions.
// Phase 1: matrix 325 rows 228 cols
[2025-06-02 00:07:42] [INFO ] Computed 57 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:07:42] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-06-02 00:07:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:07:43] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2025-06-02 00:07:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 285 constraints, problems are : Problem set: 0 solved, 324 unsolved in 18101 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 324/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (OVERLAPS) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 609 constraints, problems are : Problem set: 0 solved, 324 unsolved in 23907 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42051ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 42051ms
Starting structural reductions in LTL mode, iteration 1 : 228/246 places, 325/341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42341 ms. Remains : 228/246 places, 325/341 transitions.
[2025-06-02 00:08:25] [INFO ] Flatten gal took : 11 ms
[2025-06-02 00:08:25] [INFO ] Flatten gal took : 13 ms
[2025-06-02 00:08:25] [INFO ] Input system was already deterministic with 325 transitions.
[2025-06-02 00:08:25] [INFO ] Flatten gal took : 7 ms
[2025-06-02 00:08:25] [INFO ] Flatten gal took : 7 ms
[2025-06-02 00:08:25] [INFO ] Time to serialize gal into /tmp/CTLFireability123267914250595446.gal : 1 ms
[2025-06-02 00:08:25] [INFO ] Time to serialize properties into /tmp/CTLFireability10069371460350958531.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/CTLFireability123267914250595446.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10069371460350958531.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.36774e+33,0.343977,17904,2,624,5,69292,6,0,1239,78552,0


Converting to forward existential form...Done !
original formula: (EX((p165==0)) * EF(AX(((EF((p48==1)) * (p89==1)) * (p116==1)))))
=> equivalent forward existential formula: [(FwdU((Init * EX((p165==0))),TRUE) * !(EX(!(((E(TRUE U (p48==1)) * (p89==1)) * (p116==1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-02 00:08:55] [INFO ] Flatten gal took : 10 ms
[2025-06-02 00:08:55] [INFO ] Applying decomposition
[2025-06-02 00:08:55] [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/graph8198804407271691762.txt' '-o' '/tmp/graph8198804407271691762.bin' '-w' '/tmp/graph8198804407271691762.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8198804407271691762.bin' '-l' '-1' '-v' '-w' '/tmp/graph8198804407271691762.weights' '-q' '0' '-e' '0.001'
[2025-06-02 00:08:55] [INFO ] Decomposing Gal with order
[2025-06-02 00:08:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 00:08:55] [INFO ] Removed a total of 86 redundant transitions.
[2025-06-02 00:08:55] [INFO ] Flatten gal took : 14 ms
[2025-06-02 00:08:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2025-06-02 00:08:55] [INFO ] Time to serialize gal into /tmp/CTLFireability2613232716097556937.gal : 3 ms
[2025-06-02 00:08:55] [INFO ] Time to serialize properties into /tmp/CTLFireability11202981873587046693.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/CTLFireability2613232716097556937.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11202981873587046693.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.36774e+33,0.094494,7736,107,32,7883,463,473,10438,66,2220,0


Converting to forward existential form...Done !
original formula: (EX((i4.i0.u30.p165==0)) * EF(AX(((EF((i1.u7.p48==1)) * (i3.u16.p89==1)) * (i3.u22.p116==1)))))
=> equivalent forward existential formula: [(FwdU((Init * EX((i4.i0.u30.p165==0))),TRUE) * !(EX(!(((E(TRUE U (i1.u7.p48==1)) * (i3.u16.p89==1)) * (i3.u22.p...177
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 341/341 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 244 transition count 341
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 18 place count 228 transition count 325
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 228 transition count 325
Applied a total of 34 rules in 7 ms. Remains 228 /246 variables (removed 18) and now considering 325/341 (removed 16) transitions.
[2025-06-02 00:09:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:09:25] [INFO ] Implicit Places using invariants in 115 ms returned []
[2025-06-02 00:09:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:09:25] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2025-06-02 00:09:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 285 constraints, problems are : Problem set: 0 solved, 324 unsolved in 17374 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 324/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (OVERLAPS) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 609 constraints, problems are : Problem set: 0 solved, 324 unsolved in 23018 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40433ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 40436ms
Starting structural reductions in LTL mode, iteration 1 : 228/246 places, 325/341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40728 ms. Remains : 228/246 places, 325/341 transitions.
[2025-06-02 00:10:06] [INFO ] Flatten gal took : 9 ms
[2025-06-02 00:10:06] [INFO ] Flatten gal took : 7 ms
[2025-06-02 00:10:06] [INFO ] Input system was already deterministic with 325 transitions.
[2025-06-02 00:10:06] [INFO ] Flatten gal took : 15 ms
[2025-06-02 00:10:06] [INFO ] Flatten gal took : 19 ms
[2025-06-02 00:10:06] [INFO ] Time to serialize gal into /tmp/CTLFireability12192812893141796616.gal : 1 ms
[2025-06-02 00:10:06] [INFO ] Time to serialize properties into /tmp/CTLFireability17782179526428256461.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/CTLFireability12192812893141796616.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17782179526428256461.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.36774e+33,0.358868,17904,2,624,5,69292,6,0,1239,78552,0


Converting to forward existential form...Done !
original formula: EX(E((EF(AX((p108==1))) + (p165==1)) U AF((p18==1))))
=> equivalent forward existential formula: [(FwdU(EY(Init),(E(TRUE U !(EX(!((p108==1))))) + (p165==1))) * !(EG(!((p18==1)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.556731,18032,1,0,11,69292,29,3,6320,78552,14
FORMULA NoC3x3-PT-4A-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 341/341 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 244 transition count 341
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 17 place count 229 transition count 326
Iterating global reduction 1 with 15 rules applied. Total rules applied 32 place count 229 transition count 326
Applied a total of 32 rules in 5 ms. Remains 229 /246 variables (removed 17) and now considering 326/341 (removed 15) transitions.
// Phase 1: matrix 326 rows 229 cols
[2025-06-02 00:10:06] [INFO ] Computed 57 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:10:07] [INFO ] Implicit Places using invariants in 133 ms returned []
[2025-06-02 00:10:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:10:07] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 325 sub problems to find dead transitions.
[2025-06-02 00:10:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (OVERLAPS) 326/555 variables, 229/286 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (OVERLAPS) 0/555 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 325 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 286 constraints, problems are : Problem set: 0 solved, 325 unsolved in 17501 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 325 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (OVERLAPS) 326/555 variables, 229/286 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 325/611 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 6 (OVERLAPS) 0/555 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 325 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 611 constraints, problems are : Problem set: 0 solved, 325 unsolved in 24103 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41643ms problems are : Problem set: 0 solved, 325 unsolved
Search for dead transitions found 0 dead transitions in 41644ms
Starting structural reductions in LTL mode, iteration 1 : 229/246 places, 326/341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41973 ms. Remains : 229/246 places, 326/341 transitions.
[2025-06-02 00:10:48] [INFO ] Flatten gal took : 8 ms
[2025-06-02 00:10:48] [INFO ] Flatten gal took : 7 ms
[2025-06-02 00:10:48] [INFO ] Input system was already deterministic with 326 transitions.
[2025-06-02 00:10:48] [INFO ] Flatten gal took : 7 ms
[2025-06-02 00:10:48] [INFO ] Flatten gal took : 7 ms
[2025-06-02 00:10:48] [INFO ] Time to serialize gal into /tmp/CTLFireability8170101746179369485.gal : 1 ms
[2025-06-02 00:10:48] [INFO ] Time to serialize properties into /tmp/CTLFireability16993922403903101683.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/CTLFireability8170101746179369485.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16993922403903101683.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.64128e+33,0.425285,19956,2,627,5,81092,6,0,1244,90966,0


Converting to forward existential form...Done !
original formula: EX((EG((((p119==0)||(p169==0))&&((p84==0)||(p111==0)))) * AG((p162==0))))
=> equivalent forward existential formula: [((EY(Init) * EG((((p119==0)||(p169==0))&&((p84==0)||(p111==0))))) * !(E(TRUE U !((p162==0)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-02 00:11:19] [INFO ] Flatten gal took : 7 ms
[2025-06-02 00:11:19] [INFO ] Applying decomposition
[2025-06-02 00:11:19] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2149875763312072323.txt' '-o' '/tmp/graph2149875763312072323.bin' '-w' '/tmp/graph2149875763312072323.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2149875763312072323.bin' '-l' '-1' '-v' '-w' '/tmp/graph2149875763312072323.weights' '-q' '0' '-e' '0.001'
[2025-06-02 00:11:19] [INFO ] Decomposing Gal with order
[2025-06-02 00:11:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 00:11:19] [INFO ] Removed a total of 90 redundant transitions.
[2025-06-02 00:11:19] [INFO ] Flatten gal took : 12 ms
[2025-06-02 00:11:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-02 00:11:19] [INFO ] Time to serialize gal into /tmp/CTLFireability5906901489255816355.gal : 4 ms
[2025-06-02 00:11:19] [INFO ] Time to serialize properties into /tmp/CTLFireability13958494686187256191.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/CTLFireability5906901489255816355.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13958494686187256191.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.64128e+33,0.157536,7696,127,40,8151,537,482,9453,68,2580,0


Converting to forward existential form...Done !
original formula: EX((EG((((i4.u23.p119==0)||(i4.u31.p169==0))&&((i3.u20.p84==0)||(i3.u20.p111==0)))) * AG((i4.u29.p162==0))))
=> equivalent forward existential formula: [((EY(Init) * EG((((i4.u23.p119==0)||(i4.u31.p169==0))&&((i3.u20.p84==0)||(i3.u20.p111==0))))) * !(E(TRUE U !((i...183
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 341/341 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 244 transition count 341
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 18 place count 228 transition count 325
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 228 transition count 325
Applied a total of 34 rules in 4 ms. Remains 228 /246 variables (removed 18) and now considering 325/341 (removed 16) transitions.
// Phase 1: matrix 325 rows 228 cols
[2025-06-02 00:11:49] [INFO ] Computed 57 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:11:49] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-06-02 00:11:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:11:49] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2025-06-02 00:11:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 285 constraints, problems are : Problem set: 0 solved, 324 unsolved in 17542 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 324/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (OVERLAPS) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 609 constraints, problems are : Problem set: 0 solved, 324 unsolved in 23429 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41017ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 41018ms
Starting structural reductions in LTL mode, iteration 1 : 228/246 places, 325/341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41329 ms. Remains : 228/246 places, 325/341 transitions.
[2025-06-02 00:12:30] [INFO ] Flatten gal took : 9 ms
[2025-06-02 00:12:30] [INFO ] Flatten gal took : 7 ms
[2025-06-02 00:12:30] [INFO ] Input system was already deterministic with 325 transitions.
[2025-06-02 00:12:30] [INFO ] Flatten gal took : 7 ms
[2025-06-02 00:12:30] [INFO ] Flatten gal took : 7 ms
[2025-06-02 00:12:30] [INFO ] Time to serialize gal into /tmp/CTLFireability14915433937630789821.gal : 1 ms
[2025-06-02 00:12:30] [INFO ] Time to serialize properties into /tmp/CTLFireability3809171275990527466.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/CTLFireability14915433937630789821.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3809171275990527466.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.36774e+33,0.31609,17900,2,624,5,69292,6,0,1239,78552,0


Converting to forward existential form...Done !
original formula: !(A(EX(((p291==1)||(p110==1))) U (EX((p18==1)) + EF((p17==1)))))
=> equivalent forward existential formula: ([(((FwdU(Init,!((EX((p18==1)) + E(TRUE U (p17==1))))) * !(EX(((p291==1)||(p110==1))))) * !(E(TRUE U (p17==1))))...248
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-02 00:13:00] [INFO ] Flatten gal took : 8 ms
[2025-06-02 00:13:00] [INFO ] Applying decomposition
[2025-06-02 00:13:00] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8827260801484647278.txt' '-o' '/tmp/graph8827260801484647278.bin' '-w' '/tmp/graph8827260801484647278.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8827260801484647278.bin' '-l' '-1' '-v' '-w' '/tmp/graph8827260801484647278.weights' '-q' '0' '-e' '0.001'
[2025-06-02 00:13:00] [INFO ] Decomposing Gal with order
[2025-06-02 00:13:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 00:13:00] [INFO ] Removed a total of 90 redundant transitions.
[2025-06-02 00:13:00] [INFO ] Flatten gal took : 38 ms
[2025-06-02 00:13:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2025-06-02 00:13:00] [INFO ] Time to serialize gal into /tmp/CTLFireability12400180926586156211.gal : 2 ms
[2025-06-02 00:13:00] [INFO ] Time to serialize properties into /tmp/CTLFireability13118507524876938381.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/CTLFireability12400180926586156211.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13118507524876938381.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.36774e+33,0.106962,7596,110,32,7622,519,471,9717,60,2391,0


Converting to forward existential form...Done !
original formula: !(A(EX(((i8.u55.p291==1)||(i3.u21.p110==1))) U (EX((i0.i0.u3.p18==1)) + EF((i0.i0.u3.p17==1)))))
=> equivalent forward existential formula: ([(((FwdU(Init,!((EX((i0.i0.u3.p18==1)) + E(TRUE U (i0.i0.u3.p17==1))))) * !(EX(((i8.u55.p291==1)||(i3.u21.p110=...316
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 246/246 places, 341/341 transitions.
Graph (trivial) has 91 edges and 246 vertex of which 45 / 246 are part of one of the 20 SCC in 1 ms
Free SCC test removed 25 places
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Graph (complete) has 758 edges and 221 vertex of which 219 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 15 place count 206 transition count 279
Iterating global reduction 0 with 13 rules applied. Total rules applied 28 place count 206 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 41 place count 206 transition count 266
Applied a total of 41 rules in 16 ms. Remains 206 /246 variables (removed 40) and now considering 266/341 (removed 75) transitions.
[2025-06-02 00:13:30] [INFO ] Flow matrix only has 247 transitions (discarded 19 similar events)
// Phase 1: matrix 247 rows 206 cols
[2025-06-02 00:13:30] [INFO ] Computed 57 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:13:30] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-06-02 00:13:30] [INFO ] Flow matrix only has 247 transitions (discarded 19 similar events)
[2025-06-02 00:13:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:13:31] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-02 00:13:31] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 00:13:31] [INFO ] Redundant transitions in 1 ms returned []
Running 265 sub problems to find dead transitions.
[2025-06-02 00:13:31] [INFO ] Flow matrix only has 247 transitions (discarded 19 similar events)
[2025-06-02 00:13:31] [INFO ] Invariant cache hit.
[2025-06-02 00:13:31] [INFO ] State equation strengthened by 65 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 246/452 variables, 206/263 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 64/327 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (OVERLAPS) 1/453 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/453 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (OVERLAPS) 0/453 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 453/453 variables, and 328 constraints, problems are : Problem set: 0 solved, 265 unsolved in 16588 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 206/206 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 246/452 variables, 206/263 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 64/327 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 265/592 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/453 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/453 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (OVERLAPS) 0/453 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 453/453 variables, and 593 constraints, problems are : Problem set: 0 solved, 265 unsolved in 22212 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 206/206 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38836ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 38837ms
Starting structural reductions in SI_CTL mode, iteration 1 : 206/246 places, 266/341 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39254 ms. Remains : 206/246 places, 266/341 transitions.
[2025-06-02 00:14:10] [INFO ] Flatten gal took : 13 ms
[2025-06-02 00:14:10] [INFO ] Flatten gal took : 7 ms
[2025-06-02 00:14:10] [INFO ] Input system was already deterministic with 266 transitions.
[2025-06-02 00:14:10] [INFO ] Flatten gal took : 6 ms
[2025-06-02 00:14:10] [INFO ] Flatten gal took : 6 ms
[2025-06-02 00:14:10] [INFO ] Time to serialize gal into /tmp/CTLFireability12355785871822623865.gal : 1 ms
[2025-06-02 00:14:10] [INFO ] Time to serialize properties into /tmp/CTLFireability5291592258533268171.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/CTLFireability12355785871822623865.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5291592258533268171.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.22112e+28,0.30997,17200,2,559,5,70748,6,0,1062,69407,0


Converting to forward existential form...Done !
original formula: E(!(((((((p160==1)&&(p59==1))&&((p81==1)&&(!((p27==1)&&(p50==1)))))&&(((p107==1)||((p282==1)&&(p290==1)))||(!((p33==1)&&(p48==1))))) + ((...395
=> equivalent forward existential formula: ([((FwdU(Init,!(((((((p160==1)&&(p59==1))&&((p81==1)&&(!((p27==1)&&(p50==1)))))&&(((p107==1)||((p282==1)&&(p290=...883
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-02 00:14:40] [INFO ] Flatten gal took : 5 ms
[2025-06-02 00:14:40] [INFO ] Applying decomposition
[2025-06-02 00:14:40] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15642857501932302412.txt' '-o' '/tmp/graph15642857501932302412.bin' '-w' '/tmp/graph15642857501932302412.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15642857501932302412.bin' '-l' '-1' '-v' '-w' '/tmp/graph15642857501932302412.weights' '-q' '0' '-e' '0.001'
[2025-06-02 00:14:40] [INFO ] Decomposing Gal with order
[2025-06-02 00:14:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 00:14:40] [INFO ] Removed a total of 59 redundant transitions.
[2025-06-02 00:14:40] [INFO ] Flatten gal took : 11 ms
[2025-06-02 00:14:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 3 ms.
[2025-06-02 00:14:40] [INFO ] Time to serialize gal into /tmp/CTLFireability8851104190279825216.gal : 2 ms
[2025-06-02 00:14:40] [INFO ] Time to serialize properties into /tmp/CTLFireability17369199326036674601.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/CTLFireability8851104190279825216.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17369199326036674601.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.22112e+28,0.096278,8292,191,46,10056,413,526,10396,87,1677,0


Converting to forward existential form...Done !
original formula: E(!(((((((i4.u26.p160==1)&&(i2.u10.p59==1))&&((i2.u14.p81==1)&&(!((i1.u4.p27==1)&&(i1.u8.p50==1)))))&&(((i3.u18.p107==1)||((i8.u47.p282==...569
=> equivalent forward existential formula: ([((FwdU(Init,!(((((((i4.u26.p160==1)&&(i2.u10.p59==1))&&((i2.u14.p81==1)&&(!((i1.u4.p27==1)&&(i1.u8.p50==1)))))...1218
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 341/341 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 244 transition count 341
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 15 place count 231 transition count 328
Iterating global reduction 1 with 13 rules applied. Total rules applied 28 place count 231 transition count 328
Applied a total of 28 rules in 14 ms. Remains 231 /246 variables (removed 15) and now considering 328/341 (removed 13) transitions.
// Phase 1: matrix 328 rows 231 cols
[2025-06-02 00:15:10] [INFO ] Computed 57 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:15:10] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-02 00:15:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:15:10] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 327 sub problems to find dead transitions.
[2025-06-02 00:15:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (OVERLAPS) 328/559 variables, 231/288 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/559 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (OVERLAPS) 0/559 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 327 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 288 constraints, problems are : Problem set: 0 solved, 327 unsolved in 17919 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 327 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (OVERLAPS) 328/559 variables, 231/288 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/559 variables, 327/615 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 6 (OVERLAPS) 0/559 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 327 unsolved
No progress, stopping.
After SMT solving in domain Int declared 559/559 variables, and 615 constraints, problems are : Problem set: 0 solved, 327 unsolved in 24319 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42282ms problems are : Problem set: 0 solved, 327 unsolved
Search for dead transitions found 0 dead transitions in 42282ms
Starting structural reductions in LTL mode, iteration 1 : 231/246 places, 328/341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42561 ms. Remains : 231/246 places, 328/341 transitions.
[2025-06-02 00:15:52] [INFO ] Flatten gal took : 8 ms
[2025-06-02 00:15:52] [INFO ] Flatten gal took : 7 ms
[2025-06-02 00:15:52] [INFO ] Input system was already deterministic with 328 transitions.
[2025-06-02 00:15:52] [INFO ] Flatten gal took : 7 ms
[2025-06-02 00:15:52] [INFO ] Flatten gal took : 7 ms
[2025-06-02 00:15:52] [INFO ] Time to serialize gal into /tmp/CTLFireability7423073283599503052.gal : 2 ms
[2025-06-02 00:15:52] [INFO ] Time to serialize properties into /tmp/CTLFireability1290824171517080110.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/CTLFireability7423073283599503052.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1290824171517080110.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,2.23397e+33,0.360459,19208,2,633,5,75996,6,0,1254,86747,0


Converting to forward existential form...Done !
original formula: EX((A((E(EG(((p26==1)&&(p167==1))) U A((p287==1) U ((p122==1)&&(p265==1)))) + !(((p216==1)&&(p222==1)))) U !(EF(((p15==1)&&(p107==1))))) ...283
=> equivalent forward existential formula: ((([FwdG(FwdU((EY(Init) * !((E(!(!(E(TRUE U ((p15==1)&&(p107==1))))) U (!((E(EG(((p26==1)&&(p167==1))) U !((E(!(...1571
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-02 00:16:23] [INFO ] Flatten gal took : 7 ms
[2025-06-02 00:16:23] [INFO ] Applying decomposition
[2025-06-02 00:16:23] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17048453534771568673.txt' '-o' '/tmp/graph17048453534771568673.bin' '-w' '/tmp/graph17048453534771568673.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17048453534771568673.bin' '-l' '-1' '-v' '-w' '/tmp/graph17048453534771568673.weights' '-q' '0' '-e' '0.001'
[2025-06-02 00:16:23] [INFO ] Decomposing Gal with order
[2025-06-02 00:16:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 00:16:23] [INFO ] Removed a total of 78 redundant transitions.
[2025-06-02 00:16:23] [INFO ] Flatten gal took : 11 ms
[2025-06-02 00:16:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2025-06-02 00:16:23] [INFO ] Time to serialize gal into /tmp/CTLFireability11648071934539259207.gal : 2 ms
[2025-06-02 00:16:23] [INFO ] Time to serialize properties into /tmp/CTLFireability11786115100035843327.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/CTLFireability11648071934539259207.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11786115100035843327.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.23397e+33,0.127301,8864,143,54,10218,809,589,13106,81,3631,0


Converting to forward existential form...Done !
original formula: EX((A((E(EG(((i1.i0.u8.p26==1)&&(i4.i0.u28.p167==1))) U A((i8.u51.p287==1) U ((i4.i1.u27.p122==1)&&(i7.u46.p265==1)))) + !(((i6.u37.p216=...428
=> equivalent forward existential formula: ((([FwdG(FwdU((EY(Init) * !((E(!(!(E(TRUE U ((i0.i0.u2.p15==1)&&(i3.u18.p107==1))))) U (!((E(EG(((i1.i0.u8.p26==...2230
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 341/341 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 244 transition count 341
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 18 place count 228 transition count 325
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 228 transition count 325
Applied a total of 34 rules in 4 ms. Remains 228 /246 variables (removed 18) and now considering 325/341 (removed 16) transitions.
// Phase 1: matrix 325 rows 228 cols
[2025-06-02 00:16:53] [INFO ] Computed 57 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:16:53] [INFO ] Implicit Places using invariants in 122 ms returned []
[2025-06-02 00:16:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 00:16:53] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2025-06-02 00:16:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 285 constraints, problems are : Problem set: 0 solved, 324 unsolved in 17172 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 324/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (OVERLAPS) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 609 constraints, problems are : Problem set: 0 solved, 324 unsolved in 22680 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39910ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 39911ms
Starting structural reductions in LTL mode, iteration 1 : 228/246 places, 325/341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40200 ms. Remains : 228/246 places, 325/341 transitions.
[2025-06-02 00:17:33] [INFO ] Flatten gal took : 6 ms
[2025-06-02 00:17:33] [INFO ] Flatten gal took : 6 ms
[2025-06-02 00:17:33] [INFO ] Input system was already deterministic with 325 transitions.
[2025-06-02 00:17:33] [INFO ] Flatten gal took : 6 ms
[2025-06-02 00:17:33] [INFO ] Flatten gal took : 7 ms
[2025-06-02 00:17:33] [INFO ] Time to serialize gal into /tmp/CTLFireability13483224786288889132.gal : 1 ms
[2025-06-02 00:17:33] [INFO ] Time to serialize properties into /tmp/CTLFireability11914838473829283643.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/CTLFireability13483224786288889132.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11914838473829283643.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.36774e+33,0.315789,17904,2,624,5,69292,6,0,1239,78552,0


Converting to forward existential form...Done !
original formula: E(!(AX(EF((p15==1)))) U EX((E((p264!=1) U AF(((p119==1)&&(p166==1)))) * EF(!((((p23==1)&&(p51==1))||(p75==1)))))))
=> equivalent forward existential formula: [(FwdU((EY(FwdU(Init,!(!(EX(!(E(TRUE U (p15==1)))))))) * E((p264!=1) U !(EG(!(((p119==1)&&(p166==1))))))),TRUE) ...203
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 318/0/7
Detected timeout of ITS tools.
[2025-06-02 00:18:03] [INFO ] Flatten gal took : 12 ms
[2025-06-02 00:18:03] [INFO ] Applying decomposition
[2025-06-02 00:18:03] [INFO ] Flatten gal took : 9 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/graph6366692814586176957.txt' '-o' '/tmp/graph6366692814586176957.bin' '-w' '/tmp/graph6366692814586176957.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6366692814586176957.bin' '-l' '-1' '-v' '-w' '/tmp/graph6366692814586176957.weights' '-q' '0' '-e' '0.001'
[2025-06-02 00:18:03] [INFO ] Decomposing Gal with order
[2025-06-02 00:18:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 00:18:03] [INFO ] Removed a total of 78 redundant transitions.
[2025-06-02 00:18:03] [INFO ] Flatten gal took : 11 ms
[2025-06-02 00:18:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 1 ms.
[2025-06-02 00:18:03] [INFO ] Time to serialize gal into /tmp/CTLFireability17865646069983251604.gal : 2 ms
[2025-06-02 00:18:03] [INFO ] Time to serialize properties into /tmp/CTLFireability7592901725443441438.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/CTLFireability17865646069983251604.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7592901725443441438.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.36774e+33,0.114616,8140,119,63,8440,912,511,10888,95,3512,0


Converting to forward existential form...Done !
original formula: E(!(AX(EF((i0.u0.p15==1)))) U EX((E((i7.u46.p264!=1) U AF(((i4.i1.u21.p119==1)&&(i4.i1.u28.p166==1)))) * EF(!((((i1.u3.p23==1)&&(i1.u7.p5...184
=> equivalent forward existential formula: [(FwdU((EY(FwdU(Init,!(!(EX(!(E(TRUE U (i0.u0.p15==1)))))))) * E((i7.u46.p264!=1) U !(EG(!(((i4.i1.u21.p119==1)&...255
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
[2025-06-02 00:18:33] [INFO ] Flatten gal took : 7 ms
[2025-06-02 00:18:33] [INFO ] Flatten gal took : 8 ms
[2025-06-02 00:18:33] [INFO ] Applying decomposition
[2025-06-02 00:18:33] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3127736979058360479.txt' '-o' '/tmp/graph3127736979058360479.bin' '-w' '/tmp/graph3127736979058360479.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3127736979058360479.bin' '-l' '-1' '-v' '-w' '/tmp/graph3127736979058360479.weights' '-q' '0' '-e' '0.001'
[2025-06-02 00:18:33] [INFO ] Decomposing Gal with order
[2025-06-02 00:18:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 00:18:33] [INFO ] Removed a total of 74 redundant transitions.
[2025-06-02 00:18:33] [INFO ] Flatten gal took : 12 ms
[2025-06-02 00:18:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 1 ms.
[2025-06-02 00:18:33] [INFO ] Time to serialize gal into /tmp/CTLFireability18032123227189727414.gal : 2 ms
[2025-06-02 00:18:33] [INFO ] Time to serialize properties into /tmp/CTLFireability11286435765853625595.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/CTLFireability18032123227189727414.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11286435765853625595.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 13 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.85372e+34,0.159585,10856,219,158,15166,2370,685,16573,149,7343,0


Converting to forward existential form...Done !
original formula: !(E(A(((A((i4.u17.p114==1) U ((i9.u39.p255==1)&&(i9.u43.p266==1))) * (i10.u46.p285==1)) * EG((((i9.u37.p239==1)&&(i9.u43.p266==1))||(i8.u...416
=> equivalent forward existential formula: [(FwdU(FwdU(Init,!((E(!(EG((EG(((i2.u10.p60==1)&&(i2.u10.p75==1))) + (((i1.u4.p48==1)&&(i0.u3.p11==1))&&(i1.u6.p...801
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,190.774,3169936,1,0,4.61102e+06,14081,2102,1.98587e+07,395,62627,8758
FORMULA NoC3x3-PT-4A-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(AX(!(E(((EF(((i7.i0.u33.p221==1)&&(i8.u35.p225==1))) + (i4.u17.p113==1)) + ((i0.u3.p12==1)&&(i0.u3.p20==1))) U ((i10.u45.p278==1)&&(i1...174
=> equivalent forward existential formula: [(FwdU(EY(FwdU(Init,TRUE)),((E(TRUE U ((i7.i0.u33.p221==1)&&(i8.u35.p225==1))) + (i4.u17.p113==1)) + ((i0.u3.p12...229
(forward)formula 1,0,279.13,3169936,1,0,4.61102e+06,14081,2433,1.98587e+07,446,62627,1489385
FORMULA NoC3x3-PT-4A-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E((i1.u4.p48==1) U AF(AX(E((i7.i1.u31.p204!=1) U EX((i9.u42.p263==1))))))
=> equivalent forward existential formula: [(FwdU(Init,(i1.u4.p48==1)) * !(EG(!(!(EX(!(E((i7.i1.u31.p204!=1) U EX((i9.u42.p263==1))))))))))] != FALSE
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 2,1,1618.35,15427712,1,0,2.09266e+07,22265,1289,7.8563e+07,286,131558,75
FORMULA NoC3x3-PT-4A-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
Detected timeout of ITS tools.
[2025-06-02 00:46:53] [INFO ] Applying decomposition
[2025-06-02 00:46:53] [INFO ] Flatten gal took : 16 ms
[2025-06-02 00:46:53] [INFO ] Decomposing Gal with order
[2025-06-02 00:46:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 00:46:53] [INFO ] Removed a total of 110 redundant transitions.
[2025-06-02 00:46:53] [INFO ] Flatten gal took : 20 ms
[2025-06-02 00:46:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 7 ms.
[2025-06-02 00:46:53] [INFO ] Time to serialize gal into /tmp/CTLFireability12588959756263442080.gal : 7 ms
[2025-06-02 00:46:53] [INFO ] Time to serialize properties into /tmp/CTLFireability10913977792752252157.ctl : 15 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/CTLFireability12588959756263442080.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10913977792752252157.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 10 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.85372e+34,0.12615,8876,134,19,10292,608,645,11559,85,2402,0


Converting to forward existential form...Done !
original formula: EF(AG(A((u65.p288==1) U (((E(((u30.p128==1)&&(u34.p157==1)) U ((u47.p208==1)&&(u50.p223==1))) * A((u20.p82==1) U (u14.p58==1))) * ((!((u2...231
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!((E(!((((E(((u30.p128==1)&&(u34.p157==1)) U ((u47.p208==1)&&(u50.p223==1))) * ...855
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
Fast SCC detection found an SCC at level 47
Fast SCC detection found an SCC at level 48
Fast SCC detection found an SCC at level 49
Fast SCC detection found an SCC at level 50
Fast SCC detection found an SCC at level 51
Fast SCC detection found an SCC at level 52
Fast SCC detection found an SCC at level 53
Fast SCC detection found an SCC at level 54
Fast SCC detection found an SCC at level 55
Fast SCC detection found an SCC at level 56
Fast SCC detection found an SCC at level 57
Fast SCC detection found an SCC at level 58
Fast SCC detection found an SCC at level 59
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
Fast SCC detection found an SCC at level 47
Fast SCC detection found an SCC at level 48
Fast SCC detection found an SCC at level 49
Fast SCC detection found an SCC at level 50
Fast SCC detection found an SCC at level 51
Fast SCC detection found an SCC at level 52
Fast SCC detection found an SCC at level 53
Fast SCC detection found an SCC at level 54
Fast SCC detection found an SCC at level 55
Fast SCC detection found an SCC at level 56
Fast SCC detection found an SCC at level 57
Fast SCC detection found an SCC at level 58
Fast SCC detection found an SCC at level 59
(forward)formula 0,0,45.3592,1676668,1,0,2.84221e+06,1487,3126,7.07718e+06,298,5501,7562818
FORMULA NoC3x3-PT-4A-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX(A((u14.p56==1) U AG(((!(AF((u18.p74==1))) + AG((u59.p264==1))) + ((u6.p21==1)&&(u12.p51==1))))))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(!(E(TRUE U !(((!(!(EG(!((u18.p74==1))))) + !(E(TRUE U !((u59.p264==1))))) + ((u6.p21==1)&&(...438
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
Fast SCC detection found an SCC at level 47
Fast SCC detection found an SCC at level 48
Fast SCC detection found an SCC at level 49
Fast SCC detection found an SCC at level 50
Fast SCC detection found an SCC at level 51
Fast SCC detection found an SCC at level 52
Fast SCC detection found an SCC at level 53
Fast SCC detection found an SCC at level 54
Fast SCC detection found an SCC at level 55
Fast SCC detection found an SCC at level 56
Fast SCC detection found an SCC at level 57
Fast SCC detection found an SCC at level 58
Fast SCC detection found an SCC at level 59
(forward)formula 1,0,59.7249,2197884,1,0,3.73598e+06,1613,3209,9.21334e+06,299,6256,10093381
FORMULA NoC3x3-PT-4A-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E(((AG(E(AX((u25.p107==1)) U (u12.p50==1))) + !(EX(((u25.p107==1)&&(u18.p75==1))))) + (EG(!((AF((u4.p15==1)) * ((u64.p284==1)||((u29.p126...775
=> equivalent forward existential formula: [FwdG((FwdU(Init,((!(E(TRUE U !(E(!(EX(!((u25.p107==1)))) U (u12.p50==1))))) + !(EX(((u25.p107==1)&&(u18.p75==1)...956
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
Fast SCC detection found an SCC at level 47
Fast SCC detection found an SCC at level 48
Fast SCC detection found an SCC at level 49
Fast SCC detection found an SCC at level 50
Fast SCC detection found an SCC at level 51
Fast SCC detection found an SCC at level 52
Fast SCC detection found an SCC at level 53
Fast SCC detection found an SCC at level 54
Fast SCC detection found an SCC at level 55
Fast SCC detection found an SCC at level 56
Fast SCC detection found an SCC at level 57
Fast SCC detection found an SCC at level 58
Fast SCC detection found an SCC at level 59

BK_TIME_CONFINEMENT_REACHED

--------------------
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="NoC3x3-PT-4A"
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 NoC3x3-PT-4A, 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 r142-tall-174876812100202"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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