Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102200289.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 FireWire-PT-07, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102200289
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 97K 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 FireWire-PT-07-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-15
FORMULA_NAME FireWire-PT-07-CTLCardinality-2025-00
FORMULA_NAME FireWire-PT-07-CTLCardinality-2025-01
FORMULA_NAME FireWire-PT-07-CTLCardinality-2025-02
FORMULA_NAME FireWire-PT-07-CTLCardinality-2025-03
FORMULA_NAME FireWire-PT-07-CTLCardinality-2025-04
FORMULA_NAME FireWire-PT-07-CTLCardinality-2025-05
FORMULA_NAME FireWire-PT-07-CTLCardinality-2025-06
FORMULA_NAME FireWire-PT-07-CTLCardinality-2025-07
FORMULA_NAME FireWire-PT-07-CTLCardinality-2025-08
FORMULA_NAME FireWire-PT-07-CTLCardinality-2025-09
FORMULA_NAME FireWire-PT-07-CTLCardinality-2025-10
FORMULA_NAME FireWire-PT-07-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748851286262

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-02 08:01:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 08:01:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 08:01:29] [INFO ] Load time of PNML (sax parser for PT used): 245 ms
[2025-06-02 08:01:29] [INFO ] Transformed 126 places.
[2025-06-02 08:01:29] [INFO ] Transformed 396 transitions.
[2025-06-02 08:01:29] [INFO ] Found NUPN structural information;
[2025-06-02 08:01:29] [INFO ] Parsed PT model containing 126 places and 396 transitions and 1471 arcs in 479 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 32 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-07-CTLCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-07-CTLCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-07-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-07-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 59 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 343/343 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 123 transition count 336
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 123 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 122 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 122 transition count 333
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 122 transition count 327
Applied a total of 15 rules in 87 ms. Remains 122 /126 variables (removed 4) and now considering 327/343 (removed 16) transitions.
[2025-06-02 08:01:29] [INFO ] Flow matrix only has 301 transitions (discarded 26 similar events)
// Phase 1: matrix 301 rows 122 cols
[2025-06-02 08:01:29] [INFO ] Computed 8 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:01:30] [INFO ] Implicit Places using invariants in 520 ms returned []
[2025-06-02 08:01:30] [INFO ] Flow matrix only has 301 transitions (discarded 26 similar events)
[2025-06-02 08:01:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:01:30] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-02 08:01:30] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 1118 ms to find 0 implicit places.
Running 326 sub problems to find dead transitions.
[2025-06-02 08:01:30] [INFO ] Flow matrix only has 301 transitions (discarded 26 similar events)
[2025-06-02 08:01:30] [INFO ] Invariant cache hit.
[2025-06-02 08:01:30] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 326 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:01:36] [INFO ] Deduced a trap composed of 41 places in 198 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:01:37] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:01:37] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:01:37] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:01:37] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:01:38] [INFO ] Deduced a trap composed of 18 places in 183 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:01:39] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (OVERLAPS) 300/422 variables, 122/137 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 43/180 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 7 (OVERLAPS) 1/423 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 326 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 0/423 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 326 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 181 constraints, problems are : Problem set: 0 solved, 326 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 326 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (OVERLAPS) 300/422 variables, 122/137 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 43/180 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 326/506 constraints. Problems are: Problem set: 0 solved, 326 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/423 variables, and 506 constraints, problems are : Problem set: 0 solved, 326 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 43/44 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60648ms problems are : Problem set: 0 solved, 326 unsolved
Search for dead transitions found 0 dead transitions in 60683ms
Starting structural reductions in LTL mode, iteration 1 : 122/126 places, 327/343 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61942 ms. Remains : 122/126 places, 327/343 transitions.
Support contains 59 out of 122 places after structural reductions.
[2025-06-02 08:02:31] [INFO ] Flatten gal took : 123 ms
[2025-06-02 08:02:31] [INFO ] Flatten gal took : 71 ms
[2025-06-02 08:02:32] [INFO ] Input system was already deterministic with 327 transitions.
Support contains 56 out of 122 places (down from 59) after GAL structural reductions.
RANDOM walk for 40000 steps (2167 resets) in 2866 ms. (13 steps per ms) remains 17/39 properties
BEST_FIRST walk for 4002 steps (60 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (70 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (64 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (55 resets) in 69 ms. (57 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (59 resets) in 92 ms. (43 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (69 resets) in 71 ms. (55 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (53 resets) in 62 ms. (63 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4003 steps (55 resets) in 56 ms. (70 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (55 resets) in 44 ms. (88 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (58 resets) in 27 ms. (143 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (52 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (100 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (45 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (64 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (52 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (57 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (61 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
[2025-06-02 08:02:33] [INFO ] Flow matrix only has 301 transitions (discarded 26 similar events)
[2025-06-02 08:02:33] [INFO ] Invariant cache hit.
[2025-06-02 08:02:33] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 85/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:02:33] [INFO ] Deduced a trap composed of 22 places in 202 ms of which 26 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 12/120 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:02:33] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:02:33] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:02:34] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 300/420 variables, 120/132 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 43/175 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 2/422 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 1/423 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 0/423 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 178 constraints, problems are : Problem set: 0 solved, 16 unsolved in 2146 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 85/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 12/120 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 300/420 variables, 120/132 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 43/175 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 15/190 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:02:36] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/420 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 2/422 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 1)
(s37 0)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/423 variables, and 194 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 43/44 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7178ms problems are : Problem set: 0 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 327/327 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 122 transition count 324
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 121 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 121 transition count 321
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 1 with 2 rules applied. Total rules applied 7 place count 120 transition count 320
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 118 transition count 324
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 15 place count 118 transition count 320
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 118 transition count 318
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 118 transition count 320
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 21 place count 117 transition count 318
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 117 transition count 316
Applied a total of 23 rules in 135 ms. Remains 117 /122 variables (removed 5) and now considering 316/327 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 117/122 places, 316/327 transitions.
RANDOM walk for 40000 steps (2170 resets) in 562 ms. (71 steps per ms) remains 11/16 properties
BEST_FIRST walk for 40003 steps (566 resets) in 202 ms. (197 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (561 resets) in 181 ms. (219 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (557 resets) in 172 ms. (231 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (560 resets) in 206 ms. (193 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (738 resets) in 194 ms. (205 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (583 resets) in 130 ms. (305 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (546 resets) in 188 ms. (211 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (541 resets) in 140 ms. (283 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (577 resets) in 175 ms. (227 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (533 resets) in 126 ms. (314 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (560 resets) in 181 ms. (219 steps per ms) remains 11/11 properties
[2025-06-02 08:02:41] [INFO ] Flow matrix only has 289 transitions (discarded 27 similar events)
// Phase 1: matrix 289 rows 117 cols
[2025-06-02 08:02:41] [INFO ] Computed 8 invariants in 6 ms
[2025-06-02 08:02:41] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 89/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:02:41] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 11/115 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:02:41] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:02:42] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:02:42] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 289/404 variables, 115/127 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 44/171 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/404 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 2/406 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/406 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/406 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 173 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1385 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 89/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 11/115 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:02:43] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 289/404 variables, 115/128 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/404 variables, 44/172 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 10/182 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/404 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 2/406 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:02:44] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:02:44] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/406 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 0/406 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 187 constraints, problems are : Problem set: 0 solved, 11 unsolved in 3515 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4925ms problems are : Problem set: 0 solved, 11 unsolved
Parikh walk visited 3 properties in 7225 ms.
Support contains 12 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 316/316 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 114 transition count 309
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 114 transition count 309
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 114 transition count 308
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 112 transition count 303
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 112 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 111 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 111 transition count 301
Applied a total of 13 rules in 29 ms. Remains 111 /117 variables (removed 6) and now considering 301/316 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 111/117 places, 301/316 transitions.
RANDOM walk for 40000 steps (2165 resets) in 196 ms. (203 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (603 resets) in 58 ms. (678 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (526 resets) in 102 ms. (388 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (531 resets) in 101 ms. (392 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (759 resets) in 108 ms. (366 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (563 resets) in 127 ms. (312 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (577 resets) in 143 ms. (277 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (598 resets) in 126 ms. (314 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (567 resets) in 62 ms. (634 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 682718 steps, run timeout after 3001 ms. (steps per millisecond=227 ) properties seen :5 out of 8
Probabilistic random walk after 682718 steps, saw 150616 distinct states, run finished after 3011 ms. (steps per millisecond=226 ) properties seen :5
[2025-06-02 08:02:57] [INFO ] Flow matrix only has 274 transitions (discarded 27 similar events)
// Phase 1: matrix 274 rows 111 cols
[2025-06-02 08:02:57] [INFO ] Computed 8 invariants in 2 ms
[2025-06-02 08:02:57] [INFO ] State equation strengthened by 42 read => feed constraints.
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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 63/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 41/109 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:02:57] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:02:57] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:02:57] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 274/383 variables, 109/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 42/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/385 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/385 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 164 constraints, problems are : Problem set: 0 solved, 3 unsolved in 648 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 63/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 41/109 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 274/383 variables, 109/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 42/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/385 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/385 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 385/385 variables, and 167 constraints, problems are : Problem set: 0 solved, 3 unsolved in 701 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1361ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 724 ms.
Support contains 5 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 301/301 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 110 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 110 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 110 transition count 298
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 109 transition count 300
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 109 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 109 transition count 297
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 108 transition count 296
Applied a total of 9 rules in 66 ms. Remains 108 /111 variables (removed 3) and now considering 296/301 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 108/111 places, 296/301 transitions.
RANDOM walk for 40000 steps (2317 resets) in 195 ms. (204 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (581 resets) in 69 ms. (571 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (536 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (553 resets) in 69 ms. (571 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 686076 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :0 out of 3
Probabilistic random walk after 686076 steps, saw 153307 distinct states, run finished after 3001 ms. (steps per millisecond=228 ) properties seen :0
[2025-06-02 08:03:02] [INFO ] Flow matrix only has 267 transitions (discarded 29 similar events)
// Phase 1: matrix 267 rows 108 cols
[2025-06-02 08:03:02] [INFO ] Computed 8 invariants in 7 ms
[2025-06-02 08:03:02] [INFO ] State equation strengthened by 41 read => feed constraints.
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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 60/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 194/259 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 69/328 variables, 19/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/330 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/330 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 42/372 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/372 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/372 variables, 11/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/372 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 3/375 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/375 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/375 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/375 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 375/375 variables, and 157 constraints, problems are : Problem set: 0 solved, 3 unsolved in 397 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 60/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 194/259 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 69/328 variables, 19/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/330 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/330 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 42/372 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/372 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/372 variables, 11/157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/372 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 3/375 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/375 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/375 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/375 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 375/375 variables, and 160 constraints, problems are : Problem set: 0 solved, 3 unsolved in 862 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1276ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 625 ms.
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 296/296 transitions.
Applied a total of 0 rules in 10 ms. Remains 108 /108 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 108/108 places, 296/296 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 296/296 transitions.
Applied a total of 0 rules in 9 ms. Remains 108 /108 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2025-06-02 08:03:04] [INFO ] Flow matrix only has 267 transitions (discarded 29 similar events)
[2025-06-02 08:03:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:03:04] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-06-02 08:03:04] [INFO ] Flow matrix only has 267 transitions (discarded 29 similar events)
[2025-06-02 08:03:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:03:04] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-02 08:03:04] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:03:04] [INFO ] Redundant transitions in 20 ms returned []
Running 294 sub problems to find dead transitions.
[2025-06-02 08:03:04] [INFO ] Flow matrix only has 267 transitions (discarded 29 similar events)
[2025-06-02 08:03:04] [INFO ] Invariant cache hit.
[2025-06-02 08:03:04] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:03:06] [INFO ] Deduced a trap composed of 37 places in 183 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:03:06] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:03:07] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:03:07] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:03:07] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:03:07] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:03:08] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 17 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (OVERLAPS) 267/374 variables, 107/122 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 41/163 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:03:16] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (OVERLAPS) 1/375 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:03:34] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 21 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 375/375 variables, and 166 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (OVERLAPS) 267/374 variables, 107/124 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 41/165 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 294/459 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:03:42] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:03:50] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 16 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/375 variables, and 461 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/108 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60218ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 60222ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60652 ms. Remains : 108/108 places, 296/296 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 110 edges and 108 vertex of which 29 / 108 are part of one of the 4 SCC in 3 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 119 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 126 transitions.
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 0 with 2 rules applied. Total rules applied 3 place count 82 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 82 transition count 166
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 81 transition count 165
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 81 transition count 164
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 0 with 2 rules applied. Total rules applied 11 place count 80 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 79 transition count 138
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 79 transition count 138
Free-agglomeration rule applied 3 times with reduction of 2 identical transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 79 transition count 133
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 76 transition count 132
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 76 transition count 132
Applied a total of 22 rules in 60 ms. Remains 76 /108 variables (removed 32) and now considering 132/296 (removed 164) transitions.
Running SMT prover for 3 properties.
[2025-06-02 08:04:04] [INFO ] Flow matrix only has 130 transitions (discarded 2 similar events)
// Phase 1: matrix 130 rows 76 cols
[2025-06-02 08:04:04] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 08:04:05] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-02 08:04:05] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 08:04:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-02 08:04:05] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:04:05] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:04:05] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 4 ms to minimize.
[2025-06-02 08:04:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 160 ms
TRAPS : Iteration 1
[2025-06-02 08:04:05] [INFO ] After 376ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2025-06-02 08:04:05] [INFO ] After 483ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 746 ms.
[2025-06-02 08:04:05] [INFO ] Flatten gal took : 49 ms
[2025-06-02 08:04:05] [INFO ] Flatten gal took : 43 ms
[2025-06-02 08:04:05] [INFO ] Input system was already deterministic with 327 transitions.
Computed a total of 21 stabilizing places and 45 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 122/122 places, 327/327 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 117 transition count 316
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 117 transition count 316
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 117 transition count 314
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 115 transition count 310
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 112 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 112 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 111 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 111 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 109 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 108 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 108 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 107 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 107 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 106 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 106 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 105 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 105 transition count 286
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 1 with 2 rules applied. Total rules applied 36 place count 104 transition count 285
Applied a total of 36 rules in 79 ms. Remains 104 /122 variables (removed 18) and now considering 285/327 (removed 42) transitions.
[2025-06-02 08:04:05] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
// Phase 1: matrix 259 rows 104 cols
[2025-06-02 08:04:05] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:04:06] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-06-02 08:04:06] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2025-06-02 08:04:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:04:06] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-02 08:04:06] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:04:06] [INFO ] Redundant transitions in 11 ms returned []
Running 282 sub problems to find dead transitions.
[2025-06-02 08:04:06] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2025-06-02 08:04:06] [INFO ] Invariant cache hit.
[2025-06-02 08:04:06] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:04:08] [INFO ] Deduced a trap composed of 35 places in 175 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:04:08] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:04:08] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:04:09] [INFO ] Deduced a trap composed of 21 places in 168 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:04:09] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:04:09] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:04:10] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:04:10] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 18 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 258/361 variables, 103/119 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 36/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 1/362 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 362/363 variables, and 156 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 258/361 variables, 103/119 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 36/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 282/437 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:04:46] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:04:51] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 282 unsolved
SMT process timed out in 60202ms, After SMT, problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 60205ms
Starting structural reductions in SI_CTL mode, iteration 1 : 104/122 places, 285/327 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60743 ms. Remains : 104/122 places, 285/327 transitions.
[2025-06-02 08:05:06] [INFO ] Flatten gal took : 23 ms
[2025-06-02 08:05:06] [INFO ] Flatten gal took : 18 ms
[2025-06-02 08:05:06] [INFO ] Input system was already deterministic with 285 transitions.
[2025-06-02 08:05:06] [INFO ] Flatten gal took : 23 ms
[2025-06-02 08:05:06] [INFO ] Flatten gal took : 25 ms
[2025-06-02 08:05:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality950574015091468842.gal : 16 ms
[2025-06-02 08:05:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality14625427177967550245.ctl : 6 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/CTLCardinality950574015091468842.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14625427177967550245.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.1877e+06,5.1908,107336,2,5089,5,297543,6,0,700,382873,0


Converting to forward existential form...Done !
original formula: A(!(EF(EG(AF((p35==0))))) U EF((p45==1)))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (p45==1)))))) * !(E(!(E(TRUE U (p45==1))) U (!(!(E(TRUE U EG(!(EG(!((p35==0)))))))) * ...190
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t15, t17, t19, t23, t24, t26, t27, t28, t30, t32, t36...606
Detected timeout of ITS tools.
[2025-06-02 08:05:36] [INFO ] Flatten gal took : 26 ms
[2025-06-02 08:05:36] [INFO ] Applying decomposition
[2025-06-02 08:05:36] [INFO ] Flatten gal took : 25 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/graph12779600017109597696.txt' '-o' '/tmp/graph12779600017109597696.bin' '-w' '/tmp/graph12779600017109597696.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12779600017109597696.bin' '-l' '-1' '-v' '-w' '/tmp/graph12779600017109597696.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:05:37] [INFO ] Decomposing Gal with order
[2025-06-02 08:05:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:05:37] [INFO ] Removed a total of 435 redundant transitions.
[2025-06-02 08:05:37] [INFO ] Flatten gal took : 133 ms
[2025-06-02 08:05:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 31 ms.
[2025-06-02 08:05:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality7171567590158062668.gal : 14 ms
[2025-06-02 08:05:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality15929936539044534668.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/CTLCardinality7171567590158062668.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15929936539044534668.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.1877e+06,3.96969,94608,1872,118,121132,982,615,574539,80,6255,0


Converting to forward existential form...Done !
original formula: A(!(EF(EG(AF((i2.u10.p35==0))))) U EF((i1.i1.u15.p45==1)))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (i1.i1.u15.p45==1)))))) * !(E(!(E(TRUE U (i1.i1.u15.p45==1))) U (!(!(E(TRUE U EG(!(EG(...227
Reverse transition relation is NOT exact ! Due to transitions t5, t41, t43, t47, t48, t50, t58, t63, t68, t73, t78, t81, t90, t91, t92, t93, t98, t139, t14...793
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 327/327 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 118 transition count 317
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 118 transition count 317
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 118 transition count 315
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 116 transition count 311
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 109 transition count 293
Applied a total of 28 rules in 23 ms. Remains 109 /122 variables (removed 13) and now considering 293/327 (removed 34) transitions.
[2025-06-02 08:06:07] [INFO ] Flow matrix only has 267 transitions (discarded 26 similar events)
// Phase 1: matrix 267 rows 109 cols
[2025-06-02 08:06:07] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:06:07] [INFO ] Implicit Places using invariants in 190 ms returned []
[2025-06-02 08:06:07] [INFO ] Flow matrix only has 267 transitions (discarded 26 similar events)
[2025-06-02 08:06:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:06:07] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-02 08:06:08] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2025-06-02 08:06:08] [INFO ] Flow matrix only has 267 transitions (discarded 26 similar events)
[2025-06-02 08:06:08] [INFO ] Invariant cache hit.
[2025-06-02 08:06:08] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:12] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:12] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:12] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:12] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:12] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:13] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:13] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 266/375 variables, 109/124 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 37/161 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (OVERLAPS) 1/376 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 9 (OVERLAPS) 0/376 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 162 constraints, problems are : Problem set: 0 solved, 292 unsolved in 23610 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 266/375 variables, 109/124 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 37/161 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 292/453 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (OVERLAPS) 1/376 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 454 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53801ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 53803ms
Starting structural reductions in LTL mode, iteration 1 : 109/122 places, 293/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54450 ms. Remains : 109/122 places, 293/327 transitions.
[2025-06-02 08:07:02] [INFO ] Flatten gal took : 22 ms
[2025-06-02 08:07:02] [INFO ] Flatten gal took : 23 ms
[2025-06-02 08:07:02] [INFO ] Input system was already deterministic with 293 transitions.
[2025-06-02 08:07:02] [INFO ] Flatten gal took : 23 ms
[2025-06-02 08:07:02] [INFO ] Flatten gal took : 22 ms
[2025-06-02 08:07:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality1900878207977116194.gal : 6 ms
[2025-06-02 08:07:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality11284075274947211985.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/CTLCardinality1900878207977116194.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11284075274947211985.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.26252e+06,2.5758,56464,2,2610,5,193484,6,0,728,186303,0


Converting to forward existential form...Done !
original formula: EX(EF(((p21==0)&&(p83==1))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * ((p21==0)&&(p83==1)))] != FALSE
(forward)formula 0,1,3.96854,56592,1,0,9,195056,9,1,1441,186681,4
FORMULA FireWire-PT-07-CTLCardinality-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 122/122 places, 327/327 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 117 transition count 316
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 117 transition count 316
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 117 transition count 314
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 115 transition count 310
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 112 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 112 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 111 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 111 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 109 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 108 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 108 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 107 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 107 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 106 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 106 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 105 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 105 transition count 286
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 1 with 2 rules applied. Total rules applied 36 place count 104 transition count 285
Applied a total of 36 rules in 45 ms. Remains 104 /122 variables (removed 18) and now considering 285/327 (removed 42) transitions.
[2025-06-02 08:07:06] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
// Phase 1: matrix 259 rows 104 cols
[2025-06-02 08:07:06] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:07:06] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-02 08:07:06] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2025-06-02 08:07:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:07:06] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-02 08:07:06] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:07:06] [INFO ] Redundant transitions in 7 ms returned []
Running 282 sub problems to find dead transitions.
[2025-06-02 08:07:06] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2025-06-02 08:07:06] [INFO ] Invariant cache hit.
[2025-06-02 08:07:06] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:08] [INFO ] Deduced a trap composed of 35 places in 184 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:08] [INFO ] Deduced a trap composed of 36 places in 152 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:08] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:09] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:09] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:09] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:10] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:10] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 20 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 258/361 variables, 103/119 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 36/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 1/362 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 0.0)
(t1 0.0)
(t2 0.0)
(t3 0.0)
(t4 (/ 13.0 2.0))
(t5 1.0)
(t6 0.0)
(t7 0.0)
(t8 0.0)
(t9 0.0)
(t10 0.0)
(t11 0.0)
(t12 0.0)
(t13 0.0)
(t14 0.0)
(t15 0.0)
(t16 (/ 3.0 2.0))
(t17 0.0)
(t18 0.0)
(t19 0.0)
(t20 0.0)
(t21 0.0)
(t22 0.0)
(t23 1.0)
(t24 0.0)
(t25 0.0)
(t26 0.0)
(t27 0.0)
(t28 0.0)
(t29 0.0)
(t30 0.0)
(t31 0.0)
(t32 0.0)
(t33 0.0)
(t34 0.0)
(t35 0.0)
(t36 1.0)
(t37 0.0)
(t38 0.0)
(t39 0.0)
(t40 0.0)
(t41 7.0)
(t42 1.0)
(t43 1.0)
(t44 1.0)
(t46 1.0)
(t47 0.0)
(t48 1.0)
(t49 0.0)
(t50 0.0)
(t51 0.0)
(t52 0.0)
(t53 0.0)
(t54 0.0)
(t55 0.0)
(t56 (/ 9.0 10.0))
(t57 (/ 1.0 10.0))
(t58 0.0)
(t59 1.0)
(t60 (/ 1.0 10.0))
(t61 (/ 9.0 10.0))
(t62 0.0)
(t63 0.0)
(t64 1.0)
(t65 0.0)
(t66 (/ 9.0 10.0))
(t67 (/ 1.0 10.0))
(t68 0.0)
(t69 1.0)
(t70 0.0)
(t71 (/ 9.0 10.0))
(t72 (/ 1.0 10.0))
(t73 0.0)
(t74 1.0)
(t75 0.0)
(t76 (/ 9.0 10.0))
(t77 (/ 1.0 10.0))
(t78 0.0)
(t79 1.0)
(t80 (/ 9.0 10.0))
(t81 (/ 1.0 10.0))
(t82 0.0)
(t83 1.0)
(t84 0.0)
(t85 0.0)
(t86 0.0)
(t87 0.0)
(t88 0.0)
(t89 0.0)
(t90 0.0)
(t91 0.0)
(t92 0.0)
(t93 0.0)
(t94 0.0)
(t95 0.0)
(t96 0.0)
(t97 0.0)
(t98 0.0)
(t99 0.0)
(t100 0.0)
(t101 0.0)
(t102 0.0)
(t103 0.0)
(t104 (/ 9.0 10.0))
(t105 0.0)
(t106 (/ 1.0 10.0))
(t107 (/ 9.0 10.0))
(t108 0.0)
(t109 (/ 1.0 10.0))
(t110 (/ 9.0 10.0))
(t111 0.0)
(t112 (/ 1.0 10.0))
(t113 1.0)
(t114 (/ 9.0 10.0))
(t115 0.0)
(t116 (/ 1.0 10.0))
(t117 (/ 9.0 10.0))
(t118 (/ 33.0 5.0))
(t119 0.0)
(t120 (/ 9.0 10.0))
(t121 0.0)
(t122 (/ 33.0 5.0))
(t123 0.0)
(t124 0.0)
(t125 0.0)
(t126 0.0)
(t127 0.0)
(t128 0.0)
(t129 0.0)
(t130 (/ 13.0 2.0))
(t131 (/ 11.0 2.0))
(t132 1.0)
(t133 (/ 9.0 2.0))
(t134 2.0)
(t135 0.0)
(t136 0.0)
(t137 0.0)
(t138 0.0)
(t139 0.0)
(t140 0.0)
(t141 (/ 9.0 10.0))
(t142 (/ 1.0 10.0))
(t143 0.0)
(t144 1.0)
(t145 0.0)
(t146 0.0)
(t147 1.0)
(t148 0.0)
(t149 0.0)
(t150 0.0)
(t151 0.0)
(t152 0.0)
(t153 (/ 9.0 10.0))
(t154 0.0)
(t155 (/ 11.0 10.0))
(t156 (/ 9.0 10.0))
(t157 (/ 1.0 10.0))
(t158 0.0)
(t159 (/ 9.0 10.0))
(t160 (/ 1.0 10.0))
(t161 0.0)
(t162 0.0)
(t163 (/ 9.0 10.0))
(t164 (/ 1.0 10.0))
(t165 0.0)
(t166 (/ 9.0 10.0))
(t167 (/ 1.0 10.0))
(t168 0.0)
(t169 (/ 9.0 10.0))timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 362/363 variables, and 156 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 258/361 variables, 103/119 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 36/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 282/437 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:45] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:50] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 9 (OVERLAPS) 1/362 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 362/363 variables, and 440 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60156ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 60158ms
Starting structural reductions in SI_CTL mode, iteration 1 : 104/122 places, 285/327 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60618 ms. Remains : 104/122 places, 285/327 transitions.
[2025-06-02 08:08:06] [INFO ] Flatten gal took : 12 ms
[2025-06-02 08:08:06] [INFO ] Flatten gal took : 12 ms
[2025-06-02 08:08:06] [INFO ] Input system was already deterministic with 285 transitions.
[2025-06-02 08:08:06] [INFO ] Flatten gal took : 12 ms
[2025-06-02 08:08:06] [INFO ] Flatten gal took : 12 ms
[2025-06-02 08:08:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality2614658499812245523.gal : 3 ms
[2025-06-02 08:08:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality1597442654130376323.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/CTLCardinality2614658499812245523.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1597442654130376323.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.1877e+06,4.97339,105772,2,5089,5,297543,6,0,700,382873,0


Converting to forward existential form...Done !
original formula: EF(EG((p3==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p3==1))] != FALSE
Hit Full ! (commute/partial/dont) 251/0/34
(forward)formula 0,1,6.38588,105772,1,0,9,298268,19,2,4117,382873,8
FORMULA FireWire-PT-07-CTLCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 327/327 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 118 transition count 317
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 118 transition count 317
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 118 transition count 315
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 116 transition count 311
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 106 transition count 287
Applied a total of 34 rules in 13 ms. Remains 106 /122 variables (removed 16) and now considering 287/327 (removed 40) transitions.
[2025-06-02 08:08:13] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
// Phase 1: matrix 261 rows 106 cols
[2025-06-02 08:08:13] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:08:13] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-02 08:08:13] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2025-06-02 08:08:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:08:13] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-02 08:08:13] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2025-06-02 08:08:13] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2025-06-02 08:08:13] [INFO ] Invariant cache hit.
[2025-06-02 08:08:13] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:17] [INFO ] Deduced a trap composed of 36 places in 181 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:17] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:18] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:18] [INFO ] Deduced a trap composed of 22 places in 180 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:18] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:19] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/120 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/157 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 158 constraints, problems are : Problem set: 0 solved, 286 unsolved in 24351 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/120 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/157 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 286/443 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 286 unsolved
SMT process timed out in 54458ms, After SMT, problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 54459ms
Starting structural reductions in LTL mode, iteration 1 : 106/122 places, 287/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54849 ms. Remains : 106/122 places, 287/327 transitions.
[2025-06-02 08:09:08] [INFO ] Flatten gal took : 10 ms
[2025-06-02 08:09:08] [INFO ] Flatten gal took : 10 ms
[2025-06-02 08:09:08] [INFO ] Input system was already deterministic with 287 transitions.
[2025-06-02 08:09:08] [INFO ] Flatten gal took : 10 ms
[2025-06-02 08:09:08] [INFO ] Flatten gal took : 10 ms
[2025-06-02 08:09:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality1509859944631574707.gal : 2 ms
[2025-06-02 08:09:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality6379595300477123830.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/CTLCardinality1509859944631574707.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6379595300477123830.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.23367e+06,7.95838,169256,2,6179,5,456345,6,0,710,596611,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,7.968,169256,1,0,6,456345,7,1,1082,596611,1
FORMULA FireWire-PT-07-CTLCardinality-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 327/327 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 118 transition count 317
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 118 transition count 317
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 118 transition count 315
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 116 transition count 311
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 106 transition count 287
Applied a total of 34 rules in 16 ms. Remains 106 /122 variables (removed 16) and now considering 287/327 (removed 40) transitions.
[2025-06-02 08:09:16] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2025-06-02 08:09:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:09:16] [INFO ] Implicit Places using invariants in 136 ms returned []
[2025-06-02 08:09:16] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2025-06-02 08:09:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:09:16] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-02 08:09:16] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2025-06-02 08:09:16] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2025-06-02 08:09:16] [INFO ] Invariant cache hit.
[2025-06-02 08:09:16] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:09:20] [INFO ] Deduced a trap composed of 36 places in 163 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:09:20] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:09:21] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:09:21] [INFO ] Deduced a trap composed of 22 places in 170 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:09:21] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:09:22] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/120 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/157 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 158 constraints, problems are : Problem set: 0 solved, 286 unsolved in 24052 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/120 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/157 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 286/443 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 286 unsolved
SMT process timed out in 54149ms, After SMT, problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 54151ms
Starting structural reductions in LTL mode, iteration 1 : 106/122 places, 287/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54673 ms. Remains : 106/122 places, 287/327 transitions.
[2025-06-02 08:10:10] [INFO ] Flatten gal took : 10 ms
[2025-06-02 08:10:10] [INFO ] Flatten gal took : 12 ms
[2025-06-02 08:10:10] [INFO ] Input system was already deterministic with 287 transitions.
[2025-06-02 08:10:10] [INFO ] Flatten gal took : 10 ms
[2025-06-02 08:10:10] [INFO ] Flatten gal took : 10 ms
[2025-06-02 08:10:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality2668076413406145109.gal : 2 ms
[2025-06-02 08:10:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality9102099882343681077.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/CTLCardinality2668076413406145109.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9102099882343681077.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.23367e+06,8.97652,169800,2,6179,5,456345,6,0,710,596611,0


Converting to forward existential form...Done !
original formula: AX(((EF(EX((p40==1))) * EF((p93==0))) * (p108==0)))
=> equivalent forward existential formula: (([(EY(Init) * !(E(TRUE U EX((p40==1)))))] = FALSE * [(EY(Init) * !(E(TRUE U (p93==0))))] = FALSE) * [(EY(Init) ...180
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...612
Detected timeout of ITS tools.
[2025-06-02 08:10:41] [INFO ] Flatten gal took : 10 ms
[2025-06-02 08:10:41] [INFO ] Applying decomposition
[2025-06-02 08:10:41] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1377310067608868189.txt' '-o' '/tmp/graph1377310067608868189.bin' '-w' '/tmp/graph1377310067608868189.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1377310067608868189.bin' '-l' '-1' '-v' '-w' '/tmp/graph1377310067608868189.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:10:41] [INFO ] Decomposing Gal with order
[2025-06-02 08:10:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:10:41] [INFO ] Removed a total of 436 redundant transitions.
[2025-06-02 08:10:41] [INFO ] Flatten gal took : 25 ms
[2025-06-02 08:10:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 10 ms.
[2025-06-02 08:10:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality2475769491021748429.gal : 4 ms
[2025-06-02 08:10:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality10388079835334016992.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/CTLCardinality2475769491021748429.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10388079835334016992.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.23367e+06,6.77202,163260,2676,163,245790,1351,513,878668,86,11944,0


Converting to forward existential form...Done !
original formula: AX(((EF(EX((i1.u13.p40==1))) * EF((i4.u30.p93==0))) * (i6.u34.p108==0)))
=> equivalent forward existential formula: (([(EY(Init) * !(E(TRUE U EX((i1.u13.p40==1)))))] = FALSE * [(EY(Init) * !(E(TRUE U (i4.u30.p93==0))))] = FALSE)...201
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t48, t49, t51, t59, t64, t69, t74, t79, t82, t91, t92, t93, t94, t99, t140, t14...767
(forward)formula 0,1,18.9071,343180,1,0,491697,4276,2691,2.05287e+06,362,24120,1150478
FORMULA FireWire-PT-07-CTLCardinality-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 327/327 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 118 transition count 317
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 118 transition count 317
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 118 transition count 315
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 116 transition count 311
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 114 transition count 306
Applied a total of 18 rules in 5 ms. Remains 114 /122 variables (removed 8) and now considering 306/327 (removed 21) transitions.
[2025-06-02 08:11:00] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
// Phase 1: matrix 280 rows 114 cols
[2025-06-02 08:11:00] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:11:00] [INFO ] Implicit Places using invariants in 175 ms returned []
[2025-06-02 08:11:00] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2025-06-02 08:11:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:11:00] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-02 08:11:00] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2025-06-02 08:11:00] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2025-06-02 08:11:00] [INFO ] Invariant cache hit.
[2025-06-02 08:11:00] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:11:05] [INFO ] Deduced a trap composed of 39 places in 177 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:11:05] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:11:05] [INFO ] Deduced a trap composed of 15 places in 198 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:11:06] [INFO ] Deduced a trap composed of 22 places in 193 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:11:06] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:11:06] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:11:07] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 279/393 variables, 114/129 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 40/169 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (OVERLAPS) 1/394 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (OVERLAPS) 0/394 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 170 constraints, problems are : Problem set: 0 solved, 305 unsolved in 28324 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 114/114 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 279/393 variables, 114/129 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 40/169 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 305/474 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 393/394 variables, and 474 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 114/114 constraints, ReadFeed: 40/41 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58464ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 58465ms
Starting structural reductions in LTL mode, iteration 1 : 114/122 places, 306/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58947 ms. Remains : 114/122 places, 306/327 transitions.
[2025-06-02 08:11:59] [INFO ] Flatten gal took : 13 ms
[2025-06-02 08:11:59] [INFO ] Flatten gal took : 14 ms
[2025-06-02 08:11:59] [INFO ] Input system was already deterministic with 306 transitions.
[2025-06-02 08:11:59] [INFO ] Flatten gal took : 13 ms
[2025-06-02 08:11:59] [INFO ] Flatten gal took : 13 ms
[2025-06-02 08:11:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality14485537630516517285.gal : 3 ms
[2025-06-02 08:11:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality6070616346427751872.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/CTLCardinality14485537630516517285.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6070616346427751872.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.3117e+06,1.74594,40464,2,2226,5,140971,6,0,761,128725,0


Converting to forward existential form...Done !
original formula: (E(((EF((p52==1)) + AX(((p2==1)||(p80==1)))) + (AX(EX((p13==1))) + (p80!=0))) U ((AX(!(((p64!=0)||(!((p116==0)||(p12==1)))))) * A(AF(((p5...284
=> equivalent forward existential formula: ([(Init * !(E(((E(TRUE U (p52==1)) + !(EX(!(((p2==1)||(p80==1)))))) + (!(EX(!(EX((p13==1))))) + (p80!=0))) U ((!...498
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...660
Detected timeout of ITS tools.
[2025-06-02 08:12:29] [INFO ] Flatten gal took : 9 ms
[2025-06-02 08:12:29] [INFO ] Applying decomposition
[2025-06-02 08:12:29] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3600090372328808164.txt' '-o' '/tmp/graph3600090372328808164.bin' '-w' '/tmp/graph3600090372328808164.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3600090372328808164.bin' '-l' '-1' '-v' '-w' '/tmp/graph3600090372328808164.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:12:29] [INFO ] Decomposing Gal with order
[2025-06-02 08:12:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:12:29] [INFO ] Removed a total of 473 redundant transitions.
[2025-06-02 08:12:29] [INFO ] Flatten gal took : 25 ms
[2025-06-02 08:12:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 20 ms.
[2025-06-02 08:12:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality1447158254354058734.gal : 6 ms
[2025-06-02 08:12:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality6891866809714654942.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/CTLCardinality1447158254354058734.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6891866809714654942.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.3117e+06,27.0662,463092,1718,127,433165,9506,661,3.80338e+06,87,54749,0


Converting to forward existential form...Done !
original formula: (E(((EF((i1.u17.p52==1)) + AX(((i3.u0.p2==1)||(i3.u27.p80==1)))) + (AX(EX((i5.i0.u4.p13==1))) + (i3.u27.p80!=0))) U ((AX(!(((i2.u20.p64!=...414
=> equivalent forward existential formula: ([(Init * !(E(((E(TRUE U (i1.u17.p52==1)) + !(EX(!(((i3.u0.p2==1)||(i3.u27.p80==1)))))) + (!(EX(!(EX((i5.i0.u4.p...649
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t48, t49, t51, t59, t64, t69, t74, t78, t79, t94, t97, t99, t136, t137, t138, t...837
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 327/327 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 120 transition count 322
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 120 transition count 322
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 120 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 119 transition count 319
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 119 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 118 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 117 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 117 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 113 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 113 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 111 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 111 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 109 transition count 295
Applied a total of 27 rules in 12 ms. Remains 109 /122 variables (removed 13) and now considering 295/327 (removed 32) transitions.
[2025-06-02 08:12:59] [INFO ] Flow matrix only has 269 transitions (discarded 26 similar events)
// Phase 1: matrix 269 rows 109 cols
[2025-06-02 08:12:59] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:12:59] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-02 08:12:59] [INFO ] Flow matrix only has 269 transitions (discarded 26 similar events)
[2025-06-02 08:12:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:12:59] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-02 08:13:00] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2025-06-02 08:13:00] [INFO ] Flow matrix only has 269 transitions (discarded 26 similar events)
[2025-06-02 08:13:00] [INFO ] Invariant cache hit.
[2025-06-02 08:13:00] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:04] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:04] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:05] [INFO ] Deduced a trap composed of 22 places in 176 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:05] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:05] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:06] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 268/377 variables, 109/123 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 38/161 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (OVERLAPS) 1/378 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 9 (OVERLAPS) 0/378 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 162 constraints, problems are : Problem set: 0 solved, 294 unsolved in 25524 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 268/377 variables, 109/123 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 38/161 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 294/455 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 294 unsolved
SMT process timed out in 55671ms, After SMT, problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 55672ms
Starting structural reductions in LTL mode, iteration 1 : 109/122 places, 295/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56130 ms. Remains : 109/122 places, 295/327 transitions.
[2025-06-02 08:13:55] [INFO ] Flatten gal took : 16 ms
[2025-06-02 08:13:55] [INFO ] Flatten gal took : 8 ms
[2025-06-02 08:13:55] [INFO ] Input system was already deterministic with 295 transitions.
[2025-06-02 08:13:55] [INFO ] Flatten gal took : 8 ms
[2025-06-02 08:13:55] [INFO ] Flatten gal took : 8 ms
[2025-06-02 08:13:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality6591388635139956726.gal : 3 ms
[2025-06-02 08:13:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality18351500536769008904.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/CTLCardinality6591388635139956726.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18351500536769008904.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.71902e+06,7.74295,166888,2,6184,5,456623,6,0,730,576312,0


Converting to forward existential form...Done !
original formula: EF((AG(A(EX(((p25==0)||(p61==1))) U A((p87==0) U ((p41==0)||(p105==1))))) + ((p7==0)&&(p71==1))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !(!((E(!(!((E(!(((p41==0)||(p105==1))) U (!((p87==0)) * !(((p41==0)||(p105==1)))...522
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...630
Detected timeout of ITS tools.
[2025-06-02 08:14:25] [INFO ] Flatten gal took : 9 ms
[2025-06-02 08:14:25] [INFO ] Applying decomposition
[2025-06-02 08:14:25] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1591487342384332320.txt' '-o' '/tmp/graph1591487342384332320.bin' '-w' '/tmp/graph1591487342384332320.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1591487342384332320.bin' '-l' '-1' '-v' '-w' '/tmp/graph1591487342384332320.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:14:25] [INFO ] Decomposing Gal with order
[2025-06-02 08:14:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:14:26] [INFO ] Removed a total of 450 redundant transitions.
[2025-06-02 08:14:26] [INFO ] Flatten gal took : 37 ms
[2025-06-02 08:14:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 12 ms.
[2025-06-02 08:14:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality4076945344966198104.gal : 3 ms
[2025-06-02 08:14:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality8875224671026274091.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/CTLCardinality4076945344966198104.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8875224671026274091.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.71902e+06,16.0107,276644,2498,193,383957,2101,590,1.00802e+06,93,22718,0


Converting to forward existential form...Done !
original formula: EF((AG(A(EX(((i3.u8.p25==0)||(i5.i0.u22.p61==1))) U A((i2.u29.p87==0) U ((i4.i1.u18.p41==0)||(i6.u34.p105==1))))) + ((i4.i0.u2.p7==0)&&(i...171
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !(!((E(!(!((E(!(((i4.i1.u18.p41==0)||(i6.u34.p105==1))) U (!((i2.u29.p87==0)) * ...728
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t45, t48, t49, t59, t64, t69, t74, t79, t82, t83, t91, t92, t93, t94, t99, t142...790
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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 327/327 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 120 transition count 321
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 120 transition count 321
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 118 transition count 317
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 118 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 117 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 117 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 116 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 115 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 114 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 114 transition count 307
Applied a total of 16 rules in 6 ms. Remains 114 /122 variables (removed 8) and now considering 307/327 (removed 20) transitions.
[2025-06-02 08:14:56] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
// Phase 1: matrix 281 rows 114 cols
[2025-06-02 08:14:56] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:14:56] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-06-02 08:14:56] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2025-06-02 08:14:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:14:56] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 08:14:56] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Running 306 sub problems to find dead transitions.
[2025-06-02 08:14:56] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2025-06-02 08:14:56] [INFO ] Invariant cache hit.
[2025-06-02 08:14:56] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:15:01] [INFO ] Deduced a trap composed of 38 places in 193 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:15:01] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:15:01] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:15:02] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:15:02] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:15:03] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:15:03] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 280/394 variables, 114/129 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 39/168 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (OVERLAPS) 1/395 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (OVERLAPS) 0/395 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 169 constraints, problems are : Problem set: 0 solved, 306 unsolved in 26778 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 114/114 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 280/394 variables, 114/129 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 39/168 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 306/474 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/395 variables, and 474 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 114/114 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56934ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 56935ms
Starting structural reductions in LTL mode, iteration 1 : 114/122 places, 307/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57411 ms. Remains : 114/122 places, 307/327 transitions.
[2025-06-02 08:15:53] [INFO ] Flatten gal took : 14 ms
[2025-06-02 08:15:53] [INFO ] Flatten gal took : 15 ms
[2025-06-02 08:15:53] [INFO ] Input system was already deterministic with 307 transitions.
[2025-06-02 08:15:53] [INFO ] Flatten gal took : 26 ms
[2025-06-02 08:15:53] [INFO ] Flatten gal took : 15 ms
[2025-06-02 08:15:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality325445997713041777.gal : 5 ms
[2025-06-02 08:15:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality14622629032768409156.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/CTLCardinality325445997713041777.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14622629032768409156.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.78896e+06,2.32527,50444,2,2607,5,181376,6,0,762,156536,0


Converting to forward existential form...Done !
original formula: ((EX((((p22==0)||(p118==1)) + !(E(((p101==0)||(p24==1)) U (((p119==1)||(p120==0))||((p84==1)||(p10==1))))))) * AX((p30==0))) * (AG((AX(((...229
=> equivalent forward existential formula: (([(Init * !(EX((((p22==0)||(p118==1)) + !(E(((p101==0)||(p24==1)) U (((p119==1)||(p120==0))||((p84==1)||(p10==1...388
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...660
(forward)formula 0,0,4.38442,75948,1,0,568,362573,634,289,6342,280514,636
FORMULA FireWire-PT-07-CTLCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 122/122 places, 327/327 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 117 transition count 316
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 117 transition count 316
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 117 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 116 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 116 transition count 312
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 1 with 2 rules applied. Total rules applied 14 place count 115 transition count 311
Applied a total of 14 rules in 32 ms. Remains 115 /122 variables (removed 7) and now considering 311/327 (removed 16) transitions.
[2025-06-02 08:15:58] [INFO ] Flow matrix only has 285 transitions (discarded 26 similar events)
// Phase 1: matrix 285 rows 115 cols
[2025-06-02 08:15:58] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:15:58] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-06-02 08:15:58] [INFO ] Flow matrix only has 285 transitions (discarded 26 similar events)
[2025-06-02 08:15:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:15:58] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 08:15:58] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:15:58] [INFO ] Redundant transitions in 3 ms returned []
Running 308 sub problems to find dead transitions.
[2025-06-02 08:15:58] [INFO ] Flow matrix only has 285 transitions (discarded 26 similar events)
[2025-06-02 08:15:58] [INFO ] Invariant cache hit.
[2025-06-02 08:15:58] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:00] [INFO ] Deduced a trap composed of 40 places in 180 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:00] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:00] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:01] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:01] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:01] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:02] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:02] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 14 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (OVERLAPS) 284/398 variables, 114/130 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 40/170 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:10] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (OVERLAPS) 1/399 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 399/400 variables, and 172 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (OVERLAPS) 284/398 variables, 114/131 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 40/171 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 308/479 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (OVERLAPS) 1/399 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/400 variables, and 480 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60159ms problems are : Problem set: 0 solved, 308 unsolved
Search for dead transitions found 0 dead transitions in 60161ms
Starting structural reductions in SI_CTL mode, iteration 1 : 115/122 places, 311/327 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60603 ms. Remains : 115/122 places, 311/327 transitions.
[2025-06-02 08:16:58] [INFO ] Flatten gal took : 9 ms
[2025-06-02 08:16:58] [INFO ] Flatten gal took : 15 ms
[2025-06-02 08:16:58] [INFO ] Input system was already deterministic with 311 transitions.
[2025-06-02 08:16:58] [INFO ] Flatten gal took : 17 ms
[2025-06-02 08:16:58] [INFO ] Flatten gal took : 30 ms
RANDOM walk for 40000 steps (2318 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
[2025-06-02 08:16:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8637670897716399611.gal : 7 ms
[2025-06-02 08:16:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10916242894325691185.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8637670897716399611.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10916242894325691185.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (607 resets) in 51 ms. (769 steps per ms) remains 1/1 properties

Finished probabilistic random walk after 228 steps, run visited all 1 properties in 7 ms. (steps per millisecond=32 )
Probabilistic random walk after 228 steps, saw 174 distinct states, run finished after 14 ms. (steps per millisecond=16 ) properties seen :1
FORMULA FireWire-PT-07-CTLCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 327/327 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 119 transition count 320
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 119 transition count 320
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 119 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 118 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 118 transition count 316
Applied a total of 10 rules in 4 ms. Remains 118 /122 variables (removed 4) and now considering 316/327 (removed 11) transitions.
[2025-06-02 08:16:58] [INFO ] Flow matrix only has 290 transitions (discarded 26 similar events)
// Phase 1: matrix 290 rows 118 cols
[2025-06-02 08:16:58] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:16:59] [INFO ] Implicit Places using invariants in 148 ms returned []
[2025-06-02 08:16:59] [INFO ] Flow matrix only has 290 transitions (discarded 26 similar events)
[2025-06-02 08:16:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:16:59] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-02 08:16:59] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
Running 315 sub problems to find dead transitions.
[2025-06-02 08:16:59] [INFO ] Flow matrix only has 290 transitions (discarded 26 similar events)
[2025-06-02 08:16:59] [INFO ] Invariant cache hit.
[2025-06-02 08:16:59] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:17:04] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:17:04] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:17:04] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:17:04] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:17:04] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:17:05] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:17:05] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 289/407 variables, 118/133 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 42/175 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (OVERLAPS) 1/408 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 176 constraints, problems are : Problem set: 0 solved, 315 unsolved in 24571 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 289/407 variables, 118/133 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 42/175 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 315/490 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/408 variables, and 490 constraints, problems are : Problem set: 0 solved, 315 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 42/43 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54677ms problems are : Problem set: 0 solved, 315 unsolved
Search for dead transitions found 0 dead transitions in 54678ms
Starting structural reductions in LTL mode, iteration 1 : 118/122 places, 316/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55283 ms. Remains : 118/122 places, 316/327 transitions.
[2025-06-02 08:17:54] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:17:54] [INFO ] Flatten gal took : 9 ms
[2025-06-02 08:17:54] [INFO ] Input system was already deterministic with 316 transitions.
[2025-06-02 08:17:54] [INFO ] Flatten gal took : 8 ms
[2025-06-02 08:17:54] [INFO ] Flatten gal took : 9 ms
[2025-06-02 08:17:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality11820241653091035797.gal : 2 ms
[2025-06-02 08:17:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality1196739213023260609.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/CTLCardinality11820241653091035797.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1196739213023260609.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.3511e+06,0.930075,21404,2,2375,5,63574,6,0,787,54241,0


Converting to forward existential form...Done !
original formula: E(AF(!((AX(((p78==0)||(p105==1))) * A(((p30==1)&&(p117==0)) U ((p125==0)&&(p55==0)))))) U ((AG(!(((((p112==0)||(p13==1))&&((p67==0)||(p37...199
=> equivalent forward existential formula: [(((FwdU(Init,!(EG(!(!((!(EX(!(((p78==0)||(p105==1))))) * !((E(!(((p125==0)&&(p55==0))) U (!(((p30==1)&&(p117==0...340
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...684
Detected timeout of ITS tools.
[2025-06-02 08:18:24] [INFO ] Flatten gal took : 9 ms
[2025-06-02 08:18:24] [INFO ] Applying decomposition
[2025-06-02 08:18:24] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17542390892190946716.txt' '-o' '/tmp/graph17542390892190946716.bin' '-w' '/tmp/graph17542390892190946716.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17542390892190946716.bin' '-l' '-1' '-v' '-w' '/tmp/graph17542390892190946716.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:18:24] [INFO ] Decomposing Gal with order
[2025-06-02 08:18:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:18:24] [INFO ] Removed a total of 493 redundant transitions.
[2025-06-02 08:18:24] [INFO ] Flatten gal took : 23 ms
[2025-06-02 08:18:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 10 ms.
[2025-06-02 08:18:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality7417879075495759504.gal : 4 ms
[2025-06-02 08:18:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality3549738574503452075.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/CTLCardinality7417879075495759504.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3549738574503452075.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.3511e+06,17.0249,350672,1623,167,281726,10436,687,3.2361e+06,87,62913,0


Converting to forward existential form...Done !
original formula: E(AF(!((AX(((i0.u25.p78==0)||(i4.i1.u36.p105==1))) * A(((i2.u10.p30==1)&&(i0.u40.p117==0)) U ((i4.i1.u42.p125==0)&&(i3.u19.p55==0)))))) U...300
=> equivalent forward existential formula: [(((FwdU(Init,!(EG(!(!((!(EX(!(((i0.u25.p78==0)||(i4.i1.u36.p105==1))))) * !((E(!(((i4.i1.u42.p125==0)&&(i3.u19....475
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t48, t49, t51, t59, t64, t69, t74, t79, t91, t92, t93, t94, t97, t99, t140, t14...888
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 122/122 places, 327/327 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 117 transition count 316
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 117 transition count 316
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 117 transition count 314
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 115 transition count 310
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 114 transition count 307
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 1 with 2 rules applied. Total rules applied 18 place count 113 transition count 306
Applied a total of 18 rules in 15 ms. Remains 113 /122 variables (removed 9) and now considering 306/327 (removed 21) transitions.
[2025-06-02 08:18:54] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
// Phase 1: matrix 280 rows 113 cols
[2025-06-02 08:18:54] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:18:54] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-06-02 08:18:54] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2025-06-02 08:18:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:18:54] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-02 08:18:54] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:18:54] [INFO ] Redundant transitions in 3 ms returned []
Running 303 sub problems to find dead transitions.
[2025-06-02 08:18:54] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2025-06-02 08:18:54] [INFO ] Invariant cache hit.
[2025-06-02 08:18:54] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:18:56] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:18:57] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:18:57] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:18:57] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:18:57] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:18:58] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:18:58] [INFO ] Deduced a trap composed of 21 places in 163 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:18:58] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:18:59] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 18 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (OVERLAPS) 279/391 variables, 112/129 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 39/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (OVERLAPS) 1/392 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/393 variables, and 169 constraints, problems are : Problem set: 0 solved, 303 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (OVERLAPS) 279/391 variables, 112/129 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 39/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 303/471 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (OVERLAPS) 1/392 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/393 variables, and 472 constraints, problems are : Problem set: 0 solved, 303 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60164ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 60165ms
Starting structural reductions in SI_CTL mode, iteration 1 : 113/122 places, 306/327 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60633 ms. Remains : 113/122 places, 306/327 transitions.
[2025-06-02 08:19:55] [INFO ] Flatten gal took : 13 ms
[2025-06-02 08:19:55] [INFO ] Flatten gal took : 13 ms
[2025-06-02 08:19:55] [INFO ] Input system was already deterministic with 306 transitions.
[2025-06-02 08:19:55] [INFO ] Flatten gal took : 12 ms
[2025-06-02 08:19:55] [INFO ] Flatten gal took : 12 ms
[2025-06-02 08:19:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality17753783710747573682.gal : 2 ms
[2025-06-02 08:19:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality6845374267718585691.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/CTLCardinality17753783710747573682.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6845374267718585691.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.27565e+06,1.11246,29024,2,2263,5,91295,6,0,757,91634,0


Converting to forward existential form...Done !
original formula: EF(AG(((p47==1)||(p115==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((p47==1)||(p115==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t15, t17, t19, t23, t24, t26, t27, t28, t30, t32, t36...655
(forward)formula 0,1,6.72206,152216,1,0,639,781697,631,324,6251,570115,723
FORMULA FireWire-PT-07-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 122/122 places, 327/327 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 117 transition count 316
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 117 transition count 316
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 117 transition count 314
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 115 transition count 310
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 112 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 112 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 111 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 111 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 109 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 108 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 108 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 107 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 107 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 106 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 106 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 105 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 105 transition count 286
Applied a total of 34 rules in 39 ms. Remains 105 /122 variables (removed 17) and now considering 286/327 (removed 41) transitions.
[2025-06-02 08:20:01] [INFO ] Flow matrix only has 260 transitions (discarded 26 similar events)
// Phase 1: matrix 260 rows 105 cols
[2025-06-02 08:20:02] [INFO ] Computed 8 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:20:02] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-06-02 08:20:02] [INFO ] Flow matrix only has 260 transitions (discarded 26 similar events)
[2025-06-02 08:20:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:20:02] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-02 08:20:02] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:20:02] [INFO ] Redundant transitions in 2 ms returned []
Running 283 sub problems to find dead transitions.
[2025-06-02 08:20:02] [INFO ] Flow matrix only has 260 transitions (discarded 26 similar events)
[2025-06-02 08:20:02] [INFO ] Invariant cache hit.
[2025-06-02 08:20:02] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:20:04] [INFO ] Deduced a trap composed of 35 places in 172 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:20:04] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:20:04] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:20:04] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:20:04] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:20:05] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 18 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 259/363 variables, 104/118 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 36/154 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:20:12] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:20:13] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:20:15] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 1/364 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 364/365 variables, and 158 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 259/363 variables, 104/121 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 36/157 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 283/440 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:20:37] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 1/364 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/365 variables, and 442 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60117ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 60118ms
Starting structural reductions in SI_CTL mode, iteration 1 : 105/122 places, 286/327 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60602 ms. Remains : 105/122 places, 286/327 transitions.
[2025-06-02 08:21:02] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:21:02] [INFO ] Flatten gal took : 8 ms
[2025-06-02 08:21:02] [INFO ] Input system was already deterministic with 286 transitions.
[2025-06-02 08:21:02] [INFO ] Flatten gal took : 13 ms
[2025-06-02 08:21:02] [INFO ] Flatten gal took : 13 ms
[2025-06-02 08:21:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality11940625555335388984.gal : 2 ms
[2025-06-02 08:21:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality13001272261012525808.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/CTLCardinality11940625555335388984.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13001272261012525808.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,6.23367e+06,1.15261,31564,2,2128,5,92030,6,0,705,99426,0


Converting to forward existential form...Done !
original formula: (EG((!(E((p124!=0) U ((p103==1)&&((p6==0)||(p68==1))))) + AG((p97==0)))) * EG(AF((p87==0))))
=> equivalent forward existential formula: [FwdG((Init * EG((!(E((p124!=0) U ((p103==1)&&((p6==0)||(p68==1))))) + !(E(TRUE U !((p97==0))))))),!(EG(!((p87==...171
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t15, t17, t19, t23, t24, t26, t27, t28, t30, t32, t36...612
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2025-06-02 08:21:32] [INFO ] Flatten gal took : 11 ms
[2025-06-02 08:21:32] [INFO ] Applying decomposition
[2025-06-02 08:21:32] [INFO ] Flatten gal took : 13 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/graph17356820812566193238.txt' '-o' '/tmp/graph17356820812566193238.bin' '-w' '/tmp/graph17356820812566193238.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17356820812566193238.bin' '-l' '-1' '-v' '-w' '/tmp/graph17356820812566193238.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:21:32] [INFO ] Decomposing Gal with order
[2025-06-02 08:21:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:21:32] [INFO ] Removed a total of 432 redundant transitions.
[2025-06-02 08:21:32] [INFO ] Flatten gal took : 30 ms
[2025-06-02 08:21:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 11 ms.
[2025-06-02 08:21:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality11984332838128819264.gal : 4 ms
[2025-06-02 08:21:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality3038301965035065142.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/CTLCardinality11984332838128819264.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3038301965035065142.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.23367e+06,7.12547,175012,2675,161,259807,1374,527,955905,86,12093,0


Converting to forward existential form...Done !
original formula: (EG((!(E((i1.u3.p124!=0) U ((i7.i1.u36.p103==1)&&((i7.i1.u36.p6==0)||(i7.i0.u21.p68==1))))) + AG((i6.u32.p97==0)))) * EG(AF((i1.u28.p87==...160
=> equivalent forward existential formula: [FwdG((Init * EG((!(E((i1.u3.p124!=0) U ((i7.i1.u36.p103==1)&&((i7.i1.u36.p6==0)||(i7.i0.u21.p68==1))))) + !(E(T...221
Reverse transition relation is NOT exact ! Due to transitions t5, t41, t43, t47, t48, t50, t58, t63, t68, t73, t78, t81, t93, t98, t135, t136, t137, t139, ...776
Detected timeout of ITS tools.
[2025-06-02 08:22:02] [INFO ] Flatten gal took : 9 ms
[2025-06-02 08:22:02] [INFO ] Flatten gal took : 9 ms
[2025-06-02 08:22:02] [INFO ] Applying decomposition
[2025-06-02 08:22:02] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph269903296528375991.txt' '-o' '/tmp/graph269903296528375991.bin' '-w' '/tmp/graph269903296528375991.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph269903296528375991.bin' '-l' '-1' '-v' '-w' '/tmp/graph269903296528375991.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:22:02] [INFO ] Decomposing Gal with order
[2025-06-02 08:22:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:22:03] [INFO ] Removed a total of 499 redundant transitions.
[2025-06-02 08:22:03] [INFO ] Flatten gal took : 36 ms
[2025-06-02 08:22:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 117 labels/synchronizations in 6 ms.
[2025-06-02 08:22:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality3519058160291984031.gal : 3 ms
[2025-06-02 08:22:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality4995166018629812155.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/CTLCardinality3519058160291984031.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4995166018629812155.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 5 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.23388e+06,0.956317,31820,955,112,47915,1217,647,131924,107,5627,0


Converting to forward existential form...Done !
original formula: A(!(EF(EG(AF((i0.u10.p35==0))))) U EF((i1.i0.u15.p45==1)))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (i1.i0.u15.p45==1)))))) * !(E(!(E(TRUE U (i1.i0.u15.p45==1))) U (!(!(E(TRUE U EG(!(EG(...227
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t45, t48, t49, t51, t58, t59, t64, t69, t74, t79, t87, t91, t92, t93, t94, t97,...827
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local 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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local 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 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
(forward)formula 0,1,11.2905,313164,1,0,535002,4291,3325,1.30324e+06,496,15271,1069002
FORMULA FireWire-PT-07-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (E(((EF((i2.u17.p52==1)) + AX(((i4.u0.p2==1)||(i4.u27.p80==1)))) + (AX(EX((i1.i0.u4.p13==1))) + (i4.u27.p80!=0))) U ((AX(!(((i3.u20.p64!=...411
=> equivalent forward existential formula: ([(Init * !(E(((E(TRUE U (i2.u17.p52==1)) + !(EX(!(((i4.u0.p2==1)||(i4.u27.p80==1)))))) + (!(EX(!(EX((i1.i0.u4.p...646
(forward)formula 1,0,20.6806,560280,1,0,978704,5061,3488,2.20275e+06,508,18687,2063846
FORMULA FireWire-PT-07-CTLCardinality-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((AG(A(EX(((i0.u8.p25==0)||(i6.i0.u21.p61==1))) U A((i7.u30.p87==0) U ((i2.u19.p41==0)||(i5.u41.p105==1))))) + ((i0.u2.p7==0)&&(i3.u23....165
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !(!((E(!(!((E(!(((i2.u19.p41==0)||(i5.u41.p105==1))) U (!((i7.u30.p87==0)) * !((...698
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
(forward)formula 2,1,28.9937,799384,1,0,1.40085e+06,5679,3528,3.05844e+06,509,23966,3043005
FORMULA FireWire-PT-07-CTLCardinality-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(AF(!((AX(((i4.u26.p78==0)||(i5.u41.p105==1))) * A(((i0.u11.p30==1)&&(i4.u38.p117==0)) U ((i5.u41.p125==0)&&(i2.u19.p55==0)))))) U ((AG(...297
=> equivalent forward existential formula: [(((FwdU(Init,!(EG(!(!((!(EX(!(((i4.u26.p78==0)||(i5.u41.p105==1))))) * !((E(!(((i5.u41.p125==0)&&(i2.u19.p55==0...466
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
(forward)formula 3,0,39.6975,1035568,1,0,1.81154e+06,5834,3587,3.93492e+06,513,25480,3901465
FORMULA FireWire-PT-07-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EG((!(E((i7.u3.p124!=0) U ((i6.i1.u34.p103==1)&&((i5.u33.p6==0)||(i6.i0.u21.p68==1))))) + AG((i5.u33.p97==0)))) * EG(AF((i7.u30.p87==0))...157
=> equivalent forward existential formula: [FwdG((Init * EG((!(E((i7.u3.p124!=0) U ((i6.i1.u34.p103==1)&&((i5.u33.p6==0)||(i6.i0.u21.p68==1))))) + !(E(TRUE...218
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 4,1,54.9329,1406640,1,0,2.47898e+06,6155,3673,5.44649e+06,514,28952,5131735
FORMULA FireWire-PT-07-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1289652 ms.

BK_STOP 1748852578384

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is FireWire-PT-07, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r086-smll-174860102200289"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-07.tgz
mv FireWire-PT-07 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;