Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028500458.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is CO4-PT-11, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028500458
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 132K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748606809048

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-30 12:06:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 12:06:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 12:06:50] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2025-05-30 12:06:50] [INFO ] Transformed 545 places.
[2025-05-30 12:06:50] [INFO ] Transformed 617 transitions.
[2025-05-30 12:06:50] [INFO ] Found NUPN structural information;
[2025-05-30 12:06:50] [INFO ] Parsed PT model containing 545 places and 617 transitions and 1344 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Deduced a syphon composed of 157 places in 9 ms
Reduce places removed 157 places and 177 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-11-CTLFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-CTLFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 71 out of 388 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 388/388 places, 440/440 transitions.
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 376 transition count 437
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 66 place count 325 transition count 385
Iterating global reduction 1 with 51 rules applied. Total rules applied 117 place count 325 transition count 385
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 153 place count 289 transition count 349
Iterating global reduction 1 with 36 rules applied. Total rules applied 189 place count 289 transition count 349
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 192 place count 289 transition count 346
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 208 place count 273 transition count 330
Iterating global reduction 2 with 16 rules applied. Total rules applied 224 place count 273 transition count 330
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 235 place count 262 transition count 319
Iterating global reduction 2 with 11 rules applied. Total rules applied 246 place count 262 transition count 319
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 247 place count 262 transition count 318
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 252 place count 257 transition count 313
Iterating global reduction 3 with 5 rules applied. Total rules applied 257 place count 257 transition count 313
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 258 place count 256 transition count 312
Iterating global reduction 3 with 1 rules applied. Total rules applied 259 place count 256 transition count 312
Applied a total of 259 rules in 104 ms. Remains 256 /388 variables (removed 132) and now considering 312/440 (removed 128) transitions.
// Phase 1: matrix 312 rows 256 cols
[2025-05-30 12:06:50] [INFO ] Computed 4 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:06:50] [INFO ] Implicit Places using invariants in 225 ms returned []
[2025-05-30 12:06:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:06:51] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Running 311 sub problems to find dead transitions.
[2025-05-30 12:06:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/256 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (OVERLAPS) 312/568 variables, 256/260 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:59] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:00] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/568 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/568 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (OVERLAPS) 0/568 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 311 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 262 constraints, problems are : Problem set: 0 solved, 311 unsolved in 23692 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/256 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (OVERLAPS) 312/568 variables, 256/262 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/568 variables, 311/573 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:30] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/568 variables, 1/574 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 574 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 53819ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 53835ms
Starting structural reductions in LTL mode, iteration 1 : 256/388 places, 312/440 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54395 ms. Remains : 256/388 places, 312/440 transitions.
Support contains 71 out of 256 places after structural reductions.
[2025-05-30 12:07:45] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-05-30 12:07:45] [INFO ] Flatten gal took : 43 ms
[2025-05-30 12:07:45] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CO4-PT-11-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-CTLFireability-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 12:07:45] [INFO ] Flatten gal took : 24 ms
[2025-05-30 12:07:45] [INFO ] Input system was already deterministic with 312 transitions.
Support contains 58 out of 256 places (down from 71) after GAL structural reductions.
RANDOM walk for 40000 steps (34 resets) in 1906 ms. (20 steps per ms) remains 37/44 properties
BEST_FIRST walk for 4002 steps (17 resets) in 32 ms. (121 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4002 steps (29 resets) in 31 ms. (125 steps per ms) remains 33/36 properties
BEST_FIRST walk for 4004 steps (44 resets) in 58 ms. (67 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (32 resets) in 64 ms. (61 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (29 resets) in 73 ms. (54 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (20 resets) in 26 ms. (148 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (26 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (41 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (39 resets) in 10 ms. (363 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (27 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (31 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (28 resets) in 18 ms. (210 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4002 steps (33 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (17 resets) in 15 ms. (250 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4002 steps (29 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (17 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (34 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (27 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (18 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (20 resets) in 25 ms. (153 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (24 resets) in 23 ms. (166 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (34 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (27 resets) in 18 ms. (210 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4003 steps (46 resets) in 15 ms. (250 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4003 steps (27 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (30 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (19 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (28 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (27 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (15 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (25 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
[2025-05-30 12:07:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 10/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 16/63 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 130/193 variables, 63/67 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 207/400 variables, 95/162 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 120/520 variables, 67/229 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/520 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 37/557 variables, 23/252 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/557 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (OVERLAPS) 10/567 variables, 7/259 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/567 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 15 (OVERLAPS) 1/568 variables, 1/260 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/568 variables, 0/260 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 17 (OVERLAPS) 0/568 variables, 0/260 constraints. Problems are: Problem set: 2 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 260 constraints, problems are : Problem set: 2 solved, 27 unsolved in 2169 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 27 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 10/43 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 16/59 variables, 3/4 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 123/182 variables, 59/63 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 6/69 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/69 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 208/390 variables, 95/164 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 21/185 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 0/185 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 11 (OVERLAPS) 123/513 variables, 68/253 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/513 variables, 0/253 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 13 (OVERLAPS) 38/551 variables, 23/276 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/551 variables, 0/276 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 15 (OVERLAPS) 11/562 variables, 7/283 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/562 variables, 0/283 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 17 (OVERLAPS) 5/567 variables, 3/286 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/567 variables, 0/286 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 19 (OVERLAPS) 1/568 variables, 1/287 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/568 variables, 0/287 constraints. Problems are: Problem set: 2 solved, 27 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 287 constraints, problems are : Problem set: 2 solved, 27 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 27/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7193ms problems are : Problem set: 2 solved, 27 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 33 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 312/312 transitions.
Graph (trivial) has 204 edges and 256 vertex of which 3 / 256 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 395 edges and 254 vertex of which 239 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 90 rules applied. Total rules applied 92 place count 239 transition count 208
Reduce places removed 79 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 85 rules applied. Total rules applied 177 place count 160 transition count 202
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 183 place count 154 transition count 202
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 183 place count 154 transition count 191
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 205 place count 143 transition count 191
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 211 place count 137 transition count 185
Iterating global reduction 3 with 6 rules applied. Total rules applied 217 place count 137 transition count 185
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 217 place count 137 transition count 184
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 219 place count 136 transition count 184
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 222 place count 133 transition count 181
Iterating global reduction 3 with 3 rules applied. Total rules applied 225 place count 133 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 226 place count 133 transition count 180
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 227 place count 132 transition count 179
Iterating global reduction 4 with 1 rules applied. Total rules applied 228 place count 132 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 229 place count 132 transition count 178
Performed 32 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 293 place count 100 transition count 141
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 296 place count 100 transition count 138
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 297 place count 99 transition count 137
Iterating global reduction 6 with 1 rules applied. Total rules applied 298 place count 99 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 300 place count 98 transition count 136
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 320 place count 88 transition count 137
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 324 place count 88 transition count 133
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 328 place count 84 transition count 125
Iterating global reduction 7 with 4 rules applied. Total rules applied 332 place count 84 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 333 place count 84 transition count 124
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 336 place count 84 transition count 121
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 342 place count 84 transition count 115
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 348 place count 78 transition count 115
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 349 place count 78 transition count 114
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 350 place count 78 transition count 114
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 351 place count 77 transition count 113
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 14 edges and 76 vertex of which 2 / 76 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 2 rules applied. Total rules applied 353 place count 75 transition count 113
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 355 place count 75 transition count 111
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 356 place count 74 transition count 110
Iterating global reduction 11 with 1 rules applied. Total rules applied 357 place count 74 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 359 place count 73 transition count 109
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 11 with 8 rules applied. Total rules applied 367 place count 73 transition count 101
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 368 place count 72 transition count 100
Iterating global reduction 11 with 1 rules applied. Total rules applied 369 place count 72 transition count 100
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 370 place count 72 transition count 99
Free-agglomeration rule applied 7 times.
Iterating global reduction 11 with 7 rules applied. Total rules applied 377 place count 72 transition count 92
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 384 place count 65 transition count 92
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 385 place count 65 transition count 91
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 386 place count 64 transition count 90
Iterating global reduction 12 with 1 rules applied. Total rules applied 387 place count 64 transition count 90
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 388 place count 64 transition count 89
Applied a total of 388 rules in 79 ms. Remains 64 /256 variables (removed 192) and now considering 89/312 (removed 223) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 64/256 places, 89/312 transitions.
RANDOM walk for 40000 steps (3453 resets) in 230 ms. (173 steps per ms) remains 2/27 properties
BEST_FIRST walk for 40003 steps (783 resets) in 55 ms. (714 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40001 steps (783 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
// Phase 1: matrix 89 rows 64 cols
[2025-05-30 12:07:53] [INFO ] Computed 1 invariants in 1 ms
[2025-05-30 12:07:53] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/35 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 72/107 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/143 variables, 21/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/152 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/153 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/153 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/153 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 66 constraints, problems are : Problem set: 0 solved, 1 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/35 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/107 variables, 31/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 36/143 variables, 21/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/152 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/152 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/153 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/153 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/153 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 67 constraints, problems are : Problem set: 0 solved, 1 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 174ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 5 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2025-05-30 12:07:53] [INFO ] Flatten gal took : 14 ms
[2025-05-30 12:07:53] [INFO ] Flatten gal took : 13 ms
[2025-05-30 12:07:53] [INFO ] Input system was already deterministic with 312 transitions.
Support contains 51 out of 256 places (down from 52) after GAL structural reductions.
FORMULA CO4-PT-11-CTLFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 22 stabilizing places and 24 stable transitions
Graph (complete) has 398 edges and 256 vertex of which 250 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 256/256 places, 312/312 transitions.
Graph (trivial) has 251 edges and 256 vertex of which 3 / 256 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 396 edges and 254 vertex of which 248 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 102 place count 247 transition count 202
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 105 rules applied. Total rules applied 207 place count 147 transition count 197
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 211 place count 143 transition count 197
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 211 place count 143 transition count 184
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 237 place count 130 transition count 184
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 248 place count 119 transition count 172
Iterating global reduction 3 with 11 rules applied. Total rules applied 259 place count 119 transition count 172
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 259 place count 119 transition count 168
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 267 place count 115 transition count 168
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 272 place count 110 transition count 163
Iterating global reduction 3 with 5 rules applied. Total rules applied 277 place count 110 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 278 place count 110 transition count 162
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 318 place count 90 transition count 142
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 322 place count 90 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 323 place count 89 transition count 138
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 325 place count 87 transition count 136
Iterating global reduction 6 with 2 rules applied. Total rules applied 327 place count 87 transition count 136
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 336 place count 87 transition count 127
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 6 with 4 rules applied. Total rules applied 340 place count 87 transition count 123
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 344 place count 83 transition count 123
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 344 place count 83 transition count 122
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 346 place count 82 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 348 place count 81 transition count 121
Partial Post-agglomeration rule applied 7 times.
Drop transitions (Partial Post agglomeration) removed 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 355 place count 81 transition count 121
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 357 place count 79 transition count 119
Applied a total of 357 rules in 46 ms. Remains 79 /256 variables (removed 177) and now considering 119/312 (removed 193) transitions.
// Phase 1: matrix 119 rows 79 cols
[2025-05-30 12:07:53] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:07:53] [INFO ] Implicit Places using invariants in 37 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 78/256 places, 119/312 transitions.
Applied a total of 0 rules in 4 ms. Remains 78 /78 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 91 ms. Remains : 78/256 places, 119/312 transitions.
[2025-05-30 12:07:53] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:07:53] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:07:53] [INFO ] Input system was already deterministic with 119 transitions.
[2025-05-30 12:07:53] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:07:53] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:07:53] [INFO ] Time to serialize gal into /tmp/CTLFireability12856392222077944100.gal : 2 ms
[2025-05-30 12:07:53] [INFO ] Time to serialize properties into /tmp/CTLFireability16113214728882329000.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12856392222077944100.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16113214728882329000.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,13177,0.033794,4676,2,306,5,2856,6,0,423,2676,0


Converting to forward existential form...Done !
original formula: !(E(EF((p224==1)) U ((p324==1) * AG((E((p381==1) U (p119==1)) + AG((p375==1)))))))
=> equivalent forward existential formula: [((FwdU(Init,E(TRUE U (p224==1))) * (p324==1)) * !(E(TRUE U !((E((p381==1) U (p119==1)) + !(E(TRUE U !((p375==1)...172
Reverse transition relation is NOT exact ! Due to transitions t4, t13, t26, t32, t52, t108, Intersection with reachable at each step enabled. (destroyed/r...191
(forward)formula 0,1,0.147293,9796,1,0,166,28854,264,87,2657,22790,258
FORMULA CO4-PT-11-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 256/256 places, 312/312 transitions.
Graph (trivial) has 259 edges and 256 vertex of which 3 / 256 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 396 edges and 254 vertex of which 248 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 112 place count 247 transition count 192
Reduce places removed 110 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 111 rules applied. Total rules applied 223 place count 137 transition count 191
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 223 place count 137 transition count 179
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 247 place count 125 transition count 179
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 258 place count 114 transition count 167
Iterating global reduction 2 with 11 rules applied. Total rules applied 269 place count 114 transition count 167
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 269 place count 114 transition count 162
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 279 place count 109 transition count 162
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 285 place count 103 transition count 156
Iterating global reduction 2 with 6 rules applied. Total rules applied 291 place count 103 transition count 156
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 292 place count 103 transition count 155
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 332 place count 83 transition count 135
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 336 place count 83 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 337 place count 82 transition count 131
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 339 place count 80 transition count 129
Iterating global reduction 5 with 2 rules applied. Total rules applied 341 place count 80 transition count 129
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 349 place count 80 transition count 121
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 3 rules applied. Total rules applied 352 place count 80 transition count 118
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 355 place count 77 transition count 118
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 355 place count 77 transition count 117
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 357 place count 76 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 359 place count 75 transition count 116
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 361 place count 73 transition count 114
Applied a total of 361 rules in 35 ms. Remains 73 /256 variables (removed 183) and now considering 114/312 (removed 198) transitions.
// Phase 1: matrix 114 rows 73 cols
[2025-05-30 12:07:54] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:07:54] [INFO ] Implicit Places using invariants in 35 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 72/256 places, 114/312 transitions.
Applied a total of 0 rules in 3 ms. Remains 72 /72 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 74 ms. Remains : 72/256 places, 114/312 transitions.
[2025-05-30 12:07:54] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:07:54] [INFO ] Flatten gal took : 4 ms
[2025-05-30 12:07:54] [INFO ] Input system was already deterministic with 114 transitions.
[2025-05-30 12:07:54] [INFO ] Flatten gal took : 12 ms
[2025-05-30 12:07:54] [INFO ] Flatten gal took : 13 ms
[2025-05-30 12:07:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18313441146094088906.gal : 1 ms
[2025-05-30 12:07:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11860889916110732444.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/ReachabilityCardinality18313441146094088906.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11860889916110732444.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality11860889916110732444.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 17
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17 after 29
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :29 after 56
Reachability property CO4-PT-11-CTLFireability-2025-03 is true.
FORMULA CO4-PT-11-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,321,0.02656,4528,2,262,11,1736,6,0,394,1242,0
Total reachable state count : 321

Verifying 1 reachability properties.
Reachability property CO4-PT-11-CTLFireability-2025-03 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CO4-PT-11-CTLFireability-2025-03,32,0.026972,4656,2,109,11,1736,7,0,397,1242,0
RANDOM walk for 34810 steps (4763 resets) in 394 ms. (88 steps per ms) remains 0/1 properties
Starting structural reductions in SI_CTL mode, iteration 0 : 256/256 places, 312/312 transitions.
Graph (trivial) has 258 edges and 256 vertex of which 3 / 256 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 396 edges and 254 vertex of which 248 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 109 place count 247 transition count 195
Reduce places removed 107 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 109 rules applied. Total rules applied 218 place count 140 transition count 193
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 219 place count 139 transition count 193
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 219 place count 139 transition count 180
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 245 place count 126 transition count 180
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 257 place count 114 transition count 167
Iterating global reduction 3 with 12 rules applied. Total rules applied 269 place count 114 transition count 167
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 269 place count 114 transition count 162
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 279 place count 109 transition count 162
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 285 place count 103 transition count 156
Iterating global reduction 3 with 6 rules applied. Total rules applied 291 place count 103 transition count 156
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 292 place count 103 transition count 155
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 330 place count 84 transition count 136
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 334 place count 84 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 335 place count 83 transition count 132
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 337 place count 81 transition count 130
Iterating global reduction 6 with 2 rules applied. Total rules applied 339 place count 81 transition count 130
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 348 place count 81 transition count 121
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 6 with 4 rules applied. Total rules applied 352 place count 81 transition count 117
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 356 place count 77 transition count 117
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 356 place count 77 transition count 116
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 358 place count 76 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 360 place count 75 transition count 115
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 362 place count 73 transition count 113
Applied a total of 362 rules in 27 ms. Remains 73 /256 variables (removed 183) and now considering 113/312 (removed 199) transitions.
// Phase 1: matrix 113 rows 73 cols
[2025-05-30 12:07:54] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:07:54] [INFO ] Implicit Places using invariants in 32 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 72/256 places, 113/312 transitions.
Applied a total of 0 rules in 2 ms. Remains 72 /72 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 63 ms. Remains : 72/256 places, 113/312 transitions.
[2025-05-30 12:07:54] [INFO ] Flatten gal took : 4 ms
[2025-05-30 12:07:54] [INFO ] Flatten gal took : 4 ms
[2025-05-30 12:07:54] [INFO ] Input system was already deterministic with 113 transitions.
[2025-05-30 12:07:54] [INFO ] Flatten gal took : 4 ms
[2025-05-30 12:07:54] [INFO ] Flatten gal took : 4 ms
[2025-05-30 12:07:54] [INFO ] Time to serialize gal into /tmp/CTLFireability13956253831334329738.gal : 2 ms
[2025-05-30 12:07:54] [INFO ] Time to serialize properties into /tmp/CTLFireability4036373475682540353.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/CTLFireability13956253831334329738.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4036373475682540353.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,11881,0.018318,4448,2,225,5,2033,6,0,393,1840,0


Converting to forward existential form...Done !
original formula: EG(EF((p162==1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (p162==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t16, t33, t39, t55, t110, Intersection with reachable at each step enabled. (destroyed/r...191
(forward)formula 0,1,0.172685,12384,1,0,195,37583,252,124,2453,51983,283
FORMULA CO4-PT-11-CTLFireability-2025-04 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 : 256/256 places, 312/312 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 230 transition count 285
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 230 transition count 285
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 230 transition count 283
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 68 place count 216 transition count 269
Iterating global reduction 1 with 14 rules applied. Total rules applied 82 place count 216 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 83 place count 216 transition count 268
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 87 place count 212 transition count 264
Iterating global reduction 2 with 4 rules applied. Total rules applied 91 place count 212 transition count 264
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 210 transition count 262
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 210 transition count 262
Applied a total of 95 rules in 26 ms. Remains 210 /256 variables (removed 46) and now considering 262/312 (removed 50) transitions.
// Phase 1: matrix 262 rows 210 cols
[2025-05-30 12:07:54] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:07:54] [INFO ] Implicit Places using invariants in 55 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 209/256 places, 262/312 transitions.
Applied a total of 0 rules in 4 ms. Remains 209 /209 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 86 ms. Remains : 209/256 places, 262/312 transitions.
[2025-05-30 12:07:54] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:07:54] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:07:54] [INFO ] Input system was already deterministic with 262 transitions.
[2025-05-30 12:07:54] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:07:54] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:07:54] [INFO ] Time to serialize gal into /tmp/CTLFireability7865123403455418783.gal : 3 ms
[2025-05-30 12:07:54] [INFO ] Time to serialize properties into /tmp/CTLFireability6435690152267590941.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/CTLFireability7865123403455418783.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6435690152267590941.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,471316,0.090717,7792,2,1330,5,13615,6,0,1096,14325,0


Converting to forward existential form...Done !
original formula: AG((AX(AX((p393==1))) + EF(AX(AF((p117==1))))))
=> equivalent forward existential formula: [(EY(EY((FwdU(Init,TRUE) * !(E(TRUE U !(EX(!(!(EG(!((p117==1)))))))))))) * !((p393==1)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t13, t14, t15, t16, t17, t23, t31, t40, t42, t43, t44, t45, t46, t48, t51, t95, t15...300
(forward)formula 0,0,5.10602,185004,1,0,758,882117,554,406,6138,1.1352e+06,1022
FORMULA CO4-PT-11-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 312/312 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 233 transition count 288
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 233 transition count 288
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 233 transition count 286
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 61 place count 220 transition count 273
Iterating global reduction 1 with 13 rules applied. Total rules applied 74 place count 220 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 75 place count 220 transition count 272
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 80 place count 215 transition count 267
Iterating global reduction 2 with 5 rules applied. Total rules applied 85 place count 215 transition count 267
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 88 place count 212 transition count 264
Iterating global reduction 2 with 3 rules applied. Total rules applied 91 place count 212 transition count 264
Applied a total of 91 rules in 17 ms. Remains 212 /256 variables (removed 44) and now considering 264/312 (removed 48) transitions.
// Phase 1: matrix 264 rows 212 cols
[2025-05-30 12:07:59] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:07:59] [INFO ] Implicit Places using invariants in 63 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 211/256 places, 264/312 transitions.
Applied a total of 0 rules in 3 ms. Remains 211 /211 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 84 ms. Remains : 211/256 places, 264/312 transitions.
[2025-05-30 12:07:59] [INFO ] Flatten gal took : 20 ms
[2025-05-30 12:07:59] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:07:59] [INFO ] Input system was already deterministic with 264 transitions.
[2025-05-30 12:07:59] [INFO ] Flatten gal took : 13 ms
[2025-05-30 12:07:59] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:07:59] [INFO ] Time to serialize gal into /tmp/CTLFireability18195961594156584774.gal : 2 ms
[2025-05-30 12:07:59] [INFO ] Time to serialize properties into /tmp/CTLFireability3439647853704522777.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/CTLFireability18195961594156584774.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3439647853704522777.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,477172,0.090712,7820,2,1324,5,13673,6,0,1105,14637,0


Converting to forward existential form...Done !
original formula: (EF((EF((p421!=1)) * ((p125==1) + A(AX(FALSE) U EG((p196==1)))))) + (EF((p158==1)) * AG((AF((p235==1)) * EF((p179==1))))))
=> equivalent forward existential formula: ([((Init * !(E(TRUE U (E(TRUE U (p421!=1)) * ((p125==1) + !((E(!(EG((p196==1))) U (!(!(EX(!(FALSE)))) * !(EG((p1...625
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t16, t22, t30, t39, t41, t42, t43, t44, t45, t47, t50, t94, t14...300
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,5.71435,205492,1,0,1014,986458,573,602,6480,1.24424e+06,1299
FORMULA CO4-PT-11-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 256/256 places, 312/312 transitions.
Graph (trivial) has 247 edges and 256 vertex of which 3 / 256 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 396 edges and 254 vertex of which 248 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 247 transition count 203
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 105 rules applied. Total rules applied 206 place count 148 transition count 197
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 211 place count 143 transition count 197
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 211 place count 143 transition count 183
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 239 place count 129 transition count 183
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 249 place count 119 transition count 172
Iterating global reduction 3 with 10 rules applied. Total rules applied 259 place count 119 transition count 172
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 259 place count 119 transition count 169
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 265 place count 116 transition count 169
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 271 place count 110 transition count 163
Iterating global reduction 3 with 6 rules applied. Total rules applied 277 place count 110 transition count 163
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 317 place count 90 transition count 143
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 321 place count 90 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 322 place count 89 transition count 139
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 323 place count 88 transition count 138
Iterating global reduction 5 with 1 rules applied. Total rules applied 324 place count 88 transition count 138
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 333 place count 88 transition count 129
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 4 rules applied. Total rules applied 337 place count 88 transition count 125
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 341 place count 84 transition count 125
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 341 place count 84 transition count 124
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 343 place count 83 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 345 place count 82 transition count 123
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 347 place count 80 transition count 121
Applied a total of 347 rules in 23 ms. Remains 80 /256 variables (removed 176) and now considering 121/312 (removed 191) transitions.
// Phase 1: matrix 121 rows 80 cols
[2025-05-30 12:08:05] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:08:05] [INFO ] Implicit Places using invariants in 35 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 79/256 places, 121/312 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 62 ms. Remains : 79/256 places, 121/312 transitions.
[2025-05-30 12:08:05] [INFO ] Flatten gal took : 4 ms
[2025-05-30 12:08:05] [INFO ] Flatten gal took : 4 ms
[2025-05-30 12:08:05] [INFO ] Input system was already deterministic with 121 transitions.
[2025-05-30 12:08:05] [INFO ] Flatten gal took : 3 ms
[2025-05-30 12:08:05] [INFO ] Flatten gal took : 3 ms
[2025-05-30 12:08:05] [INFO ] Time to serialize gal into /tmp/CTLFireability1774411051722586780.gal : 1 ms
[2025-05-30 12:08:05] [INFO ] Time to serialize properties into /tmp/CTLFireability14408730769789216774.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/CTLFireability1774411051722586780.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14408730769789216774.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,21889,0.024999,4724,2,251,5,2991,6,0,429,3790,0


Converting to forward existential form...Done !
original formula: !(E((AG(((p277==1)&&(p530==1))) + E(AG((p320==1)) U AF(((p439==1)&&(p495==1))))) U (p516==1)))
=> equivalent forward existential formula: [(FwdU(Init,(!(E(TRUE U !(((p277==1)&&(p530==1))))) + E(!(E(TRUE U !((p320==1)))) U !(EG(!(((p439==1)&&(p495==1)...184
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t8, t22, t40, t46, t71, t79, t117, Intersection with reachable at each step enabled....204
(forward)formula 0,1,0.27734,18084,1,0,358,86528,281,176,2743,83728,489
FORMULA CO4-PT-11-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 312/312 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 232 transition count 287
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 232 transition count 287
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 232 transition count 285
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 62 place count 220 transition count 273
Iterating global reduction 1 with 12 rules applied. Total rules applied 74 place count 220 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 75 place count 220 transition count 272
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 79 place count 216 transition count 268
Iterating global reduction 2 with 4 rules applied. Total rules applied 83 place count 216 transition count 268
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 86 place count 213 transition count 265
Iterating global reduction 2 with 3 rules applied. Total rules applied 89 place count 213 transition count 265
Applied a total of 89 rules in 17 ms. Remains 213 /256 variables (removed 43) and now considering 265/312 (removed 47) transitions.
// Phase 1: matrix 265 rows 213 cols
[2025-05-30 12:08:06] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:08:06] [INFO ] Implicit Places using invariants in 54 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/256 places, 265/312 transitions.
Applied a total of 0 rules in 1 ms. Remains 212 /212 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 74 ms. Remains : 212/256 places, 265/312 transitions.
[2025-05-30 12:08:06] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:08:06] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:08:06] [INFO ] Input system was already deterministic with 265 transitions.
[2025-05-30 12:08:06] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:08:06] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:08:06] [INFO ] Time to serialize gal into /tmp/CTLFireability6508586386466313891.gal : 1 ms
[2025-05-30 12:08:06] [INFO ] Time to serialize properties into /tmp/CTLFireability16339036023475361120.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/CTLFireability6508586386466313891.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16339036023475361120.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,480100,0.089722,7828,2,1357,5,14077,6,0,1111,14951,0


Converting to forward existential form...Done !
original formula: AG(((AF(((p379==1) + EG(((p506!=1)||(p535!=1))))) + AX((p376!=1))) + ((p404!=1)&&(p222!=1))))
=> equivalent forward existential formula: [(EY(((FwdU(Init,TRUE) * !(((p404!=1)&&(p222!=1)))) * !(!(EG(!(((p379==1) + EG(((p506!=1)||(p535!=1)))))))))) * ...177
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t16, t22, t30, t39, t41, t42, t43, t44, t45, t47, t50, t98, t15...300
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,4.99294,179404,1,0,901,863896,563,496,6228,1.02128e+06,1161
FORMULA CO4-PT-11-CTLFireability-2025-10 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 : 256/256 places, 312/312 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 231 transition count 286
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 231 transition count 286
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 231 transition count 284
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 64 place count 219 transition count 272
Iterating global reduction 1 with 12 rules applied. Total rules applied 76 place count 219 transition count 272
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 77 place count 219 transition count 271
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 81 place count 215 transition count 267
Iterating global reduction 2 with 4 rules applied. Total rules applied 85 place count 215 transition count 267
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 87 place count 213 transition count 265
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 213 transition count 265
Applied a total of 89 rules in 14 ms. Remains 213 /256 variables (removed 43) and now considering 265/312 (removed 47) transitions.
// Phase 1: matrix 265 rows 213 cols
[2025-05-30 12:08:11] [INFO ] Computed 4 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:08:11] [INFO ] Implicit Places using invariants in 54 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/256 places, 265/312 transitions.
Applied a total of 0 rules in 2 ms. Remains 212 /212 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 71 ms. Remains : 212/256 places, 265/312 transitions.
[2025-05-30 12:08:11] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:08:11] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:08:11] [INFO ] Input system was already deterministic with 265 transitions.
[2025-05-30 12:08:11] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:08:11] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:08:11] [INFO ] Time to serialize gal into /tmp/CTLFireability10299622722996494183.gal : 1 ms
[2025-05-30 12:08:11] [INFO ] Time to serialize properties into /tmp/CTLFireability12518031412740135500.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/CTLFireability10299622722996494183.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12518031412740135500.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,501028,0.095228,7844,2,1372,5,14066,6,0,1111,14958,0


Converting to forward existential form...Done !
original formula: E(AG((EG((p223==1)) * ((p158==1)||((p219==1)&&(p530==1))))) U EF(!(EX((p514==1)))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,!(E(TRUE U !((EG((p223==1)) * ((p158==1)||((p219==1)&&(p530==1)))))))),TRUE) * !(EX((p514==1)))...166
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t16, t24, t25, t33, t42, t44, t45, t46, t47, t48, t50, t53, t97...305
(forward)formula 0,1,1.40067,55684,1,0,595,210066,564,329,6545,227698,864
FORMULA CO4-PT-11-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 312/312 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 233 transition count 288
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 233 transition count 288
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 59 place count 220 transition count 275
Iterating global reduction 0 with 13 rules applied. Total rules applied 72 place count 220 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 73 place count 220 transition count 274
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 78 place count 215 transition count 269
Iterating global reduction 1 with 5 rules applied. Total rules applied 83 place count 215 transition count 269
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 86 place count 212 transition count 266
Iterating global reduction 1 with 3 rules applied. Total rules applied 89 place count 212 transition count 266
Applied a total of 89 rules in 18 ms. Remains 212 /256 variables (removed 44) and now considering 266/312 (removed 46) transitions.
// Phase 1: matrix 266 rows 212 cols
[2025-05-30 12:08:12] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:08:12] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-05-30 12:08:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:08:12] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 265 sub problems to find dead transitions.
[2025-05-30 12:08:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 266/478 variables, 212/216 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:18] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:18] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/478 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:21] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 0/478 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 478/478 variables, and 219 constraints, problems are : Problem set: 0 solved, 265 unsolved in 18496 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 3/3 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/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (OVERLAPS) 266/478 variables, 212/219 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 265/484 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/478 variables, and 484 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48540ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 48541ms
Starting structural reductions in LTL mode, iteration 1 : 212/256 places, 266/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48709 ms. Remains : 212/256 places, 266/312 transitions.
[2025-05-30 12:09:01] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:09:01] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:09:01] [INFO ] Input system was already deterministic with 266 transitions.
[2025-05-30 12:09:01] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:09:01] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:09:01] [INFO ] Time to serialize gal into /tmp/CTLFireability7725499461845782890.gal : 1 ms
[2025-05-30 12:09:01] [INFO ] Time to serialize properties into /tmp/CTLFireability9857304455159211.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/CTLFireability7725499461845782890.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9857304455159211.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 -...280
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,498916,0.099421,7844,2,1509,5,14070,6,0,1112,14707,0


Converting to forward existential form...Done !
original formula: (A(((!((!(AX((p313==1))) + (p440==1))) * (p518==1)) * (p542==1)) U E(((EX((p453==1)) + ((p459==1)&&(p374==1))) + !(AF(((((p7==1)&&(p427==...244
=> equivalent forward existential formula: [FwdG(EY((Init * !((E(!(E(((EX((p453==1)) + ((p459==1)&&(p374==1))) + !(!(EG(!(((((p7==1)&&(p427==1))&&((p436==1...630
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t11, t12, t13, t14, t15, t16, t22, t30, t39, t41, t42, t43, t44, t45, t47, t49, t51,...333
(forward)formula 0,1,5.99188,197328,1,0,760,923528,575,414,6576,1.18868e+06,1037
FORMULA CO4-PT-11-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 312/312 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 234 transition count 289
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 234 transition count 289
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 234 transition count 287
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 59 place count 221 transition count 274
Iterating global reduction 1 with 13 rules applied. Total rules applied 72 place count 221 transition count 274
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 73 place count 221 transition count 273
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 77 place count 217 transition count 269
Iterating global reduction 2 with 4 rules applied. Total rules applied 81 place count 217 transition count 269
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 83 place count 215 transition count 267
Iterating global reduction 2 with 2 rules applied. Total rules applied 85 place count 215 transition count 267
Applied a total of 85 rules in 19 ms. Remains 215 /256 variables (removed 41) and now considering 267/312 (removed 45) transitions.
// Phase 1: matrix 267 rows 215 cols
[2025-05-30 12:09:07] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:09:07] [INFO ] Implicit Places using invariants in 53 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 214/256 places, 267/312 transitions.
Applied a total of 0 rules in 2 ms. Remains 214 /214 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 75 ms. Remains : 214/256 places, 267/312 transitions.
[2025-05-30 12:09:07] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:09:07] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:09:07] [INFO ] Input system was already deterministic with 267 transitions.
[2025-05-30 12:09:07] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:09:07] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:09:07] [INFO ] Time to serialize gal into /tmp/CTLFireability14670538512565391928.gal : 2 ms
[2025-05-30 12:09:07] [INFO ] Time to serialize properties into /tmp/CTLFireability13095840018998127748.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/CTLFireability14670538512565391928.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13095840018998127748.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,485956,0.100648,8368,2,1363,5,14973,6,0,1121,18169,0


Converting to forward existential form...Done !
original formula: !(A(!((((p189==1) + AX(AX((p390==1)))) + AF((((p540==1)&&(p188==1))&&(p530==1))))) U ((E((p332==1) U (p348==1)) + (p130==1)) + (p414==1))...157
=> equivalent forward existential formula: ([((((FwdU(Init,!(((E((p332==1) U (p348==1)) + (p130==1)) + (p414==1)))) * !(!((((p189==1) + !(EX(!(!(EX(!((p390...372
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t16, t22, t30, t39, t41, t42, t43, t44, t45, t47, t50, t97, t15...300
(forward)formula 0,1,6.72909,234572,1,0,1002,1.0117e+06,573,594,5977,1.5599e+06,1292
FORMULA CO4-PT-11-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2025-05-30 12:09:14] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:09:14] [INFO ] Flatten gal took : 6 ms
Total runtime 144233 ms.

BK_STOP 1748606954499

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CO4-PT-11"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is CO4-PT-11, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r044-tall-174854028500458"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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