Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r338-smll-178021499300433.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is FileSystem-PT-N03I10B08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499300433
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 8.2K May 27 10:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 27 10:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 27 10:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 27 10:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 33K May 27 10:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 118K May 27 10:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 27 10:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 16K May 27 10:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K May 27 10:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 27 10:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K May 27 10:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.8K May 27 10:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 14K May 27 10:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 10 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 191K Jun 10 11:57 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 FileSystem-PT-N03I10B08-CTLCardinality-2024-00
FORMULA_NAME FileSystem-PT-N03I10B08-CTLCardinality-2024-01
FORMULA_NAME FileSystem-PT-N03I10B08-CTLCardinality-2024-02
FORMULA_NAME FileSystem-PT-N03I10B08-CTLCardinality-2024-03
FORMULA_NAME FileSystem-PT-N03I10B08-CTLCardinality-2024-04
FORMULA_NAME FileSystem-PT-N03I10B08-CTLCardinality-2024-05
FORMULA_NAME FileSystem-PT-N03I10B08-CTLCardinality-2024-06
FORMULA_NAME FileSystem-PT-N03I10B08-CTLCardinality-2024-07
FORMULA_NAME FileSystem-PT-N03I10B08-CTLCardinality-2024-08
FORMULA_NAME FileSystem-PT-N03I10B08-CTLCardinality-2024-09
FORMULA_NAME FileSystem-PT-N03I10B08-CTLCardinality-2024-10
FORMULA_NAME FileSystem-PT-N03I10B08-CTLCardinality-2024-11
FORMULA_NAME FileSystem-PT-N03I10B08-CTLCardinality-2024-12
FORMULA_NAME FileSystem-PT-N03I10B08-CTLCardinality-2024-13
FORMULA_NAME FileSystem-PT-N03I10B08-CTLCardinality-2024-14
FORMULA_NAME FileSystem-PT-N03I10B08-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1781104832971

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FileSystem-PT-N03I10B08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-06-10 15:20:35] [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]
[2026-06-10 15:20:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-10 15:20:35] [INFO ] Load time of PNML (sax parser for PT used): 221 ms
[2026-06-10 15:20:35] [INFO ] Transformed 455 places.
[2026-06-10 15:20:35] [INFO ] Transformed 420 transitions.
[2026-06-10 15:20:35] [INFO ] Parsed PT model containing 455 places and 420 transitions and 1490 arcs in 449 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 33 ms.
Reduce places removed 10 places and 0 transitions.
Support contains 119 out of 445 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 420/420 transitions.
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 377 transition count 420
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 106 place count 339 transition count 382
Iterating global reduction 1 with 38 rules applied. Total rules applied 144 place count 339 transition count 382
Applied a total of 144 rules in 139 ms. Remains 339 /445 variables (removed 106) and now considering 382/420 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11343895475891692976.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7922759990910320839.kers'
[2026-06-10 15:20:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11343895475891692976.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7922759990910320839.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 382 rows 331 cols 1068 entries
Finished phase 1 with 321 SingleSign rule and 0 generalized
[2026-06-10 15:20:36] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-7922759990910320839.kers
Total runtime 7 ms.
[2026-06-10 15:20:36] [INFO ] Implicit Places using invariants in 910 ms returned []
[2026-06-10 15:20:36] [INFO ] Invariant cache hit.
[2026-06-10 15:20:37] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 15:20:38] [INFO ] Implicit Places using invariants and state equation in 1611 ms returned []
Implicit Place search using SMT with State Equation took 2603 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2026-06-10 15:20:38] [INFO ] Invariant cache hit.
[2026-06-10 15:20:38] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 11/327 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/327 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 372 unsolved
SMT process timed out in 30423ms, After SMT, problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 30457ms
Starting structural reductions in LTL mode, iteration 1 : 339/445 places, 382/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33297 ms. Remains : 339/445 places, 382/420 transitions.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 382/382 transitions.
Applied a total of 0 rules in 13 ms. Remains 339 /339 variables (removed 0) and now considering 382/382 (removed 0) transitions.
[2026-06-10 15:21:09] [INFO ] Invariant cache hit.
[2026-06-10 15:21:09] [INFO ] Implicit Places using invariants in 520 ms returned []
[2026-06-10 15:21:09] [INFO ] Invariant cache hit.
[2026-06-10 15:21:09] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 15:21:10] [INFO ] Implicit Places using invariants and state equation in 1337 ms returned []
Implicit Place search using SMT with State Equation took 1860 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1873 ms. Remains : 339/339 places, 382/382 transitions.
Support contains 119 out of 339 places after structural reductions.
[2026-06-10 15:21:11] [INFO ] Flatten gal took : 90 ms
[2026-06-10 15:21:11] [INFO ] Flatten gal took : 43 ms
[2026-06-10 15:21:11] [INFO ] Input system was already deterministic with 382 transitions.
RANDOM walk for 40000 steps (8 resets) in 2054 ms. (19 steps per ms) remains 55/83 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 54/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 53/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 52/53 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 92 ms. (43 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 51/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 50/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 49/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 49/49 properties
[2026-06-10 15:21:12] [INFO ] Invariant cache hit.
[2026-06-10 15:21:12] [INFO ] State equation strengthened by 80 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 49 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp82 is UNSAT
At refinement iteration 1 (OVERLAPS) 258/329 variables, 11/11 constraints. Problems are: Problem set: 31 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/329 variables, 0/11 constraints. Problems are: Problem set: 31 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 7/336 variables, 7/18 constraints. Problems are: Problem set: 31 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 0/18 constraints. Problems are: Problem set: 31 solved, 18 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp80 is UNSAT
At refinement iteration 5 (OVERLAPS) 382/718 variables, 336/354 constraints. Problems are: Problem set: 42 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/718 variables, 80/434 constraints. Problems are: Problem set: 42 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/718 variables, 0/434 constraints. Problems are: Problem set: 42 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 3/721 variables, 3/437 constraints. Problems are: Problem set: 42 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/721 variables, 0/437 constraints. Problems are: Problem set: 42 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/721 variables, 0/437 constraints. Problems are: Problem set: 42 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 721/721 variables, and 437 constraints, problems are : Problem set: 42 solved, 7 unsolved in 2412 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 339/339 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 42 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 42 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 301/319 variables, 8/8 constraints. Problems are: Problem set: 42 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 13/21 constraints. Problems are: Problem set: 42 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 0/21 constraints. Problems are: Problem set: 42 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 10/329 variables, 10/31 constraints. Problems are: Problem set: 42 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 0/31 constraints. Problems are: Problem set: 42 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 382/711 variables, 329/360 constraints. Problems are: Problem set: 42 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/711 variables, 80/440 constraints. Problems are: Problem set: 42 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/711 variables, 6/446 constraints. Problems are: Problem set: 42 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 711/721 variables, and 446 constraints, problems are : Problem set: 42 solved, 7 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 329/339 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 6/49 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7460ms problems are : Problem set: 42 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 339 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 339/339 places, 382/382 transitions.
Graph (complete) has 816 edges and 339 vertex of which 329 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 329 transition count 372
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 319 transition count 372
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 48 place count 292 transition count 345
Iterating global reduction 2 with 27 rules applied. Total rules applied 75 place count 292 transition count 345
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 237 place count 211 transition count 264
Free-agglomeration rule (complex) applied 73 times.
Iterating global reduction 2 with 73 rules applied. Total rules applied 310 place count 211 transition count 191
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 2 with 73 rules applied. Total rules applied 383 place count 138 transition count 191
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 384 place count 138 transition count 191
Applied a total of 384 rules in 109 ms. Remains 138 /339 variables (removed 201) and now considering 191/382 (removed 191) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 138/339 places, 191/382 transitions.
RANDOM walk for 40000 steps (8 resets) in 560 ms. (71 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 376 ms. (106 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 145 ms. (273 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 147 ms. (270 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 109 ms. (363 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-640563508947198705.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3147993467444880759.kers'
[2026-06-10 15:21:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-640563508947198705.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3147993467444880759.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 191 rows 128 cols 517 entries
Finished phase 1 with 118 SingleSign rule and 2 generalized
[2026-06-10 15:21:20] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3147993467444880759.kers
Total runtime 2 ms.
[2026-06-10 15:21:20] [INFO ] State equation strengthened by 80 read => feed constraints.
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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 109/123 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 13/136 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 191/327 variables, 136/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 80/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/327 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/329 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/329 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/329 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 236 constraints, problems are : Problem set: 0 solved, 3 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 138/138 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 109/123 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 13/136 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 191/327 variables, 136/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/327 variables, 80/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/327 variables, 3/246 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/327 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/329 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/329 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/329 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 329/329 variables, and 248 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1943 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 138/138 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2224ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 1 properties in 263 ms.
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 191/191 transitions.
Graph (complete) has 521 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 135 transition count 190
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 135 transition count 190
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 21 place count 126 transition count 181
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 27 place count 126 transition count 176
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 36 place count 117 transition count 176
Applied a total of 36 rules in 52 ms. Remains 117 /138 variables (removed 21) and now considering 176/191 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 117/138 places, 176/191 transitions.
RANDOM walk for 40000 steps (8 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 519579 steps, run visited all 2 properties in 1419 ms. (steps per millisecond=366 )
Probabilistic random walk after 519579 steps, saw 110673 distinct states, run finished after 1425 ms. (steps per millisecond=364 ) properties seen :2
Successfully simplified 42 atomic propositions for a total of 16 simplifications.
FORMULA FileSystem-PT-N03I10B08-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B08-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 15:21:24] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2026-06-10 15:21:24] [INFO ] Flatten gal took : 31 ms
[2026-06-10 15:21:24] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA FileSystem-PT-N03I10B08-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B08-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B08-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B08-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 15:21:24] [INFO ] Flatten gal took : 36 ms
[2026-06-10 15:21:25] [INFO ] Input system was already deterministic with 382 transitions.
Support contains 41 out of 339 places (down from 59) after GAL structural reductions.
Computed a total of 91 stabilizing places and 142 stable transitions
Graph (complete) has 824 edges and 339 vertex of which 327 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 382/382 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 327 transition count 382
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 46 place count 293 transition count 348
Iterating global reduction 1 with 34 rules applied. Total rules applied 80 place count 293 transition count 348
Applied a total of 80 rules in 16 ms. Remains 293 /339 variables (removed 46) and now considering 348/382 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1234276406069108771.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7719322666103440810.kers'
[2026-06-10 15:21:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1234276406069108771.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7719322666103440810.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 348 rows 285 cols 954 entries
Finished phase 1 with 275 SingleSign rule and 0 generalized
[2026-06-10 15:21:25] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7719322666103440810.kers
Total runtime 4 ms.
[2026-06-10 15:21:25] [INFO ] Implicit Places using invariants in 724 ms returned []
[2026-06-10 15:21:25] [INFO ] Invariant cache hit.
[2026-06-10 15:21:26] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 15:21:27] [INFO ] Implicit Places using invariants and state equation in 1442 ms returned []
Implicit Place search using SMT with State Equation took 2169 ms to find 0 implicit places.
Running 338 sub problems to find dead transitions.
[2026-06-10 15:21:27] [INFO ] Invariant cache hit.
[2026-06-10 15:21:27] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (OVERLAPS) 11/293 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 293/641 variables, and 51 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/293 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 338 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (OVERLAPS) 11/293 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 26/51 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 293/641 variables, and 70 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/293 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 0/338 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60207ms problems are : Problem set: 0 solved, 338 unsolved
Search for dead transitions found 0 dead transitions in 60211ms
Starting structural reductions in LTL mode, iteration 1 : 293/339 places, 348/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62401 ms. Remains : 293/339 places, 348/382 transitions.
[2026-06-10 15:22:27] [INFO ] Flatten gal took : 34 ms
[2026-06-10 15:22:27] [INFO ] Flatten gal took : 32 ms
[2026-06-10 15:22:27] [INFO ] Input system was already deterministic with 348 transitions.
[2026-06-10 15:22:27] [INFO ] Flatten gal took : 29 ms
[2026-06-10 15:22:27] [INFO ] Flatten gal took : 29 ms
[2026-06-10 15:22:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality561967617306317085.gal : 21 ms
[2026-06-10 15:22:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality13632398547005549376.ctl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality561967617306317085.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13632398547005549376.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.5572e+06,5.35409,122824,2,47382,5,350851,6,0,1489,521955,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-06-10 15:22:57] [INFO ] Flatten gal took : 16 ms
[2026-06-10 15:22:57] [INFO ] Applying decomposition
[2026-06-10 15:22:57] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2725590484919238458.txt' '-o' '/tmp/graph2725590484919238458.bin' '-w' '/tmp/graph2725590484919238458.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2725590484919238458.bin' '-l' '-1' '-v' '-w' '/tmp/graph2725590484919238458.weights' '-q' '0' '-e' '0.001'
[2026-06-10 15:22:58] [INFO ] Decomposing Gal with order
[2026-06-10 15:22:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 15:22:58] [INFO ] Removed a total of 340 redundant transitions.
[2026-06-10 15:22:58] [INFO ] Flatten gal took : 156 ms
[2026-06-10 15:22:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 29 ms.
[2026-06-10 15:22:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality15650866716985380481.gal : 21 ms
[2026-06-10 15:22:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality10746423735120714675.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15650866716985380481.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10746423735120714675.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.5572e+06,13.397,314116,2,140240,5,966954,6,0,1503,1.03749e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 382/382 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 327 transition count 382
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 45 place count 294 transition count 349
Iterating global reduction 1 with 33 rules applied. Total rules applied 78 place count 294 transition count 349
Applied a total of 78 rules in 18 ms. Remains 294 /339 variables (removed 45) and now considering 349/382 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4245165403180168202.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4490397012827930027.kers'
[2026-06-10 15:23:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4245165403180168202.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4490397012827930027.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 349 rows 286 cols 957 entries
Finished phase 1 with 276 SingleSign rule and 0 generalized
[2026-06-10 15:23:28] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4490397012827930027.kers
Total runtime 4 ms.
[2026-06-10 15:23:29] [INFO ] Implicit Places using invariants in 471 ms returned []
[2026-06-10 15:23:29] [INFO ] Invariant cache hit.
[2026-06-10 15:23:29] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 15:23:30] [INFO ] Implicit Places using invariants and state equation in 1113 ms returned []
Implicit Place search using SMT with State Equation took 1591 ms to find 0 implicit places.
Running 339 sub problems to find dead transitions.
[2026-06-10 15:23:30] [INFO ] Invariant cache hit.
[2026-06-10 15:23:30] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (OVERLAPS) 11/294 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 294/643 variables, and 50 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/294 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 339 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (OVERLAPS) 11/294 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 25/50 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 339 unsolved
SMT process timed out in 60106ms, After SMT, problems are : Problem set: 0 solved, 339 unsolved
Search for dead transitions found 0 dead transitions in 60109ms
Starting structural reductions in LTL mode, iteration 1 : 294/339 places, 349/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61720 ms. Remains : 294/339 places, 349/382 transitions.
[2026-06-10 15:24:30] [INFO ] Flatten gal took : 30 ms
[2026-06-10 15:24:30] [INFO ] Flatten gal took : 31 ms
[2026-06-10 15:24:30] [INFO ] Input system was already deterministic with 349 transitions.
[2026-06-10 15:24:30] [INFO ] Flatten gal took : 26 ms
[2026-06-10 15:24:30] [INFO ] Flatten gal took : 25 ms
[2026-06-10 15:24:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality10900127761470468491.gal : 6 ms
[2026-06-10 15:24:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality2241892683429875093.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10900127761470468491.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2241892683429875093.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.5573e+06,5.89469,125240,2,49739,5,359690,6,0,1494,523679,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-06-10 15:25:00] [INFO ] Flatten gal took : 25 ms
[2026-06-10 15:25:00] [INFO ] Applying decomposition
[2026-06-10 15:25:00] [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.202604301425/bin/convert-linux64' '-i' '/tmp/graph5090100234273815199.txt' '-o' '/tmp/graph5090100234273815199.bin' '-w' '/tmp/graph5090100234273815199.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5090100234273815199.bin' '-l' '-1' '-v' '-w' '/tmp/graph5090100234273815199.weights' '-q' '0' '-e' '0.001'
[2026-06-10 15:25:00] [INFO ] Decomposing Gal with order
[2026-06-10 15:25:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 15:25:00] [INFO ] Removed a total of 343 redundant transitions.
[2026-06-10 15:25:00] [INFO ] Flatten gal took : 60 ms
[2026-06-10 15:25:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 25 ms.
[2026-06-10 15:25:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality14487045977656049983.gal : 9 ms
[2026-06-10 15:25:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality3027413549198517666.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14487045977656049983.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3027413549198517666.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.5573e+06,11.01,223800,2,98570,5,686658,6,0,1508,870931,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 382/382 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 327 transition count 382
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 44 place count 295 transition count 350
Iterating global reduction 1 with 32 rules applied. Total rules applied 76 place count 295 transition count 350
Applied a total of 76 rules in 13 ms. Remains 295 /339 variables (removed 44) and now considering 350/382 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8737440215678690761.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9224546512234864954.kers'
[2026-06-10 15:25:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8737440215678690761.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9224546512234864954.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 350 rows 287 cols 960 entries
Finished phase 1 with 277 SingleSign rule and 0 generalized
[2026-06-10 15:25:31] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9224546512234864954.kers
Total runtime 4 ms.
[2026-06-10 15:25:31] [INFO ] Implicit Places using invariants in 752 ms returned []
[2026-06-10 15:25:31] [INFO ] Invariant cache hit.
[2026-06-10 15:25:32] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 15:25:33] [INFO ] Implicit Places using invariants and state equation in 1455 ms returned []
Implicit Place search using SMT with State Equation took 2210 ms to find 0 implicit places.
Running 340 sub problems to find dead transitions.
[2026-06-10 15:25:33] [INFO ] Invariant cache hit.
[2026-06-10 15:25:33] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/284 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (OVERLAPS) 11/295 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 340 unsolved
SMT process timed out in 30132ms, After SMT, problems are : Problem set: 0 solved, 340 unsolved
Search for dead transitions found 0 dead transitions in 30134ms
Starting structural reductions in LTL mode, iteration 1 : 295/339 places, 350/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32358 ms. Remains : 295/339 places, 350/382 transitions.
[2026-06-10 15:26:03] [INFO ] Flatten gal took : 11 ms
[2026-06-10 15:26:03] [INFO ] Flatten gal took : 11 ms
[2026-06-10 15:26:03] [INFO ] Input system was already deterministic with 350 transitions.
[2026-06-10 15:26:03] [INFO ] Flatten gal took : 11 ms
[2026-06-10 15:26:03] [INFO ] Flatten gal took : 10 ms
[2026-06-10 15:26:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality7142607960826653051.gal : 3 ms
[2026-06-10 15:26:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality13265594966214278301.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7142607960826653051.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13265594966214278301.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.56123e+06,5.67476,129444,2,48727,5,372821,6,0,1499,569807,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-06-10 15:26:33] [INFO ] Flatten gal took : 12 ms
[2026-06-10 15:26:33] [INFO ] Applying decomposition
[2026-06-10 15:26:33] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph13972699588456916597.txt' '-o' '/tmp/graph13972699588456916597.bin' '-w' '/tmp/graph13972699588456916597.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13972699588456916597.bin' '-l' '-1' '-v' '-w' '/tmp/graph13972699588456916597.weights' '-q' '0' '-e' '0.001'
[2026-06-10 15:26:33] [INFO ] Decomposing Gal with order
[2026-06-10 15:26:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 15:26:33] [INFO ] Removed a total of 345 redundant transitions.
[2026-06-10 15:26:33] [INFO ] Flatten gal took : 30 ms
[2026-06-10 15:26:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 23 ms.
[2026-06-10 15:26:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality13628790480009192235.gal : 5 ms
[2026-06-10 15:26:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality3058577838589051471.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13628790480009192235.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3058577838589051471.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.56123e+06,15.9157,364264,2,166067,5,1.23239e+06,6,0,1519,1.23659e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 382/382 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 327 transition count 382
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 44 place count 295 transition count 350
Iterating global reduction 1 with 32 rules applied. Total rules applied 76 place count 295 transition count 350
Applied a total of 76 rules in 8 ms. Remains 295 /339 variables (removed 44) and now considering 350/382 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3821973391436781813.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10323033371674786228.kers'
[2026-06-10 15:27:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3821973391436781813.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10323033371674786228.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 350 rows 287 cols 960 entries
Finished phase 1 with 277 SingleSign rule and 0 generalized
[2026-06-10 15:27:03] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10323033371674786228.kers
Total runtime 3 ms.
[2026-06-10 15:27:04] [INFO ] Implicit Places using invariants in 1064 ms returned []
[2026-06-10 15:27:04] [INFO ] Invariant cache hit.
[2026-06-10 15:27:05] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 15:27:06] [INFO ] Implicit Places using invariants and state equation in 1797 ms returned []
Implicit Place search using SMT with State Equation took 2867 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 295/339 places, 350/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2876 ms. Remains : 295/339 places, 350/382 transitions.
[2026-06-10 15:27:06] [INFO ] Flatten gal took : 17 ms
[2026-06-10 15:27:06] [INFO ] Flatten gal took : 15 ms
[2026-06-10 15:27:06] [INFO ] Input system was already deterministic with 350 transitions.
[2026-06-10 15:27:06] [INFO ] Flatten gal took : 15 ms
[2026-06-10 15:27:06] [INFO ] Flatten gal took : 15 ms
[2026-06-10 15:27:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality831586377230728738.gal : 5 ms
[2026-06-10 15:27:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality5079987579042930323.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality831586377230728738.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5079987579042930323.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.64366e+06,5.73456,130032,2,49175,5,365984,6,0,1499,568439,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-06-10 15:27:36] [INFO ] Flatten gal took : 8 ms
[2026-06-10 15:27:36] [INFO ] Applying decomposition
[2026-06-10 15:27:36] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1962952944714361540.txt' '-o' '/tmp/graph1962952944714361540.bin' '-w' '/tmp/graph1962952944714361540.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1962952944714361540.bin' '-l' '-1' '-v' '-w' '/tmp/graph1962952944714361540.weights' '-q' '0' '-e' '0.001'
[2026-06-10 15:27:36] [INFO ] Decomposing Gal with order
[2026-06-10 15:27:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 15:27:37] [INFO ] Removed a total of 333 redundant transitions.
[2026-06-10 15:27:37] [INFO ] Flatten gal took : 25 ms
[2026-06-10 15:27:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2026-06-10 15:27:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality13503216799293213028.gal : 8 ms
[2026-06-10 15:27:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality17178144651957406448.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13503216799293213028.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17178144651957406448.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.64366e+06,10.4627,299312,13558,32,307239,329,845,2.5364e+06,27,684,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 339/339 places, 382/382 transitions.
Graph (complete) has 824 edges and 339 vertex of which 327 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.3 ms
Discarding 12 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 327 transition count 372
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 317 transition count 372
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 54 place count 284 transition count 339
Iterating global reduction 2 with 33 rules applied. Total rules applied 87 place count 284 transition count 339
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 257 place count 199 transition count 254
Applied a total of 257 rules in 41 ms. Remains 199 /339 variables (removed 140) and now considering 254/382 (removed 128) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3243274734837636293.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17996582070165302984.kers'
[2026-06-10 15:28:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3243274734837636293.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17996582070165302984.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 254 rows 191 cols 838 entries
Finished phase 1 with 181 SingleSign rule and 0 generalized
[2026-06-10 15:28:07] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-17996582070165302984.kers
Total runtime 7 ms.
[2026-06-10 15:28:07] [INFO ] Implicit Places using invariants in 526 ms returned []
[2026-06-10 15:28:07] [INFO ] Invariant cache hit.
[2026-06-10 15:28:07] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 15:28:08] [INFO ] Implicit Places using invariants and state equation in 1122 ms returned []
Implicit Place search using SMT with State Equation took 1650 ms to find 0 implicit places.
[2026-06-10 15:28:08] [INFO ] Redundant transitions in 21 ms returned []
Running 244 sub problems to find dead transitions.
[2026-06-10 15:28:08] [INFO ] Invariant cache hit.
[2026-06-10 15:28:08] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 11/199 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 15/33 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 244 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 199/453 variables, and 42 constraints, problems are : Problem set: 0 solved, 244 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/199 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 11/199 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 23/42 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 9 (OVERLAPS) 254/453 variables, 199/250 constraints. Problems are: Problem set: 0 solved, 244 unsolved
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD156 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/453 variables, 80/330 constraints. Problems are: Problem set: 12 solved, 232 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/453 variables, 232/562 constraints. Problems are: Problem set: 12 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 453/453 variables, and 562 constraints, problems are : Problem set: 12 solved, 232 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 199/199 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 232/244 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60079ms problems are : Problem set: 12 solved, 232 unsolved
Search for dead transitions found 12 dead transitions in 60081ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 199/339 places, 242/382 transitions.
Applied a total of 0 rules in 11 ms. Remains 199 /199 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2026-06-10 15:29:08] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 61822 ms. Remains : 199/339 places, 242/382 transitions.
[2026-06-10 15:29:08] [INFO ] Flatten gal took : 6 ms
[2026-06-10 15:29:08] [INFO ] Flatten gal took : 7 ms
[2026-06-10 15:29:08] [INFO ] Input system was already deterministic with 242 transitions.
[2026-06-10 15:29:08] [INFO ] Flatten gal took : 7 ms
[2026-06-10 15:29:09] [INFO ] Flatten gal took : 7 ms
[2026-06-10 15:29:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality15236054156662430822.gal : 3 ms
[2026-06-10 15:29:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality3301001851547672075.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15236054156662430822.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3301001851547672075.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,934614,2.85191,74156,2,16453,5,187217,6,0,1007,298883,0


Converting to forward existential form...Done !
original formula: EF(((loop_9_11>beginloop_8_18) + AF(AG((beginloop_9_14>endloop_2_17)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (loop_9_11>beginloop_8_18))] != FALSE + [(FwdU(Init,TRUE) * !(EG(!(!(E(TRUE U !((beginloop_...191
(forward)formula 0,1,2.86663,74156,1,0,7,187217,8,1,1014,298883,1
FORMULA FileSystem-PT-N03I10B08-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 339/339 places, 382/382 transitions.
Graph (complete) has 824 edges and 339 vertex of which 327 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 327 transition count 372
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 317 transition count 372
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 54 place count 284 transition count 339
Iterating global reduction 2 with 33 rules applied. Total rules applied 87 place count 284 transition count 339
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 261 place count 197 transition count 252
Applied a total of 261 rules in 31 ms. Remains 197 /339 variables (removed 142) and now considering 252/382 (removed 130) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12404019596116685371.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14513266774157808725.kers'
[2026-06-10 15:29:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12404019596116685371.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14513266774157808725.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 252 rows 189 cols 834 entries
Finished phase 1 with 179 SingleSign rule and 0 generalized
[2026-06-10 15:29:11] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14513266774157808725.kers
Total runtime 3 ms.
[2026-06-10 15:29:12] [INFO ] Implicit Places using invariants in 450 ms returned []
[2026-06-10 15:29:12] [INFO ] Invariant cache hit.
[2026-06-10 15:29:12] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 15:29:13] [INFO ] Implicit Places using invariants and state equation in 1272 ms returned []
Implicit Place search using SMT with State Equation took 1727 ms to find 0 implicit places.
[2026-06-10 15:29:13] [INFO ] Redundant transitions in 5 ms returned []
Running 242 sub problems to find dead transitions.
[2026-06-10 15:29:13] [INFO ] Invariant cache hit.
[2026-06-10 15:29:13] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 11/197 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 15/33 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 252/449 variables, 197/232 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 80/312 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 449/449 variables, and 312 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 197/197 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 11/197 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (OVERLAPS) 252/449 variables, 197/244 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD152 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 80/324 constraints. Problems are: Problem set: 12 solved, 230 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/449 variables, 230/554 constraints. Problems are: Problem set: 12 solved, 230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 449/449 variables, and 554 constraints, problems are : Problem set: 12 solved, 230 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 197/197 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 230/242 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60088ms problems are : Problem set: 12 solved, 230 unsolved
Search for dead transitions found 12 dead transitions in 60089ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 197/339 places, 240/382 transitions.
Applied a total of 0 rules in 14 ms. Remains 197 /197 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2026-06-10 15:30:13] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 61886 ms. Remains : 197/339 places, 240/382 transitions.
[2026-06-10 15:30:13] [INFO ] Flatten gal took : 15 ms
[2026-06-10 15:30:13] [INFO ] Flatten gal took : 10 ms
[2026-06-10 15:30:13] [INFO ] Input system was already deterministic with 240 transitions.
[2026-06-10 15:30:13] [INFO ] Flatten gal took : 9 ms
[2026-06-10 15:30:13] [INFO ] Flatten gal took : 9 ms
[2026-06-10 15:30:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality2978760353416804775.gal : 8 ms
[2026-06-10 15:30:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality18412578351845726081.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2978760353416804775.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18412578351845726081.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,892370,3.73721,72872,2,16260,5,187637,6,0,997,281497,0


Converting to forward existential form...Done !
original formula: EG(AG(EF((endloop_7_18<=loop_1_11))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(E(TRUE U (endloop_7_18<=loop_1_11))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t93, t94, t95, t96, t97, t98, t99, t100, t101, t102, t103, t104, t105, t106, t107, t108, t109...623
Detected timeout of ITS tools.
[2026-06-10 15:30:43] [INFO ] Flatten gal took : 7 ms
[2026-06-10 15:30:43] [INFO ] Applying decomposition
[2026-06-10 15:30:43] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14254012325182691407.txt' '-o' '/tmp/graph14254012325182691407.bin' '-w' '/tmp/graph14254012325182691407.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14254012325182691407.bin' '-l' '-1' '-v' '-w' '/tmp/graph14254012325182691407.weights' '-q' '0' '-e' '0.001'
[2026-06-10 15:30:43] [INFO ] Decomposing Gal with order
[2026-06-10 15:30:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 15:30:43] [INFO ] Removed a total of 63 redundant transitions.
[2026-06-10 15:30:43] [INFO ] Flatten gal took : 18 ms
[2026-06-10 15:30:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 3 ms.
[2026-06-10 15:30:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality1958951663272216843.gal : 3 ms
[2026-06-10 15:30:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality14973025261028101791.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1958951663272216843.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14973025261028101791.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,892370,2.9971,74376,2,25206,5,228430,6,0,1011,287266,0


Converting to forward existential form...Done !
original formula: EG(AG(EF((gu15.endloop_7_18<=gu15.loop_1_11))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(E(TRUE U (gu15.endloop_7_18<=gu15.loop_1_11))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions gi0.gu2.t104, gi0.gu2.t105, gi0.gu2.t106, gi0.gu2.t107, gi0.gu2.t108, gi0.gu2.t109, gi0.gu2.t...488
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 382/382 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 329 transition count 382
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 40 place count 299 transition count 352
Iterating global reduction 1 with 30 rules applied. Total rules applied 70 place count 299 transition count 352
Applied a total of 70 rules in 7 ms. Remains 299 /339 variables (removed 40) and now considering 352/382 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8335047296318891429.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9102001285349123182.kers'
[2026-06-10 15:31:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8335047296318891429.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9102001285349123182.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 352 rows 291 cols 968 entries
Finished phase 1 with 281 SingleSign rule and 0 generalized
[2026-06-10 15:31:14] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-9102001285349123182.kers
Total runtime 10 ms.
[2026-06-10 15:31:15] [INFO ] Implicit Places using invariants in 970 ms returned []
[2026-06-10 15:31:15] [INFO ] Invariant cache hit.
[2026-06-10 15:31:15] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 15:31:16] [INFO ] Implicit Places using invariants and state equation in 1323 ms returned []
Implicit Place search using SMT with State Equation took 2296 ms to find 0 implicit places.
Running 342 sub problems to find dead transitions.
[2026-06-10 15:31:16] [INFO ] Invariant cache hit.
[2026-06-10 15:31:16] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 2 (OVERLAPS) 11/297 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 342 unsolved
SMT process timed out in 30185ms, After SMT, problems are : Problem set: 0 solved, 342 unsolved
Search for dead transitions found 0 dead transitions in 30187ms
Starting structural reductions in LTL mode, iteration 1 : 299/339 places, 352/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32492 ms. Remains : 299/339 places, 352/382 transitions.
[2026-06-10 15:31:46] [INFO ] Flatten gal took : 17 ms
[2026-06-10 15:31:46] [INFO ] Flatten gal took : 13 ms
[2026-06-10 15:31:46] [INFO ] Input system was already deterministic with 352 transitions.
[2026-06-10 15:31:46] [INFO ] Flatten gal took : 12 ms
[2026-06-10 15:31:46] [INFO ] Flatten gal took : 13 ms
[2026-06-10 15:31:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality6684439642338145461.gal : 4 ms
[2026-06-10 15:31:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality10759879229109613545.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6684439642338145461.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10759879229109613545.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.74996e+06,9.2322,190592,2,51557,5,509720,6,0,1511,874551,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-06-10 15:32:16] [INFO ] Flatten gal took : 8 ms
[2026-06-10 15:32:16] [INFO ] Applying decomposition
[2026-06-10 15:32:16] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7722134827176728557.txt' '-o' '/tmp/graph7722134827176728557.bin' '-w' '/tmp/graph7722134827176728557.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7722134827176728557.bin' '-l' '-1' '-v' '-w' '/tmp/graph7722134827176728557.weights' '-q' '0' '-e' '0.001'
[2026-06-10 15:32:16] [INFO ] Decomposing Gal with order
[2026-06-10 15:32:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 15:32:16] [INFO ] Removed a total of 339 redundant transitions.
[2026-06-10 15:32:16] [INFO ] Flatten gal took : 24 ms
[2026-06-10 15:32:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 7 ms.
[2026-06-10 15:32:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality3564794075876340930.gal : 4 ms
[2026-06-10 15:32:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality11822497561432340487.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3564794075876340930.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11822497561432340487.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.74996e+06,12.6712,264808,2,80299,5,794164,6,0,1518,1.11164e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 339/339 places, 382/382 transitions.
Graph (complete) has 824 edges and 339 vertex of which 328 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 328 transition count 372
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 318 transition count 372
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 52 place count 287 transition count 341
Iterating global reduction 2 with 31 rules applied. Total rules applied 83 place count 287 transition count 341
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 259 place count 199 transition count 253
Applied a total of 259 rules in 28 ms. Remains 199 /339 variables (removed 140) and now considering 253/382 (removed 129) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15832978350207204126.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5279521348310187723.kers'
[2026-06-10 15:32:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15832978350207204126.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5279521348310187723.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 253 rows 191 cols 837 entries
Finished phase 1 with 181 SingleSign rule and 0 generalized
[2026-06-10 15:32:46] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5279521348310187723.kers
Total runtime 3 ms.
[2026-06-10 15:32:47] [INFO ] Implicit Places using invariants in 496 ms returned []
[2026-06-10 15:32:47] [INFO ] Invariant cache hit.
[2026-06-10 15:32:47] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 15:32:48] [INFO ] Implicit Places using invariants and state equation in 1170 ms returned []
Implicit Place search using SMT with State Equation took 1669 ms to find 0 implicit places.
[2026-06-10 15:32:48] [INFO ] Redundant transitions in 1 ms returned []
Running 243 sub problems to find dead transitions.
[2026-06-10 15:32:48] [INFO ] Invariant cache hit.
[2026-06-10 15:32:48] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (OVERLAPS) 11/198 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (OVERLAPS) 253/451 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 80/328 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 451/452 variables, and 328 constraints, problems are : Problem set: 0 solved, 243 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 198/199 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (OVERLAPS) 11/198 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 30/50 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 11/75 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 11 (OVERLAPS) 253/451 variables, 198/274 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD151 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 80/354 constraints. Problems are: Problem set: 12 solved, 231 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/451 variables, 220/574 constraints. Problems are: Problem set: 12 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 451/452 variables, and 574 constraints, problems are : Problem set: 12 solved, 231 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 198/199 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 220/243 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60075ms problems are : Problem set: 12 solved, 231 unsolved
Search for dead transitions found 12 dead transitions in 60076ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 199/339 places, 241/382 transitions.
Applied a total of 0 rules in 8 ms. Remains 199 /199 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2026-06-10 15:33:48] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 61797 ms. Remains : 199/339 places, 241/382 transitions.
[2026-06-10 15:33:48] [INFO ] Flatten gal took : 6 ms
[2026-06-10 15:33:48] [INFO ] Flatten gal took : 5 ms
[2026-06-10 15:33:48] [INFO ] Input system was already deterministic with 241 transitions.
[2026-06-10 15:33:48] [INFO ] Flatten gal took : 6 ms
[2026-06-10 15:33:48] [INFO ] Flatten gal took : 5 ms
[2026-06-10 15:33:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality9048359639034401179.gal : 2 ms
[2026-06-10 15:33:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality9374313071612794608.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9048359639034401179.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9374313071612794608.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,855055,3.02535,75560,2,16875,5,190916,6,0,1003,292826,0


Converting to forward existential form...Done !
original formula: AG(EF(((inode_6_12<2)&&((endloop_5_16>=1)||(endloop_7_12>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((inode_6_12<2)&&((endloop_5_16>=1)||(endloop_7_12>=1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t93, t94, t95, t96, t97, t98, t99, t100, t101, t102, t103, t104, t105, t106, t107, t108, t109...623
(forward)formula 0,0,21.0493,475004,1,0,568,2.4989e+06,503,260,7286,1.79916e+06,525
FORMULA FileSystem-PT-N03I10B08-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 382/382 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 328 transition count 382
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 43 place count 296 transition count 350
Iterating global reduction 1 with 32 rules applied. Total rules applied 75 place count 296 transition count 350
Applied a total of 75 rules in 7 ms. Remains 296 /339 variables (removed 43) and now considering 350/382 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13447286560010867965.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9201336379272904058.kers'
[2026-06-10 15:34:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13447286560010867965.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9201336379272904058.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 350 rows 288 cols 961 entries
Finished phase 1 with 278 SingleSign rule and 0 generalized
[2026-06-10 15:34:10] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9201336379272904058.kers
Total runtime 4 ms.
[2026-06-10 15:34:10] [INFO ] Implicit Places using invariants in 710 ms returned []
[2026-06-10 15:34:10] [INFO ] Invariant cache hit.
[2026-06-10 15:34:10] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 15:34:11] [INFO ] Implicit Places using invariants and state equation in 1210 ms returned []
Implicit Place search using SMT with State Equation took 1920 ms to find 0 implicit places.
Running 340 sub problems to find dead transitions.
[2026-06-10 15:34:11] [INFO ] Invariant cache hit.
[2026-06-10 15:34:11] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/284 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (OVERLAPS) 11/295 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 295/646 variables, and 58 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/296 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/284 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (OVERLAPS) 11/295 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 33/58 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 9 (OVERLAPS) 350/645 variables, 295/368 constraints. Problems are: Problem set: 0 solved, 340 unsolved
SMT process timed out in 60073ms, After SMT, problems are : Problem set: 0 solved, 340 unsolved
Search for dead transitions found 0 dead transitions in 60075ms
Starting structural reductions in LTL mode, iteration 1 : 296/339 places, 350/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62003 ms. Remains : 296/339 places, 350/382 transitions.
[2026-06-10 15:35:12] [INFO ] Flatten gal took : 10 ms
[2026-06-10 15:35:12] [INFO ] Flatten gal took : 11 ms
[2026-06-10 15:35:12] [INFO ] Input system was already deterministic with 350 transitions.
[2026-06-10 15:35:12] [INFO ] Flatten gal took : 10 ms
[2026-06-10 15:35:12] [INFO ] Flatten gal took : 11 ms
[2026-06-10 15:35:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality8555909379648573029.gal : 3 ms
[2026-06-10 15:35:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality11877543083217029189.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8555909379648573029.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11877543083217029189.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.57619e+06,6.78825,148076,2,51711,5,412195,6,0,1500,668164,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-06-10 15:35:42] [INFO ] Flatten gal took : 32 ms
[2026-06-10 15:35:42] [INFO ] Applying decomposition
[2026-06-10 15:35:42] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8869449994651063010.txt' '-o' '/tmp/graph8869449994651063010.bin' '-w' '/tmp/graph8869449994651063010.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8869449994651063010.bin' '-l' '-1' '-v' '-w' '/tmp/graph8869449994651063010.weights' '-q' '0' '-e' '0.001'
[2026-06-10 15:35:42] [INFO ] Decomposing Gal with order
[2026-06-10 15:35:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 15:35:42] [INFO ] Removed a total of 338 redundant transitions.
[2026-06-10 15:35:42] [INFO ] Flatten gal took : 23 ms
[2026-06-10 15:35:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 6 ms.
[2026-06-10 15:35:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality373623450095517616.gal : 4 ms
[2026-06-10 15:35:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality13705335641740378073.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality373623450095517616.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13705335641740378073.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.57619e+06,9.75955,190784,2,60867,5,551842,6,0,1508,810232,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 339/339 places, 382/382 transitions.
Graph (complete) has 824 edges and 339 vertex of which 327 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 327 transition count 372
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 317 transition count 372
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 54 place count 284 transition count 339
Iterating global reduction 2 with 33 rules applied. Total rules applied 87 place count 284 transition count 339
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 261 place count 197 transition count 252
Applied a total of 261 rules in 32 ms. Remains 197 /339 variables (removed 142) and now considering 252/382 (removed 130) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16277446274657283926.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9863133870990863861.kers'
[2026-06-10 15:36:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16277446274657283926.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9863133870990863861.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 252 rows 189 cols 834 entries
Finished phase 1 with 179 SingleSign rule and 0 generalized
[2026-06-10 15:36:12] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-9863133870990863861.kers
Total runtime 7 ms.
[2026-06-10 15:36:12] [INFO ] Implicit Places using invariants in 380 ms returned []
[2026-06-10 15:36:12] [INFO ] Invariant cache hit.
[2026-06-10 15:36:12] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 15:36:13] [INFO ] Implicit Places using invariants and state equation in 763 ms returned []
Implicit Place search using SMT with State Equation took 1145 ms to find 0 implicit places.
[2026-06-10 15:36:13] [INFO ] Redundant transitions in 1 ms returned []
Running 242 sub problems to find dead transitions.
[2026-06-10 15:36:13] [INFO ] Invariant cache hit.
[2026-06-10 15:36:13] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 11/197 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 16/34 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 252/449 variables, 197/233 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 80/313 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 449/449 variables, and 313 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 197/197 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 11/197 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 252/449 variables, 197/234 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD151 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 80/314 constraints. Problems are: Problem set: 12 solved, 230 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 230/544 constraints. Problems are: Problem set: 12 solved, 230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 449/449 variables, and 544 constraints, problems are : Problem set: 12 solved, 230 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 197/197 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 230/242 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60055ms problems are : Problem set: 12 solved, 230 unsolved
Search for dead transitions found 12 dead transitions in 60056ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 197/339 places, 240/382 transitions.
Applied a total of 0 rules in 8 ms. Remains 197 /197 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2026-06-10 15:37:13] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 61267 ms. Remains : 197/339 places, 240/382 transitions.
[2026-06-10 15:37:13] [INFO ] Flatten gal took : 5 ms
[2026-06-10 15:37:13] [INFO ] Flatten gal took : 6 ms
[2026-06-10 15:37:13] [INFO ] Input system was already deterministic with 240 transitions.
[2026-06-10 15:37:13] [INFO ] Flatten gal took : 25 ms
[2026-06-10 15:37:13] [INFO ] Flatten gal took : 10 ms
[2026-06-10 15:37:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality8851978470486899264.gal : 3 ms
[2026-06-10 15:37:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality1543975660938151331.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8851978470486899264.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1543975660938151331.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,854622,3.14295,72944,2,16366,5,186393,6,0,997,279805,0


Converting to forward existential form...Done !
original formula: EG((endloop_4_12<=beginloop_6_17))
=> equivalent forward existential formula: [FwdG(Init,(endloop_4_12<=beginloop_6_17))] != FALSE
Hit Full ! (commute/partial/dont) 236/0/4
(forward)formula 0,1,20.8371,450664,1,0,66,1.83427e+06,19,2,5551,1.46264e+06,67
FORMULA FileSystem-PT-N03I10B08-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-06-10 15:37:34] [INFO ] Flatten gal took : 8 ms
[2026-06-10 15:37:34] [INFO ] Flatten gal took : 9 ms
[2026-06-10 15:37:34] [INFO ] Applying decomposition
[2026-06-10 15:37:34] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12480994928049085765.txt' '-o' '/tmp/graph12480994928049085765.bin' '-w' '/tmp/graph12480994928049085765.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12480994928049085765.bin' '-l' '-1' '-v' '-w' '/tmp/graph12480994928049085765.weights' '-q' '0' '-e' '0.001'
[2026-06-10 15:37:34] [INFO ] Decomposing Gal with order
[2026-06-10 15:37:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 15:37:34] [INFO ] Removed a total of 349 redundant transitions.
[2026-06-10 15:37:34] [INFO ] Flatten gal took : 25 ms
[2026-06-10 15:37:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 7 ms.
[2026-06-10 15:37:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality9094166809180630685.gal : 5 ms
[2026-06-10 15:37:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality16263607135481900788.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9094166809180630685.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16263607135481900788.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 7 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.11946e+06,51.6808,1018020,2,296653,5,3.36002e+06,6,0,1723,3.74174e+06,0


Converting to forward existential form...Done !
original formula: A((gu114.testbusy_8_13<=gu114.beginloop_5_15) U AX(FALSE))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(FALSE))))))) * !(E(!(!(EX(!(FALSE)))) U (!((gu114.testbusy_8_13<=gu114.beginloop_5_15)) ...189
Reverse transition relation is NOT exact ! Due to transitions gi2.gi0.gi0.t209, gi2.gi0.gi0.t205, gi2.gi0.gi0.t202, gi2.gi0.gi1.t255, gi2.gi0.gi1.t252, gi2...1275
(forward)formula 0,0,933.82,11885896,1,0,676,6.4625e+07,9,338,3753,3.6125e+07,1
FORMULA FileSystem-PT-N03I10B08-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX(A(AG(AF((gi2.gi2.gi1.gu40.beginloop_7_17>=1))) U (gu58.endloop_10_12<=gu58.testbusy_5_11)))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!((gu58.endloop_10_12<=gu58.testbusy_5_11))))) * !(E(!((gu58.endloop_10_12<=gu58.testbusy_5_1...287
(forward)formula 1,1,999.929,11885896,1,0,676,6.4625e+07,26,338,6420,3.6125e+07,364
FORMULA FileSystem-PT-N03I10B08-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(EF(((AX(AF((gu84.initblock_5<=gu84.endloop_7_18))) * (gi2.gi0.gi0.gu79.lockb_13<=0)) * EG((gu98.loop_6_15>gu98.endloop_5_15)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((!(EX(!(!(EG(!((gu84.initblock_5<=gu84.endloop_7_18))))))) * (gi2.gi0.gi0.gu79.l...221
(forward)formula 2,0,1012.22,11885896,1,0,676,6.4625e+07,33,338,6427,3.6125e+07,630
FORMULA FileSystem-PT-N03I10B08-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E(EX(!(EX(TRUE))) U EG((((gi2.gi1.gi1.gu13.loop_2_14>0) + EX(TRUE)) * ((EG(((gi2.gi0.gi0.gu79.endloop_10_13>=1)||(gi2.gi1.gi1.gu13.testbu...248
=> equivalent forward existential formula: [FwdG(FwdU(Init,EX(!(EX(TRUE)))),(((gi2.gi1.gi1.gu13.loop_2_14>0) + EX(TRUE)) * ((EG(((gi2.gi0.gi0.gu79.endloop_...298
(forward)formula 3,1,1202.07,11885896,1,0,760,6.4625e+07,51,338,6864,3.6125e+07,981
FORMULA FileSystem-PT-N03I10B08-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(AG(EF((gu84.endloop_7_18<=gu84.loop_1_11))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(E(TRUE U (gu84.endloop_7_18<=gu84.loop_1_11))))))] != FALSE
(forward)formula 4,1,1202.94,11885896,1,0,763,6.4625e+07,52,338,6867,3.6125e+07,987
FORMULA FileSystem-PT-N03I10B08-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EG(AF(((gi2.gi1.gi1.gu73.inode_10_14<1)||((gu107.testbusy_3_14<=gu107.loop_10_15)&&(gi2.gi0.gi1.gu61.inode_1_18<=1))))) + EG(((((AG((gu6...345
=> equivalent forward existential formula: ([FwdG(Init,!(EG(!(((gi2.gi1.gi1.gu73.inode_10_14<1)||((gu107.testbusy_3_14<=gu107.loop_10_15)&&(gi2.gi0.gi1.gu6...448
(forward)formula 5,1,1205.29,11885896,1,0,856,6.4625e+07,58,353,6879,3.6125e+07,1133
FORMULA FileSystem-PT-N03I10B08-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
Detected timeout of ITS tools.
[2026-06-10 16:03:15] [INFO ] Flatten gal took : 10 ms
[2026-06-10 16:03:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality3503526786878004911.gal : 3 ms
[2026-06-10 16:03:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality1898913453767362666.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3503526786878004911.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1898913453767362666.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.11946e+06,25.6323,564856,2,106927,5,1.24136e+06,6,0,1671,2.30955e+06,0


Converting to forward existential form...Done !
original formula: AX(EF((AG((inode_10_18<=beginloop_9_11)) * EX(((endloop_9_11<1)&&(beginloop_1_12<1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (!(E(TRUE U !((inode_10_18<=beginloop_9_11)))) * EX(((endloop_9_11<1)&&(beginloop_1_12<1...171
Reverse transition relation is NOT exact ! Due to transitions t180, t182, t183, t185, t186, t187, t191, t192, t193, t195, t199, t202, t205, t209, t211, t21...679
(forward)formula 0,1,212.031,3048340,1,0,734,1.5917e+07,14,371,6291,8.83573e+06,76
FORMULA FileSystem-PT-N03I10B08-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Total runtime 2773428 ms.

BK_STOP 1781107608551

--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="FileSystem-PT-N03I10B08"
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-5973"
echo " Executing tool itstools"
echo " Input is FileSystem-PT-N03I10B08, 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 r338-smll-178021499300433"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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