fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r086-smll-174860102400385
Last Updated
June 24, 2025

About the Execution of ITS-Tools for FireWire-PT-19

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 ?F???T??TF?????? normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K 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 221K 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-19-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-15
FORMULA_NAME FireWire-PT-19-CTLCardinality-2025-00
FORMULA_NAME FireWire-PT-19-CTLCardinality-2025-01
FORMULA_NAME FireWire-PT-19-CTLCardinality-2025-02
FORMULA_NAME FireWire-PT-19-CTLCardinality-2025-03
FORMULA_NAME FireWire-PT-19-CTLCardinality-2025-04
FORMULA_NAME FireWire-PT-19-CTLCardinality-2025-05
FORMULA_NAME FireWire-PT-19-CTLCardinality-2025-06
FORMULA_NAME FireWire-PT-19-CTLCardinality-2025-07
FORMULA_NAME FireWire-PT-19-CTLCardinality-2025-08
FORMULA_NAME FireWire-PT-19-CTLCardinality-2025-09
FORMULA_NAME FireWire-PT-19-CTLCardinality-2025-10
FORMULA_NAME FireWire-PT-19-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748898489876

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-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-02 21:08:12] [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 21:08:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:08:12] [INFO ] Load time of PNML (sax parser for PT used): 277 ms
[2025-06-02 21:08:12] [INFO ] Transformed 602 places.
[2025-06-02 21:08:12] [INFO ] Transformed 944 transitions.
[2025-06-02 21:08:12] [INFO ] Found NUPN structural information;
[2025-06-02 21:08:12] [INFO ] Parsed PT model containing 602 places and 944 transitions and 2776 arcs in 527 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 29 ms.
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-19-CTLCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-19-CTLCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 132 out of 602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 602/602 places, 944/944 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 596 transition count 944
Discarding 91 places :
Symmetric choice reduction at 1 with 91 rule applications. Total rules 97 place count 505 transition count 853
Iterating global reduction 1 with 91 rules applied. Total rules applied 188 place count 505 transition count 853
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 203 place count 490 transition count 833
Iterating global reduction 1 with 15 rules applied. Total rules applied 218 place count 490 transition count 833
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 219 place count 490 transition count 832
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 220 place count 489 transition count 831
Iterating global reduction 2 with 1 rules applied. Total rules applied 221 place count 489 transition count 831
Applied a total of 221 rules in 179 ms. Remains 489 /602 variables (removed 113) and now considering 831/944 (removed 113) transitions.
// Phase 1: matrix 831 rows 489 cols
[2025-06-02 21:08:13] [INFO ] Computed 10 invariants in 38 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:08:14] [INFO ] Implicit Places using invariants in 839 ms returned []
[2025-06-02 21:08:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:08:15] [INFO ] Implicit Places using invariants and state equation in 1418 ms returned []
Implicit Place search using SMT with State Equation took 2311 ms to find 0 implicit places.
Running 830 sub problems to find dead transitions.
[2025-06-02 21:08:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 830 unsolved
SMT process timed out in 30709ms, After SMT, problems are : Problem set: 0 solved, 830 unsolved
Search for dead transitions found 0 dead transitions in 30737ms
Starting structural reductions in LTL mode, iteration 1 : 489/602 places, 831/944 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33260 ms. Remains : 489/602 places, 831/944 transitions.
Support contains 132 out of 489 places after structural reductions.
[2025-06-02 21:08:46] [INFO ] Flatten gal took : 209 ms
[2025-06-02 21:08:46] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA FireWire-PT-19-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-19-CTLCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 21:08:46] [INFO ] Flatten gal took : 115 ms
[2025-06-02 21:08:47] [INFO ] Input system was already deterministic with 831 transitions.
Support contains 103 out of 489 places (down from 132) after GAL structural reductions.
RANDOM walk for 40000 steps (16 resets) in 2626 ms. (15 steps per ms) remains 30/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
[2025-06-02 21:08:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 355/398 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/398 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 25/423 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 772/1195 variables, 423/433 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1195 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 48/1243 variables, 24/457 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1243 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 42/1285 variables, 21/478 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1285 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (OVERLAPS) 19/1304 variables, 12/490 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1304/1320 variables, and 490 constraints, problems are : Problem set: 0 solved, 30 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 480/489 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 355/398 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:08:54] [INFO ] Deduced a trap composed of 76 places in 162 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/398 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 25/423 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 772/1195 variables, 423/434 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1195 variables, 27/461 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:08:58] [INFO ] Deduced a trap composed of 100 places in 622 ms of which 104 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1195/1320 variables, and 462 constraints, problems are : Problem set: 0 solved, 30 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 423/489 constraints, PredecessorRefiner: 27/30 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10071ms problems are : Problem set: 0 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 43 out of 489 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 489/489 places, 831/831 transitions.
Graph (trivial) has 332 edges and 489 vertex of which 18 / 489 are part of one of the 3 SCC in 9 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 1440 edges and 474 vertex of which 471 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 82 rules applied. Total rules applied 84 place count 471 transition count 728
Reduce places removed 81 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 86 rules applied. Total rules applied 170 place count 390 transition count 723
Reduce places removed 3 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 11 rules applied. Total rules applied 181 place count 387 transition count 715
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 189 place count 379 transition count 715
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 26 Pre rules applied. Total rules applied 189 place count 379 transition count 689
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 241 place count 353 transition count 689
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 259 place count 335 transition count 669
Iterating global reduction 4 with 18 rules applied. Total rules applied 277 place count 335 transition count 669
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 278 place count 335 transition count 668
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 278 place count 335 transition count 661
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 292 place count 328 transition count 661
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 294 place count 326 transition count 658
Iterating global reduction 5 with 2 rules applied. Total rules applied 296 place count 326 transition count 658
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 298 place count 326 transition count 656
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 299 place count 325 transition count 656
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 2 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 7 with 98 rules applied. Total rules applied 397 place count 276 transition count 607
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: -152
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 7 with 68 rules applied. Total rules applied 465 place count 242 transition count 759
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 467 place count 242 transition count 757
Free-agglomeration rule applied 33 times.
Iterating global reduction 7 with 33 rules applied. Total rules applied 500 place count 242 transition count 724
Reduce places removed 33 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 45 rules applied. Total rules applied 545 place count 209 transition count 712
Drop transitions (Redundant composition of simpler transitions.) removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 8 with 72 rules applied. Total rules applied 617 place count 209 transition count 640
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 622 place count 209 transition count 640
Applied a total of 622 rules in 467 ms. Remains 209 /489 variables (removed 280) and now considering 640/831 (removed 191) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 468 ms. Remains : 209/489 places, 640/831 transitions.
RANDOM walk for 40000 steps (1073 resets) in 1169 ms. (34 steps per ms) remains 8/30 properties
BEST_FIRST walk for 40003 steps (214 resets) in 135 ms. (294 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (207 resets) in 113 ms. (350 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (225 resets) in 167 ms. (238 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (231 resets) in 124 ms. (320 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (215 resets) in 115 ms. (344 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (207 resets) in 107 ms. (370 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (201 resets) in 157 ms. (253 steps per ms) remains 7/7 properties
[2025-06-02 21:08:59] [INFO ] Flow matrix only has 618 transitions (discarded 22 similar events)
// Phase 1: matrix 618 rows 209 cols
[2025-06-02 21:08:59] [INFO ] Computed 10 invariants in 7 ms
[2025-06-02 21:08:59] [INFO ] State equation strengthened by 89 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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 170/179 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 18/197 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 611/808 variables, 197/207 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/808 variables, 85/292 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/808 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 12/820 variables, 7/299 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/820 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 5/825 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/825 variables, 4/306 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/825 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 2/827 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/827 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/827 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 827/827 variables, and 308 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1213 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 209/209 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 170/179 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 18/197 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 611/808 variables, 197/207 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/808 variables, 85/292 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/808 variables, 7/299 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/808 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 12/820 variables, 7/306 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/820 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 5/825 variables, 3/309 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/825 variables, 4/313 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/825 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 2/827 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/827 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/827 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 827/827 variables, and 315 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3479 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 209/209 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4715ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 1 properties in 2806 ms.
Support contains 8 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 640/640 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 209 transition count 631
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 200 transition count 631
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 18 place count 200 transition count 628
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 197 transition count 628
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 197 transition count 627
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 28 place count 194 transition count 622
Iterating global reduction 3 with 3 rules applied. Total rules applied 31 place count 194 transition count 622
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 53 place count 183 transition count 611
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 64 place count 183 transition count 600
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 66 place count 181 transition count 596
Iterating global reduction 4 with 2 rules applied. Total rules applied 68 place count 181 transition count 596
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 73 place count 181 transition count 591
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 89 place count 173 transition count 621
Drop transitions (Redundant composition of simpler transitions.) removed 68 transitions
Redundant transition composition rules discarded 68 transitions
Iterating global reduction 5 with 68 rules applied. Total rules applied 157 place count 173 transition count 553
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 160 place count 173 transition count 550
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 163 place count 170 transition count 550
Applied a total of 163 rules in 105 ms. Remains 170 /209 variables (removed 39) and now considering 550/640 (removed 90) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 170/209 places, 550/640 transitions.
RANDOM walk for 40000 steps (1440 resets) in 319 ms. (125 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40002 steps (261 resets) in 119 ms. (333 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (269 resets) in 128 ms. (310 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (282 resets) in 102 ms. (388 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (302 resets) in 107 ms. (370 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (285 resets) in 108 ms. (367 steps per ms) remains 4/4 properties
[2025-06-02 21:09:07] [INFO ] Flow matrix only has 505 transitions (discarded 45 similar events)
// Phase 1: matrix 505 rows 170 cols
[2025-06-02 21:09:07] [INFO ] Computed 10 invariants in 3 ms
[2025-06-02 21:09:07] [INFO ] State equation strengthened by 89 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 98/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 60/164 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 505/669 variables, 164/174 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/669 variables, 89/263 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/669 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 6/675 variables, 6/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/675 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/675 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 675/675 variables, and 269 constraints, problems are : Problem set: 0 solved, 4 unsolved in 543 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 170/170 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 98/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 60/164 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:09:08] [INFO ] Deduced a trap composed of 18 places in 301 ms of which 24 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 505/669 variables, 164/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/669 variables, 89/264 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 4/268 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 6/675 variables, 6/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/675 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/675 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 675/675 variables, and 274 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1793 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 170/170 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2353ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 680 ms.
Support contains 6 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 550/550 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 170 transition count 549
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 169 transition count 549
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 168 transition count 548
Applied a total of 4 rules in 41 ms. Remains 168 /170 variables (removed 2) and now considering 548/550 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 168/170 places, 548/550 transitions.
RANDOM walk for 40000 steps (1440 resets) in 248 ms. (160 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (297 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (276 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (299 resets) in 108 ms. (367 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (281 resets) in 75 ms. (526 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 6662 steps, run visited all 4 properties in 132 ms. (steps per millisecond=50 )
Probabilistic random walk after 6662 steps, saw 2675 distinct states, run finished after 139 ms. (steps per millisecond=47 ) properties seen :4
[2025-06-02 21:09:11] [INFO ] Flatten gal took : 74 ms
[2025-06-02 21:09:11] [INFO ] Flatten gal took : 77 ms
[2025-06-02 21:09:11] [INFO ] Input system was already deterministic with 831 transitions.
Computed a total of 83 stabilizing places and 87 stable transitions
Graph (complete) has 1459 edges and 489 vertex of which 486 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.23 ms
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 831/831 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 486 transition count 831
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 46 place count 443 transition count 784
Iterating global reduction 1 with 43 rules applied. Total rules applied 89 place count 443 transition count 784
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 90 place count 443 transition count 783
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 104 place count 429 transition count 737
Iterating global reduction 2 with 14 rules applied. Total rules applied 118 place count 429 transition count 737
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 120 place count 429 transition count 735
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 123 place count 426 transition count 732
Iterating global reduction 3 with 3 rules applied. Total rules applied 126 place count 426 transition count 732
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 128 place count 424 transition count 730
Iterating global reduction 3 with 2 rules applied. Total rules applied 130 place count 424 transition count 730
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 132 place count 422 transition count 728
Iterating global reduction 3 with 2 rules applied. Total rules applied 134 place count 422 transition count 728
Applied a total of 134 rules in 169 ms. Remains 422 /489 variables (removed 67) and now considering 728/831 (removed 103) transitions.
// Phase 1: matrix 728 rows 422 cols
[2025-06-02 21:09:11] [INFO ] Computed 10 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:09:12] [INFO ] Implicit Places using invariants in 396 ms returned []
[2025-06-02 21:09:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:09:13] [INFO ] Implicit Places using invariants and state equation in 981 ms returned []
Implicit Place search using SMT with State Equation took 1387 ms to find 0 implicit places.
Running 727 sub problems to find dead transitions.
[2025-06-02 21:09:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 727 unsolved
At refinement iteration 1 (OVERLAPS) 1/422 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 727 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:09:41] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:09:42] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 8 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 422/1150 variables, and 12 constraints, problems are : Problem set: 0 solved, 727 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/422 constraints, PredecessorRefiner: 727/727 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 727 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 727 unsolved
At refinement iteration 1 (OVERLAPS) 1/422 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 727 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 727 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:09:54] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:09:56] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:09:59] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:09:59] [INFO ] Deduced a trap composed of 56 places in 349 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:10:00] [INFO ] Deduced a trap composed of 75 places in 413 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:10:07] [INFO ] Deduced a trap composed of 72 places in 129 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/422 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 727 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/1150 variables, and 18 constraints, problems are : Problem set: 0 solved, 727 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/422 constraints, PredecessorRefiner: 0/727 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60311ms problems are : Problem set: 0 solved, 727 unsolved
Search for dead transitions found 0 dead transitions in 60315ms
Starting structural reductions in LTL mode, iteration 1 : 422/489 places, 728/831 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61877 ms. Remains : 422/489 places, 728/831 transitions.
[2025-06-02 21:10:13] [INFO ] Flatten gal took : 51 ms
[2025-06-02 21:10:13] [INFO ] Flatten gal took : 52 ms
[2025-06-02 21:10:13] [INFO ] Input system was already deterministic with 728 transitions.
[2025-06-02 21:10:13] [INFO ] Flatten gal took : 57 ms
[2025-06-02 21:10:13] [INFO ] Flatten gal took : 68 ms
[2025-06-02 21:10:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality15976888419092102779.gal : 66 ms
[2025-06-02 21:10:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality15386851171207883683.ctl : 13 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/CTLCardinality15976888419092102779.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15386851171207883683.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 21:10:43] [INFO ] Flatten gal took : 24 ms
[2025-06-02 21:10:43] [INFO ] Applying decomposition
[2025-06-02 21:10:44] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7892646170802343569.txt' '-o' '/tmp/graph7892646170802343569.bin' '-w' '/tmp/graph7892646170802343569.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7892646170802343569.bin' '-l' '-1' '-v' '-w' '/tmp/graph7892646170802343569.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:10:44] [INFO ] Decomposing Gal with order
[2025-06-02 21:10:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:10:44] [INFO ] Removed a total of 751 redundant transitions.
[2025-06-02 21:10:44] [INFO ] Flatten gal took : 150 ms
[2025-06-02 21:10:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 22 ms.
[2025-06-02 21:10:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality12652644577944457296.gal : 18 ms
[2025-06-02 21:10:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality16386918842476540317.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/CTLCardinality12652644577944457296.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16386918842476540317.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 : 489/489 places, 831/831 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 486 transition count 831
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 44 place count 445 transition count 788
Iterating global reduction 1 with 41 rules applied. Total rules applied 85 place count 445 transition count 788
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 445 transition count 787
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 99 place count 432 transition count 742
Iterating global reduction 2 with 13 rules applied. Total rules applied 112 place count 432 transition count 742
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 114 place count 432 transition count 740
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 117 place count 429 transition count 737
Iterating global reduction 3 with 3 rules applied. Total rules applied 120 place count 429 transition count 737
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 122 place count 427 transition count 735
Iterating global reduction 3 with 2 rules applied. Total rules applied 124 place count 427 transition count 735
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 126 place count 425 transition count 733
Iterating global reduction 3 with 2 rules applied. Total rules applied 128 place count 425 transition count 733
Applied a total of 128 rules in 64 ms. Remains 425 /489 variables (removed 64) and now considering 733/831 (removed 98) transitions.
// Phase 1: matrix 733 rows 425 cols
[2025-06-02 21:11:14] [INFO ] Computed 10 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:11:15] [INFO ] Implicit Places using invariants in 435 ms returned []
[2025-06-02 21:11:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:11:15] [INFO ] Implicit Places using invariants and state equation in 836 ms returned []
Implicit Place search using SMT with State Equation took 1275 ms to find 0 implicit places.
Running 732 sub problems to find dead transitions.
[2025-06-02 21:11:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/424 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 1 (OVERLAPS) 1/425 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 732 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:11:44] [INFO ] Deduced a trap composed of 86 places in 141 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:11:45] [INFO ] Deduced a trap composed of 75 places in 113 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:11:45] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 425/1158 variables, and 13 constraints, problems are : Problem set: 0 solved, 732 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/425 constraints, PredecessorRefiner: 732/732 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 732 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/424 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 1 (OVERLAPS) 1/425 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/425 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 732 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:12:02] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:12:02] [INFO ] Deduced a trap composed of 55 places in 352 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:12:03] [INFO ] Deduced a trap composed of 74 places in 396 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:12:10] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/425 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 732 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/1158 variables, and 17 constraints, problems are : Problem set: 0 solved, 732 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/425 constraints, PredecessorRefiner: 0/732 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60235ms problems are : Problem set: 0 solved, 732 unsolved
Search for dead transitions found 0 dead transitions in 60239ms
Starting structural reductions in LTL mode, iteration 1 : 425/489 places, 733/831 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61581 ms. Remains : 425/489 places, 733/831 transitions.
[2025-06-02 21:12:16] [INFO ] Flatten gal took : 37 ms
[2025-06-02 21:12:16] [INFO ] Flatten gal took : 39 ms
[2025-06-02 21:12:16] [INFO ] Input system was already deterministic with 733 transitions.
[2025-06-02 21:12:16] [INFO ] Flatten gal took : 37 ms
[2025-06-02 21:12:16] [INFO ] Flatten gal took : 37 ms
[2025-06-02 21:12:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality12743038826158991021.gal : 8 ms
[2025-06-02 21:12:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality651158028040879504.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12743038826158991021.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality651158028040879504.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 21:12:46] [INFO ] Flatten gal took : 24 ms
[2025-06-02 21:12:46] [INFO ] Applying decomposition
[2025-06-02 21:12:46] [INFO ] Flatten gal took : 23 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/graph15853640768593046708.txt' '-o' '/tmp/graph15853640768593046708.bin' '-w' '/tmp/graph15853640768593046708.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15853640768593046708.bin' '-l' '-1' '-v' '-w' '/tmp/graph15853640768593046708.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:12:46] [INFO ] Decomposing Gal with order
[2025-06-02 21:12:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:12:46] [INFO ] Removed a total of 758 redundant transitions.
[2025-06-02 21:12:46] [INFO ] Flatten gal took : 63 ms
[2025-06-02 21:12:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 20 ms.
[2025-06-02 21:12:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality13058319616598186055.gal : 13 ms
[2025-06-02 21:12:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality12572706708485327636.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/CTLCardinality13058319616598186055.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12572706708485327636.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 : 489/489 places, 831/831 transitions.
Graph (trivial) has 375 edges and 489 vertex of which 18 / 489 are part of one of the 3 SCC in 2 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 1443 edges and 474 vertex of which 471 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 98 place count 470 transition count 718
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 99 rules applied. Total rules applied 197 place count 374 transition count 715
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 200 place count 372 transition count 714
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 201 place count 371 transition count 714
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 27 Pre rules applied. Total rules applied 201 place count 371 transition count 687
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 255 place count 344 transition count 687
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 279 place count 320 transition count 659
Iterating global reduction 4 with 24 rules applied. Total rules applied 303 place count 320 transition count 659
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 305 place count 320 transition count 657
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 305 place count 320 transition count 646
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 327 place count 309 transition count 646
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 333 place count 303 transition count 609
Iterating global reduction 5 with 6 rules applied. Total rules applied 339 place count 303 transition count 609
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 343 place count 303 transition count 605
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 345 place count 301 transition count 605
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 7 with 64 rules applied. Total rules applied 409 place count 269 transition count 573
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 411 place count 267 transition count 541
Iterating global reduction 7 with 2 rules applied. Total rules applied 413 place count 267 transition count 541
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 414 place count 267 transition count 540
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 416 place count 265 transition count 538
Applied a total of 416 rules in 221 ms. Remains 265 /489 variables (removed 224) and now considering 538/831 (removed 293) transitions.
[2025-06-02 21:13:17] [INFO ] Flow matrix only has 533 transitions (discarded 5 similar events)
// Phase 1: matrix 533 rows 265 cols
[2025-06-02 21:13:17] [INFO ] Computed 10 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:13:17] [INFO ] Implicit Places using invariants in 278 ms returned []
[2025-06-02 21:13:17] [INFO ] Flow matrix only has 533 transitions (discarded 5 similar events)
[2025-06-02 21:13:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:13:17] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-02 21:13:18] [INFO ] Implicit Places using invariants and state equation in 785 ms returned []
Implicit Place search using SMT with State Equation took 1068 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 21:13:18] [INFO ] Redundant transitions in 53 ms returned []
Running 527 sub problems to find dead transitions.
[2025-06-02 21:13:18] [INFO ] Flow matrix only has 533 transitions (discarded 5 similar events)
[2025-06-02 21:13:18] [INFO ] Invariant cache hit.
[2025-06-02 21:13:18] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 527 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:13:23] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:13:23] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/262 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 527 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 527 unsolved
At refinement iteration 3 (OVERLAPS) 1/263 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 527 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:13:43] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:13:44] [INFO ] Deduced a trap composed of 26 places in 339 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:13:45] [INFO ] Deduced a trap composed of 77 places in 377 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:13:45] [INFO ] Deduced a trap composed of 35 places in 376 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:13:47] [INFO ] Deduced a trap composed of 26 places in 302 ms of which 18 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 263/798 variables, and 17 constraints, problems are : Problem set: 0 solved, 527 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/265 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 527/527 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 527 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 527 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/262 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 527 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 527 unsolved
At refinement iteration 3 (OVERLAPS) 1/263 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 527 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 527 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:13:59] [INFO ] Deduced a trap composed of 82 places in 384 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:14:00] [INFO ] Deduced a trap composed of 23 places in 349 ms of which 34 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 527 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 527 unsolved
At refinement iteration 7 (OVERLAPS) 532/795 variables, 263/282 constraints. Problems are: Problem set: 0 solved, 527 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/795 variables, 3/285 constraints. Problems are: Problem set: 0 solved, 527 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/795 variables, 527/812 constraints. Problems are: Problem set: 0 solved, 527 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 795/798 variables, and 812 constraints, problems are : Problem set: 0 solved, 527 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 263/265 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 527/527 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60343ms problems are : Problem set: 0 solved, 527 unsolved
Search for dead transitions found 0 dead transitions in 60346ms
Starting structural reductions in SI_CTL mode, iteration 1 : 265/489 places, 538/831 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61703 ms. Remains : 265/489 places, 538/831 transitions.
[2025-06-02 21:14:18] [INFO ] Flatten gal took : 31 ms
[2025-06-02 21:14:18] [INFO ] Flatten gal took : 29 ms
[2025-06-02 21:14:18] [INFO ] Input system was already deterministic with 538 transitions.
[2025-06-02 21:14:18] [INFO ] Flatten gal took : 26 ms
[2025-06-02 21:14:18] [INFO ] Flatten gal took : 26 ms
[2025-06-02 21:14:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality1608231077863545085.gal : 6 ms
[2025-06-02 21:14:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality5530110689425037440.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/CTLCardinality1608231077863545085.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5530110689425037440.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 21:14:48] [INFO ] Flatten gal took : 14 ms
[2025-06-02 21:14:48] [INFO ] Applying decomposition
[2025-06-02 21:14:48] [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/graph6368602567204621441.txt' '-o' '/tmp/graph6368602567204621441.bin' '-w' '/tmp/graph6368602567204621441.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6368602567204621441.bin' '-l' '-1' '-v' '-w' '/tmp/graph6368602567204621441.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:14:49] [INFO ] Decomposing Gal with order
[2025-06-02 21:14:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:14:49] [INFO ] Removed a total of 713 redundant transitions.
[2025-06-02 21:14:49] [INFO ] Flatten gal took : 37 ms
[2025-06-02 21:14:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 107 labels/synchronizations in 17 ms.
[2025-06-02 21:14:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality3099915190391681095.gal : 6 ms
[2025-06-02 21:14:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality2863331120583284351.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/CTLCardinality3099915190391681095.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2863331120583284351.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 LTL mode, iteration 0 : 489/489 places, 831/831 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 486 transition count 831
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 46 place count 443 transition count 784
Iterating global reduction 1 with 43 rules applied. Total rules applied 89 place count 443 transition count 784
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 90 place count 443 transition count 783
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 105 place count 428 transition count 736
Iterating global reduction 2 with 15 rules applied. Total rules applied 120 place count 428 transition count 736
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 122 place count 428 transition count 734
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 125 place count 425 transition count 731
Iterating global reduction 3 with 3 rules applied. Total rules applied 128 place count 425 transition count 731
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 130 place count 423 transition count 729
Iterating global reduction 3 with 2 rules applied. Total rules applied 132 place count 423 transition count 729
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 134 place count 421 transition count 727
Iterating global reduction 3 with 2 rules applied. Total rules applied 136 place count 421 transition count 727
Applied a total of 136 rules in 47 ms. Remains 421 /489 variables (removed 68) and now considering 727/831 (removed 104) transitions.
// Phase 1: matrix 727 rows 421 cols
[2025-06-02 21:15:19] [INFO ] Computed 10 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:15:19] [INFO ] Implicit Places using invariants in 310 ms returned []
[2025-06-02 21:15:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:15:20] [INFO ] Implicit Places using invariants and state equation in 800 ms returned []
Implicit Place search using SMT with State Equation took 1117 ms to find 0 implicit places.
Running 726 sub problems to find dead transitions.
[2025-06-02 21:15:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 1 (OVERLAPS) 1/421 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 726 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:15:47] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:15:48] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:15:50] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:15:50] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 8 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1148 variables, and 14 constraints, problems are : Problem set: 0 solved, 726 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/421 constraints, PredecessorRefiner: 726/726 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 726 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 1 (OVERLAPS) 1/421 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 726 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:16:01] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:16:06] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:16:06] [INFO ] Deduced a trap composed of 54 places in 336 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:16:08] [INFO ] Deduced a trap composed of 73 places in 413 ms of which 66 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/421 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 726 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:16:19] [INFO ] Deduced a trap composed of 74 places in 133 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:16:19] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 1)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 1)
(s157 0)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 1)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/1148 variables, and 20 constraints, problems are : Problem set: 0 solved, 726 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/421 constraints, PredecessorRefiner: 0/726 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60201ms problems are : Problem set: 0 solved, 726 unsolved
Search for dead transitions found 0 dead transitions in 60204ms
Starting structural reductions in LTL mode, iteration 1 : 421/489 places, 727/831 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61373 ms. Remains : 421/489 places, 727/831 transitions.
[2025-06-02 21:16:20] [INFO ] Flatten gal took : 20 ms
[2025-06-02 21:16:20] [INFO ] Flatten gal took : 16 ms
[2025-06-02 21:16:20] [INFO ] Input system was already deterministic with 727 transitions.
[2025-06-02 21:16:20] [INFO ] Flatten gal took : 16 ms
[2025-06-02 21:16:20] [INFO ] Flatten gal took : 17 ms
[2025-06-02 21:16:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality11729476620480532653.gal : 4 ms
[2025-06-02 21:16:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality11103776362149044662.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/CTLCardinality11729476620480532653.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11103776362149044662.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 21:16:50] [INFO ] Flatten gal took : 25 ms
[2025-06-02 21:16:50] [INFO ] Applying decomposition
[2025-06-02 21:16:50] [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/graph12722262661409236148.txt' '-o' '/tmp/graph12722262661409236148.bin' '-w' '/tmp/graph12722262661409236148.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12722262661409236148.bin' '-l' '-1' '-v' '-w' '/tmp/graph12722262661409236148.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:16:50] [INFO ] Decomposing Gal with order
[2025-06-02 21:16:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:16:50] [INFO ] Removed a total of 748 redundant transitions.
[2025-06-02 21:16:50] [INFO ] Flatten gal took : 41 ms
[2025-06-02 21:16:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 8 ms.
[2025-06-02 21:16:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality7764298393844824867.gal : 7 ms
[2025-06-02 21:16:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality14533286886107513096.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/CTLCardinality7764298393844824867.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14533286886107513096.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 489/489 places, 831/831 transitions.
Graph (trivial) has 362 edges and 489 vertex of which 14 / 489 are part of one of the 2 SCC in 1 ms
Free SCC test removed 12 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 1446 edges and 477 vertex of which 474 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 98 place count 474 transition count 722
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 101 rules applied. Total rules applied 199 place count 378 transition count 717
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 204 place count 375 transition count 715
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 206 place count 373 transition count 715
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 26 Pre rules applied. Total rules applied 206 place count 373 transition count 689
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 258 place count 347 transition count 689
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 280 place count 325 transition count 663
Iterating global reduction 4 with 22 rules applied. Total rules applied 302 place count 325 transition count 663
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 304 place count 325 transition count 661
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 304 place count 325 transition count 651
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 324 place count 315 transition count 651
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 326 place count 313 transition count 648
Iterating global reduction 5 with 2 rules applied. Total rules applied 328 place count 313 transition count 648
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 394 place count 280 transition count 615
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 395 place count 279 transition count 613
Iterating global reduction 5 with 1 rules applied. Total rules applied 396 place count 279 transition count 613
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 397 place count 279 transition count 613
Applied a total of 397 rules in 97 ms. Remains 279 /489 variables (removed 210) and now considering 613/831 (removed 218) transitions.
[2025-06-02 21:17:21] [INFO ] Flow matrix only has 609 transitions (discarded 4 similar events)
// Phase 1: matrix 609 rows 279 cols
[2025-06-02 21:17:21] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:17:21] [INFO ] Implicit Places using invariants in 324 ms returned []
[2025-06-02 21:17:21] [INFO ] Flow matrix only has 609 transitions (discarded 4 similar events)
[2025-06-02 21:17:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:17:21] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-06-02 21:17:22] [INFO ] Implicit Places using invariants and state equation in 1295 ms returned []
Implicit Place search using SMT with State Equation took 1621 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 21:17:22] [INFO ] Redundant transitions in 115 ms returned []
Running 612 sub problems to find dead transitions.
[2025-06-02 21:17:22] [INFO ] Flow matrix only has 609 transitions (discarded 4 similar events)
[2025-06-02 21:17:22] [INFO ] Invariant cache hit.
[2025-06-02 21:17:22] [INFO ] State equation strengthened by 34 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 612 unsolved
At refinement iteration 1 (OVERLAPS) 1/279 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 612 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:17:38] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:17:39] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:17:39] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:17:40] [INFO ] Deduced a trap composed of 69 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:17:40] [INFO ] Deduced a trap composed of 30 places in 390 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:17:41] [INFO ] Deduced a trap composed of 85 places in 392 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:17:41] [INFO ] Deduced a trap composed of 42 places in 386 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:17:46] [INFO ] Deduced a trap composed of 30 places in 380 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:17:46] [INFO ] Deduced a trap composed of 30 places in 346 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:17:46] [INFO ] Deduced a trap composed of 32 places in 290 ms of which 31 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 612 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 279/888 variables, and 20 constraints, problems are : Problem set: 0 solved, 612 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/279 constraints, ReadFeed: 0/34 constraints, PredecessorRefiner: 612/612 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 612 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 612 unsolved
At refinement iteration 1 (OVERLAPS) 1/279 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 612 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 612 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:18:07] [INFO ] Deduced a trap composed of 30 places in 353 ms of which 38 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 612 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 612 unsolved
At refinement iteration 5 (OVERLAPS) 608/887 variables, 279/300 constraints. Problems are: Problem set: 0 solved, 612 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/887 variables, 33/333 constraints. Problems are: Problem set: 0 solved, 612 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 887/888 variables, and 945 constraints, problems are : Problem set: 0 solved, 612 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 279/279 constraints, ReadFeed: 33/34 constraints, PredecessorRefiner: 612/612 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60306ms problems are : Problem set: 0 solved, 612 unsolved
Search for dead transitions found 0 dead transitions in 60309ms
Starting structural reductions in SI_CTL mode, iteration 1 : 279/489 places, 613/831 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62151 ms. Remains : 279/489 places, 613/831 transitions.
[2025-06-02 21:18:23] [INFO ] Flatten gal took : 24 ms
[2025-06-02 21:18:23] [INFO ] Flatten gal took : 25 ms
[2025-06-02 21:18:23] [INFO ] Input system was already deterministic with 613 transitions.
[2025-06-02 21:18:23] [INFO ] Flatten gal took : 25 ms
[2025-06-02 21:18:23] [INFO ] Flatten gal took : 26 ms
[2025-06-02 21:18:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality12580857757687983274.gal : 5 ms
[2025-06-02 21:18:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality9979565864094090303.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/CTLCardinality12580857757687983274.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9979565864094090303.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 21:18:53] [INFO ] Flatten gal took : 16 ms
[2025-06-02 21:18:53] [INFO ] Applying decomposition
[2025-06-02 21:18:53] [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/graph4874394179487761393.txt' '-o' '/tmp/graph4874394179487761393.bin' '-w' '/tmp/graph4874394179487761393.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4874394179487761393.bin' '-l' '-1' '-v' '-w' '/tmp/graph4874394179487761393.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:18:53] [INFO ] Decomposing Gal with order
[2025-06-02 21:18:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:18:53] [INFO ] Removed a total of 795 redundant transitions.
[2025-06-02 21:18:53] [INFO ] Flatten gal took : 44 ms
[2025-06-02 21:18:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 77 labels/synchronizations in 13 ms.
[2025-06-02 21:18:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality2020587842313166409.gal : 5 ms
[2025-06-02 21:18:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality14000492553478827521.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/CTLCardinality2020587842313166409.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14000492553478827521.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 : 489/489 places, 831/831 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 486 transition count 831
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 46 place count 443 transition count 784
Iterating global reduction 1 with 43 rules applied. Total rules applied 89 place count 443 transition count 784
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 103 place count 429 transition count 738
Iterating global reduction 1 with 14 rules applied. Total rules applied 117 place count 429 transition count 738
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 119 place count 429 transition count 736
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 121 place count 427 transition count 734
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 427 transition count 734
Applied a total of 123 rules in 57 ms. Remains 427 /489 variables (removed 62) and now considering 734/831 (removed 97) transitions.
// Phase 1: matrix 734 rows 427 cols
[2025-06-02 21:19:23] [INFO ] Computed 10 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:19:24] [INFO ] Implicit Places using invariants in 379 ms returned []
[2025-06-02 21:19:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:19:25] [INFO ] Implicit Places using invariants and state equation in 810 ms returned []
Implicit Place search using SMT with State Equation took 1203 ms to find 0 implicit places.
Running 733 sub problems to find dead transitions.
[2025-06-02 21:19:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 733 unsolved
At refinement iteration 1 (OVERLAPS) 1/427 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 733 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:19:55] [INFO ] Deduced a trap composed of 85 places in 137 ms of which 9 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 427/1161 variables, and 11 constraints, problems are : Problem set: 0 solved, 733 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/427 constraints, PredecessorRefiner: 733/733 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 733 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 733 unsolved
At refinement iteration 1 (OVERLAPS) 1/427 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 733 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/427 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 733 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:20:06] [INFO ] Deduced a trap composed of 72 places in 140 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:20:06] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:20:06] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:20:10] [INFO ] Deduced a trap composed of 87 places in 132 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:20:10] [INFO ] Deduced a trap composed of 75 places in 134 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:20:10] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:20:12] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:20:12] [INFO ] Deduced a trap composed of 55 places in 386 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:20:13] [INFO ] Deduced a trap composed of 74 places in 409 ms of which 73 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/427 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 733 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 427/1161 variables, and 20 constraints, problems are : Problem set: 0 solved, 733 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/427 constraints, PredecessorRefiner: 0/733 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60297ms problems are : Problem set: 0 solved, 733 unsolved
Search for dead transitions found 0 dead transitions in 60301ms
Starting structural reductions in LTL mode, iteration 1 : 427/489 places, 734/831 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61564 ms. Remains : 427/489 places, 734/831 transitions.
[2025-06-02 21:20:25] [INFO ] Flatten gal took : 26 ms
[2025-06-02 21:20:25] [INFO ] Flatten gal took : 31 ms
[2025-06-02 21:20:25] [INFO ] Input system was already deterministic with 734 transitions.
[2025-06-02 21:20:25] [INFO ] Flatten gal took : 27 ms
[2025-06-02 21:20:25] [INFO ] Flatten gal took : 27 ms
[2025-06-02 21:20:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality5329051382879355435.gal : 6 ms
[2025-06-02 21:20:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality181335896144204171.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/CTLCardinality5329051382879355435.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality181335896144204171.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 21:20:55] [INFO ] Flatten gal took : 17 ms
[2025-06-02 21:20:55] [INFO ] Applying decomposition
[2025-06-02 21:20:55] [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/graph12870639409177693881.txt' '-o' '/tmp/graph12870639409177693881.bin' '-w' '/tmp/graph12870639409177693881.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12870639409177693881.bin' '-l' '-1' '-v' '-w' '/tmp/graph12870639409177693881.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:20:55] [INFO ] Decomposing Gal with order
[2025-06-02 21:20:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:20:55] [INFO ] Removed a total of 787 redundant transitions.
[2025-06-02 21:20:55] [INFO ] Flatten gal took : 41 ms
[2025-06-02 21:20:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 6 ms.
[2025-06-02 21:20:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality15712575469735825498.gal : 6 ms
[2025-06-02 21:20:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality2779737774388078625.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/CTLCardinality15712575469735825498.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2779737774388078625.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 : 489/489 places, 831/831 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 486 transition count 831
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 47 place count 442 transition count 783
Iterating global reduction 1 with 44 rules applied. Total rules applied 91 place count 442 transition count 783
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 92 place count 442 transition count 782
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 104 place count 430 transition count 769
Iterating global reduction 2 with 12 rules applied. Total rules applied 116 place count 430 transition count 769
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 118 place count 430 transition count 767
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 121 place count 427 transition count 764
Iterating global reduction 3 with 3 rules applied. Total rules applied 124 place count 427 transition count 764
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 126 place count 425 transition count 762
Iterating global reduction 3 with 2 rules applied. Total rules applied 128 place count 425 transition count 762
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 130 place count 423 transition count 760
Iterating global reduction 3 with 2 rules applied. Total rules applied 132 place count 423 transition count 760
Applied a total of 132 rules in 83 ms. Remains 423 /489 variables (removed 66) and now considering 760/831 (removed 71) transitions.
// Phase 1: matrix 760 rows 423 cols
[2025-06-02 21:21:25] [INFO ] Computed 10 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:21:26] [INFO ] Implicit Places using invariants in 340 ms returned []
[2025-06-02 21:21:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:21:27] [INFO ] Implicit Places using invariants and state equation in 729 ms returned []
Implicit Place search using SMT with State Equation took 1071 ms to find 0 implicit places.
Running 759 sub problems to find dead transitions.
[2025-06-02 21:21:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 1 (OVERLAPS) 1/423 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 759 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 423/1183 variables, and 10 constraints, problems are : Problem set: 0 solved, 759 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/423 constraints, PredecessorRefiner: 759/759 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 759 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 1 (OVERLAPS) 1/423 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 759 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:22:17] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:22:19] [INFO ] Deduced a trap composed of 88 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:22:20] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:22:20] [INFO ] Deduced a trap composed of 55 places in 309 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:22:21] [INFO ] Deduced a trap composed of 74 places in 405 ms of which 63 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/1183 variables, and 15 constraints, problems are : Problem set: 0 solved, 759 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/423 constraints, PredecessorRefiner: 0/759 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60215ms problems are : Problem set: 0 solved, 759 unsolved
Search for dead transitions found 0 dead transitions in 60220ms
Starting structural reductions in LTL mode, iteration 1 : 423/489 places, 760/831 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61377 ms. Remains : 423/489 places, 760/831 transitions.
[2025-06-02 21:22:27] [INFO ] Flatten gal took : 27 ms
[2025-06-02 21:22:27] [INFO ] Flatten gal took : 32 ms
[2025-06-02 21:22:27] [INFO ] Input system was already deterministic with 760 transitions.
[2025-06-02 21:22:27] [INFO ] Flatten gal took : 29 ms
[2025-06-02 21:22:27] [INFO ] Flatten gal took : 28 ms
[2025-06-02 21:22:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality7106350445017737221.gal : 6 ms
[2025-06-02 21:22:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality9661375385978817838.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/CTLCardinality7106350445017737221.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9661375385978817838.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 21:22:57] [INFO ] Flatten gal took : 17 ms
[2025-06-02 21:22:57] [INFO ] Applying decomposition
[2025-06-02 21:22:57] [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/graph11187315131023956115.txt' '-o' '/tmp/graph11187315131023956115.bin' '-w' '/tmp/graph11187315131023956115.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11187315131023956115.bin' '-l' '-1' '-v' '-w' '/tmp/graph11187315131023956115.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:22:57] [INFO ] Decomposing Gal with order
[2025-06-02 21:22:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:22:57] [INFO ] Removed a total of 855 redundant transitions.
[2025-06-02 21:22:57] [INFO ] Flatten gal took : 36 ms
[2025-06-02 21:22:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 7 ms.
[2025-06-02 21:22:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality13092842918875167936.gal : 6 ms
[2025-06-02 21:22:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality4507034247955976395.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/CTLCardinality13092842918875167936.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4507034247955976395.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 489/489 places, 831/831 transitions.
Graph (trivial) has 385 edges and 489 vertex of which 18 / 489 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 1443 edges and 474 vertex of which 471 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 106 place count 470 transition count 710
Reduce places removed 104 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 109 rules applied. Total rules applied 215 place count 366 transition count 705
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 218 place count 363 transition count 705
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 218 place count 363 transition count 679
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 270 place count 337 transition count 679
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 294 place count 313 transition count 651
Iterating global reduction 3 with 24 rules applied. Total rules applied 318 place count 313 transition count 651
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 320 place count 313 transition count 649
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 320 place count 313 transition count 638
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 342 place count 302 transition count 638
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 347 place count 297 transition count 602
Iterating global reduction 4 with 5 rules applied. Total rules applied 352 place count 297 transition count 602
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 356 place count 297 transition count 598
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 358 place count 295 transition count 598
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 6 with 68 rules applied. Total rules applied 426 place count 261 transition count 564
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 428 place count 259 transition count 532
Iterating global reduction 6 with 2 rules applied. Total rules applied 430 place count 259 transition count 532
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 431 place count 259 transition count 531
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 432 place count 259 transition count 531
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 434 place count 257 transition count 529
Applied a total of 434 rules in 110 ms. Remains 257 /489 variables (removed 232) and now considering 529/831 (removed 302) transitions.
[2025-06-02 21:23:27] [INFO ] Flow matrix only has 524 transitions (discarded 5 similar events)
// Phase 1: matrix 524 rows 257 cols
[2025-06-02 21:23:27] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:23:28] [INFO ] Implicit Places using invariants in 493 ms returned []
[2025-06-02 21:23:28] [INFO ] Flow matrix only has 524 transitions (discarded 5 similar events)
[2025-06-02 21:23:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:23:28] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-06-02 21:23:29] [INFO ] Implicit Places using invariants and state equation in 915 ms returned []
Implicit Place search using SMT with State Equation took 1411 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 21:23:29] [INFO ] Redundant transitions in 7 ms returned []
Running 516 sub problems to find dead transitions.
[2025-06-02 21:23:29] [INFO ] Flow matrix only has 524 transitions (discarded 5 similar events)
[2025-06-02 21:23:29] [INFO ] Invariant cache hit.
[2025-06-02 21:23:29] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 516 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:34] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:34] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:34] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:35] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:35] [INFO ] Deduced a trap composed of 25 places in 325 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:36] [INFO ] Deduced a trap composed of 76 places in 357 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:36] [INFO ] Deduced a trap composed of 34 places in 341 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:38] [INFO ] Deduced a trap composed of 25 places in 273 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:38] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:39] [INFO ] Deduced a trap composed of 86 places in 367 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:41] [INFO ] Deduced a trap composed of 55 places in 296 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:41] [INFO ] Deduced a trap composed of 22 places in 247 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:41] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 8 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 516 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:47] [INFO ] Deduced a trap composed of 22 places in 334 ms of which 29 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 516 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 516 unsolved
SMT process timed out in 30138ms, After SMT, problems are : Problem set: 0 solved, 516 unsolved
Search for dead transitions found 0 dead transitions in 30140ms
Starting structural reductions in SI_CTL mode, iteration 1 : 257/489 places, 529/831 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31675 ms. Remains : 257/489 places, 529/831 transitions.
[2025-06-02 21:23:59] [INFO ] Flatten gal took : 20 ms
[2025-06-02 21:23:59] [INFO ] Flatten gal took : 22 ms
[2025-06-02 21:23:59] [INFO ] Input system was already deterministic with 529 transitions.
[2025-06-02 21:23:59] [INFO ] Flatten gal took : 21 ms
[2025-06-02 21:23:59] [INFO ] Flatten gal took : 20 ms
[2025-06-02 21:23:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality6711122472112848921.gal : 5 ms
[2025-06-02 21:23:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality3277879249197859369.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/CTLCardinality6711122472112848921.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3277879249197859369.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 21:24:29] [INFO ] Flatten gal took : 13 ms
[2025-06-02 21:24:29] [INFO ] Applying decomposition
[2025-06-02 21:24:29] [INFO ] Flatten gal took : 19 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/graph7845310612088763831.txt' '-o' '/tmp/graph7845310612088763831.bin' '-w' '/tmp/graph7845310612088763831.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7845310612088763831.bin' '-l' '-1' '-v' '-w' '/tmp/graph7845310612088763831.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:24:29] [INFO ] Decomposing Gal with order
[2025-06-02 21:24:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:24:29] [INFO ] Removed a total of 651 redundant transitions.
[2025-06-02 21:24:29] [INFO ] Flatten gal took : 23 ms
[2025-06-02 21:24:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 113 labels/synchronizations in 5 ms.
[2025-06-02 21:24:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality11145598164433433319.gal : 4 ms
[2025-06-02 21:24:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality6544839572846999919.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/CTLCardinality11145598164433433319.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6544839572846999919.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 : 489/489 places, 831/831 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 487 transition count 831
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 45 place count 444 transition count 784
Iterating global reduction 1 with 43 rules applied. Total rules applied 88 place count 444 transition count 784
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 89 place count 444 transition count 783
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 104 place count 429 transition count 736
Iterating global reduction 2 with 15 rules applied. Total rules applied 119 place count 429 transition count 736
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 121 place count 429 transition count 734
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 124 place count 426 transition count 731
Iterating global reduction 3 with 3 rules applied. Total rules applied 127 place count 426 transition count 731
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 129 place count 424 transition count 729
Iterating global reduction 3 with 2 rules applied. Total rules applied 131 place count 424 transition count 729
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 133 place count 422 transition count 727
Iterating global reduction 3 with 2 rules applied. Total rules applied 135 place count 422 transition count 727
Applied a total of 135 rules in 33 ms. Remains 422 /489 variables (removed 67) and now considering 727/831 (removed 104) transitions.
// Phase 1: matrix 727 rows 422 cols
[2025-06-02 21:24:59] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:25:00] [INFO ] Implicit Places using invariants in 334 ms returned []
[2025-06-02 21:25:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:25:00] [INFO ] Implicit Places using invariants and state equation in 671 ms returned []
Implicit Place search using SMT with State Equation took 1045 ms to find 0 implicit places.
Running 726 sub problems to find dead transitions.
[2025-06-02 21:25:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 1 (OVERLAPS) 1/421 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 726 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:30] [INFO ] Deduced a trap composed of 86 places in 139 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:31] [INFO ] Deduced a trap composed of 74 places in 138 ms of which 10 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1149 variables, and 12 constraints, problems are : Problem set: 0 solved, 726 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/422 constraints, PredecessorRefiner: 726/726 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 726 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 1 (OVERLAPS) 1/421 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 726 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:45] [INFO ] Deduced a trap composed of 87 places in 131 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:46] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:47] [INFO ] Deduced a trap composed of 55 places in 383 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:47] [INFO ] Deduced a trap composed of 56 places in 383 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:49] [INFO ] Deduced a trap composed of 74 places in 433 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:55] [INFO ] Deduced a trap composed of 73 places in 132 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/421 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 726 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:26:00] [INFO ] Deduced a trap composed of 75 places in 134 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:26:00] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/1149 variables, and 20 constraints, problems are : Problem set: 0 solved, 726 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/422 constraints, PredecessorRefiner: 0/726 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60236ms problems are : Problem set: 0 solved, 726 unsolved
Search for dead transitions found 0 dead transitions in 60238ms
Starting structural reductions in LTL mode, iteration 1 : 422/489 places, 727/831 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61317 ms. Remains : 422/489 places, 727/831 transitions.
[2025-06-02 21:26:01] [INFO ] Flatten gal took : 26 ms
[2025-06-02 21:26:01] [INFO ] Flatten gal took : 27 ms
[2025-06-02 21:26:01] [INFO ] Input system was already deterministic with 727 transitions.
[2025-06-02 21:26:01] [INFO ] Flatten gal took : 27 ms
[2025-06-02 21:26:01] [INFO ] Flatten gal took : 27 ms
[2025-06-02 21:26:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality9371793530356120046.gal : 5 ms
[2025-06-02 21:26:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality15182401144750993785.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/CTLCardinality9371793530356120046.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15182401144750993785.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 21:26:31] [INFO ] Flatten gal took : 16 ms
[2025-06-02 21:26:31] [INFO ] Applying decomposition
[2025-06-02 21:26:31] [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/graph6240216674193498865.txt' '-o' '/tmp/graph6240216674193498865.bin' '-w' '/tmp/graph6240216674193498865.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6240216674193498865.bin' '-l' '-1' '-v' '-w' '/tmp/graph6240216674193498865.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:26:31] [INFO ] Decomposing Gal with order
[2025-06-02 21:26:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:26:31] [INFO ] Removed a total of 778 redundant transitions.
[2025-06-02 21:26:31] [INFO ] Flatten gal took : 31 ms
[2025-06-02 21:26:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 5 ms.
[2025-06-02 21:26:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality419562706585400084.gal : 5 ms
[2025-06-02 21:26:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality14198187485473128949.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/CTLCardinality419562706585400084.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14198187485473128949.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 : 489/489 places, 831/831 transitions.
Graph (trivial) has 382 edges and 489 vertex of which 18 / 489 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 1443 edges and 474 vertex of which 471 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 104 place count 470 transition count 712
Reduce places removed 102 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 107 rules applied. Total rules applied 211 place count 368 transition count 707
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 214 place count 365 transition count 707
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 214 place count 365 transition count 681
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 266 place count 339 transition count 681
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 291 place count 314 transition count 652
Iterating global reduction 3 with 25 rules applied. Total rules applied 316 place count 314 transition count 652
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 318 place count 314 transition count 650
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 318 place count 314 transition count 639
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 340 place count 303 transition count 639
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 346 place count 297 transition count 602
Iterating global reduction 4 with 6 rules applied. Total rules applied 352 place count 297 transition count 602
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 356 place count 297 transition count 598
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 358 place count 295 transition count 598
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 6 with 68 rules applied. Total rules applied 426 place count 261 transition count 564
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 428 place count 259 transition count 532
Iterating global reduction 6 with 2 rules applied. Total rules applied 430 place count 259 transition count 532
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 431 place count 259 transition count 531
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 433 place count 257 transition count 529
Applied a total of 433 rules in 76 ms. Remains 257 /489 variables (removed 232) and now considering 529/831 (removed 302) transitions.
[2025-06-02 21:27:01] [INFO ] Flow matrix only has 524 transitions (discarded 5 similar events)
// Phase 1: matrix 524 rows 257 cols
[2025-06-02 21:27:01] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:27:02] [INFO ] Implicit Places using invariants in 385 ms returned []
[2025-06-02 21:27:02] [INFO ] Flow matrix only has 524 transitions (discarded 5 similar events)
[2025-06-02 21:27:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:27:02] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-06-02 21:27:03] [INFO ] Implicit Places using invariants and state equation in 966 ms returned []
Implicit Place search using SMT with State Equation took 1357 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 21:27:03] [INFO ] Redundant transitions in 6 ms returned []
Running 515 sub problems to find dead transitions.
[2025-06-02 21:27:03] [INFO ] Flow matrix only has 524 transitions (discarded 5 similar events)
[2025-06-02 21:27:03] [INFO ] Invariant cache hit.
[2025-06-02 21:27:03] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:27:08] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:27:08] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:27:08] [INFO ] Deduced a trap composed of 25 places in 302 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:27:09] [INFO ] Deduced a trap composed of 25 places in 272 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:27:09] [INFO ] Deduced a trap composed of 76 places in 318 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:27:09] [INFO ] Deduced a trap composed of 34 places in 298 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:27:11] [INFO ] Deduced a trap composed of 25 places in 252 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:27:13] [INFO ] Deduced a trap composed of 55 places in 213 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:27:13] [INFO ] Deduced a trap composed of 22 places in 285 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:27:13] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (OVERLAPS) 1/254 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:27:28] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:27:28] [INFO ] Deduced a trap composed of 53 places in 103 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 254/781 variables, and 22 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/257 constraints, ReadFeed: 0/33 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 515 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (OVERLAPS) 1/254 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 5 (OVERLAPS) 523/777 variables, 254/276 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/777 variables, 33/309 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/777 variables, 515/824 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 777/781 variables, and 824 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 254/257 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60157ms problems are : Problem set: 0 solved, 515 unsolved
Search for dead transitions found 0 dead transitions in 60158ms
Starting structural reductions in SI_CTL mode, iteration 1 : 257/489 places, 529/831 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61604 ms. Remains : 257/489 places, 529/831 transitions.
[2025-06-02 21:28:03] [INFO ] Flatten gal took : 18 ms
[2025-06-02 21:28:03] [INFO ] Flatten gal took : 21 ms
[2025-06-02 21:28:03] [INFO ] Input system was already deterministic with 529 transitions.
[2025-06-02 21:28:03] [INFO ] Flatten gal took : 19 ms
[2025-06-02 21:28:03] [INFO ] Flatten gal took : 19 ms
[2025-06-02 21:28:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality13197304819211239213.gal : 3 ms
[2025-06-02 21:28:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality9386183281312579864.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/CTLCardinality13197304819211239213.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9386183281312579864.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 21:28:33] [INFO ] Flatten gal took : 11 ms
[2025-06-02 21:28:33] [INFO ] Applying decomposition
[2025-06-02 21:28:33] [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/graph11847626433861028753.txt' '-o' '/tmp/graph11847626433861028753.bin' '-w' '/tmp/graph11847626433861028753.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11847626433861028753.bin' '-l' '-1' '-v' '-w' '/tmp/graph11847626433861028753.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:28:33] [INFO ] Decomposing Gal with order
[2025-06-02 21:28:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:28:33] [INFO ] Removed a total of 652 redundant transitions.
[2025-06-02 21:28:33] [INFO ] Flatten gal took : 37 ms
[2025-06-02 21:28:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 119 labels/synchronizations in 22 ms.
[2025-06-02 21:28:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality3589331546597707664.gal : 13 ms
[2025-06-02 21:28:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality10249680918426645115.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/CTLCardinality3589331546597707664.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10249680918426645115.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 : 489/489 places, 831/831 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 487 transition count 831
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 41 place count 448 transition count 790
Iterating global reduction 1 with 39 rules applied. Total rules applied 80 place count 448 transition count 790
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 81 place count 448 transition count 789
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 92 place count 437 transition count 748
Iterating global reduction 2 with 11 rules applied. Total rules applied 103 place count 437 transition count 748
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 105 place count 437 transition count 746
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 107 place count 435 transition count 744
Iterating global reduction 3 with 2 rules applied. Total rules applied 109 place count 435 transition count 744
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 110 place count 434 transition count 743
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 434 transition count 743
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 433 transition count 742
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 433 transition count 742
Applied a total of 113 rules in 47 ms. Remains 433 /489 variables (removed 56) and now considering 742/831 (removed 89) transitions.
// Phase 1: matrix 742 rows 433 cols
[2025-06-02 21:29:03] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:29:04] [INFO ] Implicit Places using invariants in 379 ms returned []
[2025-06-02 21:29:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:29:04] [INFO ] Implicit Places using invariants and state equation in 650 ms returned []
Implicit Place search using SMT with State Equation took 1038 ms to find 0 implicit places.
Running 741 sub problems to find dead transitions.
[2025-06-02 21:29:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 1 (OVERLAPS) 1/432 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 741 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:29:30] [INFO ] Deduced a trap composed of 75 places in 141 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:29:31] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:29:32] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:29:33] [INFO ] Deduced a trap composed of 90 places in 141 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:29:34] [INFO ] Deduced a trap composed of 87 places in 135 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 432/1175 variables, and 15 constraints, problems are : Problem set: 0 solved, 741 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/433 constraints, PredecessorRefiner: 741/741 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 741 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 1 (OVERLAPS) 1/432 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/432 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 741 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:29:46] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:29:51] [INFO ] Deduced a trap composed of 54 places in 367 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:29:52] [INFO ] Deduced a trap composed of 73 places in 442 ms of which 73 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/432 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 741 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:30:03] [INFO ] Deduced a trap composed of 77 places in 139 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:30:03] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:30:05] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 432/1175 variables, and 21 constraints, problems are : Problem set: 0 solved, 741 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/433 constraints, PredecessorRefiner: 0/741 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60213ms problems are : Problem set: 0 solved, 741 unsolved
Search for dead transitions found 0 dead transitions in 60215ms
Starting structural reductions in LTL mode, iteration 1 : 433/489 places, 742/831 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61302 ms. Remains : 433/489 places, 742/831 transitions.
[2025-06-02 21:30:05] [INFO ] Flatten gal took : 26 ms
[2025-06-02 21:30:05] [INFO ] Flatten gal took : 28 ms
[2025-06-02 21:30:05] [INFO ] Input system was already deterministic with 742 transitions.
[2025-06-02 21:30:05] [INFO ] Flatten gal took : 28 ms
[2025-06-02 21:30:05] [INFO ] Flatten gal took : 28 ms
[2025-06-02 21:30:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality16057980577541948700.gal : 5 ms
[2025-06-02 21:30:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality14618361406776158307.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/CTLCardinality16057980577541948700.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14618361406776158307.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 21:30:35] [INFO ] Flatten gal took : 16 ms
[2025-06-02 21:30:35] [INFO ] Applying decomposition
[2025-06-02 21:30:35] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1245661907543561417.txt' '-o' '/tmp/graph1245661907543561417.bin' '-w' '/tmp/graph1245661907543561417.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1245661907543561417.bin' '-l' '-1' '-v' '-w' '/tmp/graph1245661907543561417.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:30:35] [INFO ] Decomposing Gal with order
[2025-06-02 21:30:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:30:35] [INFO ] Removed a total of 794 redundant transitions.
[2025-06-02 21:30:35] [INFO ] Flatten gal took : 33 ms
[2025-06-02 21:30:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 4 ms.
[2025-06-02 21:30:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality8294480204125279137.gal : 5 ms
[2025-06-02 21:30:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality5142809654296143434.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/CTLCardinality8294480204125279137.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5142809654296143434.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 : 489/489 places, 831/831 transitions.
Graph (trivial) has 382 edges and 489 vertex of which 18 / 489 are part of one of the 3 SCC in 2 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 1443 edges and 474 vertex of which 471 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 104 place count 470 transition count 712
Reduce places removed 102 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 107 rules applied. Total rules applied 211 place count 368 transition count 707
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 215 place count 365 transition count 706
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 216 place count 364 transition count 706
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 25 Pre rules applied. Total rules applied 216 place count 364 transition count 681
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 266 place count 339 transition count 681
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 292 place count 313 transition count 651
Iterating global reduction 4 with 26 rules applied. Total rules applied 318 place count 313 transition count 651
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 320 place count 313 transition count 649
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 320 place count 313 transition count 637
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 344 place count 301 transition count 637
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 350 place count 295 transition count 600
Iterating global reduction 5 with 6 rules applied. Total rules applied 356 place count 295 transition count 600
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 360 place count 295 transition count 596
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 362 place count 293 transition count 596
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 7 with 66 rules applied. Total rules applied 428 place count 260 transition count 563
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 430 place count 258 transition count 531
Iterating global reduction 7 with 2 rules applied. Total rules applied 432 place count 258 transition count 531
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 433 place count 258 transition count 530
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 435 place count 256 transition count 528
Applied a total of 435 rules in 92 ms. Remains 256 /489 variables (removed 233) and now considering 528/831 (removed 303) transitions.
[2025-06-02 21:31:05] [INFO ] Flow matrix only has 523 transitions (discarded 5 similar events)
// Phase 1: matrix 523 rows 256 cols
[2025-06-02 21:31:05] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:31:06] [INFO ] Implicit Places using invariants in 451 ms returned []
[2025-06-02 21:31:06] [INFO ] Flow matrix only has 523 transitions (discarded 5 similar events)
[2025-06-02 21:31:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:31:06] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-06-02 21:31:06] [INFO ] Implicit Places using invariants and state equation in 659 ms returned []
Implicit Place search using SMT with State Equation took 1112 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 21:31:06] [INFO ] Redundant transitions in 5 ms returned []
Running 515 sub problems to find dead transitions.
[2025-06-02 21:31:06] [INFO ] Flow matrix only has 523 transitions (discarded 5 similar events)
[2025-06-02 21:31:06] [INFO ] Invariant cache hit.
[2025-06-02 21:31:06] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:31:11] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:31:12] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:31:12] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:31:13] [INFO ] Deduced a trap composed of 26 places in 343 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:31:13] [INFO ] Deduced a trap composed of 78 places in 212 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:31:13] [INFO ] Deduced a trap composed of 35 places in 324 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:31:15] [INFO ] Deduced a trap composed of 26 places in 255 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:31:16] [INFO ] Deduced a trap composed of 26 places in 284 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:31:16] [INFO ] Deduced a trap composed of 83 places in 312 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:31:17] [INFO ] Deduced a trap composed of 56 places in 299 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:31:18] [INFO ] Deduced a trap composed of 23 places in 326 ms of which 31 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:31:24] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 515 unsolved
SMT process timed out in 30150ms, After SMT, problems are : Problem set: 0 solved, 515 unsolved
Search for dead transitions found 0 dead transitions in 30152ms
Starting structural reductions in SI_CTL mode, iteration 1 : 256/489 places, 528/831 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31369 ms. Remains : 256/489 places, 528/831 transitions.
[2025-06-02 21:31:36] [INFO ] Flatten gal took : 19 ms
[2025-06-02 21:31:37] [INFO ] Flatten gal took : 20 ms
[2025-06-02 21:31:37] [INFO ] Input system was already deterministic with 528 transitions.
[2025-06-02 21:31:37] [INFO ] Flatten gal took : 21 ms
[2025-06-02 21:31:37] [INFO ] Flatten gal took : 22 ms
[2025-06-02 21:31:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality6725031637703710455.gal : 4 ms
[2025-06-02 21:31:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality6233161831173465552.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/CTLCardinality6725031637703710455.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6233161831173465552.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 21:32:07] [INFO ] Flatten gal took : 12 ms
[2025-06-02 21:32:07] [INFO ] Applying decomposition
[2025-06-02 21:32:07] [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/graph16510560444538992952.txt' '-o' '/tmp/graph16510560444538992952.bin' '-w' '/tmp/graph16510560444538992952.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16510560444538992952.bin' '-l' '-1' '-v' '-w' '/tmp/graph16510560444538992952.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:32:07] [INFO ] Decomposing Gal with order
[2025-06-02 21:32:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:32:07] [INFO ] Removed a total of 649 redundant transitions.
[2025-06-02 21:32:07] [INFO ] Flatten gal took : 21 ms
[2025-06-02 21:32:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 126 labels/synchronizations in 6 ms.
[2025-06-02 21:32:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality4962534217311437163.gal : 3 ms
[2025-06-02 21:32:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality9909478572183393008.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/CTLCardinality4962534217311437163.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9909478572183393008.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.
[2025-06-02 21:32:37] [INFO ] Flatten gal took : 19 ms
[2025-06-02 21:32:37] [INFO ] Flatten gal took : 18 ms
[2025-06-02 21:32:37] [INFO ] Applying decomposition
[2025-06-02 21:32:37] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15404148788608145998.txt' '-o' '/tmp/graph15404148788608145998.bin' '-w' '/tmp/graph15404148788608145998.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15404148788608145998.bin' '-l' '-1' '-v' '-w' '/tmp/graph15404148788608145998.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:32:37] [INFO ] Decomposing Gal with order
[2025-06-02 21:32:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:32:37] [INFO ] Removed a total of 797 redundant transitions.
[2025-06-02 21:32:37] [INFO ] Flatten gal took : 42 ms
[2025-06-02 21:32:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 9 ms.
[2025-06-02 21:32:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality7058430889303216540.gal : 7 ms
[2025-06-02 21:32:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality16497249216078211252.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/CTLCardinality7058430889303216540.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16497249216078211252.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 12 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 22:00:49] [INFO ] Applying decomposition
[2025-06-02 22:00:49] [INFO ] Flatten gal took : 680 ms
[2025-06-02 22:00:50] [INFO ] Decomposing Gal with order
[2025-06-02 22:00:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 22:00:51] [INFO ] Removed a total of 654 redundant transitions.
[2025-06-02 22:00:51] [INFO ] Flatten gal took : 716 ms
[2025-06-02 22:00:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 591 labels/synchronizations in 268 ms.
[2025-06-02 22:00:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality6038884426540060245.gal : 110 ms
[2025-06-02 22:00:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality7826568260897198708.ctl : 35 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/CTLCardinality6038884426540060245.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7826568260897198708.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 12 CTL formulae.

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-19"
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-19, 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-174860102400385"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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