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.r162-smll-177961107700073.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 IBM319-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-177961107700073
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 12K Mar 7 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 7 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Mar 7 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 7 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.2K Mar 15 10:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 10:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Mar 15 11:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 15 11:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Mar 7 16:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Mar 7 16:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Mar 7 16:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Mar 7 16:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 11:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 15 11:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 184K 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 IBM319-PT-none-CTLCardinality-2024-00
FORMULA_NAME IBM319-PT-none-CTLCardinality-2024-01
FORMULA_NAME IBM319-PT-none-CTLCardinality-2024-02
FORMULA_NAME IBM319-PT-none-CTLCardinality-2024-03
FORMULA_NAME IBM319-PT-none-CTLCardinality-2024-04
FORMULA_NAME IBM319-PT-none-CTLCardinality-2024-05
FORMULA_NAME IBM319-PT-none-CTLCardinality-2024-06
FORMULA_NAME IBM319-PT-none-CTLCardinality-2024-07
FORMULA_NAME IBM319-PT-none-CTLCardinality-2024-08
FORMULA_NAME IBM319-PT-none-CTLCardinality-2024-09
FORMULA_NAME IBM319-PT-none-CTLCardinality-2024-10
FORMULA_NAME IBM319-PT-none-CTLCardinality-2024-11
FORMULA_NAME IBM319-PT-none-CTLCardinality-2024-12
FORMULA_NAME IBM319-PT-none-CTLCardinality-2024-13
FORMULA_NAME IBM319-PT-none-CTLCardinality-2024-14
FORMULA_NAME IBM319-PT-none-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779721150901

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBM319-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-25 14:59:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 14:59:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 14:59:13] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2026-05-25 14:59:13] [INFO ] Transformed 253 places.
[2026-05-25 14:59:13] [INFO ] Transformed 178 transitions.
[2026-05-25 14:59:13] [INFO ] Found NUPN structural information;
[2026-05-25 14:59:13] [INFO ] Parsed PT model containing 253 places and 178 transitions and 526 arcs in 411 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 27 ms.
Initial state reduction rules removed 1 formulas.
FORMULA IBM319-PT-none-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 75 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 178/178 transitions.
Ensure Unique test removed 71 places
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 175 transition count 178
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 82 place count 171 transition count 174
Iterating global reduction 1 with 4 rules applied. Total rules applied 86 place count 171 transition count 174
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 170 transition count 173
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 170 transition count 173
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 169 transition count 172
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 169 transition count 172
Applied a total of 90 rules in 107 ms. Remains 169 /253 variables (removed 84) and now considering 172/178 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15714632743190651816.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5661015973174842372.kers'
[2026-05-25 14:59:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15714632743190651816.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5661015973174842372.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 172 rows 164 cols 357 entries
Finished phase 1 with 155 SingleSign rule and 5 generalized
[2026-05-25 14:59:14] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5661015973174842372.kers
Total runtime 3 ms.
[2026-05-25 14:59:14] [INFO ] Implicit Places using invariants in 427 ms returned []
[2026-05-25 14:59:14] [INFO ] Invariant cache hit.
[2026-05-25 14:59:15] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 830 ms to find 0 implicit places.
Running 171 sub problems to find dead transitions.
[2026-05-25 14:59:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 172/339 variables, 167/176 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Problem TDEAD19 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD167 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/341 variables, 2/178 constraints. Problems are: Problem set: 8 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/178 constraints. Problems are: Problem set: 8 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 0/341 variables, 0/178 constraints. Problems are: Problem set: 8 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 178 constraints, problems are : Problem set: 8 solved, 163 unsolved in 23683 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 8/8 constraints. Problems are: Problem set: 8 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/8 constraints. Problems are: Problem set: 8 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 2/157 variables, 1/9 constraints. Problems are: Problem set: 8 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/9 constraints. Problems are: Problem set: 8 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 165/322 variables, 157/166 constraints. Problems are: Problem set: 8 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 154/320 constraints. Problems are: Problem set: 8 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/320 constraints. Problems are: Problem set: 8 solved, 163 unsolved
At refinement iteration 7 (OVERLAPS) 8/330 variables, 6/326 constraints. Problems are: Problem set: 8 solved, 163 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 9/335 constraints. Problems are: Problem set: 8 solved, 163 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/335 constraints. Problems are: Problem set: 8 solved, 163 unsolved
SMT process timed out in 53772ms, After SMT, problems are : Problem set: 8 solved, 163 unsolved
Search for dead transitions found 8 dead transitions in 53791ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in LTL mode, iteration 1 : 169/253 places, 164/178 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 161 transition count 164
Deduced a syphon composed of 3 places in 1 ms
Applied a total of 8 rules in 7 ms. Remains 161 /169 variables (removed 8) and now considering 164/164 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2490981037210701496.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1919817679748229790.kers'
[2026-05-25 15:00:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2490981037210701496.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1919817679748229790.kers]
Culling trivial invariants: removing 3 columns.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 164 rows 153 cols 333 entries
Finished phase 1 with 148 SingleSign rule and 2 generalized
[2026-05-25 15:00:08] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1919817679748229790.kers
Total runtime 1 ms.
[2026-05-25 15:00:08] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-25 15:00:08] [INFO ] Invariant cache hit.
[2026-05-25 15:00:09] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 161/253 places, 164/178 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55079 ms. Remains : 161/253 places, 164/178 transitions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 164/164 transitions.
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 0 rules in 5 ms. Remains 161 /161 variables (removed 0) and now considering 164/164 (removed 0) transitions.
[2026-05-25 15:00:09] [INFO ] Invariant cache hit.
[2026-05-25 15:00:09] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-25 15:00:09] [INFO ] Invariant cache hit.
[2026-05-25 15:00:09] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2026-05-25 15:00:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 164/319 variables, 155/163 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 3/322 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 0/322 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/325 variables, and 166 constraints, problems are : Problem set: 0 solved, 163 unsolved in 24008 ms.
Refiners :[Positive P Invariants (semi-flows): 0/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 158/161 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 164/319 variables, 155/163 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 160/323 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 3/322 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 3/329 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 163 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/325 variables, and 329 constraints, problems are : Problem set: 0 solved, 163 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 0/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 158/161 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54072ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 54075ms
Finished structural reductions in LTL mode , in 1 iterations and 54417 ms. Remains : 161/161 places, 164/164 transitions.
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Support contains 69 out of 158 places after structural reductions.
[2026-05-25 15:01:03] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2026-05-25 15:01:03] [INFO ] Flatten gal took : 51 ms
FORMULA IBM319-PT-none-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 15:01:03] [INFO ] Flatten gal took : 29 ms
[2026-05-25 15:01:03] [INFO ] Input system was already deterministic with 164 transitions.
Support contains 63 out of 158 places (down from 69) after GAL structural reductions.
RANDOM walk for 25172 steps (491 resets) in 1254 ms. (20 steps per ms) remains 0/42 properties
[2026-05-25 15:01:04] [INFO ] Flatten gal took : 11 ms
[2026-05-25 15:01:04] [INFO ] Flatten gal took : 11 ms
[2026-05-25 15:01:04] [INFO ] Input system was already deterministic with 164 transitions.
Computed a total of 158 stabilizing places and 164 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 158 transition count 164
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 3 formulas.
FORMULA IBM319-PT-none-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 164/164 transitions.
Ensure Unique test removed 5 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 152 transition count 164
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 16 place count 142 transition count 154
Iterating global reduction 1 with 10 rules applied. Total rules applied 26 place count 142 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 27 place count 142 transition count 153
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 141 transition count 152
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 141 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 140 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 140 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 139 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 139 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 138 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 138 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 137 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 137 transition count 148
Applied a total of 37 rules in 35 ms. Remains 137 /158 variables (removed 21) and now considering 148/164 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9992121471087967429.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7275573939399030498.kers'
[2026-05-25 15:01:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9992121471087967429.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7275573939399030498.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 148 rows 137 cols 301 entries
Finished phase 1 with 132 SingleSign rule and 2 generalized
[2026-05-25 15:01:04] [INFO ] Computed 3 invariants in 1 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7275573939399030498.kers
Total runtime 1 ms.
[2026-05-25 15:01:04] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-25 15:01:04] [INFO ] Invariant cache hit.
[2026-05-25 15:01:04] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2026-05-25 15:01:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 148/283 variables, 135/138 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 2/285 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 140 constraints, problems are : Problem set: 0 solved, 147 unsolved in 14159 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 148/283 variables, 135/138 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 145/283 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 2/285 variables, 2/285 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 287 constraints, problems are : Problem set: 0 solved, 147 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44194ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 44198ms
Starting structural reductions in LTL mode, iteration 1 : 137/158 places, 148/164 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44490 ms. Remains : 137/158 places, 148/164 transitions.
[2026-05-25 15:01:49] [INFO ] Flatten gal took : 13 ms
[2026-05-25 15:01:49] [INFO ] Flatten gal took : 18 ms
[2026-05-25 15:01:49] [INFO ] Input system was already deterministic with 148 transitions.
[2026-05-25 15:01:49] [INFO ] Flatten gal took : 9 ms
[2026-05-25 15:01:49] [INFO ] Flatten gal took : 11 ms
[2026-05-25 15:01:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality13902284426891921907.gal : 5 ms
[2026-05-25 15:01:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality4413838383963691099.ctl : 4 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/CTLCardinality13902284426891921907.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4413838383963691099.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,2176,0.058728,4768,2,461,5,2611,6,0,690,1959,0


Converting to forward existential form...Done !
original formula: !(E(AX((E((callToProcess_s00002944_inputCriterion_s00001053_used!=0) U ((callToTask_s00002960_input_s00001066==0)||(callToProcess_s000029...381
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!((E((callToProcess_s00002944_inputCriterion_s00001053_used!=0) U ((callToTask_s00002960_input_...435
Reverse transition relation is NOT exact ! Due to transitions t31, t41, t42, t43, t44, t132, t143, Intersection with reachable at each step enabled. (dest...198
(forward)formula 0,1,0.474521,16512,1,0,330,66409,326,278,3441,57387,579
FORMULA IBM319-PT-none-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 158/158 places, 164/164 transitions.
Graph (complete) has 179 edges and 158 vertex of which 50 are kept as prefixes of interest. Removing 108 places using SCC suffix rule.2 ms
Discarding 108 places :
Also discarding 114 output transitions
Drop transitions (Output transitions of discarded places.) removed 114 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 47 transition count 20
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 62 place count 18 transition count 17
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 65 place count 16 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 66 place count 15 transition count 16
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 66 place count 15 transition count 12
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 74 place count 11 transition count 12
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 76 place count 10 transition count 11
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 78 place count 9 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 78 place count 9 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 83 place count 6 transition count 8
Applied a total of 83 rules in 25 ms. Remains 6 /158 variables (removed 152) and now considering 8/164 (removed 156) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8573410132970309278.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18353365424091965352.kers'
[2026-05-25 15:01:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8573410132970309278.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18353365424091965352.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 6 cols 13 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-25 15:01:49] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18353365424091965352.kers
Total runtime 0 ms.
[2026-05-25 15:01:49] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-25 15:01:49] [INFO ] Invariant cache hit.
[2026-05-25 15:01:49] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2026-05-25 15:01:49] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-25 15:01:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 6 constraints, problems are : Problem set: 0 solved, 6 unsolved in 147 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/14 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 12 constraints, problems are : Problem set: 0 solved, 6 unsolved in 144 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 293ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 294ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/158 places, 8/164 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 387 ms. Remains : 6/158 places, 8/164 transitions.
[2026-05-25 15:01:50] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:01:50] [INFO ] Flatten gal took : 0 ms
[2026-05-25 15:01:50] [INFO ] Input system was already deterministic with 8 transitions.
[2026-05-25 15:01:50] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:01:50] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:01:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality7991135985622536455.gal : 0 ms
[2026-05-25 15:01:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality7007575199940999357.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/CTLCardinality7991135985622536455.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7007575199940999357.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,0.003188,3764,2,12,5,49,6,0,31,41,0


Converting to forward existential form...Done !
original formula: EF(!(A((callToTask_s00002965_inputCriterion_s00001053_used==0) U (callToTask_s00002931_output_s00001054!=1))))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),!((callToTask_s00002931_output_s00001054!=1))) * (!((callToTask_s00002965_inputCriterion...317
dead was empty
(forward)formula 0,0,0.005364,4036,1,0,13,128,17,2,125,119,11
FORMULA IBM319-PT-none-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 158/158 places, 164/164 transitions.
Graph (complete) has 179 edges and 158 vertex of which 103 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.1 ms
Discarding 55 places :
Also discarding 57 output transitions
Drop transitions (Output transitions of discarded places.) removed 57 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 99 transition count 38
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 78 rules applied. Total rules applied 147 place count 31 transition count 28
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 154 place count 25 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 155 place count 24 transition count 27
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 155 place count 24 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 175 place count 13 transition count 18
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 177 place count 12 transition count 17
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 179 place count 11 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 179 place count 11 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 184 place count 8 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 188 place count 8 transition count 10
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 190 place count 8 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 192 place count 6 transition count 8
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 193 place count 6 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 1 rules applied. Total rules applied 194 place count 6 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 195 place count 5 transition count 6
Applied a total of 195 rules in 19 ms. Remains 5 /158 variables (removed 153) and now considering 6/164 (removed 158) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4567889094688677667.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3738994218582711678.kers'
[2026-05-25 15:01:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4567889094688677667.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3738994218582711678.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 6 rows 5 cols 10 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-25 15:01:50] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3738994218582711678.kers
Total runtime 2 ms.
[2026-05-25 15:01:50] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-25 15:01:50] [INFO ] Invariant cache hit.
[2026-05-25 15:01:50] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2026-05-25 15:01:50] [INFO ] Redundant transitions in 1 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-25 15:01:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/11 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 5 constraints, problems are : Problem set: 0 solved, 5 unsolved in 72 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1/11 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/11 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/11 variables, and 10 constraints, problems are : Problem set: 0 solved, 5 unsolved in 78 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 153ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 153ms
Starting structural reductions in SI_CTL mode, iteration 1 : 5/158 places, 6/164 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 228 ms. Remains : 5/158 places, 6/164 transitions.
[2026-05-25 15:01:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-25 15:01:50] [INFO ] Flatten gal took : 1 ms
FORMULA IBM319-PT-none-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 15:01:50] [INFO ] Flatten gal took : 0 ms
[2026-05-25 15:01:50] [INFO ] Input system was already deterministic with 6 transitions.
Support contains 0 out of 5 places (down from 2) after GAL structural reductions.
Starting structural reductions in SI_CTL mode, iteration 0 : 158/158 places, 164/164 transitions.
Graph (complete) has 179 edges and 158 vertex of which 69 are kept as prefixes of interest. Removing 89 places using SCC suffix rule.1 ms
Discarding 89 places :
Also discarding 96 output transitions
Drop transitions (Output transitions of discarded places.) removed 96 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 66 transition count 31
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 45 rules applied. Total rules applied 82 place count 30 transition count 22
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 90 place count 24 transition count 20
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 92 place count 22 transition count 20
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 92 place count 22 transition count 14
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 13 rules applied. Total rules applied 105 place count 15 transition count 14
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 108 place count 13 transition count 13
Reduce places removed 1 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 5 with 3 rules applied. Total rules applied 111 place count 12 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 112 place count 11 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 112 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 115 place count 9 transition count 10
Applied a total of 115 rules in 9 ms. Remains 9 /158 variables (removed 149) and now considering 10/164 (removed 154) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2658537704404201611.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9806710594184003684.kers'
[2026-05-25 15:01:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2658537704404201611.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9806710594184003684.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 10 rows 9 cols 18 entries
Finished phase 1 with 9 SingleSign rule and 0 generalized
[2026-05-25 15:01:50] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9806710594184003684.kers
Total runtime 0 ms.
[2026-05-25 15:01:50] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-25 15:01:50] [INFO ] Invariant cache hit.
[2026-05-25 15:01:50] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2026-05-25 15:01:50] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2026-05-25 15:01:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 10/18 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1/19 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 9 constraints, problems are : Problem set: 0 solved, 9 unsolved in 168 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 10/18 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 1/19 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 18 constraints, problems are : Problem set: 0 solved, 9 unsolved in 153 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 324ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 325ms
Starting structural reductions in SI_CTL mode, iteration 1 : 9/158 places, 10/164 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 397 ms. Remains : 9/158 places, 10/164 transitions.
[2026-05-25 15:01:50] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:01:50] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:01:50] [INFO ] Input system was already deterministic with 10 transitions.
[2026-05-25 15:01:50] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:01:50] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:01:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality10470567635765771157.gal : 1 ms
[2026-05-25 15:01:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality10905943787442590232.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/CTLCardinality10470567635765771157.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10905943787442590232.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,10,0.004271,3784,2,18,5,70,6,0,46,54,0


Converting to forward existential form...Done !
original formula: AF((AG(((join_s00001163_activated_s00001065==0)&&(callToTask_s00002960_inputCriterion_s00001053_used==0))) * !(E((callToTask_s00002870_in...248
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !(((join_s00001163_activated_s00001065==0)&&(callToTask_s00002960_inputCriterion_s00001...305
Reverse transition relation is NOT exact ! Due to transitions t4, t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total...166
dead was empty
(forward)formula 0,1,0.009719,4332,1,0,32,397,49,19,247,464,49
FORMULA IBM319-PT-none-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 164/164 transitions.
Ensure Unique test removed 5 places
Reduce places removed 6 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 151 transition count 164
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 17 place count 141 transition count 154
Iterating global reduction 1 with 10 rules applied. Total rules applied 27 place count 141 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 141 transition count 153
Applied a total of 28 rules in 9 ms. Remains 141 /158 variables (removed 17) and now considering 153/164 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5047628867982794668.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16164266182719667902.kers'
[2026-05-25 15:01:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5047628867982794668.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16164266182719667902.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 153 rows 141 cols 308 entries
Finished phase 1 with 138 SingleSign rule and 1 generalized
[2026-05-25 15:01:50] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16164266182719667902.kers
Total runtime 1 ms.
[2026-05-25 15:01:50] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-25 15:01:50] [INFO ] Invariant cache hit.
[2026-05-25 15:01:51] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2026-05-25 15:01:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 153/292 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 2/294 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/294 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 143 constraints, problems are : Problem set: 0 solved, 152 unsolved in 17452 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 153/292 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 151/292 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (OVERLAPS) 2/294 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 294/294 variables, and 295 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47494ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 47495ms
Starting structural reductions in LTL mode, iteration 1 : 141/158 places, 153/164 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47815 ms. Remains : 141/158 places, 153/164 transitions.
[2026-05-25 15:02:38] [INFO ] Flatten gal took : 19 ms
[2026-05-25 15:02:38] [INFO ] Flatten gal took : 12 ms
[2026-05-25 15:02:38] [INFO ] Input system was already deterministic with 153 transitions.
[2026-05-25 15:02:38] [INFO ] Flatten gal took : 7 ms
[2026-05-25 15:02:38] [INFO ] Flatten gal took : 6 ms
[2026-05-25 15:02:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality17127801351751179372.gal : 3 ms
[2026-05-25 15:02:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality9570630759186371328.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/CTLCardinality17127801351751179372.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9570630759186371328.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,2059,0.048234,4996,2,449,5,2982,6,0,710,2811,0


Converting to forward existential form...Done !
original formula: E(!(AX((callToTask_s00002824_output_s00001077==1))) U !(AX(((callToTask_s00002958_output_s00001054==0)||(fork_s00001403_activated_s000010...165
=> equivalent forward existential formula: [(EY(FwdU(Init,!(!(EX(!((callToTask_s00002824_output_s00001077==1))))))) * !(((callToTask_s00002958_output_s0000...217
Reverse transition relation is NOT exact ! Due to transitions t31, t41, t42, t43, t44, t45, t137, t148, Intersection with reachable at each step enabled. ...203
(forward)formula 0,1,0.522799,20652,1,0,456,77003,329,347,3647,101044,616
FORMULA IBM319-PT-none-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 158/158 places, 164/164 transitions.
Graph (complete) has 179 edges and 158 vertex of which 127 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 32 output transitions
Drop transitions (Output transitions of discarded places.) removed 32 transitions
Ensure Unique test removed 4 places
Reduce places removed 5 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 122 transition count 47
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 94 rules applied. Total rules applied 179 place count 38 transition count 37
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 185 place count 32 transition count 37
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 185 place count 32 transition count 23
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 215 place count 16 transition count 23
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 217 place count 15 transition count 22
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 219 place count 14 transition count 21
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 219 place count 14 transition count 19
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 224 place count 11 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 229 place count 11 transition count 14
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 231 place count 11 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 233 place count 9 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 233 place count 9 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 237 place count 7 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 238 place count 7 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 238 place count 7 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 240 place count 6 transition count 8
Applied a total of 240 rules in 10 ms. Remains 6 /158 variables (removed 152) and now considering 8/164 (removed 156) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4257169601717661218.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6949167809849273197.kers'
[2026-05-25 15:02:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4257169601717661218.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6949167809849273197.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 6 cols 14 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-25 15:02:39] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6949167809849273197.kers
Total runtime 0 ms.
[2026-05-25 15:02:39] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-25 15:02:39] [INFO ] Invariant cache hit.
[2026-05-25 15:02:39] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2026-05-25 15:02:39] [INFO ] Redundant transitions in 1 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-25 15:02:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 6 constraints, problems are : Problem set: 0 solved, 6 unsolved in 136 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/14 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 12 constraints, problems are : Problem set: 0 solved, 6 unsolved in 124 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 264ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 265ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/158 places, 8/164 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 346 ms. Remains : 6/158 places, 8/164 transitions.
[2026-05-25 15:02:39] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:02:39] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:02:39] [INFO ] Input system was already deterministic with 8 transitions.
[2026-05-25 15:02:39] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:02:39] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:02:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality13718553256830896103.gal : 0 ms
[2026-05-25 15:02:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality10159795834978191615.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/CTLCardinality13718553256830896103.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10159795834978191615.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,11,0.004725,3768,2,15,5,67,6,0,30,54,0


Converting to forward existential form...Done !
original formula: EG(EF((callToTask_s00002951_output_s00001054==0)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (callToTask_s00002951_output_s00001054==0)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t5, t7, Intersection with reachable at each step enabled. (destroyed/reverse/interse...173
(forward)formula 0,1,0.009048,4048,1,0,34,307,40,15,167,385,38
FORMULA IBM319-PT-none-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 164/164 transitions.
Ensure Unique test removed 3 places
Reduce places removed 5 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 152 transition count 164
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 13 place count 145 transition count 157
Iterating global reduction 1 with 7 rules applied. Total rules applied 20 place count 145 transition count 157
Applied a total of 20 rules in 12 ms. Remains 145 /158 variables (removed 13) and now considering 157/164 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16988068568219872379.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11665345987449822041.kers'
[2026-05-25 15:02:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16988068568219872379.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11665345987449822041.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 157 rows 143 cols 316 entries
Finished phase 1 with 140 SingleSign rule and 1 generalized
[2026-05-25 15:02:39] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11665345987449822041.kers
Total runtime 2 ms.
[2026-05-25 15:02:39] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-25 15:02:39] [INFO ] Invariant cache hit.
[2026-05-25 15:02:39] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2026-05-25 15:02:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 157/301 variables, 144/148 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 1/302 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 0/302 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 149 constraints, problems are : Problem set: 0 solved, 156 unsolved in 17183 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 157/301 variables, 144/148 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 156/304 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (OVERLAPS) 1/302 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/302 variables, and 305 constraints, problems are : Problem set: 0 solved, 156 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47215ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 47218ms
Starting structural reductions in LTL mode, iteration 1 : 145/158 places, 157/164 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47599 ms. Remains : 145/158 places, 157/164 transitions.
[2026-05-25 15:03:27] [INFO ] Flatten gal took : 7 ms
[2026-05-25 15:03:27] [INFO ] Flatten gal took : 7 ms
[2026-05-25 15:03:27] [INFO ] Input system was already deterministic with 157 transitions.
[2026-05-25 15:03:27] [INFO ] Flatten gal took : 6 ms
[2026-05-25 15:03:27] [INFO ] Flatten gal took : 6 ms
[2026-05-25 15:03:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality679076190899558484.gal : 1 ms
[2026-05-25 15:03:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality7115689155967947355.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/CTLCardinality679076190899558484.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7115689155967947355.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,2101,0.052064,5100,2,569,5,3201,6,0,733,2977,0


Converting to forward existential form...Done !
original formula: AG((((decision_s00001126_input_s00001052==0) + A(!(EG((decision_s00001123_input_s00001066==1))) U (((AX((callToTask_s00002950_output_s000...1121
=> equivalent forward existential formula: ((([(FwdU((FwdU(((FwdU(Init,TRUE) * !(((decision_s00001126_input_s00001052==0) + !((E(!((((!(EX(!((callToTask_s0...7881
Reverse transition relation is NOT exact ! Due to transitions t32, t43, t44, t45, t46, t59, t62, t152, Intersection with reachable at each step enabled. (...202
dead was empty
dead was empty
(forward)formula 0,1,0.680485,24048,1,0,331,78713,369,166,3826,95175,481
FORMULA IBM319-PT-none-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 164/164 transitions.
Ensure Unique test removed 5 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 151 transition count 164
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 16 place count 142 transition count 155
Iterating global reduction 1 with 9 rules applied. Total rules applied 25 place count 142 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 142 transition count 154
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 141 transition count 153
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 141 transition count 153
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 140 transition count 152
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 140 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 139 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 139 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 138 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 138 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 137 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 137 transition count 149
Applied a total of 36 rules in 19 ms. Remains 137 /158 variables (removed 21) and now considering 149/164 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1910501708589997725.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2156874623136820651.kers'
[2026-05-25 15:03:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1910501708589997725.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2156874623136820651.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 149 rows 137 cols 302 entries
Finished phase 1 with 132 SingleSign rule and 2 generalized
[2026-05-25 15:03:27] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2156874623136820651.kers
Total runtime 2 ms.
[2026-05-25 15:03:28] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-25 15:03:28] [INFO ] Invariant cache hit.
[2026-05-25 15:03:28] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Running 148 sub problems to find dead transitions.
[2026-05-25 15:03:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 149/285 variables, 136/139 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (OVERLAPS) 1/286 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 0/286 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 140 constraints, problems are : Problem set: 0 solved, 148 unsolved in 13414 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 149/285 variables, 136/139 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 148/287 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (OVERLAPS) 1/286 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (OVERLAPS) 0/286 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/286 variables, and 288 constraints, problems are : Problem set: 0 solved, 148 unsolved in 28407 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41841ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 41843ms
Starting structural reductions in LTL mode, iteration 1 : 137/158 places, 149/164 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42135 ms. Remains : 137/158 places, 149/164 transitions.
[2026-05-25 15:04:10] [INFO ] Flatten gal took : 14 ms
[2026-05-25 15:04:10] [INFO ] Flatten gal took : 10 ms
[2026-05-25 15:04:10] [INFO ] Input system was already deterministic with 149 transitions.
[2026-05-25 15:04:10] [INFO ] Flatten gal took : 16 ms
[2026-05-25 15:04:10] [INFO ] Flatten gal took : 14 ms
[2026-05-25 15:04:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality9200420075677746432.gal : 3 ms
[2026-05-25 15:04:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality13979152231108294518.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/CTLCardinality9200420075677746432.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13979152231108294518.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,2176,0.053555,4872,2,448,5,2621,6,0,693,2140,0


Converting to forward existential form...Done !
original formula: (A(EX(AX(((((callToProcess_s00002121_output_s00001077==0)||(merge_s00001162_input_s00001068==1))&&((join_s00001164_input_s00001066==0)||(...589
=> equivalent forward existential formula: (((([FwdG((FwdU(Init,!(((!(EG(!((callToTask_s00002953_input_s00001066==1)))) * E(TRUE U ((callToTask_s00002824_o...2163
Reverse transition relation is NOT exact ! Due to transitions t31, t41, t42, t43, t44, t45, t133, t144, Intersection with reachable at each step enabled. ...203
(forward)formula 0,0,0.511139,18532,1,0,307,60625,329,149,3962,67638,447
FORMULA IBM319-PT-none-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 164/164 transitions.
Ensure Unique test removed 5 places
Reduce places removed 7 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 150 transition count 164
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 19 place count 139 transition count 153
Iterating global reduction 1 with 11 rules applied. Total rules applied 30 place count 139 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 139 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 138 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 138 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 137 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 137 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 136 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 136 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 135 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 135 transition count 148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 134 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 134 transition count 147
Applied a total of 41 rules in 23 ms. Remains 134 /158 variables (removed 24) and now considering 147/164 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4468948871098293049.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4147682555486788086.kers'
[2026-05-25 15:04:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4468948871098293049.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4147682555486788086.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 147 rows 134 cols 296 entries
Finished phase 1 with 131 SingleSign rule and 1 generalized
[2026-05-25 15:04:10] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4147682555486788086.kers
Total runtime 2 ms.
[2026-05-25 15:04:10] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-25 15:04:10] [INFO ] Invariant cache hit.
[2026-05-25 15:04:10] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2026-05-25 15:04:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/280 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 1/281 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/281 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 136 constraints, problems are : Problem set: 0 solved, 146 unsolved in 16655 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/280 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 146/281 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 1/281 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/281 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 282 constraints, problems are : Problem set: 0 solved, 146 unsolved in 30010 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46686ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 46688ms
Starting structural reductions in LTL mode, iteration 1 : 134/158 places, 147/164 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46984 ms. Remains : 134/158 places, 147/164 transitions.
[2026-05-25 15:04:57] [INFO ] Flatten gal took : 9 ms
[2026-05-25 15:04:57] [INFO ] Flatten gal took : 10 ms
[2026-05-25 15:04:57] [INFO ] Input system was already deterministic with 147 transitions.
[2026-05-25 15:04:57] [INFO ] Flatten gal took : 9 ms
[2026-05-25 15:04:57] [INFO ] Flatten gal took : 9 ms
[2026-05-25 15:04:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality6029335647852315027.gal : 2 ms
[2026-05-25 15:04:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality3537872215459974473.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/CTLCardinality6029335647852315027.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3537872215459974473.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,2038,0.075997,4860,2,443,5,2571,6,0,679,2143,0


Converting to forward existential form...Done !
original formula: EG(((EG(AX((callToTask_s00002951_output_s00001077==0))) * AX(((callToTask_s00002963_input_s00001066==0)||(callToTask_s00002931_inputCrite...272
=> equivalent forward existential formula: [FwdG(Init,((EG(!(EX(!((callToTask_s00002951_output_s00001077==0))))) * !(EX(!(((callToTask_s00002963_input_s000...327
Reverse transition relation is NOT exact ! Due to transitions t31, t41, t42, t43, t44, t45, t131, t142, Intersection with reachable at each step enabled. ...203
(forward)formula 0,1,1.0649,33180,1,0,607,165533,322,398,3496,181352,731
FORMULA IBM319-PT-none-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 164/164 transitions.
Ensure Unique test removed 5 places
Reduce places removed 7 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 150 transition count 164
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 17 place count 141 transition count 155
Iterating global reduction 1 with 9 rules applied. Total rules applied 26 place count 141 transition count 155
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 140 transition count 154
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 140 transition count 154
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 139 transition count 153
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 139 transition count 153
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 138 transition count 152
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 138 transition count 152
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 137 transition count 151
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 137 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 136 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 136 transition count 150
Applied a total of 36 rules in 10 ms. Remains 136 /158 variables (removed 22) and now considering 150/164 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14386410123172817967.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9868775989742662238.kers'
[2026-05-25 15:04:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14386410123172817967.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9868775989742662238.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 150 rows 136 cols 302 entries
Finished phase 1 with 133 SingleSign rule and 1 generalized
[2026-05-25 15:04:58] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9868775989742662238.kers
Total runtime 1 ms.
[2026-05-25 15:04:58] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-25 15:04:58] [INFO ] Invariant cache hit.
[2026-05-25 15:04:59] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2026-05-25 15:04:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 150/285 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (OVERLAPS) 1/286 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 0/286 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 138 constraints, problems are : Problem set: 0 solved, 149 unsolved in 14880 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 150/285 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 149/286 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (OVERLAPS) 1/286 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (OVERLAPS) 0/286 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/286 variables, and 287 constraints, problems are : Problem set: 0 solved, 149 unsolved in 29317 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44207ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 44210ms
Starting structural reductions in LTL mode, iteration 1 : 136/158 places, 150/164 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44526 ms. Remains : 136/158 places, 150/164 transitions.
[2026-05-25 15:05:43] [INFO ] Flatten gal took : 6 ms
[2026-05-25 15:05:43] [INFO ] Flatten gal took : 6 ms
[2026-05-25 15:05:43] [INFO ] Input system was already deterministic with 150 transitions.
[2026-05-25 15:05:43] [INFO ] Flatten gal took : 5 ms
[2026-05-25 15:05:43] [INFO ] Flatten gal took : 5 ms
[2026-05-25 15:05:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality7953843842460301475.gal : 1 ms
[2026-05-25 15:05:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality3125955979310429219.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/CTLCardinality7953843842460301475.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3125955979310429219.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,2083,0.078213,4968,2,465,5,2889,6,0,690,2617,0


Converting to forward existential form...Done !
original formula: EG(AX(((EF(((merge_s00002240_input_s00001127==0)&&(callToTask_s00002952_input_s00001066==1))) * (callToTask_s00001852_output_s00001077==1...437
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(((E(TRUE U ((merge_s00002240_input_s00001127==0)&&(callToTask_s00002952_input_s00001066==1))) ...492
Reverse transition relation is NOT exact ! Due to transitions t32, t42, t43, t44, t45, t46, t134, t145, Intersection with reachable at each step enabled. ...203
(forward)formula 0,1,1.1158,25284,1,0,427,94590,328,266,3792,117174,566
FORMULA IBM319-PT-none-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 158/158 places, 164/164 transitions.
Graph (complete) has 179 edges and 158 vertex of which 138 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 20 output transitions
Drop transitions (Output transitions of discarded places.) removed 20 transitions
Ensure Unique test removed 5 places
Reduce places removed 6 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 132 transition count 55
Reduce places removed 88 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 98 rules applied. Total rules applied 187 place count 44 transition count 45
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 194 place count 38 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 195 place count 37 transition count 44
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 195 place count 37 transition count 30
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 225 place count 21 transition count 30
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 227 place count 20 transition count 29
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 229 place count 19 transition count 28
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 229 place count 19 transition count 26
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 234 place count 16 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 239 place count 16 transition count 21
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 241 place count 16 transition count 19
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 244 place count 14 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 245 place count 13 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 245 place count 13 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 247 place count 12 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 248 place count 12 transition count 16
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 248 place count 12 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 250 place count 11 transition count 15
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 251 place count 11 transition count 15
Applied a total of 251 rules in 19 ms. Remains 11 /158 variables (removed 147) and now considering 15/164 (removed 149) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3354063083851079633.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6098253866120736488.kers'
[2026-05-25 15:05:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3354063083851079633.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6098253866120736488.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 15 rows 11 cols 28 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-25 15:05:44] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6098253866120736488.kers
Total runtime 0 ms.
[2026-05-25 15:05:44] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-25 15:05:44] [INFO ] Invariant cache hit.
[2026-05-25 15:05:44] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2026-05-25 15:05:44] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2026-05-25 15:05:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 14/24 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 2/26 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 0/26 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 11 constraints, problems are : Problem set: 0 solved, 12 unsolved in 193 ms.
Refiners :[State Equation: 11/11 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 14/24 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 2/26 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/26 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 23 constraints, problems are : Problem set: 0 solved, 12 unsolved in 230 ms.
Refiners :[State Equation: 11/11 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 426ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 426ms
Starting structural reductions in SI_CTL mode, iteration 1 : 11/158 places, 15/164 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 511 ms. Remains : 11/158 places, 15/164 transitions.
[2026-05-25 15:05:45] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:05:45] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:05:45] [INFO ] Input system was already deterministic with 15 transitions.
[2026-05-25 15:05:45] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:05:45] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:05:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality11786713808314808432.gal : 1 ms
[2026-05-25 15:05:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality14646060674536506914.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/CTLCardinality11786713808314808432.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14646060674536506914.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,20,0.00423,3820,2,29,5,141,6,0,56,107,0


Converting to forward existential form...Done !
original formula: EF((AG(((callToTask_s00002956_output_s00001077==0)||(merge_s00002241_input_s00001127==1))) + (callToTask_s00002951_inputCriterion_s000010...168
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !(((callToTask_s00002956_output_s00001077==0)||(merge_s00002241_input_s00001127=...263
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t5, t11, t12, Intersection with reachable at each step enabled. (destroyed/reverse/i...181
(forward)formula 0,1,0.008244,4100,1,0,36,702,52,18,299,691,39
FORMULA IBM319-PT-none-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-05-25 15:05:45] [INFO ] Flatten gal took : 10 ms
[2026-05-25 15:05:45] [INFO ] Flatten gal took : 9 ms
Total runtime 391617 ms.

BK_STOP 1779721545130

--------------------
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="IBM319-PT-none"
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 IBM319-PT-none, 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 r162-smll-177961107700073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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