Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r050-smll-177946901000073.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is Champagne-PT-H07T0R, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r050-smll-177946901000073
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.9K Mar 6 10:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Mar 6 10:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 6 10:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 6 10:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 6 10:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Mar 6 10:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Mar 6 10:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 6 10:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 169K 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 Champagne-PT-H07T0R-CTLCardinality-2024-00
FORMULA_NAME Champagne-PT-H07T0R-CTLCardinality-2024-01
FORMULA_NAME Champagne-PT-H07T0R-CTLCardinality-2024-02
FORMULA_NAME Champagne-PT-H07T0R-CTLCardinality-2024-03
FORMULA_NAME Champagne-PT-H07T0R-CTLCardinality-2024-04
FORMULA_NAME Champagne-PT-H07T0R-CTLCardinality-2024-05
FORMULA_NAME Champagne-PT-H07T0R-CTLCardinality-2024-06
FORMULA_NAME Champagne-PT-H07T0R-CTLCardinality-2024-07
FORMULA_NAME Champagne-PT-H07T0R-CTLCardinality-2024-08
FORMULA_NAME Champagne-PT-H07T0R-CTLCardinality-2024-09
FORMULA_NAME Champagne-PT-H07T0R-CTLCardinality-2024-10
FORMULA_NAME Champagne-PT-H07T0R-CTLCardinality-2024-11
FORMULA_NAME Champagne-PT-H07T0R-CTLCardinality-2024-12
FORMULA_NAME Champagne-PT-H07T0R-CTLCardinality-2024-13
FORMULA_NAME Champagne-PT-H07T0R-CTLCardinality-2024-14
FORMULA_NAME Champagne-PT-H07T0R-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779499757980

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H07T0R
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-23 01:29:20] [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-23 01:29:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 01:29:20] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2026-05-23 01:29:20] [INFO ] Transformed 539 places.
[2026-05-23 01:29:20] [INFO ] Transformed 742 transitions.
[2026-05-23 01:29:20] [INFO ] Found NUPN structural information;
[2026-05-23 01:29:20] [INFO ] Parsed PT model containing 539 places and 742 transitions and 1934 arcs in 356 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Champagne-PT-H07T0R-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H07T0R-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 122 out of 539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 539/539 places, 742/742 transitions.
Discarding 103 places :
Symmetric choice reduction at 0 with 103 rule applications. Total rules 103 place count 436 transition count 639
Iterating global reduction 0 with 103 rules applied. Total rules applied 206 place count 436 transition count 639
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 243 place count 399 transition count 602
Iterating global reduction 0 with 37 rules applied. Total rules applied 280 place count 399 transition count 602
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 295 place count 384 transition count 579
Iterating global reduction 0 with 15 rules applied. Total rules applied 310 place count 384 transition count 579
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 313 place count 384 transition count 576
Applied a total of 313 rules in 163 ms. Remains 384 /539 variables (removed 155) and now considering 576/742 (removed 166) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11257199889739003787.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-538763864625504807.kers'
[2026-05-23 01:29:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11257199889739003787.kers, --Pflows, --basisKERS=/tmp/petrispot-output-538763864625504807.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 576 rows 384 cols 1580 entries
Finished phase 1 with 357 SingleSign rule and 0 generalized
[2026-05-23 01:29:20] [INFO ] Computed 27 invariants in 4 ms
Computed 27 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-538763864625504807.kers
Total runtime 6 ms.
[2026-05-23 01:29:21] [INFO ] Implicit Places using invariants in 1018 ms returned []
[2026-05-23 01:29:21] [INFO ] Invariant cache hit.
[2026-05-23 01:29:22] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 1587 ms to find 0 implicit places.
Running 575 sub problems to find dead transitions.
[2026-05-23 01:29:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/383 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 1 (OVERLAPS) 1/384 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 15/42 constraints. Problems are: Problem set: 0 solved, 575 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/960 variables, and 42 constraints, problems are : Problem set: 0 solved, 575 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/384 constraints, PredecessorRefiner: 575/575 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 575 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/383 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 1 (OVERLAPS) 1/384 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 15/42 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 5 (OVERLAPS) 576/960 variables, 384/427 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/960 variables, 575/1002 constraints. Problems are: Problem set: 0 solved, 575 unsolved
SMT process timed out in 60453ms, After SMT, problems are : Problem set: 0 solved, 575 unsolved
Search for dead transitions found 0 dead transitions in 60490ms
Starting structural reductions in LTL mode, iteration 1 : 384/539 places, 576/742 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62428 ms. Remains : 384/539 places, 576/742 transitions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 576/576 transitions.
Applied a total of 0 rules in 13 ms. Remains 384 /384 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2026-05-23 01:30:22] [INFO ] Invariant cache hit.
[2026-05-23 01:30:23] [INFO ] Implicit Places using invariants in 297 ms returned []
[2026-05-23 01:30:23] [INFO ] Invariant cache hit.
[2026-05-23 01:30:23] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 789 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 802 ms. Remains : 384/384 places, 576/576 transitions.
Support contains 122 out of 384 places after structural reductions.
[2026-05-23 01:30:24] [INFO ] Flatten gal took : 136 ms
[2026-05-23 01:30:24] [INFO ] Flatten gal took : 73 ms
[2026-05-23 01:30:24] [INFO ] Input system was already deterministic with 576 transitions.
Support contains 105 out of 384 places (down from 122) after GAL structural reductions.
RANDOM walk for 40000 steps (115 resets) in 1849 ms. (21 steps per ms) remains 3/63 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (9 resets) in 157 ms. (253 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 3/3 properties
[2026-05-23 01:30:25] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 70/74 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 310/384 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 576/960 variables, 384/413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/960 variables, 2/415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/960 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/960 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 960/960 variables, and 415 constraints, problems are : Problem set: 0 solved, 3 unsolved in 950 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 384/384 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 70/74 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 310/384 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 576/960 variables, 384/416 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/960 variables, 3/419 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/960 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/960 variables, 2/421 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/960 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/960 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 960/960 variables, and 421 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1251 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 384/384 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2212ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 135 steps, including 0 resets, run visited all 3 properties in 9 ms. (steps per millisecond=15 )
Parikh walk visited 3 properties in 18 ms.
[2026-05-23 01:30:27] [INFO ] Flatten gal took : 32 ms
[2026-05-23 01:30:27] [INFO ] Flatten gal took : 33 ms
[2026-05-23 01:30:27] [INFO ] Input system was already deterministic with 576 transitions.
Computed a total of 58 stabilizing places and 58 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 576/576 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 328 transition count 517
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 328 transition count 517
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 114 place count 328 transition count 515
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 151 place count 291 transition count 461
Iterating global reduction 1 with 37 rules applied. Total rules applied 188 place count 291 transition count 461
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 194 place count 291 transition count 455
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 212 place count 273 transition count 402
Iterating global reduction 2 with 18 rules applied. Total rules applied 230 place count 273 transition count 402
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 243 place count 273 transition count 389
Applied a total of 243 rules in 54 ms. Remains 273 /384 variables (removed 111) and now considering 389/576 (removed 187) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7778695310597356.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3090177111584446976.kers'
[2026-05-23 01:30:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7778695310597356.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3090177111584446976.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 389 rows 273 cols 1068 entries
Finished phase 1 with 246 SingleSign rule and 0 generalized
[2026-05-23 01:30:27] [INFO ] Computed 27 invariants in 2 ms
Computed 27 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3090177111584446976.kers
Total runtime 3 ms.
[2026-05-23 01:30:27] [INFO ] Implicit Places using invariants in 141 ms returned []
[2026-05-23 01:30:27] [INFO ] Invariant cache hit.
[2026-05-23 01:30:28] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Running 388 sub problems to find dead transitions.
[2026-05-23 01:30:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 1 (OVERLAPS) 1/273 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 4 (OVERLAPS) 389/662 variables, 273/306 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
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 662/662 variables, and 306 constraints, problems are : Problem set: 0 solved, 388 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 388/388 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 388 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 1 (OVERLAPS) 1/273 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 4 (OVERLAPS) 389/662 variables, 273/306 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/662 variables, 388/694 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/662 variables, 1/695 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/662 variables, 5/700 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/662 variables, and 700 constraints, problems are : Problem set: 0 solved, 388 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 388/388 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60108ms problems are : Problem set: 0 solved, 388 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Starting structural reductions in LTL mode, iteration 1 : 273/384 places, 389/576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60589 ms. Remains : 273/384 places, 389/576 transitions.
[2026-05-23 01:31:28] [INFO ] Flatten gal took : 27 ms
[2026-05-23 01:31:28] [INFO ] Flatten gal took : 27 ms
[2026-05-23 01:31:28] [INFO ] Input system was already deterministic with 389 transitions.
[2026-05-23 01:31:28] [INFO ] Flatten gal took : 25 ms
[2026-05-23 01:31:28] [INFO ] Flatten gal took : 21 ms
[2026-05-23 01:31:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality3054604170467833971.gal : 17 ms
[2026-05-23 01:31:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality9620212058600378941.ctl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3054604170467833971.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9620212058600378941.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,7.95278e+25,0.508484,13572,2,2377,5,51010,6,0,1483,39385,0


Converting to forward existential form...Done !
original formula: AF(E((((EX(((p284==0)||(p315==1))) + (p287==0)) + ((p498==1) + E((p344==1) U (((p428==1)||(p450==0))||(p397==1))))) + (p164==0)) U EG(!(E...184
=> equivalent forward existential formula: [FwdG(Init,!(E((((EX(((p284==0)||(p315==1))) + (p287==0)) + ((p498==1) + E((p344==1) U (((p428==1)||(p450==0))||...229
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t28, t31, t37, t38, t42, t47, t48, t51, t53, t58, t59, t63, t66, t71, t75, t80, t81,...475
Using saturation style SCC detection
(forward)formula 0,1,14.728,332320,1,0,890,1.84812e+06,820,436,9730,1.83303e+06,1095
FORMULA Champagne-PT-H07T0R-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 576/576 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 326 transition count 511
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 326 transition count 511
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 118 place count 326 transition count 509
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 157 place count 287 transition count 450
Iterating global reduction 1 with 39 rules applied. Total rules applied 196 place count 287 transition count 450
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 203 place count 287 transition count 443
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 223 place count 267 transition count 385
Iterating global reduction 2 with 20 rules applied. Total rules applied 243 place count 267 transition count 385
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 257 place count 267 transition count 371
Applied a total of 257 rules in 30 ms. Remains 267 /384 variables (removed 117) and now considering 371/576 (removed 205) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9622939257798710160.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14854896995921777224.kers'
[2026-05-23 01:31:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9622939257798710160.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14854896995921777224.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 371 rows 267 cols 1006 entries
Finished phase 1 with 240 SingleSign rule and 0 generalized
[2026-05-23 01:31:43] [INFO ] Computed 27 invariants in 1 ms
Computed 27 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14854896995921777224.kers
Total runtime 2 ms.
[2026-05-23 01:31:43] [INFO ] Implicit Places using invariants in 128 ms returned []
[2026-05-23 01:31:43] [INFO ] Invariant cache hit.
[2026-05-23 01:31:43] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2026-05-23 01:31:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (OVERLAPS) 371/638 variables, 267/294 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 638/638 variables, and 294 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (OVERLAPS) 371/638 variables, 267/294 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/638 variables, 370/664 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/638 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 638/638 variables, and 666 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60118ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 60121ms
Starting structural reductions in LTL mode, iteration 1 : 267/384 places, 371/576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60628 ms. Remains : 267/384 places, 371/576 transitions.
[2026-05-23 01:32:44] [INFO ] Flatten gal took : 24 ms
[2026-05-23 01:32:44] [INFO ] Flatten gal took : 22 ms
[2026-05-23 01:32:44] [INFO ] Input system was already deterministic with 371 transitions.
[2026-05-23 01:32:44] [INFO ] Flatten gal took : 22 ms
[2026-05-23 01:32:44] [INFO ] Flatten gal took : 23 ms
[2026-05-23 01:32:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality14232703156981240232.gal : 10 ms
[2026-05-23 01:32:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality1732315480698750903.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/CTLCardinality14232703156981240232.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1732315480698750903.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.62048e+25,0.420702,10836,2,1853,5,35145,6,0,1441,25616,0


Converting to forward existential form...Done !
original formula: AG(!(A(A(((p335==0)||(p316==1)) U ((p517==0)||(p160==1))) U ((((p477==0)||(p163==1))&&(p91==1)) * EX((p159==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(((((p477==0)||(p163==1))&&(p91==1)) * EX((p159==1))))))) * !(E(!(((((p477==0)||(p163...390
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t26, t30, t35, t39, t44, t45, t49, t55, t59, t64, t68, t73, t74, t78, t84, t88, t94,...447
Detected timeout of ITS tools.
[2026-05-23 01:33:14] [INFO ] Flatten gal took : 12 ms
[2026-05-23 01:33:14] [INFO ] Applying decomposition
[2026-05-23 01:33:14] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4503890806216925148.txt' '-o' '/tmp/graph4503890806216925148.bin' '-w' '/tmp/graph4503890806216925148.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4503890806216925148.bin' '-l' '-1' '-v' '-w' '/tmp/graph4503890806216925148.weights' '-q' '0' '-e' '0.001'
[2026-05-23 01:33:14] [INFO ] Decomposing Gal with order
[2026-05-23 01:33:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 01:33:14] [INFO ] Removed a total of 257 redundant transitions.
[2026-05-23 01:33:14] [INFO ] Flatten gal took : 150 ms
[2026-05-23 01:33:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2026-05-23 01:33:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality540740594494846005.gal : 14 ms
[2026-05-23 01:33:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality7793871364625511498.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/CTLCardinality540740594494846005.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7793871364625511498.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,4.62048e+25,0.150226,7280,503,25,5417,634,564,7358,62,1405,0


Converting to forward existential form...Done !
original formula: AG(!(A(A(((i16.u53.p335==0)||(i15.u48.p316==1)) U ((i20.i1.u82.p517==0)||(i8.u21.p160==1))) U ((((i24.u76.p477==0)||(i8.u22.p163==1))&&(i...196
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(((((i24.u76.p477==0)||(i8.u22.p163==1))&&(i4.u11.p91==1)) * EX((i8.u21.p159==1))))))...547
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t44, t73, t114, t153, t204, i0.i1.t269, i1.t260, i2.t250, i3.t240, i4.u12.t229, i5.t...701
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 576/576 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 337 transition count 522
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 337 transition count 522
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 97 place count 337 transition count 519
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 120 place count 314 transition count 487
Iterating global reduction 1 with 23 rules applied. Total rules applied 143 place count 314 transition count 487
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 147 place count 314 transition count 483
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 160 place count 301 transition count 450
Iterating global reduction 2 with 13 rules applied. Total rules applied 173 place count 301 transition count 450
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 180 place count 301 transition count 443
Applied a total of 180 rules in 25 ms. Remains 301 /384 variables (removed 83) and now considering 443/576 (removed 133) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17393090689258600310.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6220889202430145907.kers'
[2026-05-23 01:33:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17393090689258600310.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6220889202430145907.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 443 rows 301 cols 1226 entries
Finished phase 1 with 274 SingleSign rule and 0 generalized
[2026-05-23 01:33:44] [INFO ] Computed 27 invariants in 1 ms
Computed 27 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6220889202430145907.kers
Total runtime 3 ms.
[2026-05-23 01:33:45] [INFO ] Implicit Places using invariants in 171 ms returned []
[2026-05-23 01:33:45] [INFO ] Invariant cache hit.
[2026-05-23 01:33:45] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
Running 442 sub problems to find dead transitions.
[2026-05-23 01:33:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (OVERLAPS) 1/301 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (OVERLAPS) 443/744 variables, 301/328 constraints. Problems are: Problem set: 0 solved, 442 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 744/744 variables, and 328 constraints, problems are : Problem set: 0 solved, 442 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 442 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (OVERLAPS) 1/301 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (OVERLAPS) 443/744 variables, 301/328 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/744 variables, 442/770 constraints. Problems are: Problem set: 0 solved, 442 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 744/744 variables, and 771 constraints, problems are : Problem set: 0 solved, 442 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60136ms problems are : Problem set: 0 solved, 442 unsolved
Search for dead transitions found 0 dead transitions in 60141ms
Starting structural reductions in LTL mode, iteration 1 : 301/384 places, 443/576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60757 ms. Remains : 301/384 places, 443/576 transitions.
[2026-05-23 01:34:45] [INFO ] Flatten gal took : 19 ms
[2026-05-23 01:34:45] [INFO ] Flatten gal took : 20 ms
[2026-05-23 01:34:45] [INFO ] Input system was already deterministic with 443 transitions.
[2026-05-23 01:34:45] [INFO ] Flatten gal took : 18 ms
[2026-05-23 01:34:45] [INFO ] Flatten gal took : 17 ms
[2026-05-23 01:34:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality10012533257397882894.gal : 6 ms
[2026-05-23 01:34:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality12223248433750821597.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/CTLCardinality10012533257397882894.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12223248433750821597.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.12998e+27,0.609981,13572,2,2433,5,45830,6,0,1649,39664,0


Converting to forward existential form...Done !
original formula: ((EX(EX(((EF((p425==1)) + ((p61==0)&&(p484==1))) * ((((p208==0)&&(p260==1))||(p78==0)) + EX(((p505==0)&&(p447==1))))))) * AF(((p486==0)||...364
=> equivalent forward existential formula: (([(Init * !(EX(EX(((E(TRUE U (p425==1)) + ((p61==0)&&(p484==1))) * ((((p208==0)&&(p260==1))||(p78==0)) + EX(((p...500
Reverse transition relation is NOT exact ! Due to transitions t6, t16, t29, t32, t33, t37, t42, t45, t49, t54, t55, t59, t62, t68, t72, t77, t80, t84, t89,...494
Detected timeout of ITS tools.
[2026-05-23 01:35:15] [INFO ] Flatten gal took : 9 ms
[2026-05-23 01:35:15] [INFO ] Applying decomposition
[2026-05-23 01:35:15] [INFO ] Flatten gal took : 10 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/graph6788810587090041811.txt' '-o' '/tmp/graph6788810587090041811.bin' '-w' '/tmp/graph6788810587090041811.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6788810587090041811.bin' '-l' '-1' '-v' '-w' '/tmp/graph6788810587090041811.weights' '-q' '0' '-e' '0.001'
[2026-05-23 01:35:15] [INFO ] Decomposing Gal with order
[2026-05-23 01:35:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 01:35:15] [INFO ] Removed a total of 331 redundant transitions.
[2026-05-23 01:35:15] [INFO ] Flatten gal took : 31 ms
[2026-05-23 01:35:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 14 ms.
[2026-05-23 01:35:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality16698223468774886597.gal : 6 ms
[2026-05-23 01:35:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality7677104501719727597.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/CTLCardinality16698223468774886597.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7677104501719727597.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.12998e+27,0.177788,8968,810,27,8575,461,709,16477,67,1005,0


Converting to forward existential form...Done !
original formula: ((EX(EX(((EF((i21.u65.p425==1)) + ((i3.u9.p61==0)&&(i20.i1.u75.p484==1))) * ((((i9.u30.p208==0)&&(i12.i1.u39.p260==1))||(i4.u12.p78==0)) ...554
=> equivalent forward existential formula: (([(Init * !(EX(EX(((E(TRUE U (i21.u65.p425==1)) + ((i3.u9.p61==0)&&(i20.i1.u75.p484==1))) * ((((i9.u30.p208==0)...690
Reverse transition relation is NOT exact ! Due to transitions t6, t32, t54, t89, t132, t201, t232, i0.t302, i1.t290, i2.i1.t247, i3.t279, i4.u13.t267, i5.t...834
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
(forward)formula 0,1,25.919,436772,1,0,782997,539,4560,1.80077e+06,365,1346,947645
FORMULA Champagne-PT-H07T0R-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 576/576 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 325 transition count 510
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 325 transition count 510
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 121 place count 325 transition count 507
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 160 place count 286 transition count 448
Iterating global reduction 1 with 39 rules applied. Total rules applied 199 place count 286 transition count 448
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 206 place count 286 transition count 441
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 225 place count 267 transition count 385
Iterating global reduction 2 with 19 rules applied. Total rules applied 244 place count 267 transition count 385
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 256 place count 267 transition count 373
Applied a total of 256 rules in 21 ms. Remains 267 /384 variables (removed 117) and now considering 373/576 (removed 203) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9284895363634387387.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8935928127722153172.kers'
[2026-05-23 01:35:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9284895363634387387.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8935928127722153172.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 373 rows 267 cols 1014 entries
Finished phase 1 with 240 SingleSign rule and 0 generalized
[2026-05-23 01:35:42] [INFO ] Computed 27 invariants in 1 ms
Computed 27 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8935928127722153172.kers
Total runtime 2 ms.
[2026-05-23 01:35:42] [INFO ] Implicit Places using invariants in 132 ms returned []
[2026-05-23 01:35:42] [INFO ] Invariant cache hit.
[2026-05-23 01:35:42] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2026-05-23 01:35:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (OVERLAPS) 373/640 variables, 267/294 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
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 640/640 variables, and 294 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (OVERLAPS) 373/640 variables, 267/294 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 372/666 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 640/640 variables, and 668 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60086ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60089ms
Starting structural reductions in LTL mode, iteration 1 : 267/384 places, 373/576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60587 ms. Remains : 267/384 places, 373/576 transitions.
[2026-05-23 01:36:42] [INFO ] Flatten gal took : 15 ms
[2026-05-23 01:36:42] [INFO ] Flatten gal took : 13 ms
[2026-05-23 01:36:42] [INFO ] Input system was already deterministic with 373 transitions.
[2026-05-23 01:36:42] [INFO ] Flatten gal took : 16 ms
[2026-05-23 01:36:42] [INFO ] Flatten gal took : 13 ms
[2026-05-23 01:36:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality10424469359089199918.gal : 5 ms
[2026-05-23 01:36:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality8992419664170793311.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/CTLCardinality10424469359089199918.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8992419664170793311.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.63759e+25,0.411343,10484,2,1823,5,33804,6,0,1443,24031,0


Converting to forward existential form...Done !
original formula: EX(!(E(!(E((p127==1) U (p241==1))) U (p524==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(!(E((p127==1) U (p241==1))) U (p524==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t15, t27, t28, t32, t37, t41, t46, t47, t51, t57, t61, t66, t70, t75, t76, t80, t86, t90,...441
Detected timeout of ITS tools.
[2026-05-23 01:37:12] [INFO ] Flatten gal took : 7 ms
[2026-05-23 01:37:12] [INFO ] Applying decomposition
[2026-05-23 01:37:12] [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/graph3674455252522668767.txt' '-o' '/tmp/graph3674455252522668767.bin' '-w' '/tmp/graph3674455252522668767.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3674455252522668767.bin' '-l' '-1' '-v' '-w' '/tmp/graph3674455252522668767.weights' '-q' '0' '-e' '0.001'
[2026-05-23 01:37:12] [INFO ] Decomposing Gal with order
[2026-05-23 01:37:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 01:37:12] [INFO ] Removed a total of 263 redundant transitions.
[2026-05-23 01:37:12] [INFO ] Flatten gal took : 33 ms
[2026-05-23 01:37:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2026-05-23 01:37:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality4145998636299578553.gal : 7 ms
[2026-05-23 01:37:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality11397577154054851879.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/CTLCardinality4145998636299578553.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11397577154054851879.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,4.63759e+25,0.49345,15688,2078,25,28836,650,571,26639,62,1549,0


Converting to forward existential form...Done !
original formula: EX(!(E(!(E((i6.u16.p127==1) U (i7.i1.u36.p241==1))) U (i26.i1.u82.p524==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(!(E((i6.u16.p127==1) U (i7.i1.u36.p241==1))) U (i26.i1.u82.p524==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t27, t46, t75, t114, t153, i0.i1.t240, i1.t269, i2.t260, i3.t250, i4.t230, i5.u14.t220, i...702
(forward)formula 0,1,29.1111,731116,1,0,1.5643e+06,650,3668,1.54035e+06,328,1549,1672271
FORMULA Champagne-PT-H07T0R-CTLCardinality-2024-03 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 : 384/384 places, 576/576 transitions.
Graph (trivial) has 371 edges and 384 vertex of which 59 / 384 are part of one of the 9 SCC in 5 ms
Free SCC test removed 50 places
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 333 transition count 428
Reduce places removed 88 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 133 rules applied. Total rules applied 222 place count 245 transition count 383
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 243 place count 224 transition count 383
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 243 place count 224 transition count 373
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 263 place count 214 transition count 373
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 303 place count 174 transition count 326
Iterating global reduction 3 with 40 rules applied. Total rules applied 343 place count 174 transition count 326
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 345 place count 174 transition count 324
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 345 place count 174 transition count 314
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 365 place count 164 transition count 314
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 375 place count 154 transition count 269
Iterating global reduction 4 with 10 rules applied. Total rules applied 385 place count 154 transition count 269
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 395 place count 154 transition count 259
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 1 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 5 with 138 rules applied. Total rules applied 533 place count 85 transition count 190
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 538 place count 80 transition count 162
Iterating global reduction 5 with 5 rules applied. Total rules applied 543 place count 80 transition count 162
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 548 place count 80 transition count 157
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 550 place count 78 transition count 155
Applied a total of 550 rules in 105 ms. Remains 78 /384 variables (removed 306) and now considering 155/576 (removed 421) transitions.
[2026-05-23 01:37:42] [INFO ] Flow matrix only has 78 transitions (discarded 77 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17509505682969694787.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3234093696899154342.kers'
[2026-05-23 01:37:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17509505682969694787.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3234093696899154342.kers]
Normalized transition count is 77 out of 78 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 77 rows 71 cols 203 entries
Finished phase 1 with 51 SingleSign rule and 0 generalized
[2026-05-23 01:37:42] [INFO ] Computed 27 invariants in 0 ms
Computed 27 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3234093696899154342.kers
Total runtime 1 ms.
[2026-05-23 01:37:42] [INFO ] Implicit Places using invariants in 131 ms returned []
[2026-05-23 01:37:42] [INFO ] Flow matrix only has 78 transitions (discarded 77 similar events)
[2026-05-23 01:37:42] [INFO ] Invariant cache hit.
[2026-05-23 01:37:42] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 01:37:42] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2026-05-23 01:37:42] [INFO ] Redundant transitions in 9 ms returned []
Running 106 sub problems to find dead transitions.
[2026-05-23 01:37:42] [INFO ] Flow matrix only has 78 transitions (discarded 77 similar events)
[2026-05-23 01:37:42] [INFO ] Invariant cache hit.
[2026-05-23 01:37:42] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 3/78 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 77/155 variables, 78/105 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 3/108 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/155 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/156 variables, and 108 constraints, problems are : Problem set: 0 solved, 106 unsolved in 5375 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 78/78 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 3/78 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 77/155 variables, 78/105 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 3/108 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 106/214 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/155 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/156 variables, and 214 constraints, problems are : Problem set: 0 solved, 106 unsolved in 5497 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 78/78 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10900ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 10901ms
Starting structural reductions in SI_CTL mode, iteration 1 : 78/384 places, 155/576 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11277 ms. Remains : 78/384 places, 155/576 transitions.
[2026-05-23 01:37:53] [INFO ] Flatten gal took : 8 ms
[2026-05-23 01:37:53] [INFO ] Flatten gal took : 8 ms
[2026-05-23 01:37:53] [INFO ] Input system was already deterministic with 155 transitions.
[2026-05-23 01:37:53] [INFO ] Flatten gal took : 13 ms
[2026-05-23 01:37:53] [INFO ] Flatten gal took : 9 ms
[2026-05-23 01:37:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality10731484710333797145.gal : 2 ms
[2026-05-23 01:37:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality16315160320530158377.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/CTLCardinality10731484710333797145.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16315160320530158377.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.97306e+11,0.054884,4880,2,151,5,1685,6,0,460,893,0


Converting to forward existential form...Done !
original formula: AG(!(E(!(AG((p381==1))) U AG(AF((p272==0))))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,TRUE),!(!(E(TRUE U !((p381==1)))))) * !(E(TRUE U !(!(EG(!((p272==0))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t105, t106, t128, Intersection with reachable at each step enabled. (destroyed/reverse/inter...179
(forward)formula 0,0,0.7214,13944,1,0,341,52530,332,153,3095,52189,431
FORMULA Champagne-PT-H07T0R-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 384/384 places, 576/576 transitions.
Graph (trivial) has 373 edges and 384 vertex of which 59 / 384 are part of one of the 9 SCC in 2 ms
Free SCC test removed 50 places
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 90 place count 333 transition count 427
Reduce places removed 89 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 136 rules applied. Total rules applied 226 place count 244 transition count 380
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 248 place count 222 transition count 380
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 248 place count 222 transition count 370
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 268 place count 212 transition count 370
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 309 place count 171 transition count 322
Iterating global reduction 3 with 41 rules applied. Total rules applied 350 place count 171 transition count 322
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 352 place count 171 transition count 320
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 352 place count 171 transition count 310
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 372 place count 161 transition count 310
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 382 place count 151 transition count 265
Iterating global reduction 4 with 10 rules applied. Total rules applied 392 place count 151 transition count 265
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 402 place count 151 transition count 255
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 5 with 140 rules applied. Total rules applied 542 place count 81 transition count 185
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 547 place count 76 transition count 157
Iterating global reduction 5 with 5 rules applied. Total rules applied 552 place count 76 transition count 157
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 557 place count 76 transition count 152
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 559 place count 74 transition count 150
Applied a total of 559 rules in 111 ms. Remains 74 /384 variables (removed 310) and now considering 150/576 (removed 426) transitions.
[2026-05-23 01:37:54] [INFO ] Flow matrix only has 69 transitions (discarded 81 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9863888513057110555.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12244117647649021953.kers'
[2026-05-23 01:37:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9863888513057110555.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12244117647649021953.kers]
Normalized transition count is 68 out of 69 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 68 rows 67 cols 174 entries
Finished phase 1 with 47 SingleSign rule and 0 generalized
[2026-05-23 01:37:54] [INFO ] Computed 27 invariants in 0 ms
Computed 27 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12244117647649021953.kers
Total runtime 2 ms.
[2026-05-23 01:37:54] [INFO ] Implicit Places using invariants in 134 ms returned []
[2026-05-23 01:37:54] [INFO ] Flow matrix only has 69 transitions (discarded 81 similar events)
[2026-05-23 01:37:54] [INFO ] Invariant cache hit.
[2026-05-23 01:37:54] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2026-05-23 01:37:54] [INFO ] Redundant transitions in 8 ms returned []
Running 94 sub problems to find dead transitions.
[2026-05-23 01:37:54] [INFO ] Flow matrix only has 69 transitions (discarded 81 similar events)
[2026-05-23 01:37:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 2/74 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 68/142 variables, 74/101 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 0/142 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/143 variables, and 101 constraints, problems are : Problem set: 0 solved, 94 unsolved in 3737 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 2/74 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 68/142 variables, 74/101 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 94/195 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 0/142 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/143 variables, and 195 constraints, problems are : Problem set: 0 solved, 94 unsolved in 4576 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8326ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 8328ms
Starting structural reductions in SI_CTL mode, iteration 1 : 74/384 places, 150/576 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8789 ms. Remains : 74/384 places, 150/576 transitions.
[2026-05-23 01:38:03] [INFO ] Flatten gal took : 14 ms
[2026-05-23 01:38:03] [INFO ] Flatten gal took : 4 ms
[2026-05-23 01:38:03] [INFO ] Input system was already deterministic with 150 transitions.
RANDOM walk for 93 steps (0 resets) in 7 ms. (11 steps per ms) remains 0/1 properties
FORMULA Champagne-PT-H07T0R-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-23 01:38:03] [INFO ] Flatten gal took : 4 ms
[2026-05-23 01:38:03] [INFO ] Flatten gal took : 6 ms
[2026-05-23 01:38:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1028340017808672639.gal : 2 ms
[2026-05-23 01:38:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5468241220535949629.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/ReachabilityCardinality1028340017808672639.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5468241220535949629.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 LTL mode, iteration 0 : 384/384 places, 576/576 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 326 transition count 511
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 326 transition count 511
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 119 place count 326 transition count 508
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 156 place count 289 transition count 451
Iterating global reduction 1 with 37 rules applied. Total rules applied 193 place count 289 transition count 451
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 200 place count 289 transition count 444
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 219 place count 270 transition count 391
Iterating global reduction 2 with 19 rules applied. Total rules applied 238 place count 270 transition count 391
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 251 place count 270 transition count 378
Applied a total of 251 rules in 30 ms. Remains 270 /384 variables (removed 114) and now considering 378/576 (removed 198) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10835724461079721159.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13911139967710801805.kers'
[2026-05-23 01:38:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10835724461079721159.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13911139967710801805.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 378 rows 270 cols 1030 entries
Finished phase 1 with 243 SingleSign rule and 0 generalized
[2026-05-23 01:38:03] [INFO ] Computed 27 invariants in 2 ms
Computed 27 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13911139967710801805.kers
Total runtime 3 ms.
[2026-05-23 01:38:03] [INFO ] Implicit Places using invariants in 227 ms returned []
[2026-05-23 01:38:03] [INFO ] Invariant cache hit.
[2026-05-23 01:38:03] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
Running 377 sub problems to find dead transitions.
[2026-05-23 01:38:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (OVERLAPS) 378/648 variables, 270/297 constraints. Problems are: Problem set: 0 solved, 377 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 648/648 variables, and 297 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (OVERLAPS) 378/648 variables, 270/297 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/648 variables, 377/674 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/648 variables, 1/675 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 675 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60109ms problems are : Problem set: 0 solved, 377 unsolved
Search for dead transitions found 0 dead transitions in 60111ms
Starting structural reductions in LTL mode, iteration 1 : 270/384 places, 378/576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60795 ms. Remains : 270/384 places, 378/576 transitions.
[2026-05-23 01:39:03] [INFO ] Flatten gal took : 14 ms
[2026-05-23 01:39:03] [INFO ] Flatten gal took : 11 ms
[2026-05-23 01:39:04] [INFO ] Input system was already deterministic with 378 transitions.
[2026-05-23 01:39:04] [INFO ] Flatten gal took : 12 ms
[2026-05-23 01:39:04] [INFO ] Flatten gal took : 12 ms
[2026-05-23 01:39:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality18105890699717136280.gal : 3 ms
[2026-05-23 01:39:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality8559687618591942045.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/CTLCardinality18105890699717136280.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8559687618591942045.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,5.68383e+25,0.457874,11416,2,1915,5,37771,6,0,1460,28671,0


Converting to forward existential form...Done !
original formula: EX(EF(((p247==1)&&((p255==1)||(p181==0)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * ((p247==1)&&((p255==1)||(p181==0))))] != FALSE
(forward)formula 0,1,0.766962,11896,1,0,9,39127,9,1,2766,29218,4
FORMULA Champagne-PT-H07T0R-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 576/576 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 326 transition count 511
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 326 transition count 511
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 119 place count 326 transition count 508
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 155 place count 290 transition count 458
Iterating global reduction 1 with 36 rules applied. Total rules applied 191 place count 290 transition count 458
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 197 place count 290 transition count 452
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 215 place count 272 transition count 406
Iterating global reduction 2 with 18 rules applied. Total rules applied 233 place count 272 transition count 406
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 244 place count 272 transition count 395
Applied a total of 244 rules in 28 ms. Remains 272 /384 variables (removed 112) and now considering 395/576 (removed 181) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10673287174315657122.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16074727359890654374.kers'
[2026-05-23 01:39:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10673287174315657122.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16074727359890654374.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 395 rows 272 cols 1092 entries
Finished phase 1 with 245 SingleSign rule and 0 generalized
[2026-05-23 01:39:04] [INFO ] Computed 27 invariants in 3 ms
Computed 27 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16074727359890654374.kers
Total runtime 4 ms.
[2026-05-23 01:39:05] [INFO ] Implicit Places using invariants in 209 ms returned []
[2026-05-23 01:39:05] [INFO ] Invariant cache hit.
[2026-05-23 01:39:05] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
Running 394 sub problems to find dead transitions.
[2026-05-23 01:39:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (OVERLAPS) 1/272 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (OVERLAPS) 395/667 variables, 272/299 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 667/667 variables, and 299 constraints, problems are : Problem set: 0 solved, 394 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 394 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (OVERLAPS) 1/272 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (OVERLAPS) 395/667 variables, 272/299 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/667 variables, 394/693 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/667 variables, 1/694 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 667/667 variables, and 694 constraints, problems are : Problem set: 0 solved, 394 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60104ms problems are : Problem set: 0 solved, 394 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Starting structural reductions in LTL mode, iteration 1 : 272/384 places, 395/576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60791 ms. Remains : 272/384 places, 395/576 transitions.
[2026-05-23 01:40:05] [INFO ] Flatten gal took : 7 ms
[2026-05-23 01:40:05] [INFO ] Flatten gal took : 13 ms
[2026-05-23 01:40:05] [INFO ] Input system was already deterministic with 395 transitions.
[2026-05-23 01:40:05] [INFO ] Flatten gal took : 7 ms
[2026-05-23 01:40:05] [INFO ] Flatten gal took : 7 ms
[2026-05-23 01:40:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality10791142458810590609.gal : 2 ms
[2026-05-23 01:40:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality3525556165655614909.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/CTLCardinality10791142458810590609.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3525556165655614909.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,7.59895e+25,0.523148,12012,2,2076,5,40154,6,0,1485,31904,0


Converting to forward existential form...Done !
original formula: EF(((AF((p308!=1)) * AX(EF(((p443!=0)&&(p232!=1))))) * A((!((A((p141==0) U ((p59==0)||(p450==1))) + !(((p358==0)||(p191==1))))) + AG((p14...194
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (!(EG(!((p308!=1)))) * !(EX(!(E(TRUE U ((p443!=0)&&(p232!=1)))))))) * !(EG(!(!(E((p31==1) ...431
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t26, t30, t35, t39, t44, t45, t48, t50, t56, t60, t65, t69, t74, t75, t79, t85, t89,...464
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,24.048,571888,1,0,1967,3.27248e+06,844,941,9836,4.28421e+06,2313
FORMULA Champagne-PT-H07T0R-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 576/576 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 325 transition count 510
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 325 transition count 510
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 121 place count 325 transition count 507
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 159 place count 287 transition count 449
Iterating global reduction 1 with 38 rules applied. Total rules applied 197 place count 287 transition count 449
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 204 place count 287 transition count 442
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 222 place count 269 transition count 390
Iterating global reduction 2 with 18 rules applied. Total rules applied 240 place count 269 transition count 390
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 253 place count 269 transition count 377
Applied a total of 253 rules in 20 ms. Remains 269 /384 variables (removed 115) and now considering 377/576 (removed 199) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14554146573526712182.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1925149725106629525.kers'
[2026-05-23 01:40:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14554146573526712182.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1925149725106629525.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 377 rows 269 cols 1028 entries
Finished phase 1 with 242 SingleSign rule and 0 generalized
[2026-05-23 01:40:29] [INFO ] Computed 27 invariants in 1 ms
Computed 27 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1925149725106629525.kers
Total runtime 2 ms.
[2026-05-23 01:40:30] [INFO ] Implicit Places using invariants in 134 ms returned []
[2026-05-23 01:40:30] [INFO ] Invariant cache hit.
[2026-05-23 01:40:30] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Running 376 sub problems to find dead transitions.
[2026-05-23 01:40:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (OVERLAPS) 377/646 variables, 269/296 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 646/646 variables, and 296 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 376 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (OVERLAPS) 377/646 variables, 269/296 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/646 variables, 376/672 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/646 variables, 1/673 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 675 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60088ms problems are : Problem set: 0 solved, 376 unsolved
Search for dead transitions found 0 dead transitions in 60089ms
Starting structural reductions in LTL mode, iteration 1 : 269/384 places, 377/576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60526 ms. Remains : 269/384 places, 377/576 transitions.
[2026-05-23 01:41:30] [INFO ] Flatten gal took : 16 ms
[2026-05-23 01:41:30] [INFO ] Flatten gal took : 11 ms
[2026-05-23 01:41:30] [INFO ] Input system was already deterministic with 377 transitions.
[2026-05-23 01:41:30] [INFO ] Flatten gal took : 10 ms
[2026-05-23 01:41:30] [INFO ] Flatten gal took : 11 ms
[2026-05-23 01:41:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality17529699335493313255.gal : 3 ms
[2026-05-23 01:41:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality13441573893220256777.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/CTLCardinality17529699335493313255.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13441573893220256777.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.69681e+25,0.454443,11188,2,1908,5,36655,6,0,1455,27370,0


Converting to forward existential form...Done !
original formula: AG(A(!((AX(((p161==0)||(p163==1))) * ((p252==0)||(p456==1)))) U AF(((p120==0)||(p361==1)))))
=> equivalent forward existential formula: ([FwdG((FwdU(FwdU(Init,TRUE),!(!(EG(!(((p120==0)||(p361==1))))))) * !(!((!(EX(!(((p161==0)||(p163==1))))) * ((p2...284
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t26, t30, t35, t39, t44, t45, t49, t55, t59, t64, t68, t73, t74, t78, t84, t88, t95,...453
(forward)formula 0,0,8.92996,229076,1,0,1060,1.29026e+06,781,479,8877,1.52984e+06,1297
FORMULA Champagne-PT-H07T0R-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 384/384 places, 576/576 transitions.
Graph (trivial) has 361 edges and 384 vertex of which 49 / 384 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 342 transition count 440
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 134 rules applied. Total rules applied 222 place count 255 transition count 393
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 245 place count 232 transition count 393
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 245 place count 232 transition count 383
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 265 place count 222 transition count 383
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 304 place count 183 transition count 337
Iterating global reduction 3 with 39 rules applied. Total rules applied 343 place count 183 transition count 337
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 345 place count 183 transition count 335
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 345 place count 183 transition count 325
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 365 place count 173 transition count 325
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 372 place count 166 transition count 296
Iterating global reduction 4 with 7 rules applied. Total rules applied 379 place count 166 transition count 296
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 386 place count 166 transition count 289
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 5 with 140 rules applied. Total rules applied 526 place count 96 transition count 219
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 531 place count 91 transition count 191
Iterating global reduction 5 with 5 rules applied. Total rules applied 536 place count 91 transition count 191
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 541 place count 91 transition count 186
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 543 place count 89 transition count 184
Applied a total of 543 rules in 53 ms. Remains 89 /384 variables (removed 295) and now considering 184/576 (removed 392) transitions.
[2026-05-23 01:41:39] [INFO ] Flow matrix only has 100 transitions (discarded 84 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3711232880866706575.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13784761888624591329.kers'
[2026-05-23 01:41:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3711232880866706575.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13784761888624591329.kers]
Normalized transition count is 99 out of 100 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 99 rows 83 cols 256 entries
Finished phase 1 with 62 SingleSign rule and 0 generalized
[2026-05-23 01:41:39] [INFO ] Computed 27 invariants in 0 ms
Computed 27 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13784761888624591329.kers
Total runtime 1 ms.
[2026-05-23 01:41:39] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-23 01:41:39] [INFO ] Flow matrix only has 100 transitions (discarded 84 similar events)
[2026-05-23 01:41:39] [INFO ] Invariant cache hit.
[2026-05-23 01:41:39] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2026-05-23 01:41:39] [INFO ] Redundant transitions in 7 ms returned []
Running 126 sub problems to find dead transitions.
[2026-05-23 01:41:39] [INFO ] Flow matrix only has 100 transitions (discarded 84 similar events)
[2026-05-23 01:41:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 3/89 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 99/188 variables, 89/116 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/189 variables, and 116 constraints, problems are : Problem set: 0 solved, 126 unsolved in 6872 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 3/89 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 99/188 variables, 89/116 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 126/242 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 0/188 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/189 variables, and 242 constraints, problems are : Problem set: 0 solved, 126 unsolved in 6843 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13725ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 13726ms
Starting structural reductions in SI_CTL mode, iteration 1 : 89/384 places, 184/576 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14019 ms. Remains : 89/384 places, 184/576 transitions.
[2026-05-23 01:41:53] [INFO ] Flatten gal took : 4 ms
[2026-05-23 01:41:53] [INFO ] Flatten gal took : 4 ms
[2026-05-23 01:41:53] [INFO ] Input system was already deterministic with 184 transitions.
[2026-05-23 01:41:53] [INFO ] Flatten gal took : 5 ms
[2026-05-23 01:41:53] [INFO ] Flatten gal took : 4 ms
[2026-05-23 01:41:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality11395215578885080957.gal : 2 ms
[2026-05-23 01:41:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality4105093526224882754.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/CTLCardinality11395215578885080957.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4105093526224882754.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.20399e+13,0.06295,5076,2,152,5,2250,6,0,534,1194,0


Converting to forward existential form...Done !
original formula: AG((EF((((p228==1)&&(p197==1))&&((p281==0)||(p271==1)))) + (((p511==0)||(p427==1))&&((p295==0)||(p106==1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((((p511==0)||(p427==1))&&((p295==0)||(p106==1))))) * !(E(TRUE U (((p228==1)&&(p197==1))&&...190
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.213846,6892,1,0,12,15846,16,5,2422,8694,6
FORMULA Champagne-PT-H07T0R-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 576/576 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 329 transition count 514
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 329 transition count 514
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 113 place count 329 transition count 511
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 148 place count 294 transition count 459
Iterating global reduction 1 with 35 rules applied. Total rules applied 183 place count 294 transition count 459
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 189 place count 294 transition count 453
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 205 place count 278 transition count 406
Iterating global reduction 2 with 16 rules applied. Total rules applied 221 place count 278 transition count 406
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 232 place count 278 transition count 395
Applied a total of 232 rules in 33 ms. Remains 278 /384 variables (removed 106) and now considering 395/576 (removed 181) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17169878737929440759.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-149815815218385294.kers'
[2026-05-23 01:41:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17169878737929440759.kers, --Pflows, --basisKERS=/tmp/petrispot-output-149815815218385294.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 395 rows 278 cols 1080 entries
Finished phase 1 with 251 SingleSign rule and 0 generalized
[2026-05-23 01:41:53] [INFO ] Computed 27 invariants in 3 ms
Computed 27 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-149815815218385294.kers
Total runtime 4 ms.
[2026-05-23 01:41:54] [INFO ] Implicit Places using invariants in 204 ms returned []
[2026-05-23 01:41:54] [INFO ] Invariant cache hit.
[2026-05-23 01:41:54] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
Running 394 sub problems to find dead transitions.
[2026-05-23 01:41:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (OVERLAPS) 1/278 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 13/40 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (OVERLAPS) 395/673 variables, 278/318 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 673/673 variables, and 318 constraints, problems are : Problem set: 0 solved, 394 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 394 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (OVERLAPS) 1/278 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 13/40 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (OVERLAPS) 395/673 variables, 278/318 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/673 variables, 394/712 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/673 variables, 2/714 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/673 variables, 5/719 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 673/673 variables, and 720 constraints, problems are : Problem set: 0 solved, 394 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60098ms problems are : Problem set: 0 solved, 394 unsolved
Search for dead transitions found 0 dead transitions in 60100ms
Starting structural reductions in LTL mode, iteration 1 : 278/384 places, 395/576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60769 ms. Remains : 278/384 places, 395/576 transitions.
[2026-05-23 01:42:54] [INFO ] Flatten gal took : 10 ms
[2026-05-23 01:42:54] [INFO ] Flatten gal took : 12 ms
[2026-05-23 01:42:54] [INFO ] Input system was already deterministic with 395 transitions.
[2026-05-23 01:42:54] [INFO ] Flatten gal took : 10 ms
[2026-05-23 01:42:54] [INFO ] Flatten gal took : 10 ms
[2026-05-23 01:42:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality16587080185553086767.gal : 3 ms
[2026-05-23 01:42:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality805642862117924242.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/CTLCardinality16587080185553086767.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality805642862117924242.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.29507e+26,0.644343,14720,2,2701,5,57216,6,0,1509,43492,0


Converting to forward existential form...Done !
original formula: (E(((p184==0)||(p528==1)) U !(((!((AX((p482==1)) + E(((p80==0)||(p108==1)) U ((p169==0)||(p320==1))))) + (p182==0)) + AF(EX((p155==1)))))...211
=> equivalent forward existential formula: ([(Init * !(E(((p184==0)||(p528==1)) U !(((!((!(EX(!((p482==1)))) + E(((p80==0)||(p108==1)) U ((p169==0)||(p320=...302
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t27, t28, t32, t37, t38, t42, t47, t48, t52, t57, t58, t62, t67, t71, t76, t77, t81, ...497
Detected timeout of ITS tools.
[2026-05-23 01:43:24] [INFO ] Flatten gal took : 6 ms
[2026-05-23 01:43:24] [INFO ] Applying decomposition
[2026-05-23 01:43:24] [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/graph18383868329410852705.txt' '-o' '/tmp/graph18383868329410852705.bin' '-w' '/tmp/graph18383868329410852705.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18383868329410852705.bin' '-l' '-1' '-v' '-w' '/tmp/graph18383868329410852705.weights' '-q' '0' '-e' '0.001'
[2026-05-23 01:43:24] [INFO ] Decomposing Gal with order
[2026-05-23 01:43:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 01:43:24] [INFO ] Removed a total of 281 redundant transitions.
[2026-05-23 01:43:24] [INFO ] Flatten gal took : 30 ms
[2026-05-23 01:43:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 10 ms.
[2026-05-23 01:43:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality14573841873295885788.gal : 4 ms
[2026-05-23 01:43:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality2824532330404043160.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/CTLCardinality14573841873295885788.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2824532330404043160.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.29507e+26,0.139813,7576,548,37,6218,696,639,7649,89,1359,0


Converting to forward existential form...Done !
original formula: (E(((i8.u29.p184==0)||(i24.i2.u84.p528==1)) U !(((!((AX((i20.u77.p482==1)) + E(((i3.u9.p80==0)||(i5.u16.p108==1)) U ((i7.u27.p169==0)||(i...311
=> equivalent forward existential formula: ([(Init * !(E(((i8.u29.p184==0)||(i24.i2.u84.p528==1)) U !(((!((!(EX(!((i20.u77.p482==1)))) + E(((i3.u9.p80==0)|...402
Reverse transition relation is NOT exact ! Due to transitions t6, t27, t47, t57, t76, t96, t117, t137, t156, t212, t266, i0.i1.t280, i1.t271, i2.t261, i3.t...798
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
(forward)formula 0,1,15.011,343448,1,0,700448,1418,4340,977833,480,3393,747065
FORMULA Champagne-PT-H07T0R-CTLCardinality-2024-12 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 : 384/384 places, 576/576 transitions.
Graph (trivial) has 360 edges and 384 vertex of which 55 / 384 are part of one of the 9 SCC in 0 ms
Free SCC test removed 46 places
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 85 place count 337 transition count 438
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 130 rules applied. Total rules applied 215 place count 253 transition count 392
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 23 rules applied. Total rules applied 238 place count 231 transition count 391
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 239 place count 230 transition count 391
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 239 place count 230 transition count 381
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 259 place count 220 transition count 381
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 296 place count 183 transition count 341
Iterating global reduction 4 with 37 rules applied. Total rules applied 333 place count 183 transition count 341
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 334 place count 183 transition count 340
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 334 place count 183 transition count 332
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 350 place count 175 transition count 332
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 358 place count 167 transition count 293
Iterating global reduction 5 with 8 rules applied. Total rules applied 366 place count 167 transition count 293
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 374 place count 167 transition count 285
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 6 with 138 rules applied. Total rules applied 512 place count 98 transition count 216
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 516 place count 94 transition count 193
Iterating global reduction 6 with 4 rules applied. Total rules applied 520 place count 94 transition count 193
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 524 place count 94 transition count 189
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 526 place count 92 transition count 187
Applied a total of 526 rules in 56 ms. Remains 92 /384 variables (removed 292) and now considering 187/576 (removed 389) transitions.
[2026-05-23 01:43:39] [INFO ] Flow matrix only has 96 transitions (discarded 91 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12705788935271081837.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-373492780834135299.kers'
[2026-05-23 01:43:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12705788935271081837.kers, --Pflows, --basisKERS=/tmp/petrispot-output-373492780834135299.kers]
Normalized transition count is 95 out of 96 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 95 rows 87 cols 239 entries
Finished phase 1 with 65 SingleSign rule and 0 generalized
[2026-05-23 01:43:39] [INFO ] Computed 27 invariants in 0 ms
Computed 27 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-373492780834135299.kers
Total runtime 1 ms.
[2026-05-23 01:43:40] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-23 01:43:40] [INFO ] Flow matrix only has 96 transitions (discarded 91 similar events)
[2026-05-23 01:43:40] [INFO ] Invariant cache hit.
[2026-05-23 01:43:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 01:43:40] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2026-05-23 01:43:40] [INFO ] Redundant transitions in 3 ms returned []
Running 136 sub problems to find dead transitions.
[2026-05-23 01:43:40] [INFO ] Flow matrix only has 96 transitions (discarded 91 similar events)
[2026-05-23 01:43:40] [INFO ] Invariant cache hit.
[2026-05-23 01:43:40] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 2/92 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 95/187 variables, 92/119 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/187 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/188 variables, and 122 constraints, problems are : Problem set: 0 solved, 136 unsolved in 7607 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 92/92 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 2/92 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 95/187 variables, 92/119 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 136/258 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (OVERLAPS) 0/187 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/188 variables, and 259 constraints, problems are : Problem set: 0 solved, 136 unsolved in 9007 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 92/92 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16633ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 16634ms
Starting structural reductions in SI_CTL mode, iteration 1 : 92/384 places, 187/576 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16941 ms. Remains : 92/384 places, 187/576 transitions.
[2026-05-23 01:43:56] [INFO ] Flatten gal took : 6 ms
[2026-05-23 01:43:56] [INFO ] Flatten gal took : 5 ms
[2026-05-23 01:43:56] [INFO ] Input system was already deterministic with 187 transitions.
[2026-05-23 01:43:56] [INFO ] Flatten gal took : 5 ms
[2026-05-23 01:43:56] [INFO ] Flatten gal took : 5 ms
[2026-05-23 01:43:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality3535923308561168857.gal : 1 ms
[2026-05-23 01:43:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality5282317357469242219.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/CTLCardinality3535923308561168857.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5282317357469242219.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.36476e+13,0.062941,5080,2,175,5,1971,6,0,547,1060,0


Converting to forward existential form...Done !
original formula: EG((AF(E((p287==1) U ((p109==0)||(p454==1)))) + ((EF(((p239==0)||(p461==1))) * (p307==0)) * A((p428==1) U ((p88==0)||(p528==1))))))
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(E((p287==1) U ((p109==0)||(p454==1)))))) + ((E(TRUE U ((p239==0)||(p461==1))) * (p307==0)) * ...275
Reverse transition relation is NOT exact ! Due to transitions t173, t174, t178, Intersection with reachable at each step enabled. (destroyed/reverse/inter...179
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,1.3887,35368,1,0,578,163822,414,333,3588,228927,668
FORMULA Champagne-PT-H07T0R-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 384/384 places, 576/576 transitions.
Graph (trivial) has 360 edges and 384 vertex of which 53 / 384 are part of one of the 9 SCC in 0 ms
Free SCC test removed 44 places
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 85 place count 339 transition count 440
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 127 rules applied. Total rules applied 212 place count 255 transition count 397
Reduce places removed 20 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 23 rules applied. Total rules applied 235 place count 235 transition count 394
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 240 place count 232 transition count 392
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 241 place count 231 transition count 392
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 241 place count 231 transition count 380
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 265 place count 219 transition count 380
Discarding 37 places :
Symmetric choice reduction at 5 with 37 rule applications. Total rules 302 place count 182 transition count 336
Iterating global reduction 5 with 37 rules applied. Total rules applied 339 place count 182 transition count 336
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 341 place count 182 transition count 334
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 10 Pre rules applied. Total rules applied 341 place count 182 transition count 324
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 361 place count 172 transition count 324
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 370 place count 163 transition count 284
Iterating global reduction 6 with 9 rules applied. Total rules applied 379 place count 163 transition count 284
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 388 place count 163 transition count 275
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 7 with 136 rules applied. Total rules applied 524 place count 95 transition count 207
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 529 place count 90 transition count 179
Iterating global reduction 7 with 5 rules applied. Total rules applied 534 place count 90 transition count 179
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 539 place count 90 transition count 174
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 541 place count 88 transition count 172
Applied a total of 541 rules in 61 ms. Remains 88 /384 variables (removed 296) and now considering 172/576 (removed 404) transitions.
[2026-05-23 01:43:58] [INFO ] Flow matrix only has 99 transitions (discarded 73 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13826836341959084803.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17440309871485779421.kers'
[2026-05-23 01:43:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13826836341959084803.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17440309871485779421.kers]
Normalized transition count is 98 out of 99 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 98 rows 84 cols 266 entries
Finished phase 1 with 61 SingleSign rule and 0 generalized
[2026-05-23 01:43:58] [INFO ] Computed 27 invariants in 0 ms
Computed 27 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17440309871485779421.kers
Total runtime 1 ms.
[2026-05-23 01:43:58] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-23 01:43:58] [INFO ] Flow matrix only has 99 transitions (discarded 73 similar events)
[2026-05-23 01:43:58] [INFO ] Invariant cache hit.
[2026-05-23 01:43:58] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2026-05-23 01:43:58] [INFO ] Redundant transitions in 2 ms returned []
Running 119 sub problems to find dead transitions.
[2026-05-23 01:43:58] [INFO ] Flow matrix only has 99 transitions (discarded 73 similar events)
[2026-05-23 01:43:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 4/88 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 98/186 variables, 88/115 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 0/186 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/187 variables, and 115 constraints, problems are : Problem set: 0 solved, 119 unsolved in 6168 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 4/88 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 98/186 variables, 88/115 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 119/234 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/186 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/187 variables, and 234 constraints, problems are : Problem set: 0 solved, 119 unsolved in 6645 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12824ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 12825ms
Starting structural reductions in SI_CTL mode, iteration 1 : 88/384 places, 172/576 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13090 ms. Remains : 88/384 places, 172/576 transitions.
[2026-05-23 01:44:11] [INFO ] Flatten gal took : 4 ms
[2026-05-23 01:44:11] [INFO ] Flatten gal took : 4 ms
[2026-05-23 01:44:11] [INFO ] Input system was already deterministic with 172 transitions.
[2026-05-23 01:44:11] [INFO ] Flatten gal took : 4 ms
[2026-05-23 01:44:11] [INFO ] Flatten gal took : 4 ms
[2026-05-23 01:44:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality1787706729940974975.gal : 1 ms
[2026-05-23 01:44:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality4091357867275760356.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/CTLCardinality1787706729940974975.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4091357867275760356.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,2.03869e+13,0.056753,5008,2,156,5,2583,6,0,516,1489,0


Converting to forward existential form...Done !
original formula: (E(!(((p100==0) + !((!(((p31==0)||(p41==1))) + EF((p270==1)))))) U EF((p74==1))) * AF(AG(A((p436==0) U ((p183==0)||(p68==1))))))
=> equivalent forward existential formula: ([(Init * !(E(!(((p100==0) + !((!(((p31==0)||(p41==1))) + E(TRUE U (p270==1)))))) U E(TRUE U (p74==1)))))] = FAL...308
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 168/4/4
(forward)formula 0,0,0.620705,16020,1,0,82,56981,32,77,2708,80928,85
FORMULA Champagne-PT-H07T0R-CTLCardinality-2024-14 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 : 384/384 places, 576/576 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 328 transition count 513
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 328 transition count 513
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 115 place count 328 transition count 510
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 151 place count 292 transition count 454
Iterating global reduction 1 with 36 rules applied. Total rules applied 187 place count 292 transition count 454
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 192 place count 292 transition count 449
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 210 place count 274 transition count 405
Iterating global reduction 2 with 18 rules applied. Total rules applied 228 place count 274 transition count 405
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 239 place count 274 transition count 394
Applied a total of 239 rules in 34 ms. Remains 274 /384 variables (removed 110) and now considering 394/576 (removed 182) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11662738516786355274.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16954355697225689281.kers'
[2026-05-23 01:44:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11662738516786355274.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16954355697225689281.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 394 rows 274 cols 1082 entries
Finished phase 1 with 247 SingleSign rule and 0 generalized
[2026-05-23 01:44:12] [INFO ] Computed 27 invariants in 2 ms
Computed 27 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16954355697225689281.kers
Total runtime 4 ms.
[2026-05-23 01:44:12] [INFO ] Implicit Places using invariants in 190 ms returned []
[2026-05-23 01:44:12] [INFO ] Invariant cache hit.
[2026-05-23 01:44:12] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
Running 393 sub problems to find dead transitions.
[2026-05-23 01:44:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (OVERLAPS) 1/274 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (OVERLAPS) 394/668 variables, 274/301 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
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 668/668 variables, and 301 constraints, problems are : Problem set: 0 solved, 393 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (OVERLAPS) 1/274 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (OVERLAPS) 394/668 variables, 274/301 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/668 variables, 393/694 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/668 variables, 1/695 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 668/668 variables, and 695 constraints, problems are : Problem set: 0 solved, 393 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60103ms problems are : Problem set: 0 solved, 393 unsolved
Search for dead transitions found 0 dead transitions in 60105ms
Starting structural reductions in LTL mode, iteration 1 : 274/384 places, 394/576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60786 ms. Remains : 274/384 places, 394/576 transitions.
[2026-05-23 01:45:12] [INFO ] Flatten gal took : 9 ms
[2026-05-23 01:45:12] [INFO ] Flatten gal took : 10 ms
[2026-05-23 01:45:12] [INFO ] Input system was already deterministic with 394 transitions.
[2026-05-23 01:45:12] [INFO ] Flatten gal took : 8 ms
[2026-05-23 01:45:12] [INFO ] Flatten gal took : 9 ms
[2026-05-23 01:45:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality577346335870616807.gal : 2 ms
[2026-05-23 01:45:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality1248896488636460008.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/CTLCardinality577346335870616807.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1248896488636460008.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.56187e+25,0.456567,11688,2,2012,5,38776,6,0,1492,30322,0


Converting to forward existential form...Done !
original formula: E(!(((p437==0)||(p49==1))) U EF((AF(((p9!=1) + EX(((p167==0)||(p159==1))))) * ((p350==1) + (EG((p73==1)) * ((p429==0)||(p11==1)))))))
=> equivalent forward existential formula: ([((FwdU(FwdU(Init,!(((p437==0)||(p49==1)))),TRUE) * !(EG(!(((p9!=1) + EX(((p167==0)||(p159==1)))))))) * (p350==...323
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t26, t30, t35, t39, t44, t45, t49, t55, t59, t61, t66, t70, t75, t76, t80, t86, t90,...465
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 388/6/6
(forward)formula 0,1,4.60644,109160,1,0,719,605562,823,345,9939,504426,875
FORMULA Champagne-PT-H07T0R-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-23 01:45:17] [INFO ] Flatten gal took : 9 ms
[2026-05-23 01:45:17] [INFO ] Flatten gal took : 8 ms
[2026-05-23 01:45:17] [INFO ] Applying decomposition
[2026-05-23 01:45:17] [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/graph15817089981788908442.txt' '-o' '/tmp/graph15817089981788908442.bin' '-w' '/tmp/graph15817089981788908442.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15817089981788908442.bin' '-l' '-1' '-v' '-w' '/tmp/graph15817089981788908442.weights' '-q' '0' '-e' '0.001'
[2026-05-23 01:45:17] [INFO ] Decomposing Gal with order
[2026-05-23 01:45:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 01:45:17] [INFO ] Removed a total of 436 redundant transitions.
[2026-05-23 01:45:17] [INFO ] Flatten gal took : 27 ms
[2026-05-23 01:45:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 12 ms.
[2026-05-23 01:45:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality7389965985199604165.gal : 5 ms
[2026-05-23 01:45:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality8891598280971285705.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/CTLCardinality7389965985199604165.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8891598280971285705.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 -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.12786e+30,0.262883,11336,1073,35,12899,712,973,23531,98,1632,0


Converting to forward existential form...Done !
original formula: AG(!(A(A(((i16.u86.p335==0)||(i15.u82.p316==1)) U ((i21.i1.u123.p517==0)||(i7.i1.u42.p160==1))) U ((((i21.i0.u113.p477==0)||(i7.i0.u44.p1...210
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(((((i21.i0.u113.p477==0)||(i7.i0.u44.p163==1))&&(i0.u24.p91==1)) * EX((i7.i1.u42.p15...589
Reverse transition relation is NOT exact ! Due to transitions t36, t62, t76, t112, t152, t349, t361, i0.t324, i0.t320, i1.i1.u6.t379, i2.t367, i3.u15.t354,...1242
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
(forward)formula 0,0,140.375,1781220,1,0,2.82028e+06,1102,6147,4.60381e+06,460,3288,2262544
FORMULA Champagne-PT-H07T0R-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 1098524 ms.

BK_STOP 1779500858591

--------------------
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="Champagne-PT-H07T0R"
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 Champagne-PT-H07T0R, 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 r050-smll-177946901000073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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