Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r178-oct2-177969020000265.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 MedleyA-PT-22, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020000265
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 4.8K Mar 7 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Mar 7 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 7 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 11:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 11:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Mar 7 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 7 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 7 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 7 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 238K Mar 3 18:30 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 MedleyA-PT-22-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779702432777

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-22
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-25 09:47:14] [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-05-25 09:47:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:47:14] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2026-05-25 09:47:14] [INFO ] Transformed 307 places.
[2026-05-25 09:47:14] [INFO ] Transformed 740 transitions.
[2026-05-25 09:47:14] [INFO ] Found NUPN structural information;
[2026-05-25 09:47:14] [INFO ] Parsed PT model containing 307 places and 740 transitions and 3829 arcs in 213 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
Support contains 69 out of 307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 740/740 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 304 transition count 740
Discarding 75 places :
Symmetric choice reduction at 1 with 75 rule applications. Total rules 78 place count 229 transition count 654
Iterating global reduction 1 with 75 rules applied. Total rules applied 153 place count 229 transition count 654
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 157 place count 229 transition count 650
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 170 place count 216 transition count 627
Iterating global reduction 2 with 13 rules applied. Total rules applied 183 place count 216 transition count 627
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 184 place count 215 transition count 625
Iterating global reduction 2 with 1 rules applied. Total rules applied 185 place count 215 transition count 625
Applied a total of 185 rules in 63 ms. Remains 215 /307 variables (removed 92) and now considering 625/740 (removed 115) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2473502488618870046.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12717432375940955020.kers'
[2026-05-25 09:47:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2473502488618870046.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12717432375940955020.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 625 rows 215 cols 3525 entries
Finished phase 1 with 185 SingleSign rule and 8 generalized
[2026-05-25 09:47:14] [INFO ] Computed 22 invariants in 2 ms
Computed 22 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12717432375940955020.kers
Total runtime 4 ms.
[2026-05-25 09:47:15] [INFO ] Implicit Places using invariants in 425 ms returned []
[2026-05-25 09:47:15] [INFO ] Invariant cache hit.
[2026-05-25 09:47:15] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 962 ms to find 0 implicit places.
Running 624 sub problems to find dead transitions.
[2026-05-25 09:47:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 624 unsolved
Problem TDEAD233 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD583 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/214 variables, 12/22 constraints. Problems are: Problem set: 144 solved, 480 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 11/33 constraints. Problems are: Problem set: 144 solved, 480 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 1/34 constraints. Problems are: Problem set: 144 solved, 480 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 214/840 variables, and 34 constraints, problems are : Problem set: 144 solved, 480 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/215 constraints, PredecessorRefiner: 624/624 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 144 solved, 480 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 10/10 constraints. Problems are: Problem set: 144 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/10 constraints. Problems are: Problem set: 144 solved, 480 unsolved
At refinement iteration 2 (OVERLAPS) 1/214 variables, 12/22 constraints. Problems are: Problem set: 144 solved, 480 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 12/34 constraints. Problems are: Problem set: 144 solved, 480 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/34 constraints. Problems are: Problem set: 144 solved, 480 unsolved
At refinement iteration 5 (OVERLAPS) 625/839 variables, 214/248 constraints. Problems are: Problem set: 144 solved, 480 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/839 variables, 479/727 constraints. Problems are: Problem set: 144 solved, 480 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 839/840 variables, and 730 constraints, problems are : Problem set: 144 solved, 480 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 214/215 constraints, PredecessorRefiner: 479/624 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61271ms problems are : Problem set: 144 solved, 480 unsolved
Search for dead transitions found 144 dead transitions in 61288ms
Found 144 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 144 transitions
Dead transitions reduction (with SMT) removed 144 transitions
Starting structural reductions in LTL mode, iteration 1 : 215/307 places, 481/740 transitions.
Applied a total of 0 rules in 3 ms. Remains 215 /215 variables (removed 0) and now considering 481/481 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62384 ms. Remains : 215/307 places, 481/740 transitions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 481/481 transitions.
Applied a total of 0 rules in 4 ms. Remains 215 /215 variables (removed 0) and now considering 481/481 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7945750035383549664.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13543661160424776207.kers'
[2026-05-25 09:48:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7945750035383549664.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13543661160424776207.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 481 rows 215 cols 2373 entries
Finished phase 1 with 185 SingleSign rule and 8 generalized
[2026-05-25 09:48:17] [INFO ] Computed 22 invariants in 10 ms
Computed 22 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-13543661160424776207.kers
Total runtime 12 ms.
[2026-05-25 09:48:17] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-25 09:48:17] [INFO ] Invariant cache hit.
[2026-05-25 09:48:17] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 480 sub problems to find dead transitions.
[2026-05-25 09:48:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (OVERLAPS) 1/214 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 5 (OVERLAPS) 481/695 variables, 214/248 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/695 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 480 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 695/696 variables, and 249 constraints, problems are : Problem set: 0 solved, 480 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 214/215 constraints, PredecessorRefiner: 480/480 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 480 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (OVERLAPS) 1/214 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 5 (OVERLAPS) 481/695 variables, 214/249 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/695 variables, 479/728 constraints. Problems are: Problem set: 0 solved, 480 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 695/696 variables, and 737 constraints, problems are : Problem set: 0 solved, 480 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 214/215 constraints, PredecessorRefiner: 479/480 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60467ms problems are : Problem set: 0 solved, 480 unsolved
Search for dead transitions found 0 dead transitions in 60475ms
Finished structural reductions in LTL mode , in 1 iterations and 60816 ms. Remains : 215/215 places, 481/481 transitions.
Support contains 69 out of 215 places after structural reductions.
[2026-05-25 09:49:18] [INFO ] Flatten gal took : 77 ms
[2026-05-25 09:49:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-22-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 09:49:18] [INFO ] Flatten gal took : 35 ms
[2026-05-25 09:49:18] [INFO ] Input system was already deterministic with 481 transitions.
Support contains 57 out of 215 places (down from 69) after GAL structural reductions.
RANDOM walk for 40000 steps (1165 resets) in 1445 ms. (27 steps per ms) remains 24/37 properties
BEST_FIRST walk for 4003 steps (24 resets) in 47 ms. (83 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (22 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (21 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (24 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (23 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (22 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (23 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (23 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (23 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (21 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (23 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (20 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (24 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (21 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (23 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (21 resets) in 13 ms. (285 steps per ms) remains 22/24 properties
BEST_FIRST walk for 4003 steps (23 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (21 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (21 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (21 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (23 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (22 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (21 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
[2026-05-25 09:49:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 141/180 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 20/200 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 4/204 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 475/679 variables, 204/226 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/679 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 16/695 variables, 10/236 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/695 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 1/696 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/696 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 0/696 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 696/696 variables, and 237 constraints, problems are : Problem set: 0 solved, 22 unsolved in 1782 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 1 (OVERLAPS) 141/180 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 8/20 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 20/200 variables, 8/28 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 5/33 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 2/35 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 4/204 variables, 2/37 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 475/679 variables, 204/241 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/679 variables, 16/257 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/679 variables, 2/259 constraints. Problems are: Problem set: 1 solved, 21 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 679/696 variables, and 262 constraints, problems are : Problem set: 1 solved, 21 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 204/215 constraints, PredecessorRefiner: 16/22 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 6802ms problems are : Problem set: 1 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 215 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 481/481 transitions.
Graph (complete) has 897 edges and 215 vertex of which 214 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 214 transition count 461
Reduce places removed 19 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 21 rules applied. Total rules applied 41 place count 195 transition count 459
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 193 transition count 459
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 43 place count 193 transition count 454
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 53 place count 188 transition count 454
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 61 place count 180 transition count 435
Iterating global reduction 3 with 8 rules applied. Total rules applied 69 place count 180 transition count 435
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 69 place count 180 transition count 434
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 71 place count 179 transition count 434
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 77 place count 173 transition count 414
Iterating global reduction 3 with 6 rules applied. Total rules applied 83 place count 173 transition count 414
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 85 place count 171 transition count 410
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 171 transition count 410
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 170 transition count 407
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 170 transition count 407
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 141 place count 143 transition count 382
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 143 place count 143 transition count 380
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 148 place count 138 transition count 371
Iterating global reduction 4 with 5 rules applied. Total rules applied 153 place count 138 transition count 371
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -76
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 169 place count 130 transition count 447
Drop transitions (Redundant composition of simpler transitions.) removed 71 transitions
Redundant transition composition rules discarded 71 transitions
Iterating global reduction 4 with 71 rules applied. Total rules applied 240 place count 130 transition count 376
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 243 place count 130 transition count 373
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 246 place count 127 transition count 373
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 257 place count 127 transition count 367
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 268 place count 116 transition count 367
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 272 place count 116 transition count 367
Applied a total of 272 rules in 160 ms. Remains 116 /215 variables (removed 99) and now considering 367/481 (removed 114) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 116/215 places, 367/481 transitions.
RANDOM walk for 40000 steps (4730 resets) in 1596 ms. (25 steps per ms) remains 10/21 properties
BEST_FIRST walk for 40003 steps (1100 resets) in 159 ms. (250 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40003 steps (1123 resets) in 123 ms. (322 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1155 resets) in 125 ms. (317 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1092 resets) in 108 ms. (367 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1137 resets) in 131 ms. (303 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1137 resets) in 153 ms. (259 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (1154 resets) in 115 ms. (344 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1220 resets) in 62 ms. (634 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1173 resets) in 55 ms. (714 steps per ms) remains 7/8 properties
[2026-05-25 09:49:26] [INFO ] Flow matrix only has 363 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11063433079266653799.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14549912229545826294.kers'
[2026-05-25 09:49:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11063433079266653799.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14549912229545826294.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 363 rows 116 cols 1686 entries
Finished phase 1 with 90 SingleSign rule and 6 generalized
[2026-05-25 09:49:26] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14549912229545826294.kers
Total runtime 1 ms.
[2026-05-25 09:49:26] [INFO ] State equation strengthened by 169 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 33/44 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 24/68 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 32/100 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 5/105 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 357/462 variables, 105/123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 164/287 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 16/478 variables, 10/297 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/478 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/478 variables, 5/304 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/478 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 1/479 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/479 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 0/479 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 305 constraints, problems are : Problem set: 0 solved, 7 unsolved in 463 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 116/116 constraints, ReadFeed: 169/169 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 33/44 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 24/68 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 32/100 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 5/105 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 357/462 variables, 105/124 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 164/288 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 4/292 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 16/478 variables, 10/302 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/478 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/478 variables, 5/309 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/478 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/478 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 1/479 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/479 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 0/479 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 479/479 variables, and 313 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2594 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 116/116 constraints, ReadFeed: 169/169 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3072ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Finished Parikh walk after 5855 steps, including 247 resets, run visited all 1 properties in 21 ms. (steps per millisecond=278 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 109 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2026-05-25 09:49:30] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:49:30] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:49:30] [INFO ] Input system was already deterministic with 481 transitions.
Computed a total of 17 stabilizing places and 18 stable transitions
Graph (complete) has 897 edges and 215 vertex of which 212 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 215/215 places, 481/481 transitions.
Graph (complete) has 897 edges and 215 vertex of which 212 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 211 transition count 443
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 176 transition count 442
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 72 place count 176 transition count 438
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 80 place count 172 transition count 438
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 99 place count 153 transition count 402
Iterating global reduction 2 with 19 rules applied. Total rules applied 118 place count 153 transition count 402
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 118 place count 153 transition count 400
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 122 place count 151 transition count 400
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 133 place count 140 transition count 361
Iterating global reduction 2 with 11 rules applied. Total rules applied 144 place count 140 transition count 361
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 149 place count 135 transition count 350
Iterating global reduction 2 with 5 rules applied. Total rules applied 154 place count 135 transition count 350
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 156 place count 133 transition count 344
Iterating global reduction 2 with 2 rules applied. Total rules applied 158 place count 133 transition count 344
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 205 place count 108 transition count 322
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 208 place count 108 transition count 319
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 217 place count 99 transition count 298
Iterating global reduction 3 with 9 rules applied. Total rules applied 226 place count 99 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 229 place count 99 transition count 295
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 235 place count 96 transition count 292
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 237 place count 94 transition count 290
Applied a total of 237 rules in 55 ms. Remains 94 /215 variables (removed 121) and now considering 290/481 (removed 191) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7153637940562292598.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11234354563957909827.kers'
[2026-05-25 09:49:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7153637940562292598.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11234354563957909827.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 290 rows 94 cols 1378 entries
Finished phase 1 with 70 SingleSign rule and 5 generalized
[2026-05-25 09:49:30] [INFO ] Computed 19 invariants in 2 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11234354563957909827.kers
Total runtime 2 ms.
[2026-05-25 09:49:30] [INFO ] Implicit Places using invariants in 147 ms returned []
[2026-05-25 09:49:30] [INFO ] Invariant cache hit.
[2026-05-25 09:49:30] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-25 09:49:30] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2026-05-25 09:49:30] [INFO ] Redundant transitions in 8 ms returned []
Running 278 sub problems to find dead transitions.
[2026-05-25 09:49:30] [INFO ] Invariant cache hit.
[2026-05-25 09:49:30] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 4/93 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (OVERLAPS) 289/382 variables, 93/112 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 36/148 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 8 (OVERLAPS) 2/384 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/384 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 10 (OVERLAPS) 0/384 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 149 constraints, problems are : Problem set: 0 solved, 278 unsolved in 18163 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 4/93 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (OVERLAPS) 289/382 variables, 93/112 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 36/148 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 277/425 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 9 (OVERLAPS) 2/384 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/384 variables, 1/427 constraints. Problems are: Problem set: 0 solved, 278 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/384 variables, and 427 constraints, problems are : Problem set: 0 solved, 278 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48356ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 48357ms
Starting structural reductions in SI_CTL mode, iteration 1 : 94/215 places, 290/481 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48702 ms. Remains : 94/215 places, 290/481 transitions.
[2026-05-25 09:50:18] [INFO ] Flatten gal took : 23 ms
[2026-05-25 09:50:18] [INFO ] Flatten gal took : 28 ms
[2026-05-25 09:50:18] [INFO ] Input system was already deterministic with 290 transitions.
RANDOM walk for 1185 steps (111 resets) in 14 ms. (79 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-22-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-25 09:50:19] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:50:19] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:50:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16926557722435398731.gal : 9 ms
[2026-05-25 09:50:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11188559531570116270.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16926557722435398731.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11188559531570116270.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 215/215 places, 481/481 transitions.
Graph (complete) has 897 edges and 215 vertex of which 212 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 211 transition count 443
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 176 transition count 442
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 72 place count 176 transition count 438
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 80 place count 172 transition count 438
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 99 place count 153 transition count 402
Iterating global reduction 2 with 19 rules applied. Total rules applied 118 place count 153 transition count 402
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 118 place count 153 transition count 399
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 124 place count 150 transition count 399
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 135 place count 139 transition count 360
Iterating global reduction 2 with 11 rules applied. Total rules applied 146 place count 139 transition count 360
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 151 place count 134 transition count 349
Iterating global reduction 2 with 5 rules applied. Total rules applied 156 place count 134 transition count 349
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 159 place count 131 transition count 340
Iterating global reduction 2 with 3 rules applied. Total rules applied 162 place count 131 transition count 340
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 45 rules applied. Total rules applied 207 place count 107 transition count 319
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 210 place count 107 transition count 316
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 219 place count 98 transition count 295
Iterating global reduction 3 with 9 rules applied. Total rules applied 228 place count 98 transition count 295
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 231 place count 98 transition count 292
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 237 place count 95 transition count 289
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 239 place count 93 transition count 287
Applied a total of 239 rules in 54 ms. Remains 93 /215 variables (removed 122) and now considering 287/481 (removed 194) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12580143833086131320.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8293698157401887210.kers'
[2026-05-25 09:50:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12580143833086131320.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8293698157401887210.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 287 rows 93 cols 1274 entries
Finished phase 1 with 69 SingleSign rule and 5 generalized
[2026-05-25 09:50:19] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8293698157401887210.kers
Total runtime 4 ms.
[2026-05-25 09:50:19] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-25 09:50:19] [INFO ] Invariant cache hit.
[2026-05-25 09:50:19] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-25 09:50:19] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2026-05-25 09:50:19] [INFO ] Redundant transitions in 4 ms returned []
Running 276 sub problems to find dead transitions.
[2026-05-25 09:50:19] [INFO ] Invariant cache hit.
[2026-05-25 09:50:19] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 3/92 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (OVERLAPS) 286/378 variables, 92/111 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 36/147 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (OVERLAPS) 2/380 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 10 (OVERLAPS) 0/380 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 148 constraints, problems are : Problem set: 0 solved, 276 unsolved in 18016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 3/92 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (OVERLAPS) 286/378 variables, 92/111 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 36/147 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 275/422 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 9 (OVERLAPS) 2/380 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 424 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48191ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 48192ms
Starting structural reductions in SI_CTL mode, iteration 1 : 93/215 places, 287/481 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48467 ms. Remains : 93/215 places, 287/481 transitions.
[2026-05-25 09:51:07] [INFO ] Flatten gal took : 23 ms
[2026-05-25 09:51:07] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:51:07] [INFO ] Input system was already deterministic with 287 transitions.
[2026-05-25 09:51:07] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:51:07] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:51:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality3983623109823167270.gal : 3 ms
[2026-05-25 09:51:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality14666259139882928858.ctl : 5 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/CTLCardinality3983623109823167270.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14666259139882928858.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,1.50867e+09,4.46694,130244,2,5633,5,492641,6,0,651,540570,0


Converting to forward existential form...Done !
original formula: EG((p296==0))
=> equivalent forward existential formula: [FwdG(Init,(p296==0))] != FALSE
Hit Full ! (commute/partial/dont) 276/0/11
(forward)formula 0,1,13.6835,323400,1,0,12,1.28022e+06,19,4,4736,1.37712e+06,8
FORMULA MedleyA-PT-22-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 481/481 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 190 transition count 439
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 190 transition count 439
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 190 transition count 435
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 65 place count 179 transition count 395
Iterating global reduction 1 with 11 rules applied. Total rules applied 76 place count 179 transition count 395
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 83 place count 172 transition count 378
Iterating global reduction 1 with 7 rules applied. Total rules applied 90 place count 172 transition count 378
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 93 place count 169 transition count 369
Iterating global reduction 1 with 3 rules applied. Total rules applied 96 place count 169 transition count 369
Applied a total of 96 rules in 60 ms. Remains 169 /215 variables (removed 46) and now considering 369/481 (removed 112) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16870401568858523663.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4529784371241127549.kers'
[2026-05-25 09:51:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16870401568858523663.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4529784371241127549.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 369 rows 169 cols 1977 entries
Finished phase 1 with 139 SingleSign rule and 8 generalized
[2026-05-25 09:51:21] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4529784371241127549.kers
Total runtime 2 ms.
[2026-05-25 09:51:21] [INFO ] Implicit Places using invariants in 111 ms returned []
[2026-05-25 09:51:21] [INFO ] Invariant cache hit.
[2026-05-25 09:51:21] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2026-05-25 09:51:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 1/168 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (OVERLAPS) 369/537 variables, 168/196 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 537/538 variables, and 199 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 168/169 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 1/168 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (OVERLAPS) 369/537 variables, 168/197 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 367/564 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 2/566 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/538 variables, and 568 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 168/169 constraints, PredecessorRefiner: 367/368 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/2 constraints]
After SMT, in 60329ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 60331ms
Starting structural reductions in LTL mode, iteration 1 : 169/215 places, 369/481 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60754 ms. Remains : 169/215 places, 369/481 transitions.
[2026-05-25 09:52:22] [INFO ] Flatten gal took : 33 ms
[2026-05-25 09:52:22] [INFO ] Flatten gal took : 35 ms
[2026-05-25 09:52:22] [INFO ] Input system was already deterministic with 369 transitions.
[2026-05-25 09:52:22] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:52:22] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:52:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality14966742202842649136.gal : 3 ms
[2026-05-25 09:52:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality5417803480101350144.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/CTLCardinality14966742202842649136.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5417803480101350144.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.
Detected timeout of ITS tools.
[2026-05-25 09:52:52] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:52:52] [INFO ] Applying decomposition
[2026-05-25 09:52:52] [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/graph12508606243211320728.txt' '-o' '/tmp/graph12508606243211320728.bin' '-w' '/tmp/graph12508606243211320728.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12508606243211320728.bin' '-l' '-1' '-v' '-w' '/tmp/graph12508606243211320728.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:52:52] [INFO ] Decomposing Gal with order
[2026-05-25 09:52:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:52:52] [INFO ] Removed a total of 831 redundant transitions.
[2026-05-25 09:52:52] [INFO ] Flatten gal took : 94 ms
[2026-05-25 09:52:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 16 ms.
[2026-05-25 09:52:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality10743247362979933521.gal : 5 ms
[2026-05-25 09:52:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality1019245395289668562.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/CTLCardinality10743247362979933521.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1019245395289668562.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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.30187e+11,5.62866,165728,6621,193,233014,768,767,987002,99,5618,0


Converting to forward existential form...Done !
original formula: A(!(A((i9.i1.u33.p184==1) U (((i0.u16.p83==0)||(i3.u31.p179==1))&&(i0.u15.p79==0)))) U AX((EF((i5.u34.p191!=0)) * AG(!(((i4.i1.u24.p131==...184
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!((E(TRUE U (i5.u34.p191!=0)) * !(E(TRUE U !(!(((i4.i1.u24.p131==0)||(i8.i1.u46.p279==1)))...626
Reverse transition relation is NOT exact ! Due to transitions t1, t20, t33, t59, t76, t101, t143, t144, t149, t162, t169, t174, t187, t189, t192, t194, t19...1411
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 215/215 places, 481/481 transitions.
Graph (complete) has 897 edges and 215 vertex of which 212 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 211 transition count 446
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 179 transition count 445
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 66 place count 179 transition count 441
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 74 place count 175 transition count 441
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 93 place count 156 transition count 405
Iterating global reduction 2 with 19 rules applied. Total rules applied 112 place count 156 transition count 405
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 112 place count 156 transition count 402
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 153 transition count 402
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 129 place count 142 transition count 363
Iterating global reduction 2 with 11 rules applied. Total rules applied 140 place count 142 transition count 363
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 145 place count 137 transition count 352
Iterating global reduction 2 with 5 rules applied. Total rules applied 150 place count 137 transition count 352
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 153 place count 134 transition count 343
Iterating global reduction 2 with 3 rules applied. Total rules applied 156 place count 134 transition count 343
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 45 rules applied. Total rules applied 201 place count 110 transition count 322
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 204 place count 110 transition count 319
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 213 place count 101 transition count 298
Iterating global reduction 3 with 9 rules applied. Total rules applied 222 place count 101 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 225 place count 101 transition count 295
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 231 place count 98 transition count 292
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 233 place count 96 transition count 290
Applied a total of 233 rules in 62 ms. Remains 96 /215 variables (removed 119) and now considering 290/481 (removed 191) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2788781611160924683.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16500740432819669307.kers'
[2026-05-25 09:53:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2788781611160924683.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16500740432819669307.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 290 rows 96 cols 1280 entries
Finished phase 1 with 72 SingleSign rule and 5 generalized
[2026-05-25 09:53:22] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16500740432819669307.kers
Total runtime 1 ms.
[2026-05-25 09:53:23] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-25 09:53:23] [INFO ] Invariant cache hit.
[2026-05-25 09:53:23] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-25 09:53:23] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2026-05-25 09:53:23] [INFO ] Redundant transitions in 3 ms returned []
Running 279 sub problems to find dead transitions.
[2026-05-25 09:53:23] [INFO ] Invariant cache hit.
[2026-05-25 09:53:23] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (OVERLAPS) 3/95 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (OVERLAPS) 289/384 variables, 95/114 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 36/150 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 8 (OVERLAPS) 2/386 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 10 (OVERLAPS) 0/386 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 151 constraints, problems are : Problem set: 0 solved, 279 unsolved in 18003 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 279 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (OVERLAPS) 3/95 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (OVERLAPS) 289/384 variables, 95/114 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 36/150 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 278/428 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/384 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 10 (OVERLAPS) 2/386 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/386 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 279 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 386/386 variables, and 431 constraints, problems are : Problem set: 0 solved, 279 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48206ms problems are : Problem set: 0 solved, 279 unsolved
Search for dead transitions found 0 dead transitions in 48210ms
Starting structural reductions in SI_CTL mode, iteration 1 : 96/215 places, 290/481 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48650 ms. Remains : 96/215 places, 290/481 transitions.
[2026-05-25 09:54:11] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:54:11] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:54:11] [INFO ] Input system was already deterministic with 290 transitions.
[2026-05-25 09:54:11] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:54:11] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:54:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality6533216593845142855.gal : 2 ms
[2026-05-25 09:54:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality8214020072063957584.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/CTLCardinality6533216593845142855.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8214020072063957584.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,1.73344e+09,16.2188,410824,2,6672,5,1.47195e+06,6,0,666,1.84209e+06,0


Converting to forward existential form...Done !
original formula: AF(((p131==0)&&(p300==1)))
=> equivalent forward existential formula: [FwdG(Init,!(((p131==0)&&(p300==1))))] = FALSE
Hit Full ! (commute/partial/dont) 286/0/4
(forward)formula 0,0,17.1563,410824,1,0,10,1.47195e+06,20,3,4816,1.84209e+06,8
FORMULA MedleyA-PT-22-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 481/481 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 481
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 26 place count 189 transition count 439
Iterating global reduction 1 with 25 rules applied. Total rules applied 51 place count 189 transition count 439
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 55 place count 189 transition count 435
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 67 place count 177 transition count 392
Iterating global reduction 2 with 12 rules applied. Total rules applied 79 place count 177 transition count 392
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 85 place count 171 transition count 378
Iterating global reduction 2 with 6 rules applied. Total rules applied 91 place count 171 transition count 378
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 94 place count 168 transition count 369
Iterating global reduction 2 with 3 rules applied. Total rules applied 97 place count 168 transition count 369
Applied a total of 97 rules in 45 ms. Remains 168 /215 variables (removed 47) and now considering 369/481 (removed 112) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15722284886154044943.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4785183907677605021.kers'
[2026-05-25 09:54:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15722284886154044943.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4785183907677605021.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 369 rows 168 cols 1979 entries
Finished phase 1 with 138 SingleSign rule and 8 generalized
[2026-05-25 09:54:29] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4785183907677605021.kers
Total runtime 2 ms.
[2026-05-25 09:54:29] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-25 09:54:29] [INFO ] Invariant cache hit.
[2026-05-25 09:54:29] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2026-05-25 09:54:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 1/168 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (OVERLAPS) 369/537 variables, 168/197 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 537/537 variables, and 201 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 1/168 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (OVERLAPS) 369/537 variables, 168/198 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 368/566 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 5/571 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 4/575 constraints. Problems are: Problem set: 0 solved, 368 unsolved
SMT process timed out in 60256ms, After SMT, problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 60257ms
Starting structural reductions in LTL mode, iteration 1 : 168/215 places, 369/481 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60626 ms. Remains : 168/215 places, 369/481 transitions.
[2026-05-25 09:55:29] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:55:29] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:55:29] [INFO ] Input system was already deterministic with 369 transitions.
[2026-05-25 09:55:29] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:55:29] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:55:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality16848684762132204053.gal : 4 ms
[2026-05-25 09:55:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality13332539846770465146.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/CTLCardinality16848684762132204053.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13332539846770465146.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.
Detected timeout of ITS tools.
[2026-05-25 09:55:59] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:55:59] [INFO ] Applying decomposition
[2026-05-25 09:55:59] [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/graph18243073555840562804.txt' '-o' '/tmp/graph18243073555840562804.bin' '-w' '/tmp/graph18243073555840562804.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18243073555840562804.bin' '-l' '-1' '-v' '-w' '/tmp/graph18243073555840562804.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:55:59] [INFO ] Decomposing Gal with order
[2026-05-25 09:55:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:55:59] [INFO ] Removed a total of 623 redundant transitions.
[2026-05-25 09:55:59] [INFO ] Flatten gal took : 24 ms
[2026-05-25 09:55:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 8 ms.
[2026-05-25 09:55:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality432250723143467748.gal : 3 ms
[2026-05-25 09:55:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality1539713817291689856.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/CTLCardinality432250723143467748.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1539713817291689856.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 -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.95545e+11,19.5878,387560,6656,1995,477751,145611,611,1.33968e+06,214,1.04556e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 215/215 places, 481/481 transitions.
Graph (complete) has 897 edges and 215 vertex of which 212 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 211 transition count 443
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 176 transition count 442
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 72 place count 176 transition count 438
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 80 place count 172 transition count 438
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 97 place count 155 transition count 404
Iterating global reduction 2 with 17 rules applied. Total rules applied 114 place count 155 transition count 404
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 114 place count 155 transition count 401
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 120 place count 152 transition count 401
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 130 place count 142 transition count 363
Iterating global reduction 2 with 10 rules applied. Total rules applied 140 place count 142 transition count 363
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 145 place count 137 transition count 352
Iterating global reduction 2 with 5 rules applied. Total rules applied 150 place count 137 transition count 352
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 153 place count 134 transition count 343
Iterating global reduction 2 with 3 rules applied. Total rules applied 156 place count 134 transition count 343
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 202 place count 110 transition count 321
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 205 place count 110 transition count 318
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 214 place count 101 transition count 297
Iterating global reduction 3 with 9 rules applied. Total rules applied 223 place count 101 transition count 297
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 226 place count 101 transition count 294
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 232 place count 98 transition count 291
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 234 place count 96 transition count 289
Applied a total of 234 rules in 60 ms. Remains 96 /215 variables (removed 119) and now considering 289/481 (removed 192) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7024690506492439035.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7899166893876752335.kers'
[2026-05-25 09:56:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7024690506492439035.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7899166893876752335.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 289 rows 96 cols 1284 entries
Finished phase 1 with 70 SingleSign rule and 6 generalized
[2026-05-25 09:56:30] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7899166893876752335.kers
Total runtime 2 ms.
[2026-05-25 09:56:30] [INFO ] Implicit Places using invariants in 74 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 95/215 places, 289/481 transitions.
Applied a total of 0 rules in 5 ms. Remains 95 /95 variables (removed 0) and now considering 289/289 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 145 ms. Remains : 95/215 places, 289/481 transitions.
[2026-05-25 09:56:30] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:56:30] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:56:30] [INFO ] Input system was already deterministic with 289 transitions.
[2026-05-25 09:56:30] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:56:30] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:56:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality8054236371021699409.gal : 2 ms
[2026-05-25 09:56:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality15355620068021356130.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/CTLCardinality8054236371021699409.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15355620068021356130.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,2.51076e+09,16.5353,415516,2,34618,5,1.5059e+06,6,0,661,1.60631e+06,0


Converting to forward existential form...Done !
original formula: EG(((p107==0)||(p190==1)))
=> equivalent forward existential formula: [FwdG(Init,((p107==0)||(p190==1)))] != FALSE
Hit Full ! (commute/partial/dont) 278/0/11
Detected timeout of ITS tools.
[2026-05-25 09:57:00] [INFO ] Flatten gal took : 20 ms
[2026-05-25 09:57:00] [INFO ] Applying decomposition
[2026-05-25 09:57:00] [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/graph13984373679237098109.txt' '-o' '/tmp/graph13984373679237098109.bin' '-w' '/tmp/graph13984373679237098109.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13984373679237098109.bin' '-l' '-1' '-v' '-w' '/tmp/graph13984373679237098109.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:57:00] [INFO ] Decomposing Gal with order
[2026-05-25 09:57:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:57:00] [INFO ] Removed a total of 743 redundant transitions.
[2026-05-25 09:57:00] [INFO ] Flatten gal took : 19 ms
[2026-05-25 09:57:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 6 ms.
[2026-05-25 09:57:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality17306161978791593702.gal : 2 ms
[2026-05-25 09:57:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality14038741900827514182.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/CTLCardinality17306161978791593702.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14038741900827514182.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,2.51076e+09,0.260617,13976,677,32,17601,146,349,46374,43,390,0


Converting to forward existential form...Done !
original formula: EG(((i3.u8.p107==0)||(i4.i1.u17.p190==1)))
=> equivalent forward existential formula: [FwdG(Init,((i3.u8.p107==0)||(i4.i1.u17.p190==1)))] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
(forward)formula 0,1,12.9109,357248,1,0,621816,258,1381,1.17713e+06,169,759,652157
FORMULA MedleyA-PT-22-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 215/215 places, 481/481 transitions.
Graph (complete) has 897 edges and 215 vertex of which 212 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 211 transition count 443
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 176 transition count 442
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 72 place count 176 transition count 438
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 80 place count 172 transition count 438
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 97 place count 155 transition count 405
Iterating global reduction 2 with 17 rules applied. Total rules applied 114 place count 155 transition count 405
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 114 place count 155 transition count 403
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 118 place count 153 transition count 403
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 128 place count 143 transition count 368
Iterating global reduction 2 with 10 rules applied. Total rules applied 138 place count 143 transition count 368
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 143 place count 138 transition count 357
Iterating global reduction 2 with 5 rules applied. Total rules applied 148 place count 138 transition count 357
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 151 place count 135 transition count 348
Iterating global reduction 2 with 3 rules applied. Total rules applied 154 place count 135 transition count 348
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 49 rules applied. Total rules applied 203 place count 109 transition count 325
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 206 place count 109 transition count 322
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 214 place count 101 transition count 304
Iterating global reduction 3 with 8 rules applied. Total rules applied 222 place count 101 transition count 304
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 225 place count 101 transition count 301
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 231 place count 98 transition count 298
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 233 place count 96 transition count 296
Applied a total of 233 rules in 72 ms. Remains 96 /215 variables (removed 119) and now considering 296/481 (removed 185) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1951288141277092462.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7178496473552814873.kers'
[2026-05-25 09:57:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1951288141277092462.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7178496473552814873.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 296 rows 96 cols 1322 entries
Finished phase 1 with 72 SingleSign rule and 5 generalized
[2026-05-25 09:57:13] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7178496473552814873.kers
Total runtime 1 ms.
[2026-05-25 09:57:13] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-25 09:57:13] [INFO ] Invariant cache hit.
[2026-05-25 09:57:13] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-25 09:57:13] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2026-05-25 09:57:13] [INFO ] Redundant transitions in 1 ms returned []
Running 285 sub problems to find dead transitions.
[2026-05-25 09:57:13] [INFO ] Invariant cache hit.
[2026-05-25 09:57:13] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 3/95 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (OVERLAPS) 295/390 variables, 95/115 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 36/151 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 9 (OVERLAPS) 2/392 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 11 (OVERLAPS) 0/392 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 152 constraints, problems are : Problem set: 0 solved, 285 unsolved in 22318 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 3/95 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (OVERLAPS) 295/390 variables, 95/115 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 36/151 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 284/435 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 10 (OVERLAPS) 2/392 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 285 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/392 variables, and 437 constraints, problems are : Problem set: 0 solved, 285 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52479ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 52480ms
Starting structural reductions in SI_CTL mode, iteration 1 : 96/215 places, 296/481 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52865 ms. Remains : 96/215 places, 296/481 transitions.
[2026-05-25 09:58:06] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:58:06] [INFO ] Flatten gal took : 15 ms
[2026-05-25 09:58:06] [INFO ] Input system was already deterministic with 296 transitions.
[2026-05-25 09:58:06] [INFO ] Flatten gal took : 15 ms
[2026-05-25 09:58:06] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:58:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10120312319135932362.gal : 4 ms
[2026-05-25 09:58:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17809880828042424241.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10120312319135932362.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17809880828042424241.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
RANDOM walk for 19661 steps (2044 resets) in 240 ms. (81 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-22-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 215/215 places, 481/481 transitions.
Graph (complete) has 897 edges and 215 vertex of which 214 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 213 transition count 447
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 181 transition count 446
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 66 place count 181 transition count 441
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 76 place count 176 transition count 441
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 91 place count 161 transition count 415
Iterating global reduction 2 with 15 rules applied. Total rules applied 106 place count 161 transition count 415
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 106 place count 161 transition count 412
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 112 place count 158 transition count 412
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 119 place count 151 transition count 390
Iterating global reduction 2 with 7 rules applied. Total rules applied 126 place count 151 transition count 390
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 129 place count 148 transition count 383
Iterating global reduction 2 with 3 rules applied. Total rules applied 132 place count 148 transition count 383
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 133 place count 147 transition count 380
Iterating global reduction 2 with 1 rules applied. Total rules applied 134 place count 147 transition count 380
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 45 rules applied. Total rules applied 179 place count 123 transition count 359
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 182 place count 123 transition count 356
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 191 place count 114 transition count 335
Iterating global reduction 3 with 9 rules applied. Total rules applied 200 place count 114 transition count 335
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 203 place count 114 transition count 332
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 209 place count 111 transition count 329
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 211 place count 109 transition count 327
Applied a total of 211 rules in 50 ms. Remains 109 /215 variables (removed 106) and now considering 327/481 (removed 154) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9253007624386532334.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7935111017842715802.kers'
[2026-05-25 09:58:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9253007624386532334.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7935111017842715802.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 327 rows 109 cols 1411 entries
Finished phase 1 with 85 SingleSign rule and 5 generalized
[2026-05-25 09:58:06] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7935111017842715802.kers
Total runtime 2 ms.
[2026-05-25 09:58:06] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-25 09:58:06] [INFO ] Invariant cache hit.
[2026-05-25 09:58:06] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-25 09:58:06] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2026-05-25 09:58:06] [INFO ] Redundant transitions in 3 ms returned []
Running 318 sub problems to find dead transitions.
[2026-05-25 09:58:06] [INFO ] Invariant cache hit.
[2026-05-25 09:58:06] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (OVERLAPS) 3/107 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (OVERLAPS) 326/433 variables, 107/128 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 36/164 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 9 (OVERLAPS) 3/436 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/436 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 11 (OVERLAPS) 0/436 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 166 constraints, problems are : Problem set: 0 solved, 318 unsolved in 29730 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 109/109 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 318 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 3/107 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (OVERLAPS) 326/433 variables, 107/128 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 36/164 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 316/480 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 10 (OVERLAPS) 3/436 variables, 2/482 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/436 variables, 2/484 constraints. Problems are: Problem set: 0 solved, 318 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 436/436 variables, and 484 constraints, problems are : Problem set: 0 solved, 318 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 109/109 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59923ms problems are : Problem set: 0 solved, 318 unsolved
Search for dead transitions found 0 dead transitions in 59925ms
Starting structural reductions in SI_CTL mode, iteration 1 : 109/215 places, 327/481 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60241 ms. Remains : 109/215 places, 327/481 transitions.
[2026-05-25 09:59:06] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:59:06] [INFO ] Flatten gal took : 17 ms
[2026-05-25 09:59:06] [INFO ] Input system was already deterministic with 327 transitions.
[2026-05-25 09:59:06] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:59:06] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:59:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality18221076141088655476.gal : 4 ms
[2026-05-25 09:59:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality12045495945906537573.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/CTLCardinality18221076141088655476.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12045495945906537573.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.
Detected timeout of ITS tools.
[2026-05-25 09:59:36] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:59:36] [INFO ] Applying decomposition
[2026-05-25 09:59:36] [INFO ] Flatten gal took : 6 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/graph5911280270283585476.txt' '-o' '/tmp/graph5911280270283585476.bin' '-w' '/tmp/graph5911280270283585476.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5911280270283585476.bin' '-l' '-1' '-v' '-w' '/tmp/graph5911280270283585476.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:59:36] [INFO ] Decomposing Gal with order
[2026-05-25 09:59:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:59:36] [INFO ] Removed a total of 786 redundant transitions.
[2026-05-25 09:59:36] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:59:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 4 ms.
[2026-05-25 09:59:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality7829210841496937086.gal : 1 ms
[2026-05-25 09:59:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality10889326952733238103.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/CTLCardinality7829210841496937086.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10889326952733238103.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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.3423e+09,18.4375,408420,3736,378,615337,4706,374,1.99522e+06,140,71845,0


Converting to forward existential form...Done !
original formula: EF((EG(((i1.u6.p60==0)||(i1.u6.p74==1))) + (EG(AF(((i5.u22.p279!=0)&&(i2.u13.p172!=1)))) * ((AF((i0.u3.p51==1)) + (i2.u13.p166==0)) + EG(...176
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),((i1.u6.p60==0)||(i1.u6.p74==1)))] != FALSE + (([((FwdU(Init,TRUE) * EG(!(EG(!(((i5.u22.p...439
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
(forward)formula 0,1,22.851,408444,1,0,615337,12562,1665,1.99522e+06,574,157552,273319
FORMULA MedleyA-PT-22-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 481/481 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 481
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 29 place count 186 transition count 436
Iterating global reduction 1 with 28 rules applied. Total rules applied 57 place count 186 transition count 436
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 62 place count 186 transition count 431
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 75 place count 173 transition count 387
Iterating global reduction 2 with 13 rules applied. Total rules applied 88 place count 173 transition count 387
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 94 place count 167 transition count 372
Iterating global reduction 2 with 6 rules applied. Total rules applied 100 place count 167 transition count 372
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 103 place count 164 transition count 363
Iterating global reduction 2 with 3 rules applied. Total rules applied 106 place count 164 transition count 363
Applied a total of 106 rules in 25 ms. Remains 164 /215 variables (removed 51) and now considering 363/481 (removed 118) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8822858893255031884.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15740753237213244849.kers'
[2026-05-25 09:59:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8822858893255031884.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15740753237213244849.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 363 rows 164 cols 1967 entries
Finished phase 1 with 134 SingleSign rule and 8 generalized
[2026-05-25 09:59:59] [INFO ] Computed 22 invariants in 4 ms
Computed 22 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-15740753237213244849.kers
Total runtime 6 ms.
[2026-05-25 10:00:00] [INFO ] Implicit Places using invariants in 195 ms returned []
[2026-05-25 10:00:00] [INFO ] Invariant cache hit.
[2026-05-25 10:00:00] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Running 362 sub problems to find dead transitions.
[2026-05-25 10:00:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (OVERLAPS) 363/527 variables, 164/192 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/527 variables, 3/196 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 527/527 variables, and 196 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (OVERLAPS) 363/527 variables, 164/193 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 362/555 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/527 variables, 2/557 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 527/527 variables, and 560 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/3 constraints]
After SMT, in 60295ms problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 60297ms
Starting structural reductions in LTL mode, iteration 1 : 164/215 places, 363/481 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60801 ms. Remains : 164/215 places, 363/481 transitions.
[2026-05-25 10:01:00] [INFO ] Flatten gal took : 16 ms
[2026-05-25 10:01:00] [INFO ] Flatten gal took : 14 ms
[2026-05-25 10:01:00] [INFO ] Input system was already deterministic with 363 transitions.
[2026-05-25 10:01:00] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:01:00] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:01:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality7043108988997856165.gal : 2 ms
[2026-05-25 10:01:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality9854563795595046661.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/CTLCardinality7043108988997856165.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9854563795595046661.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.
Detected timeout of ITS tools.
[2026-05-25 10:01:30] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:01:30] [INFO ] Applying decomposition
[2026-05-25 10:01:30] [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/graph16448647307325915317.txt' '-o' '/tmp/graph16448647307325915317.bin' '-w' '/tmp/graph16448647307325915317.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16448647307325915317.bin' '-l' '-1' '-v' '-w' '/tmp/graph16448647307325915317.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:01:30] [INFO ] Decomposing Gal with order
[2026-05-25 10:01:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:01:30] [INFO ] Removed a total of 569 redundant transitions.
[2026-05-25 10:01:30] [INFO ] Flatten gal took : 32 ms
[2026-05-25 10:01:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 3 ms.
[2026-05-25 10:01:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality12522031859571093634.gal : 2 ms
[2026-05-25 10:01:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality1810138814581494590.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/CTLCardinality12522031859571093634.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1810138814581494590.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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40664e+11,23.7788,501276,6496,2396,618243,135198,547,2.03559e+06,212,1.5747e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 481/481 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 481
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 30 place count 185 transition count 435
Iterating global reduction 1 with 29 rules applied. Total rules applied 59 place count 185 transition count 435
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 64 place count 185 transition count 430
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 78 place count 171 transition count 383
Iterating global reduction 2 with 14 rules applied. Total rules applied 92 place count 171 transition count 383
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 99 place count 164 transition count 366
Iterating global reduction 2 with 7 rules applied. Total rules applied 106 place count 164 transition count 366
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 110 place count 160 transition count 354
Iterating global reduction 2 with 4 rules applied. Total rules applied 114 place count 160 transition count 354
Applied a total of 114 rules in 21 ms. Remains 160 /215 variables (removed 55) and now considering 354/481 (removed 127) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15428850571038635128.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11162840387809835958.kers'
[2026-05-25 10:02:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15428850571038635128.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11162840387809835958.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 354 rows 160 cols 1945 entries
Finished phase 1 with 130 SingleSign rule and 8 generalized
[2026-05-25 10:02:00] [INFO ] Computed 22 invariants in 4 ms
Computed 22 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-11162840387809835958.kers
Total runtime 6 ms.
[2026-05-25 10:02:01] [INFO ] Implicit Places using invariants in 189 ms returned []
[2026-05-25 10:02:01] [INFO ] Invariant cache hit.
[2026-05-25 10:02:01] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Running 353 sub problems to find dead transitions.
[2026-05-25 10:02:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (OVERLAPS) 1/160 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (OVERLAPS) 354/514 variables, 160/188 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/514 variables, and 192 constraints, problems are : Problem set: 0 solved, 353 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 353/353 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 353 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (OVERLAPS) 1/160 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (OVERLAPS) 354/514 variables, 160/189 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 353/542 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 2/544 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/514 variables, and 548 constraints, problems are : Problem set: 0 solved, 353 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 353/353 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/3 constraints]
After SMT, in 60346ms problems are : Problem set: 0 solved, 353 unsolved
Search for dead transitions found 0 dead transitions in 60347ms
Starting structural reductions in LTL mode, iteration 1 : 160/215 places, 354/481 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60828 ms. Remains : 160/215 places, 354/481 transitions.
[2026-05-25 10:03:01] [INFO ] Flatten gal took : 18 ms
[2026-05-25 10:03:01] [INFO ] Flatten gal took : 19 ms
[2026-05-25 10:03:01] [INFO ] Input system was already deterministic with 354 transitions.
[2026-05-25 10:03:01] [INFO ] Flatten gal took : 14 ms
[2026-05-25 10:03:01] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:03:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality928029755919282175.gal : 3 ms
[2026-05-25 10:03:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality14231975485482702442.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/CTLCardinality928029755919282175.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14231975485482702442.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.
Detected timeout of ITS tools.
[2026-05-25 10:03:31] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:03:31] [INFO ] Applying decomposition
[2026-05-25 10:03:31] [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/graph2351600966078956604.txt' '-o' '/tmp/graph2351600966078956604.bin' '-w' '/tmp/graph2351600966078956604.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2351600966078956604.bin' '-l' '-1' '-v' '-w' '/tmp/graph2351600966078956604.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:03:32] [INFO ] Decomposing Gal with order
[2026-05-25 10:03:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:03:32] [INFO ] Removed a total of 662 redundant transitions.
[2026-05-25 10:03:32] [INFO ] Flatten gal took : 23 ms
[2026-05-25 10:03:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 3 ms.
[2026-05-25 10:03:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality7477118509677754570.gal : 2 ms
[2026-05-25 10:03:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality17675087169084795560.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/CTLCardinality7477118509677754570.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17675087169084795560.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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.70872e+10,4.24567,121052,3149,640,181658,19371,532,405365,166,195680,0


Converting to forward existential form...Done !
original formula: EX(AG(AF((EX(((i9.u34.p221==0)||(i2.i0.u7.p45==1))) * EX((i6.u24.p139==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!(EG(!((EX(((i9.u34.p221==0)||(i2.i0.u7.p45==1))) * EX((i6.u24.p139==1))))))))))] != F...159
Reverse transition relation is NOT exact ! Due to transitions t20, t59, t97, t135, t139, t148, t170, t186, t190, t196, t202, u18.t58, u18.t60, u18.t61, u18...1037
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 215/215 places, 481/481 transitions.
Graph (complete) has 897 edges and 215 vertex of which 212 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 211 transition count 448
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 34 rules applied. Total rules applied 65 place count 181 transition count 444
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 68 place count 178 transition count 444
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 68 place count 178 transition count 441
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 74 place count 175 transition count 441
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 90 place count 159 transition count 413
Iterating global reduction 3 with 16 rules applied. Total rules applied 106 place count 159 transition count 413
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 106 place count 159 transition count 410
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 112 place count 156 transition count 410
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 121 place count 147 transition count 377
Iterating global reduction 3 with 9 rules applied. Total rules applied 130 place count 147 transition count 377
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 134 place count 143 transition count 369
Iterating global reduction 3 with 4 rules applied. Total rules applied 138 place count 143 transition count 369
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 141 place count 140 transition count 360
Iterating global reduction 3 with 3 rules applied. Total rules applied 144 place count 140 transition count 360
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 45 rules applied. Total rules applied 189 place count 116 transition count 339
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 192 place count 116 transition count 336
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 199 place count 109 transition count 321
Iterating global reduction 4 with 7 rules applied. Total rules applied 206 place count 109 transition count 321
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 209 place count 109 transition count 318
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 215 place count 106 transition count 315
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 217 place count 104 transition count 313
Applied a total of 217 rules in 76 ms. Remains 104 /215 variables (removed 111) and now considering 313/481 (removed 168) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17897937949467599882.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9562667179528349430.kers'
[2026-05-25 10:04:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17897937949467599882.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9562667179528349430.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 313 rows 104 cols 1353 entries
Finished phase 1 with 80 SingleSign rule and 5 generalized
[2026-05-25 10:04:02] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9562667179528349430.kers
Total runtime 3 ms.
[2026-05-25 10:04:02] [INFO ] Implicit Places using invariants in 132 ms returned []
[2026-05-25 10:04:02] [INFO ] Invariant cache hit.
[2026-05-25 10:04:02] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-25 10:04:02] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2026-05-25 10:04:02] [INFO ] Redundant transitions in 1 ms returned []
Running 303 sub problems to find dead transitions.
[2026-05-25 10:04:02] [INFO ] Invariant cache hit.
[2026-05-25 10:04:02] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (OVERLAPS) 3/103 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (OVERLAPS) 313/416 variables, 103/122 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 36/158 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (OVERLAPS) 1/417 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 10 (OVERLAPS) 0/417 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 159 constraints, problems are : Problem set: 0 solved, 303 unsolved in 24603 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 104/104 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (OVERLAPS) 3/103 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (OVERLAPS) 313/416 variables, 103/122 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 36/158 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 302/460 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (OVERLAPS) 1/417 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 1/462 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 417/417 variables, and 462 constraints, problems are : Problem set: 0 solved, 303 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 104/104 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54793ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 54795ms
Starting structural reductions in SI_CTL mode, iteration 1 : 104/215 places, 313/481 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55177 ms. Remains : 104/215 places, 313/481 transitions.
[2026-05-25 10:04:57] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:04:57] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:04:57] [INFO ] Input system was already deterministic with 313 transitions.
[2026-05-25 10:04:57] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:04:57] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:04:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality2747022207885462230.gal : 1 ms
[2026-05-25 10:04:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality12622105429837678758.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/CTLCardinality2747022207885462230.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12622105429837678758.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.
Detected timeout of ITS tools.
[2026-05-25 10:05:27] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:05:27] [INFO ] Applying decomposition
[2026-05-25 10:05:27] [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/graph8892035962599241990.txt' '-o' '/tmp/graph8892035962599241990.bin' '-w' '/tmp/graph8892035962599241990.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8892035962599241990.bin' '-l' '-1' '-v' '-w' '/tmp/graph8892035962599241990.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:05:27] [INFO ] Decomposing Gal with order
[2026-05-25 10:05:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:05:27] [INFO ] Removed a total of 762 redundant transitions.
[2026-05-25 10:05:27] [INFO ] Flatten gal took : 30 ms
[2026-05-25 10:05:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 3 ms.
[2026-05-25 10:05:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality17724350341181168518.gal : 2 ms
[2026-05-25 10:05:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality11440784122560331665.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/CTLCardinality17724350341181168518.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11440784122560331665.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,4.58648e+09,10.2816,215660,2115,201,304502,2275,401,1.13304e+06,106,15227,0


Converting to forward existential form...Done !
original formula: EF(EG(((i1.u7.p67==0) * ((A((((i4.i1.u21.p234==1)||(i4.i0.u23.p261==0))||(i5.u24.p292==1)) U E((i1.u7.p80==1) U (i3.u8.p101==1))) + (i1.u...191
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((i1.u7.p67==0) * ((!((E(!(E((i1.u7.p80==1) U (i3.u8.p101==1))) U (!((((i4.i1.u21.p234==1)...340
Reverse transition relation is NOT exact ! Due to transitions t15, t21, t72, t206, t225, t233, t268, t297, i0.t76, i0.t66, i0.t61, i0.u1.t45, i0.u2.t67, i0...1015
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 481/481 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 481
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 26 place count 189 transition count 443
Iterating global reduction 1 with 25 rules applied. Total rules applied 51 place count 189 transition count 443
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 55 place count 189 transition count 439
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 66 place count 178 transition count 402
Iterating global reduction 2 with 11 rules applied. Total rules applied 77 place count 178 transition count 402
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 81 place count 174 transition count 393
Iterating global reduction 2 with 4 rules applied. Total rules applied 85 place count 174 transition count 393
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 87 place count 172 transition count 387
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 172 transition count 387
Applied a total of 89 rules in 11 ms. Remains 172 /215 variables (removed 43) and now considering 387/481 (removed 94) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16807607682038365806.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6795159916293049232.kers'
[2026-05-25 10:05:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16807607682038365806.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6795159916293049232.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 387 rows 172 cols 2051 entries
Finished phase 1 with 142 SingleSign rule and 8 generalized
[2026-05-25 10:05:57] [INFO ] Computed 22 invariants in 10 ms
Computed 22 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-6795159916293049232.kers
Total runtime 15 ms.
[2026-05-25 10:05:57] [INFO ] Implicit Places using invariants in 112 ms returned []
[2026-05-25 10:05:57] [INFO ] Invariant cache hit.
[2026-05-25 10:05:58] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Running 386 sub problems to find dead transitions.
[2026-05-25 10:05:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (OVERLAPS) 1/172 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 5 (OVERLAPS) 387/559 variables, 172/203 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/559 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 559/559 variables, and 207 constraints, problems are : Problem set: 0 solved, 386 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 386/386 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (OVERLAPS) 1/172 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 5 (OVERLAPS) 387/559 variables, 172/205 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/559 variables, 386/591 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/559 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/559 variables, 2/594 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 559/559 variables, and 594 constraints, problems are : Problem set: 0 solved, 386 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 386/386 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60286ms problems are : Problem set: 0 solved, 386 unsolved
Search for dead transitions found 0 dead transitions in 60287ms
Starting structural reductions in LTL mode, iteration 1 : 172/215 places, 387/481 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60629 ms. Remains : 172/215 places, 387/481 transitions.
[2026-05-25 10:06:58] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:06:58] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:06:58] [INFO ] Input system was already deterministic with 387 transitions.
[2026-05-25 10:06:58] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:06:58] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:06:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality4364501258284552403.gal : 2 ms
[2026-05-25 10:06:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality6096864579324525080.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/CTLCardinality4364501258284552403.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6096864579324525080.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.
Detected timeout of ITS tools.
[2026-05-25 10:07:28] [INFO ] Flatten gal took : 17 ms
[2026-05-25 10:07:28] [INFO ] Applying decomposition
[2026-05-25 10:07:28] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16655226829556521960.txt' '-o' '/tmp/graph16655226829556521960.bin' '-w' '/tmp/graph16655226829556521960.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16655226829556521960.bin' '-l' '-1' '-v' '-w' '/tmp/graph16655226829556521960.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:07:28] [INFO ] Decomposing Gal with order
[2026-05-25 10:07:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:07:28] [INFO ] Removed a total of 623 redundant transitions.
[2026-05-25 10:07:28] [INFO ] Flatten gal took : 27 ms
[2026-05-25 10:07:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 75 labels/synchronizations in 4 ms.
[2026-05-25 10:07:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality10592895413940218457.gal : 3 ms
[2026-05-25 10:07:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality10283346352857775838.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/CTLCardinality10592895413940218457.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10283346352857775838.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,2.49236e+11,17.4192,359448,5406,1713,463012,76372,522,1.48033e+06,223,671618,0


Converting to forward existential form...Done !
original formula: AX(EF((EG((u3.p68==1)) * (EX(((i3.u14.p115==0)&&(u3.p82==1))) + E(EF(((i7.i1.u41.p293==0)||(i3.u26.p156==1))) U !(((i3.u25.p170==0)||(u29...171
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (EG((u3.p68==1)) * (EX(((i3.u14.p115==0)&&(u3.p82==1))) + E(E(TRUE U ((i7.i1.u41.p293==0...230
Reverse transition relation is NOT exact ! Due to transitions t1, t20, t64, t112, t151, t158, t171, t173, t185, t195, t204, t205, t211, t215, t225, t240, t...1391
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 215/215 places, 481/481 transitions.
Graph (complete) has 897 edges and 215 vertex of which 212 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 211 transition count 443
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 176 transition count 442
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 72 place count 176 transition count 438
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 80 place count 172 transition count 438
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 98 place count 154 transition count 403
Iterating global reduction 2 with 18 rules applied. Total rules applied 116 place count 154 transition count 403
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 116 place count 154 transition count 401
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 120 place count 152 transition count 401
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 131 place count 141 transition count 362
Iterating global reduction 2 with 11 rules applied. Total rules applied 142 place count 141 transition count 362
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 147 place count 136 transition count 351
Iterating global reduction 2 with 5 rules applied. Total rules applied 152 place count 136 transition count 351
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 155 place count 133 transition count 342
Iterating global reduction 2 with 3 rules applied. Total rules applied 158 place count 133 transition count 342
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 49 rules applied. Total rules applied 207 place count 107 transition count 319
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 210 place count 107 transition count 316
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 219 place count 98 transition count 295
Iterating global reduction 3 with 9 rules applied. Total rules applied 228 place count 98 transition count 295
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 231 place count 98 transition count 292
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 237 place count 95 transition count 289
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 239 place count 93 transition count 287
Applied a total of 239 rules in 53 ms. Remains 93 /215 variables (removed 122) and now considering 287/481 (removed 194) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18200055814988780421.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5172537702200595384.kers'
[2026-05-25 10:07:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18200055814988780421.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5172537702200595384.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 287 rows 93 cols 1290 entries
Finished phase 1 with 69 SingleSign rule and 5 generalized
[2026-05-25 10:07:58] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5172537702200595384.kers
Total runtime 1 ms.
[2026-05-25 10:07:58] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-25 10:07:58] [INFO ] Invariant cache hit.
[2026-05-25 10:07:58] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-25 10:07:58] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2026-05-25 10:07:58] [INFO ] Redundant transitions in 2 ms returned []
Running 276 sub problems to find dead transitions.
[2026-05-25 10:07:58] [INFO ] Invariant cache hit.
[2026-05-25 10:07:59] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 3/92 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (OVERLAPS) 286/378 variables, 92/111 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 36/147 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (OVERLAPS) 2/380 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 10 (OVERLAPS) 0/380 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 148 constraints, problems are : Problem set: 0 solved, 276 unsolved in 16946 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 3/92 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (OVERLAPS) 286/378 variables, 92/111 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 36/147 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 275/422 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 9 (OVERLAPS) 2/380 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 424 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47081ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 47082ms
Starting structural reductions in SI_CTL mode, iteration 1 : 93/215 places, 287/481 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47454 ms. Remains : 93/215 places, 287/481 transitions.
[2026-05-25 10:08:46] [INFO ] Flatten gal took : 14 ms
[2026-05-25 10:08:46] [INFO ] Flatten gal took : 9 ms
[2026-05-25 10:08:46] [INFO ] Input system was already deterministic with 287 transitions.
[2026-05-25 10:08:46] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:08:46] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:08:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality2504005681244751262.gal : 2 ms
[2026-05-25 10:08:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality2153963678908882048.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/CTLCardinality2504005681244751262.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2153963678908882048.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,1.85508e+09,5.28149,143164,2,7305,5,539150,6,0,652,584584,0


Converting to forward existential form...Done !
original formula: AG(EF((p209==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p209==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t12, t13, t14, t19, t21, t22, t32, t33, t34, t40, t41, t52, t53, t54, t69, t71, t...264
(forward)formula 0,1,10.6608,204084,1,0,394,1.04218e+06,595,118,6874,664535,587
FORMULA MedleyA-PT-22-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 481/481 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 481
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 29 place count 186 transition count 436
Iterating global reduction 1 with 28 rules applied. Total rules applied 57 place count 186 transition count 436
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 61 place count 186 transition count 432
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 74 place count 173 transition count 388
Iterating global reduction 2 with 13 rules applied. Total rules applied 87 place count 173 transition count 388
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 94 place count 166 transition count 371
Iterating global reduction 2 with 7 rules applied. Total rules applied 101 place count 166 transition count 371
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 105 place count 162 transition count 359
Iterating global reduction 2 with 4 rules applied. Total rules applied 109 place count 162 transition count 359
Applied a total of 109 rules in 8 ms. Remains 162 /215 variables (removed 53) and now considering 359/481 (removed 122) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6360474325864816003.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-363079611351609474.kers'
[2026-05-25 10:08:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6360474325864816003.kers, --Pflows, --basisKERS=/tmp/petrispot-output-363079611351609474.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 359 rows 162 cols 1955 entries
Finished phase 1 with 132 SingleSign rule and 8 generalized
[2026-05-25 10:08:56] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-363079611351609474.kers
Total runtime 2 ms.
[2026-05-25 10:08:57] [INFO ] Implicit Places using invariants in 123 ms returned []
[2026-05-25 10:08:57] [INFO ] Invariant cache hit.
[2026-05-25 10:08:57] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 358 sub problems to find dead transitions.
[2026-05-25 10:08:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 5 (OVERLAPS) 359/521 variables, 162/190 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/521 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 521/521 variables, and 193 constraints, problems are : Problem set: 0 solved, 358 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 358/358 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 358 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 5 (OVERLAPS) 359/521 variables, 162/191 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/521 variables, 358/549 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 2/551 constraints. Problems are: Problem set: 0 solved, 358 unsolved
SMT process timed out in 60216ms, After SMT, problems are : Problem set: 0 solved, 358 unsolved
Search for dead transitions found 0 dead transitions in 60218ms
Starting structural reductions in LTL mode, iteration 1 : 162/215 places, 359/481 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60565 ms. Remains : 162/215 places, 359/481 transitions.
[2026-05-25 10:09:57] [INFO ] Flatten gal took : 19 ms
[2026-05-25 10:09:57] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:09:57] [INFO ] Input system was already deterministic with 359 transitions.
[2026-05-25 10:09:57] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:09:57] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:09:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality6638409329144104536.gal : 3 ms
[2026-05-25 10:09:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality4522404599805252748.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/CTLCardinality6638409329144104536.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4522404599805252748.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.
Detected timeout of ITS tools.
[2026-05-25 10:10:27] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:10:27] [INFO ] Applying decomposition
[2026-05-25 10:10:27] [INFO ] Flatten gal took : 6 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/graph11763818699489310786.txt' '-o' '/tmp/graph11763818699489310786.bin' '-w' '/tmp/graph11763818699489310786.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11763818699489310786.bin' '-l' '-1' '-v' '-w' '/tmp/graph11763818699489310786.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:10:27] [INFO ] Decomposing Gal with order
[2026-05-25 10:10:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:10:27] [INFO ] Removed a total of 717 redundant transitions.
[2026-05-25 10:10:27] [INFO ] Flatten gal took : 33 ms
[2026-05-25 10:10:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 4 ms.
[2026-05-25 10:10:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality13347290943936216477.gal : 2 ms
[2026-05-25 10:10:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality16523566922348001395.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/CTLCardinality13347290943936216477.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16523566922348001395.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,1.1543e+11,4.15084,118588,3009,743,162413,7964,544,656641,140,63959,0


Converting to forward existential form...Done !
original formula: AX(EF(AG((i5.u27.p153!=1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(TRUE U !((i5.u27.p153!=1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t20, t59, t102, t135, t144, t153, t155, t165, t201, t203, i1.u14.t101, i1.u14.t103, i1.u1...1118
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 481/481 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 481
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 28 place count 187 transition count 438
Iterating global reduction 1 with 27 rules applied. Total rules applied 55 place count 187 transition count 438
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 60 place count 187 transition count 433
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 73 place count 174 transition count 390
Iterating global reduction 2 with 13 rules applied. Total rules applied 86 place count 174 transition count 390
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 92 place count 168 transition count 376
Iterating global reduction 2 with 6 rules applied. Total rules applied 98 place count 168 transition count 376
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 102 place count 164 transition count 364
Iterating global reduction 2 with 4 rules applied. Total rules applied 106 place count 164 transition count 364
Applied a total of 106 rules in 18 ms. Remains 164 /215 variables (removed 51) and now considering 364/481 (removed 117) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14523787066324352802.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9277978482306531858.kers'
[2026-05-25 10:10:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14523787066324352802.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9277978482306531858.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 364 rows 164 cols 1981 entries
Finished phase 1 with 134 SingleSign rule and 8 generalized
[2026-05-25 10:10:57] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9277978482306531858.kers
Total runtime 2 ms.
[2026-05-25 10:10:57] [INFO ] Implicit Places using invariants in 82 ms returned []
[2026-05-25 10:10:57] [INFO ] Invariant cache hit.
[2026-05-25 10:10:58] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2026-05-25 10:10:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (OVERLAPS) 364/528 variables, 164/193 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/528 variables, and 199 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (OVERLAPS) 364/528 variables, 164/197 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 363/560 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 4/564 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/528 variables, and 570 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/2 constraints]
After SMT, in 60254ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60255ms
Starting structural reductions in LTL mode, iteration 1 : 164/215 places, 364/481 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60598 ms. Remains : 164/215 places, 364/481 transitions.
[2026-05-25 10:11:58] [INFO ] Flatten gal took : 18 ms
[2026-05-25 10:11:58] [INFO ] Flatten gal took : 14 ms
[2026-05-25 10:11:58] [INFO ] Input system was already deterministic with 364 transitions.
[2026-05-25 10:11:58] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:11:58] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:11:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality4177052821336531677.gal : 2 ms
[2026-05-25 10:11:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality13430162158435804804.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/CTLCardinality4177052821336531677.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13430162158435804804.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.
Detected timeout of ITS tools.
[2026-05-25 10:12:28] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:12:28] [INFO ] Applying decomposition
[2026-05-25 10:12:28] [INFO ] Flatten gal took : 6 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/graph2489615653481464697.txt' '-o' '/tmp/graph2489615653481464697.bin' '-w' '/tmp/graph2489615653481464697.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2489615653481464697.bin' '-l' '-1' '-v' '-w' '/tmp/graph2489615653481464697.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:12:28] [INFO ] Decomposing Gal with order
[2026-05-25 10:12:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:12:28] [INFO ] Removed a total of 653 redundant transitions.
[2026-05-25 10:12:28] [INFO ] Flatten gal took : 15 ms
[2026-05-25 10:12:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 102 labels/synchronizations in 3 ms.
[2026-05-25 10:12:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality9191477705561788227.gal : 2 ms
[2026-05-25 10:12:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality14289654732583788943.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/CTLCardinality9191477705561788227.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14289654732583788943.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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40074e+11,10.727,248216,4130,1589,312230,43353,565,963804,181,458723,0


Converting to forward existential form...Done !
original formula: AX(AF(!(A((i6.u39.p241==1) U ((i8.u3.p25==0)||(i2.i2.u40.p298==1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(!(!((E(!(((i8.u3.p25==0)||(i2.i2.u40.p298==1))) U (!((i6.u39.p241==1)) * !(((i8.u3.p25==0)||(i2...236
Reverse transition relation is NOT exact ! Due to transitions t1, t20, t64, t102, t141, t149, t171, t187, t189, t208, t280, t281, t285, t286, t298, t299, t...1218
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2026-05-25 10:12:58] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:12:58] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:12:58] [INFO ] Applying decomposition
[2026-05-25 10:12:58] [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/graph16862887030610978028.txt' '-o' '/tmp/graph16862887030610978028.bin' '-w' '/tmp/graph16862887030610978028.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16862887030610978028.bin' '-l' '-1' '-v' '-w' '/tmp/graph16862887030610978028.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:12:58] [INFO ] Decomposing Gal with order
[2026-05-25 10:12:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:12:58] [INFO ] Removed a total of 818 redundant transitions.
[2026-05-25 10:12:58] [INFO ] Flatten gal took : 22 ms
[2026-05-25 10:12:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 125 labels/synchronizations in 4 ms.
[2026-05-25 10:12:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality10036329067159104345.gal : 3 ms
[2026-05-25 10:12:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality15107033450713708434.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/CTLCardinality10036329067159104345.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15107033450713708434.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 8 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.81098e+12,1593.99,11169292,50852,28365,5.38253e+06,9.28658e+06,803,5.35782e+07,322,1.12283e+08,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 10:41:33] [INFO ] Applying decomposition
[2026-05-25 10:41:33] [INFO ] Flatten gal took : 10 ms
[2026-05-25 10:41:33] [INFO ] Decomposing Gal with order
[2026-05-25 10:41:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:41:33] [INFO ] Removed a total of 852 redundant transitions.
[2026-05-25 10:41:33] [INFO ] Flatten gal took : 24 ms
[2026-05-25 10:41:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 191 labels/synchronizations in 5 ms.
[2026-05-25 10:41:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality17706252276811431375.gal : 2 ms
[2026-05-25 10:41:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality9565208582756954470.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/CTLCardinality17706252276811431375.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9565208582756954470.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 -...263
No direction supplied, using forward translation only.
Parsed 8 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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="MedleyA-PT-22"
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 MedleyA-PT-22, 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 r178-oct2-177969020000265"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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