Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K 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.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 448K 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 AutonomousCar-PT-08a-CTLFireability-2023-12
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2023-13
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2023-14
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2023-15
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2025-00
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2025-01
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2025-02
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2025-03
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2025-04
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2025-05
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2025-06
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2025-07
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2025-08
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2025-09
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2025-10
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748652820916

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-08a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-31 00:53:42] [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-31 00:53:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 00:53:42] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2025-05-31 00:53:42] [INFO ] Transformed 81 places.
[2025-05-31 00:53:42] [INFO ] Transformed 849 transitions.
[2025-05-31 00:53:42] [INFO ] Found NUPN structural information;
[2025-05-31 00:53:42] [INFO ] Parsed PT model containing 81 places and 849 transitions and 8894 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Ensure Unique test removed 275 transitions
Reduce redundant transitions removed 275 transitions.
Support contains 59 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 574/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 80 transition count 573
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 80 transition count 573
Applied a total of 2 rules in 39 ms. Remains 80 /81 variables (removed 1) and now considering 573/574 (removed 1) transitions.
// Phase 1: matrix 573 rows 80 cols
[2025-05-31 00:53:42] [INFO ] Computed 12 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:53:42] [INFO ] Implicit Places using invariants in 184 ms returned []
[2025-05-31 00:53:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:53:42] [INFO ] State equation strengthened by 259 read => feed constraints.
[2025-05-31 00:53:42] [INFO ] Implicit Places using invariants and state equation in 232 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 448 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/81 places, 573/574 transitions.
Applied a total of 0 rules in 4 ms. Remains 79 /79 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 507 ms. Remains : 79/81 places, 573/574 transitions.
Support contains 59 out of 79 places after structural reductions.
[2025-05-31 00:53:43] [INFO ] Flatten gal took : 134 ms
[2025-05-31 00:53:43] [INFO ] Flatten gal took : 86 ms
[2025-05-31 00:53:43] [INFO ] Input system was already deterministic with 573 transitions.
Reduction of identical properties reduced properties to check from 90 to 89
RANDOM walk for 40000 steps (2025 resets) in 2061 ms. (19 steps per ms) remains 39/89 properties
BEST_FIRST walk for 4004 steps (12 resets) in 25 ms. (154 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (13 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (15 resets) in 36 ms. (108 steps per ms) remains 37/39 properties
BEST_FIRST walk for 4004 steps (14 resets) in 12 ms. (308 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (13 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (13 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (20 resets) in 49 ms. (80 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (12 resets) in 10 ms. (364 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (17 resets) in 21 ms. (182 steps per ms) remains 35/37 properties
BEST_FIRST walk for 4003 steps (13 resets) in 10 ms. (363 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (11 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (17 resets) in 12 ms. (308 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4004 steps (19 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (12 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (14 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (12 resets) in 36 ms. (108 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (12 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (13 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (12 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (15 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (12 resets) in 11 ms. (333 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (11 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (13 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (18 resets) in 12 ms. (308 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4004 steps (16 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (18 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (19 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (18 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (12 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (12 resets) in 9 ms. (400 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (12 resets) in 10 ms. (364 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (13 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (12 resets) in 12 ms. (308 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4004 steps (14 resets) in 13 ms. (286 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4004 steps (12 resets) in 10 ms. (364 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (12 resets) in 10 ms. (364 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (13 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
// Phase 1: matrix 573 rows 79 cols
[2025-05-31 00:53:44] [INFO ] Computed 11 invariants in 9 ms
[2025-05-31 00:53:44] [INFO ] State equation strengthened by 259 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp86 is UNSAT
At refinement iteration 1 (OVERLAPS) 34/78 variables, 11/11 constraints. Problems are: Problem set: 5 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:44] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 1/12 constraints. Problems are: Problem set: 5 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/12 constraints. Problems are: Problem set: 5 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 572/650 variables, 78/90 constraints. Problems are: Problem set: 5 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 258/348 constraints. Problems are: Problem set: 5 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 0/348 constraints. Problems are: Problem set: 5 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 1/651 variables, 1/349 constraints. Problems are: Problem set: 5 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/651 variables, 0/349 constraints. Problems are: Problem set: 5 solved, 26 unsolved
At refinement iteration 9 (OVERLAPS) 1/652 variables, 1/350 constraints. Problems are: Problem set: 5 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/652 variables, 0/350 constraints. Problems are: Problem set: 5 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 0/652 variables, 0/350 constraints. Problems are: Problem set: 5 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 652/652 variables, and 350 constraints, problems are : Problem set: 5 solved, 26 unsolved in 3139 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 79/79 constraints, ReadFeed: 259/259 constraints, PredecessorRefiner: 31/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 26 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 41/78 variables, 11/11 constraints. Problems are: Problem set: 5 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 1/12 constraints. Problems are: Problem set: 5 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/12 constraints. Problems are: Problem set: 5 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 572/650 variables, 78/90 constraints. Problems are: Problem set: 5 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 258/348 constraints. Problems are: Problem set: 5 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:48] [INFO ] Deduced a trap along path composed of 2 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:48] [INFO ] Deduced a trap along path composed of 2 places in 49 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:48] [INFO ] Deduced a trap along path composed of 2 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:49] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 4/352 constraints. Problems are: Problem set: 5 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 0/352 constraints. Problems are: Problem set: 5 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 1/651 variables, 1/353 constraints. Problems are: Problem set: 5 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/651 variables, 0/353 constraints. Problems are: Problem set: 5 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 1/652 variables, 1/354 constraints. Problems are: Problem set: 5 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/652 variables, 0/354 constraints. Problems are: Problem set: 5 solved, 26 unsolved
At refinement iteration 12 (OVERLAPS) 0/652 variables, 0/354 constraints. Problems are: Problem set: 5 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 652/652 variables, and 354 constraints, problems are : Problem set: 5 solved, 26 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 79/79 constraints, ReadFeed: 259/259 constraints, PredecessorRefiner: 26/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 8342ms problems are : Problem set: 5 solved, 26 unsolved
Fused 26 Parikh solutions to 23 different solutions.
Parikh walk visited 2 properties in 1203 ms.
Support contains 37 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 573/573 transitions.
Graph (complete) has 848 edges and 79 vertex of which 78 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 78 transition count 566
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 74 transition count 566
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 11 place count 74 transition count 563
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 17 place count 71 transition count 563
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 2 with 2 rules applied. Total rules applied 19 place count 70 transition count 562
Free-agglomeration rule applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 27 place count 70 transition count 554
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 67 place count 62 transition count 522
Applied a total of 67 rules in 121 ms. Remains 62 /79 variables (removed 17) and now considering 522/573 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 62/79 places, 522/573 transitions.
RANDOM walk for 40000 steps (1349 resets) in 579 ms. (68 steps per ms) remains 11/24 properties
BEST_FIRST walk for 40003 steps (138 resets) in 79 ms. (500 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (137 resets) in 70 ms. (563 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (144 resets) in 91 ms. (434 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (140 resets) in 79 ms. (500 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (141 resets) in 75 ms. (526 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (135 resets) in 86 ms. (459 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (142 resets) in 75 ms. (526 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (133 resets) in 59 ms. (666 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (136 resets) in 51 ms. (769 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (130 resets) in 59 ms. (666 steps per ms) remains 9/9 properties
// Phase 1: matrix 522 rows 62 cols
[2025-05-31 00:53:54] [INFO ] Computed 12 invariants in 4 ms
[2025-05-31 00:53:54] [INFO ] State equation strengthened by 227 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 36/48 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 13/61 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 521/582 variables, 61/73 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 226/299 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/582 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 2/584 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/584 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/584 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 584/584 variables, and 301 constraints, problems are : Problem set: 0 solved, 9 unsolved in 827 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 62/62 constraints, ReadFeed: 227/227 constraints, PredecessorRefiner: 9/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 36/48 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 13/61 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 521/582 variables, 61/73 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 226/299 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:55] [INFO ] Deduced a trap along path composed of 2 places in 72 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:55] [INFO ] Deduced a trap along path composed of 2 places in 58 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:55] [INFO ] Deduced a trap along path composed of 2 places in 49 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:55] [INFO ] Deduced a trap along path composed of 2 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/582 variables, 4/303 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/582 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 2/584 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 0/584 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 584/584 variables, and 305 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1584 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 62/62 constraints, ReadFeed: 227/227 constraints, PredecessorRefiner: 9/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 2454ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 2128 ms.
Support contains 12 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 522/522 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 59 transition count 495
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 59 transition count 495
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 57 transition count 493
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 13 place count 57 transition count 490
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 40 place count 54 transition count 466
Applied a total of 40 rules in 62 ms. Remains 54 /62 variables (removed 8) and now considering 466/522 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 54/62 places, 466/522 transitions.
RANDOM walk for 40000 steps (429 resets) in 453 ms. (88 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40004 steps (56 resets) in 68 ms. (579 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (153 resets) in 64 ms. (615 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (163 resets) in 60 ms. (655 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (168 resets) in 52 ms. (754 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (155 resets) in 70 ms. (563 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (154 resets) in 40 ms. (975 steps per ms) remains 6/6 properties
// Phase 1: matrix 466 rows 54 cols
[2025-05-31 00:53:59] [INFO ] Computed 12 invariants in 2 ms
[2025-05-31 00:53:59] [INFO ] State equation strengthened by 179 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 29/38 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 15/53 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 465/518 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 178/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 2/520 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/520 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/520 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/520 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 245 constraints, problems are : Problem set: 0 solved, 6 unsolved in 432 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 54/54 constraints, ReadFeed: 179/179 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 29/38 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 15/53 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 465/518 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 178/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:00] [INFO ] Deduced a trap along path composed of 2 places in 64 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:00] [INFO ] Deduced a trap along path composed of 2 places in 48 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:00] [INFO ] Deduced a trap along path composed of 2 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:00] [INFO ] Deduced a trap along path composed of 2 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:00] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 5/248 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/518 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2/520 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/520 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/520 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/520 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 250 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1124 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 54/54 constraints, ReadFeed: 179/179 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 1580ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 535 ms.
Support contains 9 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 466/466 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 53 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 53 transition count 457
Applied a total of 2 rules in 24 ms. Remains 53 /54 variables (removed 1) and now considering 457/466 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 53/54 places, 457/466 transitions.
RANDOM walk for 40000 steps (402 resets) in 330 ms. (120 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (156 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (162 resets) in 61 ms. (645 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (160 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
// Phase 1: matrix 457 rows 53 cols
[2025-05-31 00:54:01] [INFO ] Computed 12 invariants in 2 ms
[2025-05-31 00:54:01] [INFO ] State equation strengthened by 171 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 21/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 24/52 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 456/508 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 170/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/508 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/510 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/510 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/510 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 510/510 variables, and 236 constraints, problems are : Problem set: 0 solved, 3 unsolved in 235 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 53/53 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 21/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 24/52 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 456/508 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 170/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:02] [INFO ] Deduced a trap along path composed of 2 places in 69 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:02] [INFO ] Deduced a trap along path composed of 2 places in 54 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:02] [INFO ] Deduced a trap along path composed of 2 places in 43 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:02] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:02] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:02] [INFO ] Deduced a trap along path composed of 2 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/508 variables, 6/240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/508 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/510 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/510 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/510 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 510/510 variables, and 242 constraints, problems are : Problem set: 0 solved, 3 unsolved in 859 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 53/53 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 1112ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 439 ms.
Support contains 7 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 457/457 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 52 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 52 transition count 448
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 52 transition count 447
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 12 place count 51 transition count 439
Applied a total of 12 rules in 46 ms. Remains 51 /53 variables (removed 2) and now considering 439/457 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 51/53 places, 439/457 transitions.
RANDOM walk for 40000 steps (236 resets) in 298 ms. (133 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (213 resets) in 42 ms. (930 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (212 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (213 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1441910 steps, run timeout after 3001 ms. (steps per millisecond=480 ) properties seen :2 out of 3
Probabilistic random walk after 1441910 steps, saw 182105 distinct states, run finished after 3005 ms. (steps per millisecond=479 ) properties seen :2
// Phase 1: matrix 439 rows 51 cols
[2025-05-31 00:54:06] [INFO ] Computed 12 invariants in 9 ms
[2025-05-31 00:54:06] [INFO ] State equation strengthened by 155 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/50 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 438/488 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 154/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/490 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/490 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 218 constraints, problems are : Problem set: 0 solved, 1 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 51/51 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 1/0 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 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/50 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 438/488 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 154/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:06] [INFO ] Deduced a trap along path composed of 2 places in 55 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:06] [INFO ] Deduced a trap along path composed of 2 places in 61 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:07] [INFO ] Deduced a trap along path composed of 2 places in 43 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:07] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:07] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 5/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/490 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/490 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/490 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 490/490 variables, and 223 constraints, problems are : Problem set: 0 solved, 1 unsolved in 523 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 51/51 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 744ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 74 ms.
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 439/439 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 49 transition count 421
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 49 transition count 421
Applied a total of 4 rules in 18 ms. Remains 49 /51 variables (removed 2) and now considering 421/439 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 49/51 places, 421/439 transitions.
RANDOM walk for 40000 steps (235 resets) in 297 ms. (134 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (217 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2007536 steps, run timeout after 3001 ms. (steps per millisecond=668 ) properties seen :0 out of 1
Probabilistic random walk after 2007536 steps, saw 247599 distinct states, run finished after 3001 ms. (steps per millisecond=668 ) properties seen :0
// Phase 1: matrix 421 rows 49 cols
[2025-05-31 00:54:10] [INFO ] Computed 12 invariants in 8 ms
[2025-05-31 00:54:10] [INFO ] State equation strengthened by 139 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/48 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 420/468 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 138/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/470 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/470 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/470 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 200 constraints, problems are : Problem set: 0 solved, 1 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 49/49 constraints, ReadFeed: 139/139 constraints, PredecessorRefiner: 1/0 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 120.0 s and query timeout 12000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/48 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 420/468 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 138/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:10] [INFO ] Deduced a trap along path composed of 2 places in 56 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:10] [INFO ] Deduced a trap along path composed of 2 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:10] [INFO ] Deduced a trap along path composed of 2 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:10] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 4/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/470 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/470 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/470 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/470 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 204 constraints, problems are : Problem set: 0 solved, 1 unsolved in 417 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 49/49 constraints, ReadFeed: 139/139 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 628ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 69 ms.
Support contains 4 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 421/421 transitions.
Applied a total of 0 rules in 21 ms. Remains 49 /49 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 49/49 places, 421/421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 421/421 transitions.
Applied a total of 0 rules in 16 ms. Remains 49 /49 variables (removed 0) and now considering 421/421 (removed 0) transitions.
[2025-05-31 00:54:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:54:11] [INFO ] Implicit Places using invariants in 154 ms returned []
[2025-05-31 00:54:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:54:11] [INFO ] State equation strengthened by 139 read => feed constraints.
[2025-05-31 00:54:11] [INFO ] Implicit Places using invariants and state equation in 284 ms returned [47]
Discarding 1 places :
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 441 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 48/49 places, 420/421 transitions.
Applied a total of 0 rules in 17 ms. Remains 48 /48 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 474 ms. Remains : 48/49 places, 420/421 transitions.
RANDOM walk for 30074 steps (10 resets) in 240 ms. (124 steps per ms) remains 0/1 properties
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2025-05-31 00:54:11] [INFO ] Flatten gal took : 56 ms
[2025-05-31 00:54:11] [INFO ] Flatten gal took : 59 ms
[2025-05-31 00:54:11] [INFO ] Input system was already deterministic with 573 transitions.
Support contains 58 out of 79 places (down from 59) after GAL structural reductions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 573/573 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 74 transition count 528
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 74 transition count 528
Applied a total of 10 rules in 3 ms. Remains 74 /79 variables (removed 5) and now considering 528/573 (removed 45) transitions.
// Phase 1: matrix 528 rows 74 cols
[2025-05-31 00:54:12] [INFO ] Computed 11 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:54:12] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-05-31 00:54:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:54:12] [INFO ] State equation strengthened by 219 read => feed constraints.
[2025-05-31 00:54:12] [INFO ] Implicit Places using invariants and state equation in 288 ms returned [72]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 363 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/79 places, 528/573 transitions.
Applied a total of 0 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 528/528 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 372 ms. Remains : 73/79 places, 528/573 transitions.
[2025-05-31 00:54:12] [INFO ] Flatten gal took : 41 ms
[2025-05-31 00:54:12] [INFO ] Flatten gal took : 41 ms
[2025-05-31 00:54:12] [INFO ] Input system was already deterministic with 528 transitions.
[2025-05-31 00:54:12] [INFO ] Flatten gal took : 41 ms
[2025-05-31 00:54:12] [INFO ] Flatten gal took : 41 ms
[2025-05-31 00:54:12] [INFO ] Time to serialize gal into /tmp/CTLFireability14973007991322644712.gal : 26 ms
[2025-05-31 00:54:12] [INFO ] Time to serialize properties into /tmp/CTLFireability2140922442218191266.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/CTLFireability14973007991322644712.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2140922442218191266.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.
Detected timeout of ITS tools.
[2025-05-31 00:54:42] [INFO ] Flatten gal took : 38 ms
[2025-05-31 00:54:42] [INFO ] Applying decomposition
[2025-05-31 00:54:42] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11363304993321003682.txt' '-o' '/tmp/graph11363304993321003682.bin' '-w' '/tmp/graph11363304993321003682.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11363304993321003682.bin' '-l' '-1' '-v' '-w' '/tmp/graph11363304993321003682.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:54:43] [INFO ] Decomposing Gal with order
[2025-05-31 00:54:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:54:43] [INFO ] Removed a total of 2885 redundant transitions.
[2025-05-31 00:54:43] [INFO ] Flatten gal took : 144 ms
[2025-05-31 00:54:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 36 ms.
[2025-05-31 00:54:43] [INFO ] Time to serialize gal into /tmp/CTLFireability118350726261238509.gal : 7 ms
[2025-05-31 00:54:43] [INFO ] Time to serialize properties into /tmp/CTLFireability8067308404786995563.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/CTLFireability118350726261238509.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8067308404786995563.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 573/573 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 71 transition count 501
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 71 transition count 501
Applied a total of 16 rules in 5 ms. Remains 71 /79 variables (removed 8) and now considering 501/573 (removed 72) transitions.
// Phase 1: matrix 501 rows 71 cols
[2025-05-31 00:55:13] [INFO ] Computed 11 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:55:13] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-05-31 00:55:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:55:13] [INFO ] State equation strengthened by 195 read => feed constraints.
[2025-05-31 00:55:13] [INFO ] Implicit Places using invariants and state equation in 213 ms returned [69]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 295 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 70/79 places, 501/573 transitions.
Applied a total of 0 rules in 1 ms. Remains 70 /70 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 302 ms. Remains : 70/79 places, 501/573 transitions.
[2025-05-31 00:55:13] [INFO ] Flatten gal took : 40 ms
[2025-05-31 00:55:13] [INFO ] Flatten gal took : 35 ms
[2025-05-31 00:55:13] [INFO ] Input system was already deterministic with 501 transitions.
[2025-05-31 00:55:13] [INFO ] Flatten gal took : 34 ms
[2025-05-31 00:55:13] [INFO ] Flatten gal took : 33 ms
[2025-05-31 00:55:13] [INFO ] Time to serialize gal into /tmp/CTLFireability18184960915830020931.gal : 6 ms
[2025-05-31 00:55:13] [INFO ] Time to serialize properties into /tmp/CTLFireability8375372777909569823.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/CTLFireability18184960915830020931.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8375372777909569823.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.
Detected timeout of ITS tools.
[2025-05-31 00:55:44] [INFO ] Flatten gal took : 38 ms
[2025-05-31 00:55:44] [INFO ] Applying decomposition
[2025-05-31 00:55:44] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12135557075908311174.txt' '-o' '/tmp/graph12135557075908311174.bin' '-w' '/tmp/graph12135557075908311174.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12135557075908311174.bin' '-l' '-1' '-v' '-w' '/tmp/graph12135557075908311174.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:55:44] [INFO ] Decomposing Gal with order
[2025-05-31 00:55:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:55:44] [INFO ] Removed a total of 2968 redundant transitions.
[2025-05-31 00:55:44] [INFO ] Flatten gal took : 78 ms
[2025-05-31 00:55:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 27 ms.
[2025-05-31 00:55:44] [INFO ] Time to serialize gal into /tmp/CTLFireability17534477938298773035.gal : 4 ms
[2025-05-31 00:55:44] [INFO ] Time to serialize properties into /tmp/CTLFireability13658140226556758990.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/CTLFireability17534477938298773035.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13658140226556758990.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.99505e+08,19.3529,348496,6486,136,487011,1772,957,2.01964e+06,78,10199,0


Converting to forward existential form...Done !
original formula: (AG(((((((i1.u4.p18==0)||(i4.u6.p22==0))||((i3.u11.p32==0)||(i5.u14.p39==0)))||(((i4.u16.p43==0)||(i4.u19.p50==0))||((i4.u22.p57==0)||(i9...426
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(((((((i1.u4.p18==0)||(i4.u6.p22==0))||((i3.u11.p32==0)||(i5.u14.p39==0)))||(((i4.u16.p43=...508
Reverse transition relation is NOT exact ! Due to transitions t234, t235, t236, t237, t238, t239, t240, t241, t242, t243, t244, t245, t246, t247, t248, t24...1942
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 573/573 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 79 transition count 563
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 69 transition count 563
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 69 transition count 562
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 68 transition count 562
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 29 place count 61 transition count 499
Iterating global reduction 2 with 7 rules applied. Total rules applied 36 place count 61 transition count 499
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 59 transition count 497
Applied a total of 40 rules in 61 ms. Remains 59 /79 variables (removed 20) and now considering 497/573 (removed 76) transitions.
// Phase 1: matrix 497 rows 59 cols
[2025-05-31 00:56:14] [INFO ] Computed 11 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:56:14] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-05-31 00:56:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:56:14] [INFO ] State equation strengthened by 204 read => feed constraints.
[2025-05-31 00:56:14] [INFO ] Implicit Places using invariants and state equation in 279 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 412 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 58/79 places, 497/573 transitions.
Applied a total of 0 rules in 45 ms. Remains 58 /58 variables (removed 0) and now considering 497/497 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 518 ms. Remains : 58/79 places, 497/573 transitions.
[2025-05-31 00:56:14] [INFO ] Flatten gal took : 37 ms
[2025-05-31 00:56:15] [INFO ] Flatten gal took : 37 ms
[2025-05-31 00:56:15] [INFO ] Input system was already deterministic with 497 transitions.
[2025-05-31 00:56:15] [INFO ] Flatten gal took : 36 ms
[2025-05-31 00:56:15] [INFO ] Flatten gal took : 35 ms
[2025-05-31 00:56:15] [INFO ] Time to serialize gal into /tmp/CTLFireability10941262786987619310.gal : 5 ms
[2025-05-31 00:56:15] [INFO ] Time to serialize properties into /tmp/CTLFireability10269201389080214020.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/CTLFireability10941262786987619310.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10269201389080214020.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,3.37848e+07,25.3745,620236,2,50533,5,1.32352e+06,6,0,725,1.10778e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-31 00:56:45] [INFO ] Flatten gal took : 35 ms
[2025-05-31 00:56:45] [INFO ] Applying decomposition
[2025-05-31 00:56:45] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4446872563637788580.txt' '-o' '/tmp/graph4446872563637788580.bin' '-w' '/tmp/graph4446872563637788580.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4446872563637788580.bin' '-l' '-1' '-v' '-w' '/tmp/graph4446872563637788580.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:56:45] [INFO ] Decomposing Gal with order
[2025-05-31 00:56:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:56:45] [INFO ] Removed a total of 2655 redundant transitions.
[2025-05-31 00:56:45] [INFO ] Flatten gal took : 60 ms
[2025-05-31 00:56:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 12 ms.
[2025-05-31 00:56:45] [INFO ] Time to serialize gal into /tmp/CTLFireability10194419505949379307.gal : 3 ms
[2025-05-31 00:56:45] [INFO ] Time to serialize properties into /tmp/CTLFireability1296151821341806108.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/CTLFireability10194419505949379307.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1296151821341806108.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.37848e+07,0.813371,42904,1874,122,47909,1205,915,289888,80,6791,0


Converting to forward existential form...Done !
original formula: EG((((u16.p1==0)||(u16.p8==0))||((u2.p23==0)||(u16.p73==0))))
=> equivalent forward existential formula: [FwdG(Init,(((u16.p1==0)||(u16.p8==0))||((u2.p23==0)||(u16.p73==0))))] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 10
(forward)formula 0,1,14.5811,487188,1,0,385213,2108,6291,4.6613e+06,401,14585,966259
FORMULA AutonomousCar-PT-08a-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 573/573 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 79 transition count 567
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 73 transition count 567
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 73 transition count 565
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 71 transition count 565
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 24 place count 63 transition count 493
Iterating global reduction 2 with 8 rules applied. Total rules applied 32 place count 63 transition count 493
Applied a total of 32 rules in 32 ms. Remains 63 /79 variables (removed 16) and now considering 493/573 (removed 80) transitions.
// Phase 1: matrix 493 rows 63 cols
[2025-05-31 00:57:00] [INFO ] Computed 11 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:57:00] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-05-31 00:57:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:57:00] [INFO ] State equation strengthened by 196 read => feed constraints.
[2025-05-31 00:57:00] [INFO ] Implicit Places using invariants and state equation in 211 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 279 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 62/79 places, 493/573 transitions.
Applied a total of 0 rules in 22 ms. Remains 62 /62 variables (removed 0) and now considering 493/493 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 335 ms. Remains : 62/79 places, 493/573 transitions.
[2025-05-31 00:57:00] [INFO ] Flatten gal took : 36 ms
[2025-05-31 00:57:00] [INFO ] Flatten gal took : 47 ms
[2025-05-31 00:57:00] [INFO ] Input system was already deterministic with 493 transitions.
[2025-05-31 00:57:00] [INFO ] Flatten gal took : 38 ms
[2025-05-31 00:57:00] [INFO ] Flatten gal took : 38 ms
[2025-05-31 00:57:00] [INFO ] Time to serialize gal into /tmp/CTLFireability1165053172805421650.gal : 5 ms
[2025-05-31 00:57:00] [INFO ] Time to serialize properties into /tmp/CTLFireability10170335356919369372.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/CTLFireability1165053172805421650.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10170335356919369372.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.
Detected timeout of ITS tools.
[2025-05-31 00:57:30] [INFO ] Flatten gal took : 39 ms
[2025-05-31 00:57:30] [INFO ] Applying decomposition
[2025-05-31 00:57:30] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4000018548643193207.txt' '-o' '/tmp/graph4000018548643193207.bin' '-w' '/tmp/graph4000018548643193207.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4000018548643193207.bin' '-l' '-1' '-v' '-w' '/tmp/graph4000018548643193207.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:57:31] [INFO ] Decomposing Gal with order
[2025-05-31 00:57:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:57:31] [INFO ] Removed a total of 2787 redundant transitions.
[2025-05-31 00:57:31] [INFO ] Flatten gal took : 56 ms
[2025-05-31 00:57:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 10 ms.
[2025-05-31 00:57:31] [INFO ] Time to serialize gal into /tmp/CTLFireability8136129916182717302.gal : 2 ms
[2025-05-31 00:57:31] [INFO ] Time to serialize properties into /tmp/CTLFireability15291837108290148155.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/CTLFireability8136129916182717302.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15291837108290148155.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.3941e+07,3.18098,96156,2008,119,214804,1805,576,312791,78,11352,0


Converting to forward existential form...Done !
original formula: AF((EG((((u0.p1==0)||(u0.p2==0))||((i4.u6.p26==0)||(u0.p73==0)))) * ((EG((((((i1.u1.p15==0)||(i1.u4.p22==0))||((i1.u7.p29==0)||(u10.p39==...542
=> equivalent forward existential formula: [FwdG(Init,!((EG((((u0.p1==0)||(u0.p2==0))||((i4.u6.p26==0)||(u0.p73==0)))) * ((EG((((((i1.u1.p15==0)||(i1.u4.p2...742
Reverse transition relation is NOT exact ! Due to transitions t222, t223, t224, t225, t226, t227, t228, t229, t230, t231, t232, t233, t234, t235, t236, t23...1150
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 573/573 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 73 transition count 519
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 73 transition count 519
Applied a total of 12 rules in 4 ms. Remains 73 /79 variables (removed 6) and now considering 519/573 (removed 54) transitions.
// Phase 1: matrix 519 rows 73 cols
[2025-05-31 00:58:01] [INFO ] Computed 11 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:58:01] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-05-31 00:58:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:58:01] [INFO ] State equation strengthened by 211 read => feed constraints.
[2025-05-31 00:58:01] [INFO ] Implicit Places using invariants and state equation in 219 ms returned [71]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 306 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 72/79 places, 519/573 transitions.
Applied a total of 0 rules in 3 ms. Remains 72 /72 variables (removed 0) and now considering 519/519 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 314 ms. Remains : 72/79 places, 519/573 transitions.
[2025-05-31 00:58:01] [INFO ] Flatten gal took : 39 ms
[2025-05-31 00:58:01] [INFO ] Flatten gal took : 30 ms
[2025-05-31 00:58:01] [INFO ] Input system was already deterministic with 519 transitions.
[2025-05-31 00:58:01] [INFO ] Flatten gal took : 30 ms
[2025-05-31 00:58:01] [INFO ] Flatten gal took : 30 ms
[2025-05-31 00:58:01] [INFO ] Time to serialize gal into /tmp/CTLFireability2125538934451423292.gal : 5 ms
[2025-05-31 00:58:01] [INFO ] Time to serialize properties into /tmp/CTLFireability5588182304699507671.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/CTLFireability2125538934451423292.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5588182304699507671.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.
Detected timeout of ITS tools.
[2025-05-31 00:58:31] [INFO ] Flatten gal took : 33 ms
[2025-05-31 00:58:31] [INFO ] Applying decomposition
[2025-05-31 00:58:31] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph18245499961008779525.txt' '-o' '/tmp/graph18245499961008779525.bin' '-w' '/tmp/graph18245499961008779525.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18245499961008779525.bin' '-l' '-1' '-v' '-w' '/tmp/graph18245499961008779525.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:58:31] [INFO ] Decomposing Gal with order
[2025-05-31 00:58:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:58:31] [INFO ] Removed a total of 2868 redundant transitions.
[2025-05-31 00:58:31] [INFO ] Flatten gal took : 58 ms
[2025-05-31 00:58:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 13 ms.
[2025-05-31 00:58:32] [INFO ] Time to serialize gal into /tmp/CTLFireability17296729909524209259.gal : 3 ms
[2025-05-31 00:58:32] [INFO ] Time to serialize properties into /tmp/CTLFireability2515143979080920099.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/CTLFireability17296729909524209259.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2515143979080920099.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 573/573 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 79 transition count 566
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 72 transition count 566
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 72 transition count 564
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 70 transition count 564
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 24 place count 64 transition count 510
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 64 transition count 510
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 2 with 2 rules applied. Total rules applied 32 place count 63 transition count 509
Applied a total of 32 rules in 38 ms. Remains 63 /79 variables (removed 16) and now considering 509/573 (removed 64) transitions.
// Phase 1: matrix 509 rows 63 cols
[2025-05-31 00:59:02] [INFO ] Computed 11 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:59:02] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-05-31 00:59:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:59:02] [INFO ] State equation strengthened by 212 read => feed constraints.
[2025-05-31 00:59:02] [INFO ] Implicit Places using invariants and state equation in 248 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 313 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 62/79 places, 509/573 transitions.
Applied a total of 0 rules in 23 ms. Remains 62 /62 variables (removed 0) and now considering 509/509 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 374 ms. Remains : 62/79 places, 509/573 transitions.
[2025-05-31 00:59:02] [INFO ] Flatten gal took : 36 ms
[2025-05-31 00:59:02] [INFO ] Flatten gal took : 38 ms
[2025-05-31 00:59:02] [INFO ] Input system was already deterministic with 509 transitions.
[2025-05-31 00:59:02] [INFO ] Flatten gal took : 49 ms
[2025-05-31 00:59:02] [INFO ] Flatten gal took : 37 ms
[2025-05-31 00:59:02] [INFO ] Time to serialize gal into /tmp/CTLFireability17551162738215446824.gal : 5 ms
[2025-05-31 00:59:02] [INFO ] Time to serialize properties into /tmp/CTLFireability3530059897415709585.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/CTLFireability17551162738215446824.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3530059897415709585.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.
Detected timeout of ITS tools.
[2025-05-31 00:59:32] [INFO ] Flatten gal took : 39 ms
[2025-05-31 00:59:32] [INFO ] Applying decomposition
[2025-05-31 00:59:32] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8852071283869259304.txt' '-o' '/tmp/graph8852071283869259304.bin' '-w' '/tmp/graph8852071283869259304.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8852071283869259304.bin' '-l' '-1' '-v' '-w' '/tmp/graph8852071283869259304.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:59:32] [INFO ] Decomposing Gal with order
[2025-05-31 00:59:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:59:32] [INFO ] Removed a total of 2808 redundant transitions.
[2025-05-31 00:59:32] [INFO ] Flatten gal took : 52 ms
[2025-05-31 00:59:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 9 ms.
[2025-05-31 00:59:33] [INFO ] Time to serialize gal into /tmp/CTLFireability9931005198833403982.gal : 1 ms
[2025-05-31 00:59:33] [INFO ] Time to serialize properties into /tmp/CTLFireability12221616743782726169.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/CTLFireability9931005198833403982.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12221616743782726169.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.80785e+07,1.12668,55548,3799,144,80702,1444,556,351590,83,13057,0


Converting to forward existential form...Done !
original formula: AG(EF(((!(A(EG((((((u1.p18==1)&&(u3.p25==1))&&((i0.u4.p29==1)&&(u7.p39==1)))&&(((i0.u9.p43==1)&&(i0.u12.p53==1))&&((i0.u13.p57==1)&&(i0.u...552
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((!(!((E(!(!((((((u1.p18==1)&&(i0.u2.p22==1))&&((i0.u4.p29==1)&&(i0.u6.p36==1)))&...1108
Reverse transition relation is NOT exact ! Due to transitions t76, t285, t286, t287, t288, t289, t290, t291, t292, t293, t294, t295, t296, t297, t298, t299...583
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 573/573 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 79 transition count 565
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 71 transition count 565
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 16 place count 71 transition count 563
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 69 transition count 563
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 28 place count 61 transition count 491
Iterating global reduction 2 with 8 rules applied. Total rules applied 36 place count 61 transition count 491
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 2 with 2 rules applied. Total rules applied 38 place count 60 transition count 490
Applied a total of 38 rules in 32 ms. Remains 60 /79 variables (removed 19) and now considering 490/573 (removed 83) transitions.
// Phase 1: matrix 490 rows 60 cols
[2025-05-31 01:00:03] [INFO ] Computed 11 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:00:03] [INFO ] Implicit Places using invariants in 123 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 127 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 59/79 places, 490/573 transitions.
Applied a total of 0 rules in 17 ms. Remains 59 /59 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 177 ms. Remains : 59/79 places, 490/573 transitions.
[2025-05-31 01:00:03] [INFO ] Flatten gal took : 35 ms
[2025-05-31 01:00:03] [INFO ] Flatten gal took : 37 ms
[2025-05-31 01:00:03] [INFO ] Input system was already deterministic with 490 transitions.
[2025-05-31 01:00:03] [INFO ] Flatten gal took : 37 ms
[2025-05-31 01:00:03] [INFO ] Flatten gal took : 36 ms
[2025-05-31 01:00:03] [INFO ] Time to serialize gal into /tmp/CTLFireability13502884947459537273.gal : 5 ms
[2025-05-31 01:00:03] [INFO ] Time to serialize properties into /tmp/CTLFireability10814990781062797614.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/CTLFireability13502884947459537273.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10814990781062797614.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,4.09863e+07,1.6754,60052,2,3038,5,127329,6,0,725,129172,0


Converting to forward existential form...Done !
original formula: A(!((((((p18==1)&&(p25==1))&&((p29==1)&&(p36==1)))&&(((p46==1)&&(p53==1))&&((p57==1)&&(p67==1))))&&(p74==1))) U AF((((((p15==1)&&(p25==1)...239
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!((((((p15==1)&&(p25==1))&&((p29==1)&&(p39==1)))&&(((p46==1)&&(p53==1))&&((p60==1)&&(p64==...550
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t5, t6, t8, t9, t11, t12, t14, t15, t17, t18, t20, t21, t23, t24, t218, t219, t220, t...1791
Detected timeout of ITS tools.
[2025-05-31 01:00:33] [INFO ] Flatten gal took : 36 ms
[2025-05-31 01:00:33] [INFO ] Applying decomposition
[2025-05-31 01:00:33] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13781446387788402494.txt' '-o' '/tmp/graph13781446387788402494.bin' '-w' '/tmp/graph13781446387788402494.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13781446387788402494.bin' '-l' '-1' '-v' '-w' '/tmp/graph13781446387788402494.weights' '-q' '0' '-e' '0.001'
[2025-05-31 01:00:33] [INFO ] Decomposing Gal with order
[2025-05-31 01:00:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 01:00:33] [INFO ] Removed a total of 2769 redundant transitions.
[2025-05-31 01:00:33] [INFO ] Flatten gal took : 50 ms
[2025-05-31 01:00:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 8 ms.
[2025-05-31 01:00:33] [INFO ] Time to serialize gal into /tmp/CTLFireability13250430840410511005.gal : 3 ms
[2025-05-31 01:00:33] [INFO ] Time to serialize properties into /tmp/CTLFireability17800633559420853862.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/CTLFireability13250430840410511005.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17800633559420853862.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.09863e+07,1.58008,75080,3268,94,73842,1142,926,619221,76,5690,0


Converting to forward existential form...Done !
original formula: A(!((((((u1.p18==1)&&(u3.p25==1))&&((i0.u4.p29==1)&&(i0.u6.p36==1)))&&(((u9.p46==1)&&(u11.p53==1))&&((i0.u12.p57==1)&&(u15.p67==1))))&&(i...323
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!((((((i0.u0.p15==1)&&(u3.p25==1))&&((i0.u4.p29==1)&&(u7.p39==1)))&&(((u9.p46==1)&&(u11.p5...718
Reverse transition relation is NOT exact ! Due to transitions t218, t219, t220, t221, t222, t223, t224, t225, t226, t227, t228, t229, t230, t231, t232, t23...1876
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 573/573 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 79 transition count 565
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 71 transition count 565
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 16 place count 71 transition count 563
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 69 transition count 563
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 27 place count 62 transition count 500
Iterating global reduction 2 with 7 rules applied. Total rules applied 34 place count 62 transition count 500
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 2 with 2 rules applied. Total rules applied 36 place count 61 transition count 499
Applied a total of 36 rules in 36 ms. Remains 61 /79 variables (removed 18) and now considering 499/573 (removed 74) transitions.
// Phase 1: matrix 499 rows 61 cols
[2025-05-31 01:01:03] [INFO ] Computed 11 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:01:03] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-05-31 01:01:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:01:04] [INFO ] State equation strengthened by 204 read => feed constraints.
[2025-05-31 01:01:04] [INFO ] Implicit Places using invariants and state equation in 233 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 323 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 60/79 places, 499/573 transitions.
Applied a total of 0 rules in 21 ms. Remains 60 /60 variables (removed 0) and now considering 499/499 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 380 ms. Remains : 60/79 places, 499/573 transitions.
[2025-05-31 01:01:04] [INFO ] Flatten gal took : 35 ms
[2025-05-31 01:01:04] [INFO ] Flatten gal took : 37 ms
[2025-05-31 01:01:04] [INFO ] Input system was already deterministic with 499 transitions.
[2025-05-31 01:01:04] [INFO ] Flatten gal took : 36 ms
[2025-05-31 01:01:04] [INFO ] Flatten gal took : 37 ms
[2025-05-31 01:01:04] [INFO ] Time to serialize gal into /tmp/CTLFireability11608418278018871243.gal : 5 ms
[2025-05-31 01:01:04] [INFO ] Time to serialize properties into /tmp/CTLFireability8090559778359436982.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/CTLFireability11608418278018871243.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8090559778359436982.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.
Detected timeout of ITS tools.
[2025-05-31 01:01:34] [INFO ] Flatten gal took : 42 ms
[2025-05-31 01:01:34] [INFO ] Applying decomposition
[2025-05-31 01:01:34] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3378498380085045935.txt' '-o' '/tmp/graph3378498380085045935.bin' '-w' '/tmp/graph3378498380085045935.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3378498380085045935.bin' '-l' '-1' '-v' '-w' '/tmp/graph3378498380085045935.weights' '-q' '0' '-e' '0.001'
[2025-05-31 01:01:34] [INFO ] Decomposing Gal with order
[2025-05-31 01:01:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 01:01:34] [INFO ] Removed a total of 2784 redundant transitions.
[2025-05-31 01:01:34] [INFO ] Flatten gal took : 52 ms
[2025-05-31 01:01:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 7 ms.
[2025-05-31 01:01:34] [INFO ] Time to serialize gal into /tmp/CTLFireability4043390885095039298.gal : 2 ms
[2025-05-31 01:01:34] [INFO ] Time to serialize properties into /tmp/CTLFireability6686534252269009578.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/CTLFireability4043390885095039298.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6686534252269009578.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.88976e+07,0.274157,17448,1505,135,28383,1348,296,57930,75,10916,0


Converting to forward existential form...Done !
original formula: E(!((((u17.p1==1)&&(u17.p9==1))&&((u0.p14==1)&&(u17.p73==1)))) U (((((u1.p18==1)&&(i0.u2.p22==1))&&((i0.u4.p29==1)&&(i0.u6.p36==1)))&&(((...239
=> equivalent forward existential formula: [(FwdU(Init,!((((u17.p1==1)&&(u17.p9==1))&&((u0.p14==1)&&(u17.p73==1))))) * (((((u1.p18==1)&&(i0.u2.p22==1))&&((...285
(forward)formula 0,1,0.593086,28072,1,0,47177,1573,940,97367,144,14418,105869
FORMULA AutonomousCar-PT-08a-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 573/573 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 79 transition count 563
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 69 transition count 563
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 69 transition count 562
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 68 transition count 562
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 29 place count 61 transition count 499
Iterating global reduction 2 with 7 rules applied. Total rules applied 36 place count 61 transition count 499
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 59 transition count 497
Applied a total of 40 rules in 43 ms. Remains 59 /79 variables (removed 20) and now considering 497/573 (removed 76) transitions.
// Phase 1: matrix 497 rows 59 cols
[2025-05-31 01:01:35] [INFO ] Computed 11 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:01:35] [INFO ] Implicit Places using invariants in 136 ms returned []
[2025-05-31 01:01:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:01:35] [INFO ] State equation strengthened by 204 read => feed constraints.
[2025-05-31 01:01:35] [INFO ] Implicit Places using invariants and state equation in 283 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 424 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 58/79 places, 497/573 transitions.
Applied a total of 0 rules in 28 ms. Remains 58 /58 variables (removed 0) and now considering 497/497 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 495 ms. Remains : 58/79 places, 497/573 transitions.
[2025-05-31 01:01:35] [INFO ] Flatten gal took : 34 ms
[2025-05-31 01:01:35] [INFO ] Flatten gal took : 35 ms
[2025-05-31 01:01:36] [INFO ] Input system was already deterministic with 497 transitions.
[2025-05-31 01:01:36] [INFO ] Flatten gal took : 35 ms
[2025-05-31 01:01:36] [INFO ] Flatten gal took : 35 ms
[2025-05-31 01:01:36] [INFO ] Time to serialize gal into /tmp/CTLFireability11155861106529967560.gal : 6 ms
[2025-05-31 01:01:36] [INFO ] Time to serialize properties into /tmp/CTLFireability17438851939142983967.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/CTLFireability11155861106529967560.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17438851939142983967.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,3.37848e+07,26.8026,640416,2,50534,5,1.38952e+06,6,0,725,1.15822e+06,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.37848e+07,0.239665,16684,712,132,20101,1218,403,83900,80,9040,0


Converting to forward existential form...Done !
original formula: (AG(AF((((u16.p1==0)||(u16.p9==0))||((u10.p51==0)||(u16.p73==0))))) + EF((((u16.p1==1)&&(u16.p10==1))&&((u10.p51==1)&&(u16.p73==1)))))
=> equivalent forward existential formula: [FwdG(FwdU((Init * !(E(TRUE U (((u16.p1==1)&&(u16.p10==1))&&((u10.p51==1)&&(u16.p73==1)))))),TRUE),!((((u16.p1==...213
Reverse transition relation is NOT exact ! Due to transitions t1, t27, t29, t31, t33, t35, t37, t39, t41, t43, t45, t47, t49, t51, t53, t55, t57, t91, t93,...725
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 10
(forward)formula 0,1,11.4316,374160,1,0,289658,1761,4172,3.83312e+06,435,9040,474093
FORMULA AutonomousCar-PT-08a-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 573/573 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 72 transition count 510
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 72 transition count 510
Applied a total of 14 rules in 2 ms. Remains 72 /79 variables (removed 7) and now considering 510/573 (removed 63) transitions.
// Phase 1: matrix 510 rows 72 cols
[2025-05-31 01:02:17] [INFO ] Computed 11 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:02:18] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-05-31 01:02:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:02:18] [INFO ] State equation strengthened by 203 read => feed constraints.
[2025-05-31 01:02:18] [INFO ] Implicit Places using invariants and state equation in 210 ms returned [70]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 292 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 71/79 places, 510/573 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 510/510 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 295 ms. Remains : 71/79 places, 510/573 transitions.
[2025-05-31 01:02:18] [INFO ] Flatten gal took : 29 ms
[2025-05-31 01:02:18] [INFO ] Flatten gal took : 28 ms
[2025-05-31 01:02:18] [INFO ] Input system was already deterministic with 510 transitions.
[2025-05-31 01:02:18] [INFO ] Flatten gal took : 29 ms
[2025-05-31 01:02:18] [INFO ] Flatten gal took : 40 ms
[2025-05-31 01:02:18] [INFO ] Time to serialize gal into /tmp/CTLFireability14257002322029529259.gal : 5 ms
[2025-05-31 01:02:18] [INFO ] Time to serialize properties into /tmp/CTLFireability3126260841564743517.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/CTLFireability14257002322029529259.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3126260841564743517.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.
Detected timeout of ITS tools.
[2025-05-31 01:02:48] [INFO ] Flatten gal took : 30 ms
[2025-05-31 01:02:48] [INFO ] Applying decomposition
[2025-05-31 01:02:48] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17753335545647928553.txt' '-o' '/tmp/graph17753335545647928553.bin' '-w' '/tmp/graph17753335545647928553.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17753335545647928553.bin' '-l' '-1' '-v' '-w' '/tmp/graph17753335545647928553.weights' '-q' '0' '-e' '0.001'
[2025-05-31 01:02:48] [INFO ] Decomposing Gal with order
[2025-05-31 01:02:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 01:02:48] [INFO ] Removed a total of 2983 redundant transitions.
[2025-05-31 01:02:48] [INFO ] Flatten gal took : 48 ms
[2025-05-31 01:02:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 22 ms.
[2025-05-31 01:02:48] [INFO ] Time to serialize gal into /tmp/CTLFireability4933898907398446455.gal : 2 ms
[2025-05-31 01:02:48] [INFO ] Time to serialize properties into /tmp/CTLFireability445776221807114379.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/CTLFireability4933898907398446455.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability445776221807114379.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.47697e+08,3.21878,141668,5888,140,136448,1464,980,1.17613e+06,74,8872,0


Converting to forward existential form...Done !
original formula: EF((((A(((((((i1.u2.p15==1)&&(i1.u5.p22==1))&&((i1.u8.p29==1)&&(i4.u12.p39==1)))&&(((i1.u14.p43==1)&&(i1.u17.p50==1))&&((i7.u21.p60==1)&&...488
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * ((i6.u16.p47==1)&&(u26.p73==1))) * ((u26.p1==1)&&(u26.p7==1))) * !((E(!(E(!(EX((i6.u18.p5...785
Reverse transition relation is NOT exact ! Due to transitions t144, t243, t244, t247, t248, t251, t252, t255, t256, t259, t260, t263, t264, t267, t268, t27...1187
(forward)formula 0,0,6.89934,229016,1,0,289144,1464,9547,1.87427e+06,389,8872,650550
FORMULA AutonomousCar-PT-08a-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 573/573 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 79 transition count 564
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 70 transition count 564
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 23 place count 65 transition count 519
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 65 transition count 519
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 63 transition count 517
Applied a total of 32 rules in 42 ms. Remains 63 /79 variables (removed 16) and now considering 517/573 (removed 56) transitions.
// Phase 1: matrix 517 rows 63 cols
[2025-05-31 01:02:55] [INFO ] Computed 11 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:02:55] [INFO ] Implicit Places using invariants in 134 ms returned []
[2025-05-31 01:02:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:02:55] [INFO ] State equation strengthened by 219 read => feed constraints.
[2025-05-31 01:02:56] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 01:02:56] [INFO ] Redundant transitions in 32 ms returned []
Running 516 sub problems to find dead transitions.
[2025-05-31 01:02:56] [INFO ] Invariant cache hit.
[2025-05-31 01:02:56] [INFO ] State equation strengthened by 219 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 516 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:02:59] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:02:59] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:00] [INFO ] Deduced a trap composed of 19 places in 170 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 4 (OVERLAPS) 516/579 variables, 63/77 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 218/295 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 7 (OVERLAPS) 1/580 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/580 variables, and 296 constraints, problems are : Problem set: 0 solved, 516 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 219/219 constraints, PredecessorRefiner: 516/42 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 516 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 4 (OVERLAPS) 516/579 variables, 63/77 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 218/295 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 42/337 constraints. Problems are: Problem set: 0 solved, 516 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:37] [INFO ] Deduced a trap along path composed of 2 places in 52 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:37] [INFO ] Deduced a trap along path composed of 2 places in 47 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:37] [INFO ] Deduced a trap along path composed of 2 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:37] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:37] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:38] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:50] [INFO ] Deduced a trap along path composed of 2 places in 43 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 7/344 constraints. Problems are: Problem set: 0 solved, 516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 579/580 variables, and 344 constraints, problems are : Problem set: 0 solved, 516 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 218/219 constraints, PredecessorRefiner: 516/42 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 60970ms problems are : Problem set: 0 solved, 516 unsolved
Search for dead transitions found 0 dead transitions in 60974ms
Starting structural reductions in SI_CTL mode, iteration 1 : 63/79 places, 517/573 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61464 ms. Remains : 63/79 places, 517/573 transitions.
[2025-05-31 01:03:57] [INFO ] Flatten gal took : 34 ms
[2025-05-31 01:03:57] [INFO ] Flatten gal took : 36 ms
[2025-05-31 01:03:57] [INFO ] Input system was already deterministic with 517 transitions.
[2025-05-31 01:03:57] [INFO ] Flatten gal took : 36 ms
[2025-05-31 01:03:57] [INFO ] Flatten gal took : 35 ms
[2025-05-31 01:03:57] [INFO ] Time to serialize gal into /tmp/CTLFireability10155879451257836462.gal : 5 ms
[2025-05-31 01:03:57] [INFO ] Time to serialize properties into /tmp/CTLFireability6213361966027191459.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/CTLFireability10155879451257836462.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6213361966027191459.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.
Detected timeout of ITS tools.
[2025-05-31 01:04:27] [INFO ] Flatten gal took : 39 ms
[2025-05-31 01:04:27] [INFO ] Applying decomposition
[2025-05-31 01:04:27] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14406114472878556545.txt' '-o' '/tmp/graph14406114472878556545.bin' '-w' '/tmp/graph14406114472878556545.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14406114472878556545.bin' '-l' '-1' '-v' '-w' '/tmp/graph14406114472878556545.weights' '-q' '0' '-e' '0.001'
[2025-05-31 01:04:27] [INFO ] Decomposing Gal with order
[2025-05-31 01:04:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 01:04:27] [INFO ] Removed a total of 2686 redundant transitions.
[2025-05-31 01:04:27] [INFO ] Flatten gal took : 42 ms
[2025-05-31 01:04:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 10 ms.
[2025-05-31 01:04:27] [INFO ] Time to serialize gal into /tmp/CTLFireability4431975862329836827.gal : 2 ms
[2025-05-31 01:04:27] [INFO ] Time to serialize properties into /tmp/CTLFireability11450583613913308548.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/CTLFireability4431975862329836827.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11450583613913308548.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.09182e+07,1.68135,83520,2885,106,90897,1192,926,683519,75,7869,0


Converting to forward existential form...Done !
original formula: EG(((((u18.p1==1)&&(u18.p7==1))&&((i1.u15.p65==1)&&(u18.p73==1))) + (AF((((u18.p1==1)&&(u18.p8==1))&&((i1.u13.p58==1)&&(u18.p73==1)))) * ...325
=> equivalent forward existential formula: [FwdG(Init,((((u18.p1==1)&&(u18.p7==1))&&((i1.u15.p65==1)&&(u18.p73==1))) + (!(EG(!((((u18.p1==1)&&(u18.p8==1))&...374
Reverse transition relation is NOT exact ! Due to transitions t96, t97, t98, t99, t100, t101, t102, t103, t112, t113, t114, t115, t117, t118, t119, t128, t...579
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 573/573 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 75 transition count 537
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 75 transition count 537
Applied a total of 8 rules in 10 ms. Remains 75 /79 variables (removed 4) and now considering 537/573 (removed 36) transitions.
// Phase 1: matrix 537 rows 75 cols
[2025-05-31 01:04:57] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:04:57] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-05-31 01:04:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:04:57] [INFO ] State equation strengthened by 227 read => feed constraints.
[2025-05-31 01:04:57] [INFO ] Implicit Places using invariants and state equation in 201 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 246 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/79 places, 537/573 transitions.
Applied a total of 0 rules in 4 ms. Remains 74 /74 variables (removed 0) and now considering 537/537 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 262 ms. Remains : 74/79 places, 537/573 transitions.
[2025-05-31 01:04:58] [INFO ] Flatten gal took : 28 ms
[2025-05-31 01:04:58] [INFO ] Flatten gal took : 30 ms
[2025-05-31 01:04:58] [INFO ] Input system was already deterministic with 537 transitions.
[2025-05-31 01:04:58] [INFO ] Flatten gal took : 29 ms
[2025-05-31 01:04:58] [INFO ] Flatten gal took : 30 ms
[2025-05-31 01:04:58] [INFO ] Time to serialize gal into /tmp/CTLFireability5411182569163079604.gal : 5 ms
[2025-05-31 01:04:58] [INFO ] Time to serialize properties into /tmp/CTLFireability5359734516753476970.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/CTLFireability5411182569163079604.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5359734516753476970.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.
Detected timeout of ITS tools.
[2025-05-31 01:05:28] [INFO ] Flatten gal took : 30 ms
[2025-05-31 01:05:28] [INFO ] Applying decomposition
[2025-05-31 01:05:28] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12347217246417525481.txt' '-o' '/tmp/graph12347217246417525481.bin' '-w' '/tmp/graph12347217246417525481.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12347217246417525481.bin' '-l' '-1' '-v' '-w' '/tmp/graph12347217246417525481.weights' '-q' '0' '-e' '0.001'
[2025-05-31 01:05:28] [INFO ] Decomposing Gal with order
[2025-05-31 01:05:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 01:05:28] [INFO ] Removed a total of 3028 redundant transitions.
[2025-05-31 01:05:28] [INFO ] Flatten gal took : 47 ms
[2025-05-31 01:05:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 12 ms.
[2025-05-31 01:05:28] [INFO ] Time to serialize gal into /tmp/CTLFireability6438838164489643816.gal : 2 ms
[2025-05-31 01:05:28] [INFO ] Time to serialize properties into /tmp/CTLFireability12804722196826830706.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/CTLFireability6438838164489643816.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12804722196826830706.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 573/573 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 75 transition count 537
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 75 transition count 537
Applied a total of 8 rules in 8 ms. Remains 75 /79 variables (removed 4) and now considering 537/573 (removed 36) transitions.
// Phase 1: matrix 537 rows 75 cols
[2025-05-31 01:05:58] [INFO ] Computed 11 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:05:58] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-05-31 01:05:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:05:58] [INFO ] State equation strengthened by 227 read => feed constraints.
[2025-05-31 01:05:58] [INFO ] Implicit Places using invariants and state equation in 172 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 228 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/79 places, 537/573 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 537/537 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 240 ms. Remains : 74/79 places, 537/573 transitions.
[2025-05-31 01:05:58] [INFO ] Flatten gal took : 30 ms
[2025-05-31 01:05:58] [INFO ] Flatten gal took : 30 ms
[2025-05-31 01:05:58] [INFO ] Input system was already deterministic with 537 transitions.
[2025-05-31 01:05:58] [INFO ] Flatten gal took : 30 ms
[2025-05-31 01:05:58] [INFO ] Flatten gal took : 30 ms
[2025-05-31 01:05:58] [INFO ] Time to serialize gal into /tmp/CTLFireability14120945662497992804.gal : 5 ms
[2025-05-31 01:05:58] [INFO ] Time to serialize properties into /tmp/CTLFireability12636542168383681748.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/CTLFireability14120945662497992804.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12636542168383681748.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.
Detected timeout of ITS tools.
[2025-05-31 01:06:29] [INFO ] Flatten gal took : 34 ms
[2025-05-31 01:06:29] [INFO ] Applying decomposition
[2025-05-31 01:06:29] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14835595983908111865.txt' '-o' '/tmp/graph14835595983908111865.bin' '-w' '/tmp/graph14835595983908111865.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14835595983908111865.bin' '-l' '-1' '-v' '-w' '/tmp/graph14835595983908111865.weights' '-q' '0' '-e' '0.001'
[2025-05-31 01:06:29] [INFO ] Decomposing Gal with order
[2025-05-31 01:06:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 01:06:29] [INFO ] Removed a total of 3028 redundant transitions.
[2025-05-31 01:06:29] [INFO ] Flatten gal took : 49 ms
[2025-05-31 01:06:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 14 ms.
[2025-05-31 01:06:29] [INFO ] Time to serialize gal into /tmp/CTLFireability8256617188197063224.gal : 3 ms
[2025-05-31 01:06:29] [INFO ] Time to serialize properties into /tmp/CTLFireability3285741024526223440.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/CTLFireability8256617188197063224.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3285741024526223440.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.44795e+08,9.27594,353300,6581,140,211510,1467,978,3.66714e+06,74,12167,0


Converting to forward existential form...Done !
original formula: EG(((AF((EF((((((i0.u2.p18==1)&&(i1.u5.p25==1))&&((i2.u8.p32==1)&&(i10.u10.p36==1)))&&(((i10.u13.p43==1)&&(i5.u17.p53==1))&&((i6.u20.p60=...1075
=> equivalent forward existential formula: [FwdG(Init,((!(EG(!((E(TRUE U (((((i0.u2.p18==1)&&(i1.u5.p25==1))&&((i2.u8.p32==1)&&(i10.u10.p36==1)))&&(((i10.u...1656
Reverse transition relation is NOT exact ! Due to transitions t130, t334, t338, t342, t346, t350, t358, t362, t462, t466, t470, t474, t478, t482, t486, t49...560
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 573/573 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 75 transition count 537
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 75 transition count 537
Applied a total of 8 rules in 10 ms. Remains 75 /79 variables (removed 4) and now considering 537/573 (removed 36) transitions.
// Phase 1: matrix 537 rows 75 cols
[2025-05-31 01:06:59] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:06:59] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-05-31 01:06:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:06:59] [INFO ] State equation strengthened by 227 read => feed constraints.
[2025-05-31 01:06:59] [INFO ] Implicit Places using invariants and state equation in 299 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 428 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/79 places, 537/573 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 537/537 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 442 ms. Remains : 74/79 places, 537/573 transitions.
[2025-05-31 01:06:59] [INFO ] Flatten gal took : 29 ms
[2025-05-31 01:06:59] [INFO ] Flatten gal took : 30 ms
[2025-05-31 01:06:59] [INFO ] Input system was already deterministic with 537 transitions.
[2025-05-31 01:06:59] [INFO ] Flatten gal took : 31 ms
[2025-05-31 01:06:59] [INFO ] Flatten gal took : 30 ms
[2025-05-31 01:06:59] [INFO ] Time to serialize gal into /tmp/CTLFireability4677767493245656875.gal : 5 ms
[2025-05-31 01:06:59] [INFO ] Time to serialize properties into /tmp/CTLFireability14257028449753546975.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/CTLFireability4677767493245656875.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14257028449753546975.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.
Detected timeout of ITS tools.
[2025-05-31 01:07:30] [INFO ] Flatten gal took : 31 ms
[2025-05-31 01:07:30] [INFO ] Applying decomposition
[2025-05-31 01:07:30] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3179906422530631936.txt' '-o' '/tmp/graph3179906422530631936.bin' '-w' '/tmp/graph3179906422530631936.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3179906422530631936.bin' '-l' '-1' '-v' '-w' '/tmp/graph3179906422530631936.weights' '-q' '0' '-e' '0.001'
[2025-05-31 01:07:30] [INFO ] Decomposing Gal with order
[2025-05-31 01:07:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 01:07:30] [INFO ] Removed a total of 2900 redundant transitions.
[2025-05-31 01:07:30] [INFO ] Flatten gal took : 48 ms
[2025-05-31 01:07:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 14 ms.
[2025-05-31 01:07:30] [INFO ] Time to serialize gal into /tmp/CTLFireability18211375051209982915.gal : 2 ms
[2025-05-31 01:07:30] [INFO ] Time to serialize properties into /tmp/CTLFireability12572232631407902503.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/CTLFireability18211375051209982915.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12572232631407902503.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.44795e+08,4.30756,185792,7131,164,201674,1676,985,1.57531e+06,78,13062,0


Converting to forward existential form...Done !
original formula: (EG(A(AF(AX((((u25.p1==1)&&(u25.p6==1))&&((i2.u10.p35==1)&&(u25.p73==1))))) U EX((!((((u25.p1==1)&&(u25.p8==1))&&((i2.u4.p23==1)&&(u25.p7...258
=> equivalent forward existential formula: [FwdG((Init * EG(!((E(!(EX((!((((u25.p1==1)&&(u25.p8==1))&&((i2.u4.p23==1)&&(u25.p73==1)))) + EX((((u25.p1==1)&&...618
Reverse transition relation is NOT exact ! Due to transitions t202, t338, t339, t355, t370, t371, t386, t387, t466, t467, t482, t483, t498, t499, t514, t51...546
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 573/573 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 76 transition count 546
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 76 transition count 546
Applied a total of 6 rules in 7 ms. Remains 76 /79 variables (removed 3) and now considering 546/573 (removed 27) transitions.
// Phase 1: matrix 546 rows 76 cols
[2025-05-31 01:08:00] [INFO ] Computed 11 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:08:00] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-05-31 01:08:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:08:00] [INFO ] State equation strengthened by 235 read => feed constraints.
[2025-05-31 01:08:00] [INFO ] Implicit Places using invariants and state equation in 276 ms returned [74]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 353 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/79 places, 546/573 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 546/546 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 366 ms. Remains : 75/79 places, 546/573 transitions.
[2025-05-31 01:08:00] [INFO ] Flatten gal took : 28 ms
[2025-05-31 01:08:00] [INFO ] Flatten gal took : 30 ms
[2025-05-31 01:08:00] [INFO ] Input system was already deterministic with 546 transitions.
[2025-05-31 01:08:00] [INFO ] Flatten gal took : 30 ms
[2025-05-31 01:08:00] [INFO ] Flatten gal took : 31 ms
[2025-05-31 01:08:00] [INFO ] Time to serialize gal into /tmp/CTLFireability8118883469448224800.gal : 6 ms
[2025-05-31 01:08:00] [INFO ] Time to serialize properties into /tmp/CTLFireability8294966978999770683.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/CTLFireability8118883469448224800.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8294966978999770683.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.
Detected timeout of ITS tools.
[2025-05-31 01:08:31] [INFO ] Flatten gal took : 35 ms
[2025-05-31 01:08:31] [INFO ] Applying decomposition
[2025-05-31 01:08:31] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2624002789314381527.txt' '-o' '/tmp/graph2624002789314381527.bin' '-w' '/tmp/graph2624002789314381527.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2624002789314381527.bin' '-l' '-1' '-v' '-w' '/tmp/graph2624002789314381527.weights' '-q' '0' '-e' '0.001'
[2025-05-31 01:08:31] [INFO ] Decomposing Gal with order
[2025-05-31 01:08:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 01:08:31] [INFO ] Removed a total of 2915 redundant transitions.
[2025-05-31 01:08:31] [INFO ] Flatten gal took : 48 ms
[2025-05-31 01:08:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 12 ms.
[2025-05-31 01:08:31] [INFO ] Time to serialize gal into /tmp/CTLFireability13348149787324510967.gal : 2 ms
[2025-05-31 01:08:31] [INFO ] Time to serialize properties into /tmp/CTLFireability7435895294499741941.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/CTLFireability13348149787324510967.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7435895294499741941.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.32948e+08,5.30082,207008,7225,164,227475,1647,985,1.72237e+06,78,13297,0


Converting to forward existential form...Done !
original formula: (EG(AF(E((((((u25.p1==1)&&(u25.p9==1))&&((i2.u22.p65==1)&&(u25.p73==1)))&&(i5.u14.p45==1))||((((u25.p1==1)&&(u25.p10==1))&&((i2.u7.p30==1...943
=> equivalent forward existential formula: (([(FwdU(EY(FwdU((Init * !(EG(!(EG(!(E((((((u25.p1==1)&&(u25.p9==1))&&((i2.u22.p65==1)&&(u25.p73==1)))&&(i5.u14....2284
Reverse transition relation is NOT exact ! Due to transitions t42, t210, t283, t299, t315, t331, t347, t379, t395, t544, u25.t276, i0.u2.t37, i1.u5.t32, i2...517
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 573/573 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 77 transition count 555
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 77 transition count 555
Applied a total of 4 rules in 9 ms. Remains 77 /79 variables (removed 2) and now considering 555/573 (removed 18) transitions.
// Phase 1: matrix 555 rows 77 cols
[2025-05-31 01:09:01] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:09:01] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-05-31 01:09:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:09:01] [INFO ] State equation strengthened by 243 read => feed constraints.
[2025-05-31 01:09:01] [INFO ] Implicit Places using invariants and state equation in 169 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 219 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 76/79 places, 555/573 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 555/555 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 231 ms. Remains : 76/79 places, 555/573 transitions.
[2025-05-31 01:09:01] [INFO ] Flatten gal took : 29 ms
[2025-05-31 01:09:01] [INFO ] Flatten gal took : 31 ms
[2025-05-31 01:09:01] [INFO ] Input system was already deterministic with 555 transitions.
[2025-05-31 01:09:01] [INFO ] Flatten gal took : 30 ms
[2025-05-31 01:09:01] [INFO ] Flatten gal took : 31 ms
[2025-05-31 01:09:01] [INFO ] Time to serialize gal into /tmp/CTLFireability10964063840935168901.gal : 5 ms
[2025-05-31 01:09:01] [INFO ] Time to serialize properties into /tmp/CTLFireability3756161160672979769.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/CTLFireability10964063840935168901.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3756161160672979769.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.
Detected timeout of ITS tools.
[2025-05-31 01:09:31] [INFO ] Flatten gal took : 33 ms
[2025-05-31 01:09:31] [INFO ] Applying decomposition
[2025-05-31 01:09:31] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10021335519088952931.txt' '-o' '/tmp/graph10021335519088952931.bin' '-w' '/tmp/graph10021335519088952931.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10021335519088952931.bin' '-l' '-1' '-v' '-w' '/tmp/graph10021335519088952931.weights' '-q' '0' '-e' '0.001'
[2025-05-31 01:09:31] [INFO ] Decomposing Gal with order
[2025-05-31 01:09:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 01:09:32] [INFO ] Removed a total of 2930 redundant transitions.
[2025-05-31 01:09:32] [INFO ] Flatten gal took : 48 ms
[2025-05-31 01:09:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 12 ms.
[2025-05-31 01:09:32] [INFO ] Time to serialize gal into /tmp/CTLFireability11044038131328450234.gal : 2 ms
[2025-05-31 01:09:32] [INFO ] Time to serialize properties into /tmp/CTLFireability16244838593962648446.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/CTLFireability11044038131328450234.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16244838593962648446.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.35402e+08,6.81275,267276,7269,175,301008,1835,961,2.23188e+06,86,17613,0


Converting to forward existential form...Done !
original formula: ((AX(((AF((((u25.p1==0)||(u25.p5==0))||((i1.u22.p65==0)||(u25.p73==0)))) * AG(EX((((u25.p1==1)&&(u25.p2==1))&&((i1.u4.p21==1)&&(u25.p73==...1588
=> equivalent forward existential formula: ([((Init * !((!(EX(!(((!(EG(!((((u25.p1==0)||(u25.p5==0))||((i1.u22.p65==0)||(u25.p73==0)))))) * !(E(TRUE U !(EX...3492
Reverse transition relation is NOT exact ! Due to transitions t51, t356, t388, t404, t553, u24.t1, u24.t287, u24.t552, u25.t285, i0.u2.t38, i1.u1.t2, i1.u1...491
Detected timeout of ITS tools.
[2025-05-31 01:10:02] [INFO ] Flatten gal took : 32 ms
[2025-05-31 01:10:02] [INFO ] Flatten gal took : 33 ms
[2025-05-31 01:10:02] [INFO ] Applying decomposition
[2025-05-31 01:10:02] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14543171847099980425.txt' '-o' '/tmp/graph14543171847099980425.bin' '-w' '/tmp/graph14543171847099980425.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14543171847099980425.bin' '-l' '-1' '-v' '-w' '/tmp/graph14543171847099980425.weights' '-q' '0' '-e' '0.001'
[2025-05-31 01:10:02] [INFO ] Decomposing Gal with order
[2025-05-31 01:10:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 01:10:02] [INFO ] Removed a total of 2961 redundant transitions.
[2025-05-31 01:10:02] [INFO ] Flatten gal took : 50 ms
[2025-05-31 01:10:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 12 ms.
[2025-05-31 01:10:02] [INFO ] Time to serialize gal into /tmp/CTLFireability18109380480457698166.gal : 2 ms
[2025-05-31 01:10:02] [INFO ] Time to serialize properties into /tmp/CTLFireability8614708240689849222.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/CTLFireability18109380480457698166.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8614708240689849222.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 12 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.92718e+08,6.68481,267008,6725,159,301609,1666,984,2.34007e+06,79,14458,0


Converting to forward existential form...Done !
original formula: E(!(AG(!((((u25.p1==1)&&(u25.p7==1))&&((i1.u7.p28==1)&&(u25.p73==1)))))) U E(AX(EX(EF((((((i1.u1.p15==1)&&(i1.u4.p22==1))&&((i1.u7.p29==1...474
=> equivalent forward existential formula: [(FwdU(FwdU(Init,!(!(E(TRUE U !(!((((u25.p1==1)&&(u25.p7==1))&&((i1.u7.p28==1)&&(u25.p73==1))))))))),!(EX(!(EX(E...551
Reverse transition relation is NOT exact ! Due to transitions t53, t181, t571, u25.t303, i0.u2.t40, i1.u1.t41, i1.u1.t42, i1.u4.t2, i1.u4.t36, i1.u4.t37, i...511
(forward)formula 0,1,132.285,2217704,1,0,1.55646e+06,2807,4904,2.23942e+07,260,20521,2546747
FORMULA AutonomousCar-PT-08a-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AG(((((((i0.u2.p18==0)||(i1.u4.p22==0))||((i3.u8.p32==0)||(i4.u11.p39==0)))||(((i1.u13.p43==0)||(i1.u16.p50==0))||((i1.u19.p57==0)||(i8....426
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(((((((i0.u2.p18==0)||(i1.u4.p22==0))||((i3.u8.p32==0)||(i4.u11.p39==0)))||(((i1.u13.p43==...508
(forward)formula 1,0,136.891,2217704,1,0,1.55646e+06,3365,4991,2.23942e+07,272,27914,3246301
FORMULA AutonomousCar-PT-08a-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF((EG((((u25.p1==0)||(u25.p2==0))||((i3.u6.p26==0)||(u25.p73==0)))) * ((EG((((((i1.u1.p15==0)||(i1.u4.p22==0))||((i1.u7.p29==0)||(i4.u11...561
=> equivalent forward existential formula: [FwdG(Init,!((EG((((u25.p1==0)||(u25.p2==0))||((i3.u6.p26==0)||(u25.p73==0)))) * ((EG((((((i1.u1.p15==0)||(i1.u4...767
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2025-05-31 01:13:23] [INFO ] Applying decomposition
[2025-05-31 01:13:23] [INFO ] Flatten gal took : 50 ms
[2025-05-31 01:13:23] [INFO ] Decomposing Gal with order
[2025-05-31 01:13:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 01:13:24] [INFO ] Removed a total of 3273 redundant transitions.
[2025-05-31 01:13:24] [INFO ] Flatten gal took : 55 ms
[2025-05-31 01:13:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 6 ms.
[2025-05-31 01:13:24] [INFO ] Time to serialize gal into /tmp/CTLFireability16574424249971306952.gal : 0 ms
[2025-05-31 01:13:24] [INFO ] Time to serialize properties into /tmp/CTLFireability7664324758316563136.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/CTLFireability16574424249971306952.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7664324758316563136.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.92718e+08,0.050426,5920,148,103,5070,372,110,5454,71,1520,0


Converting to forward existential form...Done !
original formula: AF((EG((((u1.p1==0)||(u2.p2==0))||((u5.p26==0)||(u11.p73==0)))) * ((EG((((((u3.p15==0)||(u4.p22==0))||((u5.p29==0)||(u6.p39==0)))||(((u7....486
=> equivalent forward existential formula: [FwdG(Init,!((EG((((u1.p1==0)||(u2.p2==0))||((u5.p26==0)||(u11.p73==0)))) * ((EG((((((u3.p15==0)||(u4.p22==0))||...682
Reverse transition relation is NOT exact ! Due to transitions t66, t98, t130, t154, t194, t234, t266, t274, t305, t571, u2.t303, u3.t40, u3.t41, u3.t42, u4...445
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,1,2.61013,146080,1,0,321149,1728,928,340639,359,8848,345947
FORMULA AutonomousCar-PT-08a-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX(EX((!(A((((u1.p1==1)&&(u2.p6==1))&&((u5.p30==1)&&(u11.p73==1))) U AF((((u1.p1==1)&&(u2.p11==1))&&((u5.p26==1)&&(u11.p73==1)))))) + (((...461
=> equivalent forward existential formula: [(EY(Init) * !(EX((!(!((E(!(!(EG(!((((u1.p1==1)&&(u2.p11==1))&&((u5.p26==1)&&(u11.p73==1))))))) U (!((((u1.p1==1...681
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 1,1,4.35281,223520,1,0,489062,2019,1060,536356,370,11304,549371
FORMULA AutonomousCar-PT-08a-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(EF(((!(A(EG((((((u3.p18==1)&&(u4.p25==1))&&((u5.p29==1)&&(u6.p39==1)))&&(((u7.p43==1)&&(u8.p53==1))&&((u9.p57==1)&&(u10.p64==1))))&&(u...499
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((!(!((E(!(!((((((u3.p18==1)&&(u4.p22==1))&&((u5.p29==1)&&(u6.p36==1)))&&(((u7.p4...1007
(forward)formula 2,1,5.33877,275488,1,0,607587,2404,1171,688561,370,15955,721497
FORMULA AutonomousCar-PT-08a-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A(!((((((u3.p18==1)&&(u4.p25==1))&&((u5.p29==1)&&(u6.p36==1)))&&(((u7.p46==1)&&(u8.p53==1))&&((u9.p57==1)&&(u10.p67==1))))&&(u11.p74==1))...297
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!((((((u3.p15==1)&&(u4.p25==1))&&((u5.p29==1)&&(u6.p39==1)))&&(((u7.p46==1)&&(u8.p53==1))&...666
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 3,0,6.21355,317472,1,0,700176,2414,1216,804354,370,16113,825841
FORMULA AutonomousCar-PT-08a-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(((((u1.p1==1)&&(u2.p7==1))&&((u10.p65==1)&&(u11.p73==1))) + (AF((((u1.p1==1)&&(u2.p8==1))&&((u9.p58==1)&&(u11.p73==1)))) * ((((u1.p1==...296
=> equivalent forward existential formula: [FwdG(Init,((((u1.p1==1)&&(u2.p7==1))&&((u10.p65==1)&&(u11.p73==1))) + (!(EG(!((((u1.p1==1)&&(u2.p8==1))&&((u9.p...345
(forward)formula 4,0,7.11213,343652,1,0,751131,2502,1276,878864,373,16885,896046
FORMULA AutonomousCar-PT-08a-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((A(((AX((((u1.p1==1)&&(u2.p5==1))&&((u7.p44==1)&&(u11.p73==1)))) + (((u1.p1==1)&&(u2.p6==1))&&((u8.p51==1)&&(u11.p73==1)))) * !((EG(((...756
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!((!(E(TRUE U (((u1.p1==1)&&(u2.p6==1))&&((u9.p58==1)&&(u11.p73==1))))) * EX(!((((((u...1309
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 5,1,8.31251,389100,1,0,856028,2627,1349,1.02096e+06,373,18263,1037814
FORMULA AutonomousCar-PT-08a-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(((AF((EF((((((u3.p18==1)&&(u4.p25==1))&&((u5.p32==1)&&(u6.p36==1)))&&(((u7.p43==1)&&(u8.p53==1))&&((u9.p60==1)&&(u10.p64==1))))&&(u11....897
=> equivalent forward existential formula: [FwdG(Init,((!(EG(!((E(TRUE U (((((u3.p18==1)&&(u4.p25==1))&&((u5.p32==1)&&(u6.p36==1)))&&(((u7.p43==1)&&(u8.p53...1392
(forward)formula 6,0,10.6726,514412,1,0,1.1341e+06,2797,1451,1.32243e+06,373,20435,1345727
FORMULA AutonomousCar-PT-08a-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EG(A(AF(AX((((u1.p1==1)&&(u2.p6==1))&&((u6.p35==1)&&(u11.p73==1))))) U EX((!((((u1.p1==1)&&(u2.p8==1))&&((u4.p23==1)&&(u11.p73==1)))) + ...238
=> equivalent forward existential formula: [FwdG((Init * EG(!((E(!(EX((!((((u1.p1==1)&&(u2.p8==1))&&((u4.p23==1)&&(u11.p73==1)))) + EX((((u1.p1==1)&&(u2.p1...576
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 7,1,11.9052,573932,1,0,1.26864e+06,2896,1555,1.47632e+06,389,21624,1488103
FORMULA AutonomousCar-PT-08a-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EG(AF(E((((((u1.p1==1)&&(u2.p9==1))&&((u10.p65==1)&&(u11.p73==1)))&&(u7.p45==1))||((((u1.p1==1)&&(u2.p10==1))&&((u5.p30==1)&&(u11.p73==1...849
=> equivalent forward existential formula: (([(FwdU(EY(FwdU((Init * !(EG(!(EG(!(E((((((u1.p1==1)&&(u2.p9==1))&&((u10.p65==1)&&(u11.p73==1)))&&(u7.p45==1))|...2088
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 8,0,14.7666,675016,1,0,1.4983e+06,2980,1626,1.77171e+06,393,22670,1750747
FORMULA AutonomousCar-PT-08a-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: ((AX(((AF((((u1.p1==0)||(u2.p5==0))||((u10.p65==0)||(u11.p73==0)))) * AG(EX((((u1.p1==1)&&(u2.p2==1))&&((u4.p21==1)&&(u11.p73==1)))))) * ...1378
=> equivalent forward existential formula: ([((Init * !((!(EX(!(((!(EG(!((((u1.p1==0)||(u2.p5==0))||((u10.p65==0)||(u11.p73==0)))))) * !(E(TRUE U !(EX((((u...3066
(forward)formula 9,0,15.9883,736328,1,0,1.63264e+06,3023,1782,1.93218e+06,394,23606,1923869
FORMULA AutonomousCar-PT-08a-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 1198128 ms.

BK_STOP 1748654020206

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="AutonomousCar-PT-08a"
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 AutonomousCar-PT-08a, 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 r002-tall-174853729800714"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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