About the Execution of ITS-Tools for FireWire-PT-13
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | ????TFTTFFFFFTTT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102300337.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-13, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102300337
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K 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 153K 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-13-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-13-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-13-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-13-CTLCardinality-2024-15
FORMULA_NAME FireWire-PT-13-CTLCardinality-2025-00
FORMULA_NAME FireWire-PT-13-CTLCardinality-2025-01
FORMULA_NAME FireWire-PT-13-CTLCardinality-2025-02
FORMULA_NAME FireWire-PT-13-CTLCardinality-2025-03
FORMULA_NAME FireWire-PT-13-CTLCardinality-2025-04
FORMULA_NAME FireWire-PT-13-CTLCardinality-2025-05
FORMULA_NAME FireWire-PT-13-CTLCardinality-2025-06
FORMULA_NAME FireWire-PT-13-CTLCardinality-2025-07
FORMULA_NAME FireWire-PT-13-CTLCardinality-2025-08
FORMULA_NAME FireWire-PT-13-CTLCardinality-2025-09
FORMULA_NAME FireWire-PT-13-CTLCardinality-2025-10
FORMULA_NAME FireWire-PT-13-CTLCardinality-2025-11
=== Now, execution of the tool begins
BK_START 1748869967136
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-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-02 13:12:49] [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 13:12:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 13:12:49] [INFO ] Load time of PNML (sax parser for PT used): 244 ms
[2025-06-02 13:12:49] [INFO ] Transformed 205 places.
[2025-06-02 13:12:49] [INFO ] Transformed 610 transitions.
[2025-06-02 13:12:49] [INFO ] Found NUPN structural information;
[2025-06-02 13:12:49] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2309 arcs in 485 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 38 ms.
Ensure Unique test removed 68 transitions
Reduce redundant transitions removed 68 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA FireWire-PT-13-CTLCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-13-CTLCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 79 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 542/542 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 204 transition count 540
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 204 transition count 540
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 204 transition count 534
Applied a total of 8 rules in 99 ms. Remains 204 /205 variables (removed 1) and now considering 534/542 (removed 8) transitions.
[2025-06-02 13:12:50] [INFO ] Flow matrix only has 502 transitions (discarded 32 similar events)
// Phase 1: matrix 502 rows 204 cols
[2025-06-02 13:12:50] [INFO ] Computed 10 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:12:50] [INFO ] Implicit Places using invariants in 673 ms returned []
[2025-06-02 13:12:50] [INFO ] Flow matrix only has 502 transitions (discarded 32 similar events)
[2025-06-02 13:12:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:12:51] [INFO ] State equation strengthened by 73 read => feed constraints.
[2025-06-02 13:12:52] [INFO ] Implicit Places using invariants and state equation in 1194 ms returned [85, 148]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1964 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 202/205 places, 534/542 transitions.
Applied a total of 0 rules in 26 ms. Remains 202 /202 variables (removed 0) and now considering 534/534 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2121 ms. Remains : 202/205 places, 534/542 transitions.
Support contains 79 out of 202 places after structural reductions.
[2025-06-02 13:12:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-02 13:12:52] [INFO ] Flatten gal took : 160 ms
FORMULA FireWire-PT-13-CTLCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 13:12:52] [INFO ] Flatten gal took : 92 ms
[2025-06-02 13:12:53] [INFO ] Input system was already deterministic with 534 transitions.
Support contains 78 out of 202 places (down from 79) after GAL structural reductions.
RANDOM walk for 40000 steps (1158 resets) in 2301 ms. (17 steps per ms) remains 23/55 properties
BEST_FIRST walk for 4003 steps (23 resets) in 50 ms. (78 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (23 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (24 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (24 resets) in 38 ms. (102 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (22 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (24 resets) in 37 ms. (105 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (18 resets) in 38 ms. (102 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (28 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (23 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (27 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (20 resets) in 26 ms. (148 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4004 steps (27 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (23 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (27 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (19 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (24 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (21 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (25 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (22 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (22 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (23 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (26 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
[2025-06-02 13:12:54] [INFO ] Flow matrix only has 502 transitions (discarded 32 similar events)
// Phase 1: matrix 502 rows 202 cols
[2025-06-02 13:12:54] [INFO ] Computed 8 invariants in 5 ms
[2025-06-02 13:12:54] [INFO ] State equation strengthened by 73 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/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 139/176 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 15/191 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 493/684 variables, 191/199 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/684 variables, 70/269 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/684 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 19/703 variables, 11/280 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/703 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/703 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 1/704 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/704 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 0/704 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 704/704 variables, and 283 constraints, problems are : Problem set: 0 solved, 22 unsolved in 3963 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 202/202 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem AtomicPropp39 is UNSAT
At refinement iteration 1 (OVERLAPS) 139/176 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 21 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:58] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 21 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:59] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 15/191 variables, 2/10 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 493/684 variables, 191/201 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/684 variables, 70/271 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/684 variables, 17/288 constraints. Problems are: Problem set: 1 solved, 21 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:00] [INFO ] Deduced a trap composed of 15 places in 318 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:01] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:01] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/684 variables, 3/291 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/684 variables, 0/291 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 12 (OVERLAPS) 19/703 variables, 11/302 constraints. Problems are: Problem set: 1 solved, 21 unsolved
SMT process timed out in 9045ms, After SMT, problems are : Problem set: 1 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 534/534 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 202 transition count 531
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 202 transition count 528
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 199 transition count 528
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 198 transition count 526
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 198 transition count 526
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 198 transition count 525
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 196 transition count 523
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 194 transition count 527
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 24 place count 194 transition count 523
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 26 place count 194 transition count 521
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 194 transition count 523
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 3 with 3 rules applied. Total rules applied 30 place count 193 transition count 521
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 32 place count 193 transition count 519
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 33 place count 192 transition count 518
Applied a total of 33 rules in 280 ms. Remains 192 /202 variables (removed 10) and now considering 518/534 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 281 ms. Remains : 192/202 places, 518/534 transitions.
RANDOM walk for 40000 steps (1308 resets) in 1494 ms. (26 steps per ms) remains 19/21 properties
BEST_FIRST walk for 4003 steps (24 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (24 resets) in 21 ms. (181 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (25 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (27 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (26 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (27 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (27 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (25 resets) in 44 ms. (88 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (24 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (23 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (35 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (27 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (30 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (27 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (30 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (23 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (21 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (20 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (29 resets) in 32 ms. (121 steps per ms) remains 19/19 properties
[2025-06-02 13:13:04] [INFO ] Flow matrix only has 485 transitions (discarded 33 similar events)
// Phase 1: matrix 485 rows 192 cols
[2025-06-02 13:13:04] [INFO ] Computed 8 invariants in 4 ms
[2025-06-02 13:13:04] [INFO ] State equation strengthened by 71 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/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 141/170 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 471/641 variables, 170/176 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/641 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 35/676 variables, 21/197 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/676 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/676 variables, 71/269 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/676 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 1/677 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/677 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/677 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 0/677 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 677/677 variables, and 271 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1658 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 192/192 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 141/170 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:06] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:06] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:06] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 471/641 variables, 170/179 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/641 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 35/676 variables, 21/200 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/676 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/676 variables, 71/272 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/676 variables, 17/289 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:07] [INFO ] Deduced a trap composed of 41 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 13:13:07] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/676 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/676 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 1/677 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/677 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/677 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:09] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:09] [INFO ] Deduced a trap composed of 55 places in 179 ms of which 26 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/677 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:10] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/677 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/677 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 18 (OVERLAPS) 0/677 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 677/677 variables, and 298 constraints, problems are : Problem set: 0 solved, 19 unsolved in 6800 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 192/192 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8501ms problems are : Problem set: 0 solved, 19 unsolved
Parikh walk visited 0 properties in 962 ms.
Support contains 29 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 518/518 transitions.
Applied a total of 0 rules in 20 ms. Remains 192 /192 variables (removed 0) and now considering 518/518 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 192/192 places, 518/518 transitions.
RANDOM walk for 40000 steps (1260 resets) in 922 ms. (43 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (21 resets) in 37 ms. (105 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (29 resets) in 40 ms. (97 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (28 resets) in 39 ms. (100 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (24 resets) in 36 ms. (108 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (29 resets) in 42 ms. (93 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (33 resets) in 46 ms. (85 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (24 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (23 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (34 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (26 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (22 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (30 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (24 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (20 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (30 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (22 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (20 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (34 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (27 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 286313 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :8 out of 19
Probabilistic random walk after 286313 steps, saw 74997 distinct states, run finished after 3010 ms. (steps per millisecond=95 ) properties seen :8
[2025-06-02 13:13:17] [INFO ] Flow matrix only has 485 transitions (discarded 33 similar events)
[2025-06-02 13:13:17] [INFO ] Invariant cache hit.
[2025-06-02 13:13:17] [INFO ] State equation strengthened by 71 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/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 151/170 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 471/641 variables, 170/176 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 13:13:17] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/641 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/641 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 35/676 variables, 21/198 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/676 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/676 variables, 71/270 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/676 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 1/677 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/677 variables, 1/272 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 13:13:18] [INFO ] Deduced a trap composed of 65 places in 251 ms of which 46 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/677 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/677 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 0/677 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 677/677 variables, and 273 constraints, problems are : Problem set: 0 solved, 11 unsolved in 2106 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 192/192 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 151/170 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 471/641 variables, 170/177 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/641 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 35/676 variables, 21/198 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/676 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/676 variables, 71/270 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/676 variables, 10/280 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/676 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 1/677 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/677 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/677 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/677 variables, 1/284 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 13:13:21] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/677 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/677 variables, 0/285 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 13:13:22] [INFO ] Deduced a trap composed of 14 places in 316 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:23] [INFO ] Deduced a trap composed of 17 places in 235 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:23] [INFO ] Deduced a trap composed of 55 places in 325 ms of which 40 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/677 variables, 3/288 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/677 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 0/677 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 677/677 variables, and 288 constraints, problems are : Problem set: 0 solved, 11 unsolved in 6275 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 192/192 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8400ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 2316 ms.
Support contains 19 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 518/518 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 191 transition count 515
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 191 transition count 515
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 190 transition count 513
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 190 transition count 513
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 189 transition count 510
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 189 transition count 510
Applied a total of 6 rules in 32 ms. Remains 189 /192 variables (removed 3) and now considering 510/518 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 189/192 places, 510/518 transitions.
RANDOM walk for 40000 steps (1310 resets) in 296 ms. (134 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (286 resets) in 87 ms. (454 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (281 resets) in 81 ms. (487 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (274 resets) in 103 ms. (384 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (260 resets) in 86 ms. (459 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (293 resets) in 97 ms. (408 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (302 resets) in 84 ms. (470 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (273 resets) in 86 ms. (459 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (237 resets) in 99 ms. (400 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (273 resets) in 122 ms. (325 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (268 resets) in 91 ms. (434 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (285 resets) in 81 ms. (487 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 324950 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :1 out of 11
Probabilistic random walk after 324950 steps, saw 84722 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :1
[2025-06-02 13:13:31] [INFO ] Flow matrix only has 477 transitions (discarded 33 similar events)
// Phase 1: matrix 477 rows 189 cols
[2025-06-02 13:13:31] [INFO ] Computed 8 invariants in 3 ms
[2025-06-02 13:13:31] [INFO ] State equation strengthened by 69 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/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 151/167 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:31] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:31] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:31] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 463/630 variables, 167/176 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/630 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 35/665 variables, 21/197 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/665 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/665 variables, 69/267 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/665 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 1/666 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/666 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:32] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 18 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/666 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/666 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/666 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 270 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2068 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 189/189 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 151/167 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 463/630 variables, 167/176 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/630 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 35/665 variables, 21/197 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/665 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/665 variables, 69/267 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/665 variables, 9/276 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/665 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 1/666 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/666 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/666 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/666 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:34] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/666 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/666 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 0/666 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 281 constraints, problems are : Problem set: 0 solved, 10 unsolved in 3185 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 189/189 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5271ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 2893 ms.
Support contains 16 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 510/510 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 188 transition count 508
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 188 transition count 508
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 188 transition count 507
Applied a total of 3 rules in 23 ms. Remains 188 /189 variables (removed 1) and now considering 507/510 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 188/189 places, 507/510 transitions.
RANDOM walk for 40000 steps (1304 resets) in 282 ms. (141 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (261 resets) in 79 ms. (500 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (279 resets) in 96 ms. (412 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (290 resets) in 67 ms. (588 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (259 resets) in 88 ms. (449 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (265 resets) in 92 ms. (430 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (276 resets) in 79 ms. (500 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (244 resets) in 59 ms. (666 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (278 resets) in 84 ms. (470 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (279 resets) in 95 ms. (416 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (286 resets) in 76 ms. (519 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 369490 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 10
Probabilistic random walk after 369490 steps, saw 96943 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
[2025-06-02 13:13:42] [INFO ] Flow matrix only has 474 transitions (discarded 33 similar events)
// Phase 1: matrix 474 rows 188 cols
[2025-06-02 13:13:42] [INFO ] Computed 8 invariants in 8 ms
[2025-06-02 13:13:42] [INFO ] State equation strengthened by 69 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 150/166 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 460/626 variables, 166/172 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:43] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:43] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/626 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 35/661 variables, 21/195 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/661 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/661 variables, 69/265 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/661 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 1/662 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/662 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:44] [INFO ] Deduced a trap composed of 54 places in 271 ms of which 44 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/662 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/662 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/662 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 662/662 variables, and 268 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2037 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 188/188 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 150/166 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 460/626 variables, 166/174 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/626 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 35/661 variables, 21/195 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/661 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/661 variables, 69/265 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/661 variables, 9/274 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/661 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 1/662 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/662 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/662 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/662 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/662 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 0/662 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 662/662 variables, and 278 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2216 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 188/188 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4282ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 0 properties in 2334 ms.
Support contains 16 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 507/507 transitions.
Applied a total of 0 rules in 11 ms. Remains 188 /188 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 188/188 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 507/507 transitions.
Applied a total of 0 rules in 17 ms. Remains 188 /188 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2025-06-02 13:13:49] [INFO ] Flow matrix only has 474 transitions (discarded 33 similar events)
[2025-06-02 13:13:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:13:49] [INFO ] Implicit Places using invariants in 183 ms returned []
[2025-06-02 13:13:49] [INFO ] Flow matrix only has 474 transitions (discarded 33 similar events)
[2025-06-02 13:13:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:13:49] [INFO ] State equation strengthened by 69 read => feed constraints.
[2025-06-02 13:13:50] [INFO ] Implicit Places using invariants and state equation in 496 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 686 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 187/188 places, 507/507 transitions.
Applied a total of 0 rules in 11 ms. Remains 187 /187 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 715 ms. Remains : 187/188 places, 507/507 transitions.
RANDOM walk for 40000 steps (1299 resets) in 268 ms. (148 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (264 resets) in 50 ms. (784 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (269 resets) in 42 ms. (930 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (274 resets) in 55 ms. (714 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (276 resets) in 42 ms. (930 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (287 resets) in 42 ms. (930 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (283 resets) in 45 ms. (869 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (219 resets) in 52 ms. (754 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (278 resets) in 42 ms. (930 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (273 resets) in 42 ms. (930 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (270 resets) in 57 ms. (689 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 353255 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :0 out of 10
Probabilistic random walk after 353255 steps, saw 91839 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
[2025-06-02 13:13:53] [INFO ] Flow matrix only has 474 transitions (discarded 33 similar events)
// Phase 1: matrix 474 rows 187 cols
[2025-06-02 13:13:53] [INFO ] Computed 7 invariants in 4 ms
[2025-06-02 13:13:53] [INFO ] State equation strengthened by 69 read => feed constraints.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 148/164 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 459/623 variables, 164/169 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:53] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/623 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 37/660 variables, 22/192 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/660 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/660 variables, 69/262 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/660 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 1/661 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/661 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:54] [INFO ] Deduced a trap composed of 43 places in 317 ms of which 43 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/661 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:55] [INFO ] Deduced a trap composed of 63 places in 300 ms of which 42 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/661 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/661 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 0/661 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 661/661 variables, and 266 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2176 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 187/187 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 148/164 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 459/623 variables, 164/171 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/623 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 37/660 variables, 22/193 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/660 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/660 variables, 69/263 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/660 variables, 9/272 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/660 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 1/661 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/661 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/661 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/661 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:57] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/661 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:57] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 5 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/661 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/661 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 0/661 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 661/661 variables, and 278 constraints, problems are : Problem set: 0 solved, 10 unsolved in 4204 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 187/187 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6398ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 2663 ms.
Support contains 16 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 507/507 transitions.
Applied a total of 0 rules in 15 ms. Remains 187 /187 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 187/187 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 507/507 transitions.
Applied a total of 0 rules in 9 ms. Remains 187 /187 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2025-06-02 13:14:02] [INFO ] Flow matrix only has 474 transitions (discarded 33 similar events)
[2025-06-02 13:14:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:14:02] [INFO ] Implicit Places using invariants in 163 ms returned []
[2025-06-02 13:14:02] [INFO ] Flow matrix only has 474 transitions (discarded 33 similar events)
[2025-06-02 13:14:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:14:02] [INFO ] State equation strengthened by 69 read => feed constraints.
[2025-06-02 13:14:03] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 1032 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:14:03] [INFO ] Redundant transitions in 57 ms returned []
Running 501 sub problems to find dead transitions.
[2025-06-02 13:14:03] [INFO ] Flow matrix only has 474 transitions (discarded 33 similar events)
[2025-06-02 13:14:03] [INFO ] Invariant cache hit.
[2025-06-02 13:14:03] [INFO ] State equation strengthened by 69 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:08] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:08] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:08] [INFO ] Deduced a trap composed of 68 places in 320 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:09] [INFO ] Deduced a trap composed of 17 places in 296 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:09] [INFO ] Deduced a trap composed of 23 places in 340 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:11] [INFO ] Deduced a trap composed of 17 places in 275 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:12] [INFO ] Deduced a trap composed of 25 places in 307 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:12] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:13] [INFO ] Deduced a trap composed of 17 places in 245 ms of which 15 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (OVERLAPS) 474/661 variables, 187/203 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/661 variables, 69/272 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 661/661 variables, and 272 constraints, problems are : Problem set: 0 solved, 501 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 187/187 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 501 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (OVERLAPS) 474/661 variables, 187/203 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/661 variables, 69/272 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/661 variables, 501/773 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:51] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 661/661 variables, and 774 constraints, problems are : Problem set: 0 solved, 501 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 187/187 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60799ms problems are : Problem set: 0 solved, 501 unsolved
Search for dead transitions found 0 dead transitions in 60807ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61926 ms. Remains : 187/187 places, 507/507 transitions.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2025-06-02 13:15:04] [INFO ] Flatten gal took : 74 ms
[2025-06-02 13:15:04] [INFO ] Flatten gal took : 62 ms
[2025-06-02 13:15:04] [INFO ] Input system was already deterministic with 534 transitions.
Computed a total of 58 stabilizing places and 134 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 202/202 places, 534/534 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 201 transition count 531
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 199 transition count 531
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 10 place count 193 transition count 518
Iterating global reduction 0 with 6 rules applied. Total rules applied 16 place count 193 transition count 518
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 193 transition count 515
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 190 transition count 507
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 190 transition count 507
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 187 transition count 500
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 187 transition count 500
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 184 transition count 492
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 184 transition count 492
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 181 transition count 485
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 181 transition count 485
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 178 transition count 477
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 178 transition count 477
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 175 transition count 470
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 175 transition count 470
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 172 transition count 462
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 172 transition count 462
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 64 place count 169 transition count 455
Iterating global reduction 1 with 3 rules applied. Total rules applied 67 place count 169 transition count 455
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 70 place count 166 transition count 447
Iterating global reduction 1 with 3 rules applied. Total rules applied 73 place count 166 transition count 447
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 76 place count 163 transition count 441
Iterating global reduction 1 with 3 rules applied. Total rules applied 79 place count 163 transition count 441
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 82 place count 160 transition count 435
Iterating global reduction 1 with 3 rules applied. Total rules applied 85 place count 160 transition count 435
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 87 place count 158 transition count 431
Iterating global reduction 1 with 2 rules applied. Total rules applied 89 place count 158 transition count 431
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 93 place count 156 transition count 429
Applied a total of 93 rules in 137 ms. Remains 156 /202 variables (removed 46) and now considering 429/534 (removed 105) transitions.
[2025-06-02 13:15:04] [INFO ] Flow matrix only has 397 transitions (discarded 32 similar events)
// Phase 1: matrix 397 rows 156 cols
[2025-06-02 13:15:04] [INFO ] Computed 8 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:15:05] [INFO ] Implicit Places using invariants in 238 ms returned []
[2025-06-02 13:15:05] [INFO ] Flow matrix only has 397 transitions (discarded 32 similar events)
[2025-06-02 13:15:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:15:05] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-06-02 13:15:05] [INFO ] Implicit Places using invariants and state equation in 677 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 919 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 155/202 places, 429/534 transitions.
Applied a total of 0 rules in 20 ms. Remains 155 /155 variables (removed 0) and now considering 429/429 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1076 ms. Remains : 155/202 places, 429/534 transitions.
[2025-06-02 13:15:05] [INFO ] Flatten gal took : 54 ms
[2025-06-02 13:15:05] [INFO ] Flatten gal took : 41 ms
[2025-06-02 13:15:05] [INFO ] Input system was already deterministic with 429 transitions.
[2025-06-02 13:15:05] [INFO ] Flatten gal took : 33 ms
[2025-06-02 13:15:06] [INFO ] Flatten gal took : 33 ms
[2025-06-02 13:15:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality16244611735725415556.gal : 20 ms
[2025-06-02 13:15:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality18030620263906844570.ctl : 3 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/CTLCardinality16244611735725415556.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18030620263906844570.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 13:15:36] [INFO ] Flatten gal took : 19 ms
[2025-06-02 13:15:36] [INFO ] Applying decomposition
[2025-06-02 13:15:36] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13592911632987965086.txt' '-o' '/tmp/graph13592911632987965086.bin' '-w' '/tmp/graph13592911632987965086.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13592911632987965086.bin' '-l' '-1' '-v' '-w' '/tmp/graph13592911632987965086.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:15:36] [INFO ] Decomposing Gal with order
[2025-06-02 13:15:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:15:36] [INFO ] Removed a total of 704 redundant transitions.
[2025-06-02 13:15:36] [INFO ] Flatten gal took : 109 ms
[2025-06-02 13:15:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 145 labels/synchronizations in 29 ms.
[2025-06-02 13:15:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality1048460446197175355.gal : 9 ms
[2025-06-02 13:15:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality4389564818650617983.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/CTLCardinality1048460446197175355.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4389564818650617983.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 202/202 places, 534/534 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 201 transition count 530
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 198 transition count 530
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 11 place count 193 transition count 519
Iterating global reduction 0 with 5 rules applied. Total rules applied 16 place count 193 transition count 519
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 193 transition count 517
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 190 transition count 509
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 190 transition count 509
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 187 transition count 502
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 187 transition count 502
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 184 transition count 494
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 184 transition count 494
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 181 transition count 487
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 181 transition count 487
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 178 transition count 479
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 178 transition count 479
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 175 transition count 472
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 175 transition count 472
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 172 transition count 464
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 172 transition count 464
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 169 transition count 457
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 169 transition count 457
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 166 transition count 449
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 166 transition count 449
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 163 transition count 443
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 163 transition count 443
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 81 place count 160 transition count 437
Iterating global reduction 1 with 3 rules applied. Total rules applied 84 place count 160 transition count 437
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 86 place count 158 transition count 433
Iterating global reduction 1 with 2 rules applied. Total rules applied 88 place count 158 transition count 433
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 94 place count 155 transition count 430
Applied a total of 94 rules in 73 ms. Remains 155 /202 variables (removed 47) and now considering 430/534 (removed 104) transitions.
[2025-06-02 13:16:06] [INFO ] Flow matrix only has 398 transitions (discarded 32 similar events)
// Phase 1: matrix 398 rows 155 cols
[2025-06-02 13:16:06] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:16:07] [INFO ] Implicit Places using invariants in 215 ms returned []
[2025-06-02 13:16:07] [INFO ] Flow matrix only has 398 transitions (discarded 32 similar events)
[2025-06-02 13:16:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:16:07] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-06-02 13:16:07] [INFO ] Implicit Places using invariants and state equation in 548 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 778 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 154/202 places, 430/534 transitions.
Applied a total of 0 rules in 20 ms. Remains 154 /154 variables (removed 0) and now considering 430/430 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 872 ms. Remains : 154/202 places, 430/534 transitions.
[2025-06-02 13:16:07] [INFO ] Flatten gal took : 27 ms
[2025-06-02 13:16:07] [INFO ] Flatten gal took : 25 ms
[2025-06-02 13:16:07] [INFO ] Input system was already deterministic with 430 transitions.
[2025-06-02 13:16:07] [INFO ] Flatten gal took : 26 ms
[2025-06-02 13:16:07] [INFO ] Flatten gal took : 26 ms
[2025-06-02 13:16:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality5164847603419770251.gal : 6 ms
[2025-06-02 13:16:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality15876081342622953477.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/CTLCardinality5164847603419770251.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15876081342622953477.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 13:16:37] [INFO ] Flatten gal took : 19 ms
[2025-06-02 13:16:37] [INFO ] Applying decomposition
[2025-06-02 13:16:37] [INFO ] Flatten gal took : 17 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/graph15292269593279451686.txt' '-o' '/tmp/graph15292269593279451686.bin' '-w' '/tmp/graph15292269593279451686.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15292269593279451686.bin' '-l' '-1' '-v' '-w' '/tmp/graph15292269593279451686.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:16:37] [INFO ] Decomposing Gal with order
[2025-06-02 13:16:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:16:38] [INFO ] Removed a total of 710 redundant transitions.
[2025-06-02 13:16:38] [INFO ] Flatten gal took : 45 ms
[2025-06-02 13:16:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 122 labels/synchronizations in 21 ms.
[2025-06-02 13:16:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality16112963943116091225.gal : 5 ms
[2025-06-02 13:16:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality13127040213831604837.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/CTLCardinality16112963943116091225.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13127040213831604837.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 534/534 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 196 transition count 521
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 196 transition count 521
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 196 transition count 518
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 194 transition count 512
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 194 transition count 512
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 192 transition count 508
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 192 transition count 508
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 190 transition count 502
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 190 transition count 502
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 188 transition count 498
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 188 transition count 498
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 187 transition count 495
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 187 transition count 495
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 186 transition count 493
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 186 transition count 493
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 185 transition count 490
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 185 transition count 490
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 184 transition count 488
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 184 transition count 488
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 183 transition count 485
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 183 transition count 485
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 182 transition count 483
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 182 transition count 483
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 181 transition count 481
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 181 transition count 481
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 180 transition count 479
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 180 transition count 479
Applied a total of 47 rules in 32 ms. Remains 180 /202 variables (removed 22) and now considering 479/534 (removed 55) transitions.
[2025-06-02 13:17:08] [INFO ] Flow matrix only has 447 transitions (discarded 32 similar events)
// Phase 1: matrix 447 rows 180 cols
[2025-06-02 13:17:08] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:17:08] [INFO ] Implicit Places using invariants in 198 ms returned []
[2025-06-02 13:17:08] [INFO ] Flow matrix only has 447 transitions (discarded 32 similar events)
[2025-06-02 13:17:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:17:08] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-02 13:17:08] [INFO ] Implicit Places using invariants and state equation in 506 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 707 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 179/202 places, 479/534 transitions.
Applied a total of 0 rules in 2 ms. Remains 179 /179 variables (removed 0) and now considering 479/479 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 742 ms. Remains : 179/202 places, 479/534 transitions.
[2025-06-02 13:17:08] [INFO ] Flatten gal took : 16 ms
[2025-06-02 13:17:08] [INFO ] Flatten gal took : 26 ms
[2025-06-02 13:17:09] [INFO ] Input system was already deterministic with 479 transitions.
[2025-06-02 13:17:09] [INFO ] Flatten gal took : 16 ms
[2025-06-02 13:17:09] [INFO ] Flatten gal took : 17 ms
[2025-06-02 13:17:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality14963964820456612496.gal : 6 ms
[2025-06-02 13:17:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality6909390780386496936.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/CTLCardinality14963964820456612496.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6909390780386496936.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 13:17:39] [INFO ] Flatten gal took : 16 ms
[2025-06-02 13:17:39] [INFO ] Applying decomposition
[2025-06-02 13:17:39] [INFO ] Flatten gal took : 15 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/graph7341004856629748804.txt' '-o' '/tmp/graph7341004856629748804.bin' '-w' '/tmp/graph7341004856629748804.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7341004856629748804.bin' '-l' '-1' '-v' '-w' '/tmp/graph7341004856629748804.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:17:39] [INFO ] Decomposing Gal with order
[2025-06-02 13:17:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:17:39] [INFO ] Removed a total of 782 redundant transitions.
[2025-06-02 13:17:39] [INFO ] Flatten gal took : 60 ms
[2025-06-02 13:17:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 172 labels/synchronizations in 27 ms.
[2025-06-02 13:17:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality16498052165081524636.gal : 7 ms
[2025-06-02 13:17:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality14838851335632691996.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/CTLCardinality16498052165081524636.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14838851335632691996.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 202/202 places, 534/534 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 201 transition count 530
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 198 transition count 530
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 11 place count 193 transition count 519
Iterating global reduction 0 with 5 rules applied. Total rules applied 16 place count 193 transition count 519
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 193 transition count 517
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 190 transition count 509
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 190 transition count 509
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 187 transition count 502
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 187 transition count 502
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 185 transition count 497
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 185 transition count 497
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 183 transition count 492
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 183 transition count 492
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 181 transition count 487
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 181 transition count 487
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 179 transition count 482
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 179 transition count 482
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 177 transition count 477
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 177 transition count 477
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 175 transition count 472
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 175 transition count 472
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 173 transition count 467
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 173 transition count 467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 171 transition count 463
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 171 transition count 463
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 169 transition count 459
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 169 transition count 459
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 72 place count 166 transition count 456
Applied a total of 72 rules in 59 ms. Remains 166 /202 variables (removed 36) and now considering 456/534 (removed 78) transitions.
[2025-06-02 13:18:09] [INFO ] Flow matrix only has 424 transitions (discarded 32 similar events)
// Phase 1: matrix 424 rows 166 cols
[2025-06-02 13:18:09] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:18:09] [INFO ] Implicit Places using invariants in 170 ms returned []
[2025-06-02 13:18:09] [INFO ] Flow matrix only has 424 transitions (discarded 32 similar events)
[2025-06-02 13:18:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:18:10] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-02 13:18:10] [INFO ] Implicit Places using invariants and state equation in 620 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 794 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 165/202 places, 456/534 transitions.
Applied a total of 0 rules in 12 ms. Remains 165 /165 variables (removed 0) and now considering 456/456 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 865 ms. Remains : 165/202 places, 456/534 transitions.
[2025-06-02 13:18:10] [INFO ] Flatten gal took : 20 ms
[2025-06-02 13:18:10] [INFO ] Flatten gal took : 20 ms
[2025-06-02 13:18:10] [INFO ] Input system was already deterministic with 456 transitions.
[2025-06-02 13:18:10] [INFO ] Flatten gal took : 20 ms
[2025-06-02 13:18:10] [INFO ] Flatten gal took : 19 ms
[2025-06-02 13:18:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality17300126818907680360.gal : 5 ms
[2025-06-02 13:18:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality17484195416254008551.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/CTLCardinality17300126818907680360.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17484195416254008551.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 13:18:40] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:18:40] [INFO ] Applying decomposition
[2025-06-02 13:18:40] [INFO ] Flatten gal took : 12 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/graph17540159507767594364.txt' '-o' '/tmp/graph17540159507767594364.bin' '-w' '/tmp/graph17540159507767594364.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17540159507767594364.bin' '-l' '-1' '-v' '-w' '/tmp/graph17540159507767594364.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:18:40] [INFO ] Decomposing Gal with order
[2025-06-02 13:18:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:18:40] [INFO ] Removed a total of 710 redundant transitions.
[2025-06-02 13:18:40] [INFO ] Flatten gal took : 30 ms
[2025-06-02 13:18:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 153 labels/synchronizations in 12 ms.
[2025-06-02 13:18:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality4176356090406654220.gal : 5 ms
[2025-06-02 13:18:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality455528472673112270.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/CTLCardinality4176356090406654220.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality455528472673112270.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 534/534 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 197 transition count 523
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 197 transition count 523
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 197 transition count 520
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 195 transition count 515
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 195 transition count 515
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 193 transition count 510
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 193 transition count 510
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 191 transition count 505
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 191 transition count 505
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 189 transition count 500
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 189 transition count 500
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 187 transition count 495
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 187 transition count 495
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 186 transition count 493
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 186 transition count 493
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 185 transition count 490
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 185 transition count 490
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 184 transition count 488
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 184 transition count 488
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 183 transition count 485
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 183 transition count 485
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 182 transition count 483
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 182 transition count 483
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 181 transition count 481
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 181 transition count 481
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 180 transition count 479
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 180 transition count 479
Applied a total of 47 rules in 24 ms. Remains 180 /202 variables (removed 22) and now considering 479/534 (removed 55) transitions.
[2025-06-02 13:19:10] [INFO ] Flow matrix only has 447 transitions (discarded 32 similar events)
// Phase 1: matrix 447 rows 180 cols
[2025-06-02 13:19:10] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:19:11] [INFO ] Implicit Places using invariants in 204 ms returned []
[2025-06-02 13:19:11] [INFO ] Flow matrix only has 447 transitions (discarded 32 similar events)
[2025-06-02 13:19:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:19:11] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-02 13:19:11] [INFO ] Implicit Places using invariants and state equation in 893 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1100 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 179/202 places, 479/534 transitions.
Applied a total of 0 rules in 2 ms. Remains 179 /179 variables (removed 0) and now considering 479/479 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1126 ms. Remains : 179/202 places, 479/534 transitions.
[2025-06-02 13:19:11] [INFO ] Flatten gal took : 11 ms
[2025-06-02 13:19:12] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:19:12] [INFO ] Input system was already deterministic with 479 transitions.
[2025-06-02 13:19:12] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:19:12] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:19:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality4982918386032327589.gal : 3 ms
[2025-06-02 13:19:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality2070446047900926554.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/CTLCardinality4982918386032327589.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2070446047900926554.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 13:19:42] [INFO ] Flatten gal took : 14 ms
[2025-06-02 13:19:42] [INFO ] Applying decomposition
[2025-06-02 13:19:42] [INFO ] Flatten gal took : 14 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/graph4103896365984007115.txt' '-o' '/tmp/graph4103896365984007115.bin' '-w' '/tmp/graph4103896365984007115.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4103896365984007115.bin' '-l' '-1' '-v' '-w' '/tmp/graph4103896365984007115.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:19:42] [INFO ] Decomposing Gal with order
[2025-06-02 13:19:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:19:42] [INFO ] Removed a total of 769 redundant transitions.
[2025-06-02 13:19:42] [INFO ] Flatten gal took : 42 ms
[2025-06-02 13:19:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 179 labels/synchronizations in 31 ms.
[2025-06-02 13:19:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality10761377494313057609.gal : 5 ms
[2025-06-02 13:19:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality14519721608046000629.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/CTLCardinality10761377494313057609.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14519721608046000629.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 534/534 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 197 transition count 523
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 197 transition count 523
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 197 transition count 521
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 195 transition count 515
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 195 transition count 515
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 193 transition count 511
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 193 transition count 511
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 192 transition count 508
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 192 transition count 508
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 191 transition count 506
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 191 transition count 506
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 190 transition count 503
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 190 transition count 503
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 189 transition count 501
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 189 transition count 501
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 188 transition count 498
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 188 transition count 498
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 187 transition count 496
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 187 transition count 496
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 186 transition count 493
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 186 transition count 493
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 185 transition count 491
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 185 transition count 491
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 184 transition count 489
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 184 transition count 489
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 183 transition count 487
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 183 transition count 487
Applied a total of 40 rules in 26 ms. Remains 183 /202 variables (removed 19) and now considering 487/534 (removed 47) transitions.
[2025-06-02 13:20:12] [INFO ] Flow matrix only has 455 transitions (discarded 32 similar events)
// Phase 1: matrix 455 rows 183 cols
[2025-06-02 13:20:12] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:20:12] [INFO ] Implicit Places using invariants in 162 ms returned []
[2025-06-02 13:20:12] [INFO ] Flow matrix only has 455 transitions (discarded 32 similar events)
[2025-06-02 13:20:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:20:12] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-02 13:20:13] [INFO ] Implicit Places using invariants and state equation in 559 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 736 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 182/202 places, 487/534 transitions.
Applied a total of 0 rules in 3 ms. Remains 182 /182 variables (removed 0) and now considering 487/487 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 766 ms. Remains : 182/202 places, 487/534 transitions.
[2025-06-02 13:20:13] [INFO ] Flatten gal took : 10 ms
[2025-06-02 13:20:13] [INFO ] Flatten gal took : 12 ms
[2025-06-02 13:20:13] [INFO ] Input system was already deterministic with 487 transitions.
[2025-06-02 13:20:13] [INFO ] Flatten gal took : 12 ms
[2025-06-02 13:20:13] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:20:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality1750286181865096909.gal : 2 ms
[2025-06-02 13:20:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality1606820930727590352.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/CTLCardinality1750286181865096909.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1606820930727590352.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 13:20:43] [INFO ] Flatten gal took : 14 ms
[2025-06-02 13:20:43] [INFO ] Applying decomposition
[2025-06-02 13:20:43] [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/graph17229766419504454404.txt' '-o' '/tmp/graph17229766419504454404.bin' '-w' '/tmp/graph17229766419504454404.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17229766419504454404.bin' '-l' '-1' '-v' '-w' '/tmp/graph17229766419504454404.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:20:43] [INFO ] Decomposing Gal with order
[2025-06-02 13:20:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:20:43] [INFO ] Removed a total of 762 redundant transitions.
[2025-06-02 13:20:43] [INFO ] Flatten gal took : 36 ms
[2025-06-02 13:20:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 183 labels/synchronizations in 12 ms.
[2025-06-02 13:20:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality17680332624234552843.gal : 5 ms
[2025-06-02 13:20:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality1841483690770755870.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/CTLCardinality17680332624234552843.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1841483690770755870.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 534/534 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 199 transition count 528
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 199 transition count 528
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 199 transition count 526
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 198 transition count 523
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 198 transition count 523
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 197 transition count 521
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 197 transition count 521
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 196 transition count 518
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 196 transition count 518
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 195 transition count 516
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 195 transition count 516
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 194 transition count 513
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 194 transition count 513
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 193 transition count 511
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 193 transition count 511
Applied a total of 20 rules in 22 ms. Remains 193 /202 variables (removed 9) and now considering 511/534 (removed 23) transitions.
[2025-06-02 13:21:13] [INFO ] Flow matrix only has 479 transitions (discarded 32 similar events)
// Phase 1: matrix 479 rows 193 cols
[2025-06-02 13:21:13] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:21:13] [INFO ] Implicit Places using invariants in 188 ms returned []
[2025-06-02 13:21:13] [INFO ] Flow matrix only has 479 transitions (discarded 32 similar events)
[2025-06-02 13:21:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:21:14] [INFO ] State equation strengthened by 70 read => feed constraints.
[2025-06-02 13:21:14] [INFO ] Implicit Places using invariants and state equation in 698 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 897 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 192/202 places, 511/534 transitions.
Applied a total of 0 rules in 3 ms. Remains 192 /192 variables (removed 0) and now considering 511/511 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 924 ms. Remains : 192/202 places, 511/534 transitions.
[2025-06-02 13:21:14] [INFO ] Flatten gal took : 14 ms
[2025-06-02 13:21:14] [INFO ] Flatten gal took : 16 ms
[2025-06-02 13:21:14] [INFO ] Input system was already deterministic with 511 transitions.
[2025-06-02 13:21:14] [INFO ] Flatten gal took : 15 ms
[2025-06-02 13:21:14] [INFO ] Flatten gal took : 15 ms
[2025-06-02 13:21:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality16811463776901554482.gal : 3 ms
[2025-06-02 13:21:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality13840118739242182598.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/CTLCardinality16811463776901554482.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13840118739242182598.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 13:21:44] [INFO ] Flatten gal took : 14 ms
[2025-06-02 13:21:44] [INFO ] Applying decomposition
[2025-06-02 13:21:44] [INFO ] Flatten gal took : 14 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/graph936613417719160900.txt' '-o' '/tmp/graph936613417719160900.bin' '-w' '/tmp/graph936613417719160900.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph936613417719160900.bin' '-l' '-1' '-v' '-w' '/tmp/graph936613417719160900.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:21:44] [INFO ] Decomposing Gal with order
[2025-06-02 13:21:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:21:44] [INFO ] Removed a total of 839 redundant transitions.
[2025-06-02 13:21:44] [INFO ] Flatten gal took : 34 ms
[2025-06-02 13:21:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 194 labels/synchronizations in 8 ms.
[2025-06-02 13:21:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality9624627175988650386.gal : 5 ms
[2025-06-02 13:21:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality5305203507354257416.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/CTLCardinality9624627175988650386.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5305203507354257416.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 202/202 places, 534/534 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 201 transition count 530
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 198 transition count 530
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 11 place count 193 transition count 519
Iterating global reduction 0 with 5 rules applied. Total rules applied 16 place count 193 transition count 519
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 193 transition count 516
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 191 transition count 511
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 191 transition count 511
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 189 transition count 506
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 189 transition count 506
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 188 transition count 503
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 188 transition count 503
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 187 transition count 501
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 187 transition count 501
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 186 transition count 498
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 186 transition count 498
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 185 transition count 496
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 185 transition count 496
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 184 transition count 493
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 184 transition count 493
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 183 transition count 491
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 183 transition count 491
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 182 transition count 488
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 182 transition count 488
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 181 transition count 486
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 181 transition count 486
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 180 transition count 484
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 180 transition count 484
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 179 transition count 482
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 179 transition count 482
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 176 transition count 479
Applied a total of 53 rules in 57 ms. Remains 176 /202 variables (removed 26) and now considering 479/534 (removed 55) transitions.
[2025-06-02 13:22:15] [INFO ] Flow matrix only has 447 transitions (discarded 32 similar events)
// Phase 1: matrix 447 rows 176 cols
[2025-06-02 13:22:15] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:22:15] [INFO ] Implicit Places using invariants in 168 ms returned []
[2025-06-02 13:22:15] [INFO ] Flow matrix only has 447 transitions (discarded 32 similar events)
[2025-06-02 13:22:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:22:15] [INFO ] State equation strengthened by 62 read => feed constraints.
[2025-06-02 13:22:15] [INFO ] Implicit Places using invariants and state equation in 447 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 617 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 175/202 places, 479/534 transitions.
Applied a total of 0 rules in 9 ms. Remains 175 /175 variables (removed 0) and now considering 479/479 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 684 ms. Remains : 175/202 places, 479/534 transitions.
[2025-06-02 13:22:15] [INFO ] Flatten gal took : 17 ms
[2025-06-02 13:22:15] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:22:15] [INFO ] Input system was already deterministic with 479 transitions.
[2025-06-02 13:22:15] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:22:15] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:22:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality139483006260135864.gal : 3 ms
[2025-06-02 13:22:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality14088446436080091975.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/CTLCardinality139483006260135864.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14088446436080091975.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 13:22:45] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:22:45] [INFO ] Applying decomposition
[2025-06-02 13:22:45] [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/graph14903477316284935732.txt' '-o' '/tmp/graph14903477316284935732.bin' '-w' '/tmp/graph14903477316284935732.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14903477316284935732.bin' '-l' '-1' '-v' '-w' '/tmp/graph14903477316284935732.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:22:45] [INFO ] Decomposing Gal with order
[2025-06-02 13:22:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:22:45] [INFO ] Removed a total of 804 redundant transitions.
[2025-06-02 13:22:45] [INFO ] Flatten gal took : 30 ms
[2025-06-02 13:22:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 157 labels/synchronizations in 9 ms.
[2025-06-02 13:22:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality7144354919906455382.gal : 4 ms
[2025-06-02 13:22:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality17791365269933417260.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/CTLCardinality7144354919906455382.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17791365269933417260.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 534/534 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 196 transition count 521
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 196 transition count 521
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 196 transition count 518
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 193 transition count 510
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 193 transition count 510
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 191 transition count 505
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 191 transition count 505
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 189 transition count 500
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 189 transition count 500
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 187 transition count 495
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 187 transition count 495
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 185 transition count 490
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 185 transition count 490
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 183 transition count 485
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 183 transition count 485
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 181 transition count 480
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 181 transition count 480
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 180 transition count 478
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 180 transition count 478
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 179 transition count 475
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 179 transition count 475
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 178 transition count 473
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 178 transition count 473
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 177 transition count 471
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 177 transition count 471
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 176 transition count 469
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 176 transition count 469
Applied a total of 55 rules in 28 ms. Remains 176 /202 variables (removed 26) and now considering 469/534 (removed 65) transitions.
[2025-06-02 13:23:16] [INFO ] Flow matrix only has 437 transitions (discarded 32 similar events)
// Phase 1: matrix 437 rows 176 cols
[2025-06-02 13:23:16] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:23:16] [INFO ] Implicit Places using invariants in 187 ms returned []
[2025-06-02 13:23:16] [INFO ] Flow matrix only has 437 transitions (discarded 32 similar events)
[2025-06-02 13:23:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:23:16] [INFO ] State equation strengthened by 63 read => feed constraints.
[2025-06-02 13:23:16] [INFO ] Implicit Places using invariants and state equation in 522 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 710 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 175/202 places, 469/534 transitions.
Applied a total of 0 rules in 1 ms. Remains 175 /175 variables (removed 0) and now considering 469/469 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 739 ms. Remains : 175/202 places, 469/534 transitions.
[2025-06-02 13:23:16] [INFO ] Flatten gal took : 11 ms
[2025-06-02 13:23:16] [INFO ] Flatten gal took : 22 ms
[2025-06-02 13:23:16] [INFO ] Input system was already deterministic with 469 transitions.
[2025-06-02 13:23:16] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:23:16] [INFO ] Flatten gal took : 12 ms
[2025-06-02 13:23:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality6939629550040723409.gal : 2 ms
[2025-06-02 13:23:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality16016492936133232489.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/CTLCardinality6939629550040723409.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16016492936133232489.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 13:23:46] [INFO ] Flatten gal took : 12 ms
[2025-06-02 13:23:46] [INFO ] Applying decomposition
[2025-06-02 13:23:46] [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/graph16907777805785611558.txt' '-o' '/tmp/graph16907777805785611558.bin' '-w' '/tmp/graph16907777805785611558.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16907777805785611558.bin' '-l' '-1' '-v' '-w' '/tmp/graph16907777805785611558.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:23:46] [INFO ] Decomposing Gal with order
[2025-06-02 13:23:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:23:46] [INFO ] Removed a total of 744 redundant transitions.
[2025-06-02 13:23:46] [INFO ] Flatten gal took : 29 ms
[2025-06-02 13:23:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 145 labels/synchronizations in 7 ms.
[2025-06-02 13:23:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality10046286351393142855.gal : 4 ms
[2025-06-02 13:23:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality2386799777679371233.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/CTLCardinality10046286351393142855.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2386799777679371233.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 534/534 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 196 transition count 521
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 196 transition count 521
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 196 transition count 518
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 193 transition count 510
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 193 transition count 510
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 191 transition count 505
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 191 transition count 505
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 189 transition count 500
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 189 transition count 500
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 187 transition count 495
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 187 transition count 495
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 185 transition count 490
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 185 transition count 490
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 183 transition count 485
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 183 transition count 485
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 182 transition count 482
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 182 transition count 482
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 181 transition count 480
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 181 transition count 480
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 180 transition count 477
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 180 transition count 477
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 179 transition count 475
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 179 transition count 475
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 178 transition count 473
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 178 transition count 473
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 177 transition count 471
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 177 transition count 471
Applied a total of 53 rules in 26 ms. Remains 177 /202 variables (removed 25) and now considering 471/534 (removed 63) transitions.
[2025-06-02 13:24:17] [INFO ] Flow matrix only has 439 transitions (discarded 32 similar events)
// Phase 1: matrix 439 rows 177 cols
[2025-06-02 13:24:17] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:24:17] [INFO ] Implicit Places using invariants in 214 ms returned []
[2025-06-02 13:24:17] [INFO ] Flow matrix only has 439 transitions (discarded 32 similar events)
[2025-06-02 13:24:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:24:17] [INFO ] State equation strengthened by 63 read => feed constraints.
[2025-06-02 13:24:18] [INFO ] Implicit Places using invariants and state equation in 851 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1068 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 176/202 places, 471/534 transitions.
Applied a total of 0 rules in 2 ms. Remains 176 /176 variables (removed 0) and now considering 471/471 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1097 ms. Remains : 176/202 places, 471/534 transitions.
[2025-06-02 13:24:18] [INFO ] Flatten gal took : 11 ms
[2025-06-02 13:24:18] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:24:18] [INFO ] Input system was already deterministic with 471 transitions.
[2025-06-02 13:24:18] [INFO ] Flatten gal took : 12 ms
[2025-06-02 13:24:18] [INFO ] Flatten gal took : 12 ms
[2025-06-02 13:24:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality109028604941904688.gal : 2 ms
[2025-06-02 13:24:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality9927491554205992787.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/CTLCardinality109028604941904688.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9927491554205992787.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 13:24:48] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:24:48] [INFO ] Applying decomposition
[2025-06-02 13:24:48] [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/graph8376537278309462161.txt' '-o' '/tmp/graph8376537278309462161.bin' '-w' '/tmp/graph8376537278309462161.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8376537278309462161.bin' '-l' '-1' '-v' '-w' '/tmp/graph8376537278309462161.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:24:48] [INFO ] Decomposing Gal with order
[2025-06-02 13:24:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:24:48] [INFO ] Removed a total of 780 redundant transitions.
[2025-06-02 13:24:48] [INFO ] Flatten gal took : 27 ms
[2025-06-02 13:24:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 134 labels/synchronizations in 7 ms.
[2025-06-02 13:24:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality4052515030504989006.gal : 4 ms
[2025-06-02 13:24:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality16843647225615684622.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/CTLCardinality4052515030504989006.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16843647225615684622.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 534/534 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 196 transition count 521
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 196 transition count 521
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 196 transition count 518
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 193 transition count 510
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 193 transition count 510
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 190 transition count 503
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 190 transition count 503
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 187 transition count 495
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 187 transition count 495
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 184 transition count 488
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 184 transition count 488
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 182 transition count 483
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 182 transition count 483
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 180 transition count 478
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 180 transition count 478
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 178 transition count 473
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 178 transition count 473
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 176 transition count 468
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 176 transition count 468
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 174 transition count 463
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 174 transition count 463
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 172 transition count 459
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 172 transition count 459
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 170 transition count 455
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 170 transition count 455
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 169 transition count 453
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 169 transition count 453
Applied a total of 69 rules in 22 ms. Remains 169 /202 variables (removed 33) and now considering 453/534 (removed 81) transitions.
[2025-06-02 13:25:18] [INFO ] Flow matrix only has 421 transitions (discarded 32 similar events)
// Phase 1: matrix 421 rows 169 cols
[2025-06-02 13:25:18] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:25:18] [INFO ] Implicit Places using invariants in 190 ms returned []
[2025-06-02 13:25:18] [INFO ] Flow matrix only has 421 transitions (discarded 32 similar events)
[2025-06-02 13:25:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:25:18] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-06-02 13:25:19] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
Running 452 sub problems to find dead transitions.
[2025-06-02 13:25:19] [INFO ] Flow matrix only has 421 transitions (discarded 32 similar events)
[2025-06-02 13:25:19] [INFO ] Invariant cache hit.
[2025-06-02 13:25:19] [INFO ] State equation strengthened by 61 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:25] [INFO ] Deduced a trap composed of 57 places in 153 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:25] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:25] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:26] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:26] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:27] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:27] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:27] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:28] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (OVERLAPS) 420/589 variables, 169/186 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/589 variables, 60/246 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/589 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 452 unsolved
SMT process timed out in 30348ms, After SMT, problems are : Problem set: 0 solved, 452 unsolved
Search for dead transitions found 0 dead transitions in 30350ms
Starting structural reductions in LTL mode, iteration 1 : 169/202 places, 453/534 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31078 ms. Remains : 169/202 places, 453/534 transitions.
[2025-06-02 13:25:49] [INFO ] Flatten gal took : 11 ms
[2025-06-02 13:25:49] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:25:49] [INFO ] Input system was already deterministic with 453 transitions.
[2025-06-02 13:25:49] [INFO ] Flatten gal took : 11 ms
[2025-06-02 13:25:49] [INFO ] Flatten gal took : 12 ms
[2025-06-02 13:25:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality16871388711776366480.gal : 2 ms
[2025-06-02 13:25:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality18304112656973709329.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/CTLCardinality16871388711776366480.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18304112656973709329.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 13:26:19] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:26:19] [INFO ] Applying decomposition
[2025-06-02 13:26:19] [INFO ] Flatten gal took : 12 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/graph5101244305063293152.txt' '-o' '/tmp/graph5101244305063293152.bin' '-w' '/tmp/graph5101244305063293152.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5101244305063293152.bin' '-l' '-1' '-v' '-w' '/tmp/graph5101244305063293152.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:26:19] [INFO ] Decomposing Gal with order
[2025-06-02 13:26:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:26:19] [INFO ] Removed a total of 750 redundant transitions.
[2025-06-02 13:26:19] [INFO ] Flatten gal took : 25 ms
[2025-06-02 13:26:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 135 labels/synchronizations in 7 ms.
[2025-06-02 13:26:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality8332441317320715017.gal : 4 ms
[2025-06-02 13:26:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality7129045572259847704.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/CTLCardinality8332441317320715017.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7129045572259847704.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 202/202 places, 534/534 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 201 transition count 530
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 198 transition count 530
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 11 place count 193 transition count 519
Iterating global reduction 0 with 5 rules applied. Total rules applied 16 place count 193 transition count 519
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 193 transition count 517
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 190 transition count 509
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 190 transition count 509
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 187 transition count 502
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 187 transition count 502
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 184 transition count 494
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 184 transition count 494
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 181 transition count 487
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 181 transition count 487
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 178 transition count 479
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 178 transition count 479
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 175 transition count 472
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 175 transition count 472
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 172 transition count 464
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 172 transition count 464
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 169 transition count 457
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 169 transition count 457
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 166 transition count 449
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 166 transition count 449
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 163 transition count 443
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 163 transition count 443
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 81 place count 160 transition count 437
Iterating global reduction 1 with 3 rules applied. Total rules applied 84 place count 160 transition count 437
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 86 place count 158 transition count 433
Iterating global reduction 1 with 2 rules applied. Total rules applied 88 place count 158 transition count 433
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 94 place count 155 transition count 430
Applied a total of 94 rules in 54 ms. Remains 155 /202 variables (removed 47) and now considering 430/534 (removed 104) transitions.
[2025-06-02 13:26:49] [INFO ] Flow matrix only has 398 transitions (discarded 32 similar events)
// Phase 1: matrix 398 rows 155 cols
[2025-06-02 13:26:49] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:26:50] [INFO ] Implicit Places using invariants in 182 ms returned []
[2025-06-02 13:26:50] [INFO ] Flow matrix only has 398 transitions (discarded 32 similar events)
[2025-06-02 13:26:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:26:50] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-06-02 13:26:50] [INFO ] Implicit Places using invariants and state equation in 480 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 671 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 154/202 places, 430/534 transitions.
Applied a total of 0 rules in 8 ms. Remains 154 /154 variables (removed 0) and now considering 430/430 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 733 ms. Remains : 154/202 places, 430/534 transitions.
[2025-06-02 13:26:50] [INFO ] Flatten gal took : 10 ms
[2025-06-02 13:26:50] [INFO ] Flatten gal took : 12 ms
[2025-06-02 13:26:50] [INFO ] Input system was already deterministic with 430 transitions.
[2025-06-02 13:26:50] [INFO ] Flatten gal took : 12 ms
[2025-06-02 13:26:50] [INFO ] Flatten gal took : 12 ms
[2025-06-02 13:26:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality4869140530446709076.gal : 2 ms
[2025-06-02 13:26:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality2150868954411541565.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/CTLCardinality4869140530446709076.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2150868954411541565.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 13:27:20] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:27:20] [INFO ] Applying decomposition
[2025-06-02 13:27:20] [INFO ] Flatten gal took : 11 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/graph12706159771193404455.txt' '-o' '/tmp/graph12706159771193404455.bin' '-w' '/tmp/graph12706159771193404455.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12706159771193404455.bin' '-l' '-1' '-v' '-w' '/tmp/graph12706159771193404455.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:27:20] [INFO ] Decomposing Gal with order
[2025-06-02 13:27:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:27:20] [INFO ] Removed a total of 710 redundant transitions.
[2025-06-02 13:27:20] [INFO ] Flatten gal took : 23 ms
[2025-06-02 13:27:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 130 labels/synchronizations in 6 ms.
[2025-06-02 13:27:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality14674170773419236613.gal : 4 ms
[2025-06-02 13:27:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality16842332109039597278.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/CTLCardinality14674170773419236613.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16842332109039597278.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 534/534 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 197 transition count 523
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 197 transition count 523
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 197 transition count 521
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 194 transition count 513
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 194 transition count 513
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 191 transition count 506
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 191 transition count 506
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 188 transition count 498
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 188 transition count 498
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 185 transition count 491
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 185 transition count 491
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 182 transition count 483
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 182 transition count 483
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 180 transition count 478
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 180 transition count 478
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 178 transition count 473
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 178 transition count 473
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 176 transition count 468
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 176 transition count 468
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 174 transition count 463
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 174 transition count 463
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 172 transition count 459
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 172 transition count 459
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 170 transition count 455
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 170 transition count 455
Applied a total of 66 rules in 23 ms. Remains 170 /202 variables (removed 32) and now considering 455/534 (removed 79) transitions.
[2025-06-02 13:27:50] [INFO ] Flow matrix only has 423 transitions (discarded 32 similar events)
// Phase 1: matrix 423 rows 170 cols
[2025-06-02 13:27:50] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:27:51] [INFO ] Implicit Places using invariants in 189 ms returned []
[2025-06-02 13:27:51] [INFO ] Flow matrix only has 423 transitions (discarded 32 similar events)
[2025-06-02 13:27:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:27:51] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-02 13:27:51] [INFO ] Implicit Places using invariants and state equation in 503 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 694 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 169/202 places, 455/534 transitions.
Applied a total of 0 rules in 1 ms. Remains 169 /169 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 718 ms. Remains : 169/202 places, 455/534 transitions.
[2025-06-02 13:27:51] [INFO ] Flatten gal took : 11 ms
[2025-06-02 13:27:51] [INFO ] Flatten gal took : 12 ms
[2025-06-02 13:27:51] [INFO ] Input system was already deterministic with 455 transitions.
[2025-06-02 13:27:51] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:27:51] [INFO ] Flatten gal took : 12 ms
[2025-06-02 13:27:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality12426462629808330011.gal : 3 ms
[2025-06-02 13:27:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality5956412885271136250.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/CTLCardinality12426462629808330011.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5956412885271136250.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 13:28:21] [INFO ] Flatten gal took : 12 ms
[2025-06-02 13:28:21] [INFO ] Applying decomposition
[2025-06-02 13:28:21] [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/graph10571276190713570136.txt' '-o' '/tmp/graph10571276190713570136.bin' '-w' '/tmp/graph10571276190713570136.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10571276190713570136.bin' '-l' '-1' '-v' '-w' '/tmp/graph10571276190713570136.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:28:21] [INFO ] Decomposing Gal with order
[2025-06-02 13:28:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:28:21] [INFO ] Removed a total of 712 redundant transitions.
[2025-06-02 13:28:21] [INFO ] Flatten gal took : 24 ms
[2025-06-02 13:28:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 172 labels/synchronizations in 7 ms.
[2025-06-02 13:28:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality11812022973036722795.gal : 3 ms
[2025-06-02 13:28:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality11792393227832695023.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/CTLCardinality11812022973036722795.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11792393227832695023.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 13:28:51] [INFO ] Flatten gal took : 16 ms
[2025-06-02 13:28:52] [INFO ] Flatten gal took : 17 ms
[2025-06-02 13:28:52] [INFO ] Applying decomposition
[2025-06-02 13:28:52] [INFO ] Flatten gal took : 16 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/graph3373020761627281389.txt' '-o' '/tmp/graph3373020761627281389.bin' '-w' '/tmp/graph3373020761627281389.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3373020761627281389.bin' '-l' '-1' '-v' '-w' '/tmp/graph3373020761627281389.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:28:52] [INFO ] Decomposing Gal with order
[2025-06-02 13:28:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:28:52] [INFO ] Removed a total of 797 redundant transitions.
[2025-06-02 13:28:52] [INFO ] Flatten gal took : 29 ms
[2025-06-02 13:28:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 257 labels/synchronizations in 7 ms.
[2025-06-02 13:28:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality11835999342897651867.gal : 4 ms
[2025-06-02 13:28:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality13169861384452406010.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/CTLCardinality11835999342897651867.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13169861384452406010.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 13:54:13] [INFO ] Applying decomposition
[2025-06-02 13:54:13] [INFO ] Flatten gal took : 15 ms
[2025-06-02 13:54:13] [INFO ] Decomposing Gal with order
[2025-06-02 13:54:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:54:13] [INFO ] Removed a total of 695 redundant transitions.
[2025-06-02 13:54:13] [INFO ] Flatten gal took : 41 ms
[2025-06-02 13:54:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 209 labels/synchronizations in 4 ms.
[2025-06-02 13:54:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality15516769835378186972.gal : 2 ms
[2025-06-02 13:54:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality6244073993966733125.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/CTLCardinality15516769835378186972.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6244073993966733125.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 13 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.88834e+08,14.7377,312840,1402,4289,197425,330020,214,536723,397,3.04153e+06,0
Converting to forward existential form...Done !
original formula: AF(EG(AG(EF(((u4.p18==0)&&(u12.p148==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(E(TRUE U !(E(TRUE U ((u4.p18==0)&&(u12.p148==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t75, t95, t97, t98, t192, t279, t281, t283, t292, t293, t338, t346, t347, t423, t445, t479, t...633
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,0,41.4048,715444,1,0,578857,818409,1304,1.28132e+06,1883,6.10917e+06,1035346
FORMULA FireWire-PT-13-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EF(EG(((u9.p86==1) + ((u9.p112==1) * E(((u5.p50==0)&&(u9.p116==0)) U (u9.p110!=0))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((u9.p86==1) + ((u9.p112==1) * E(((u5.p50==0)&&(u9.p116==0)) U (u9.p110!=0)))))] != FALSE
(forward)formula 1,1,42.925,756276,1,0,649713,840977,1345,1.38258e+06,1892,6.26754e+06,1125454
FORMULA FireWire-PT-13-CTLCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: E((u13.p176==1) U (AX(EX((((u9.p123==0)||(u13.p195==1))&&(u13.p195==1)))) + (((u8.p81!=1) * A(AX(((u9.p128==0)||(u1.p1==1))) U EX(((u13.p...202
=> equivalent forward existential formula: ([(FwdU(Init,(u13.p176==1)) * !(EX(!(EX((((u9.p123==0)||(u13.p195==1))&&(u13.p195==1)))))))] != FALSE + [((FwdU(...409
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 2,0,86.1046,1727984,1,0,1.86931e+06,1.48585e+06,1416,3.51074e+06,1918,1.06964e+07,2687234
FORMULA FireWire-PT-13-CTLCardinality-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AG(E(EF(AG((((u5.p27==0)||(u5.p58==1))||(u5.p22==1)))) U (u13.p164==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(E(TRUE U !(E(TRUE U !((((u5.p27==0)||(u5.p58==1))||(u5.p22==1)))))) U (u13.p164==1))))] ...162
(forward)formula 3,0,149.836,2204860,1,0,2.54215e+06,1.69499e+06,589,4.60577e+06,1179,1.20717e+07,786869
FORMULA FireWire-PT-13-CTLCardinality-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AX((AF((AF((u5.p55==0)) * EG((u13.p152==0)))) * (AG((u9.p95==0)) + (u13.p166==1))))
=> equivalent forward existential formula: ([FwdG(EY(Init),!((!(EG(!((u5.p55==0)))) * EG((u13.p152==0)))))] = FALSE * [(FwdU((EY(Init) * !((u13.p166==1))),...188
(forward)formula 4,0,158.465,2204860,1,0,2.54215e+06,1.69499e+06,914,4.60577e+06,1344,1.20717e+07,1258519
FORMULA FireWire-PT-13-CTLCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AG(E((!((!(EX((u13.p170==1))) * !(E((u14.p0==1) U (u13.p180==0))))) * (AF((((u5.p55==0)||(u7.p78==1))&&((u9.p90==0)||(u9.p138==1)))) + AF...234
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((!((!(EX((u13.p170==1))) * !(E((u14.p0==1) U (u13.p180==0))))) * (!(EG(!((((u5.p55==0)||...300
(forward)formula 5,0,239.366,2537532,1,0,2.54215e+06,2.8892e+06,617,4.81682e+06,1184,1.91027e+07,224613
FORMULA FireWire-PT-13-CTLCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EF(AG((AX((u13.p173==0)) + !(A(AG((u11.p142==1)) U (((u9.p127==0)||(u13.p152==1))||((u5.p69==0)||(u5.p22==1))))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(EX(!((u13.p173==0)))) + !(!((E(!((((u9.p127==0)||(u13.p152==1))||((u5.p69==0...362
(forward)formula 6,1,249.586,2537532,1,0,2.54215e+06,2.8892e+06,666,4.81682e+06,1191,1.91027e+07,723337
FORMULA FireWire-PT-13-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EF(((EF(AG(AF(((u9.p101==0)&&(u5.p65==1))))) * AG(((u9.p97==1)||(((u5.p24==0)&&(u4.p17==0))&&(u9.p92==1))))) * EF(((u9.p106==0)||(u13.p17...164
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * (E(TRUE U !(E(TRUE U !(!(EG(!(((u9.p101==0)&&(u5.p65==1))))))))) * !(E(TRUE U !(((u9.p...259
(forward)formula 7,1,523.508,3377788,1,0,4.30762e+06,3.02844e+06,881,7.49159e+06,1300,1.92096e+07,515333
FORMULA FireWire-PT-13-CTLCardinality-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EF(((AF((u5.p64==0)) * (u9.p121==0)) * A(AX(((u1.p11==0)||(u1.p4==1))) U !((A((u13.p187==1) U (u11.p143==0)) + AX(((u9.p97==0)||(u4.p18==...164
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (!(EG(!((u5.p64==0)))) * (u9.p121==0))) * !(EG(!(!((!((E(!((u11.p143==0)) U (!((u13.p187==...583
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 8,1,627.179,3522580,1,0,4.30762e+06,3.98088e+06,987,7.49159e+06,1336,2.56381e+07,3307430
FORMULA FireWire-PT-13-CTLCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: E(A(((u11.p144==1) * !(AG((u13.p154==1)))) U E((u9.p96!=1) U (u5.p76==1))) U EX((u5.p45==1)))
=> equivalent forward existential formula: [(EY(FwdU(Init,!((E(!(E((u9.p96!=1) U (u5.p76==1))) U (!(((u11.p144==1) * !(!(E(TRUE U !((u13.p154==1))))))) * !...254
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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-13"
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-13, 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-174860102300337"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-13.tgz
mv FireWire-PT-13 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 '
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 ;