About the Execution of ITS-Tools for CO4-PT-06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 862.979 | 354532.00 | 411876.00 | 977.70 | FFTTTTTFTFTTTFTF | normal |
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.r066-tall-177946967600321.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 CO4-PT-06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967600321
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 5.7K Mar 6 13:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Mar 6 13:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 6 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 6 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Mar 6 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Mar 6 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Mar 6 13:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 6 13:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 97K 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 CO4-PT-06-CTLCardinality-2024-00
FORMULA_NAME CO4-PT-06-CTLCardinality-2024-01
FORMULA_NAME CO4-PT-06-CTLCardinality-2024-02
FORMULA_NAME CO4-PT-06-CTLCardinality-2024-03
FORMULA_NAME CO4-PT-06-CTLCardinality-2024-04
FORMULA_NAME CO4-PT-06-CTLCardinality-2024-05
FORMULA_NAME CO4-PT-06-CTLCardinality-2024-06
FORMULA_NAME CO4-PT-06-CTLCardinality-2024-07
FORMULA_NAME CO4-PT-06-CTLCardinality-2024-08
FORMULA_NAME CO4-PT-06-CTLCardinality-2024-09
FORMULA_NAME CO4-PT-06-CTLCardinality-2024-10
FORMULA_NAME CO4-PT-06-CTLCardinality-2024-11
FORMULA_NAME CO4-PT-06-CTLCardinality-2024-12
FORMULA_NAME CO4-PT-06-CTLCardinality-2024-13
FORMULA_NAME CO4-PT-06-CTLCardinality-2024-14
FORMULA_NAME CO4-PT-06-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1779521263806
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-23 07:27:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 07:27:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 07:27:45] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2026-05-23 07:27:45] [INFO ] Transformed 383 places.
[2026-05-23 07:27:45] [INFO ] Transformed 454 transitions.
[2026-05-23 07:27:45] [INFO ] Found NUPN structural information;
[2026-05-23 07:27:45] [INFO ] Parsed PT model containing 383 places and 454 transitions and 1016 arcs in 163 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
Deduced a syphon composed of 100 places in 5 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-06-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 334/334 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 273 transition count 333
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 58 place count 226 transition count 284
Iterating global reduction 1 with 47 rules applied. Total rules applied 105 place count 226 transition count 284
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 108 place count 226 transition count 281
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 125 place count 209 transition count 264
Iterating global reduction 2 with 17 rules applied. Total rules applied 142 place count 209 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 143 place count 209 transition count 263
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 145 place count 207 transition count 259
Iterating global reduction 3 with 2 rules applied. Total rules applied 147 place count 207 transition count 259
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 148 place count 206 transition count 258
Iterating global reduction 3 with 1 rules applied. Total rules applied 149 place count 206 transition count 258
Applied a total of 149 rules in 71 ms. Remains 206 /283 variables (removed 77) and now considering 258/334 (removed 76) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6215429175809974609.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14140652642147543039.kers'
[2026-05-23 07:27:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6215429175809974609.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14140652642147543039.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 258 rows 206 cols 589 entries
Finished phase 1 with 202 SingleSign rule and 0 generalized
[2026-05-23 07:27:45] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14140652642147543039.kers
Total runtime 2 ms.
[2026-05-23 07:27:45] [INFO ] Implicit Places using invariants in 248 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 278 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 205/283 places, 258/334 transitions.
Applied a total of 0 rules in 19 ms. Remains 205 /205 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 382 ms. Remains : 205/283 places, 258/334 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 258/258 transitions.
Applied a total of 0 rules in 4 ms. Remains 205 /205 variables (removed 0) and now considering 258/258 (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-411555785959497771.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2835596038734127634.kers'
[2026-05-23 07:27:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-411555785959497771.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2835596038734127634.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 258 rows 205 cols 587 entries
Finished phase 1 with 202 SingleSign rule and 0 generalized
[2026-05-23 07:27:45] [INFO ] Computed 3 invariants in 1 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2835596038734127634.kers
Total runtime 1 ms.
[2026-05-23 07:27:45] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-23 07:27:45] [INFO ] Invariant cache hit.
[2026-05-23 07:27:45] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2026-05-23 07:27:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 258/463 variables, 205/208 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 0/463 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 210 constraints, problems are : Problem set: 0 solved, 257 unsolved in 16800 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/463 variables, 205/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 257/467 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/463 variables, and 468 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46909ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 46921ms
Finished structural reductions in LTL mode , in 1 iterations and 47172 ms. Remains : 205/205 places, 258/258 transitions.
Support contains 51 out of 205 places after structural reductions.
[2026-05-23 07:28:32] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2026-05-23 07:28:32] [INFO ] Flatten gal took : 40 ms
[2026-05-23 07:28:32] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CO4-PT-06-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 07:28:32] [INFO ] Flatten gal took : 17 ms
[2026-05-23 07:28:33] [INFO ] Input system was already deterministic with 258 transitions.
Support contains 26 out of 205 places (down from 51) after GAL structural reductions.
RANDOM walk for 40000 steps (53 resets) in 1763 ms. (22 steps per ms) remains 15/21 properties
BEST_FIRST walk for 4000 steps (40 resets) in 77 ms. (51 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (38 resets) in 43 ms. (90 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (28 resets) in 19 ms. (200 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4002 steps (31 resets) in 31 ms. (125 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (33 resets) in 36 ms. (108 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (35 resets) in 28 ms. (138 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4001 steps (30 resets) in 35 ms. (111 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4001 steps (33 resets) in 25 ms. (153 steps per ms) remains 9/14 properties
BEST_FIRST walk for 4001 steps (22 resets) in 29 ms. (133 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4001 steps (25 resets) in 34 ms. (114 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4001 steps (34 resets) in 23 ms. (166 steps per ms) remains 9/9 properties
[2026-05-23 07:28:33] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 25/37 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 81/118 variables, 19/31 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 166/284 variables, 71/102 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 127/411 variables, 69/171 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 9/420 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 3/176 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/420 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 3/423 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 38/461 variables, 29/206 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/461 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 2/463 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/463 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 0/463 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 208 constraints, problems are : Problem set: 0 solved, 9 unsolved in 534 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 25/37 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 81/118 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 166/284 variables, 71/111 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 127/411 variables, 69/180 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 9/420 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/420 variables, 3/185 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/420 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 3/423 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 38/461 variables, 29/215 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/461 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 2/463 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/463 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 0/463 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 217 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1304 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1843ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Finished Parikh walk after 23 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=23 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 9 properties in 245 ms.
[2026-05-23 07:28:35] [INFO ] Flatten gal took : 10 ms
[2026-05-23 07:28:35] [INFO ] Flatten gal took : 10 ms
[2026-05-23 07:28:35] [INFO ] Input system was already deterministic with 258 transitions.
Computed a total of 14 stabilizing places and 16 stable transitions
Graph (complete) has 333 edges and 205 vertex of which 201 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 205/205 places, 258/258 transitions.
Graph (trivial) has 211 edges and 205 vertex of which 2 / 205 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 332 edges and 204 vertex of which 200 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 81 place count 199 transition count 172
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 160 place count 120 transition count 172
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 160 place count 120 transition count 158
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 188 place count 106 transition count 158
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 196 place count 98 transition count 150
Iterating global reduction 2 with 8 rules applied. Total rules applied 204 place count 98 transition count 150
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 204 place count 98 transition count 148
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 208 place count 96 transition count 148
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 213 place count 91 transition count 143
Iterating global reduction 2 with 5 rules applied. Total rules applied 218 place count 91 transition count 143
Performed 11 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 240 place count 80 transition count 130
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 2 with 6 rules applied. Total rules applied 246 place count 80 transition count 124
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 251 place count 78 transition count 121
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 253 place count 77 transition count 120
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 254 place count 76 transition count 119
Iterating global reduction 5 with 1 rules applied. Total rules applied 255 place count 76 transition count 119
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 257 place count 75 transition count 118
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 261 place count 75 transition count 114
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 262 place count 75 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 263 place count 74 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 265 place count 73 transition count 112
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 267 place count 71 transition count 110
Applied a total of 267 rules in 50 ms. Remains 71 /205 variables (removed 134) and now considering 110/258 (removed 148) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1825942422676247926.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9029470194636283775.kers'
[2026-05-23 07:28:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1825942422676247926.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9029470194636283775.kers]
Normalized transition count is 109 out of 110 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 109 rows 71 cols 223 entries
Finished phase 1 with 68 SingleSign rule and 0 generalized
[2026-05-23 07:28:35] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9029470194636283775.kers
Total runtime 0 ms.
[2026-05-23 07:28:35] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-23 07:28:35] [INFO ] Invariant cache hit.
[2026-05-23 07:28:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:28:36] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2026-05-23 07:28:36] [INFO ] Redundant transitions in 2 ms returned []
Running 100 sub problems to find dead transitions.
[2026-05-23 07:28:36] [INFO ] Invariant cache hit.
[2026-05-23 07:28:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 109/180 variables, 71/74 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 1/181 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 0/181 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 75 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2896 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 109/180 variables, 71/74 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 100/174 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 1/181 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/181 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 175 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3350 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6255ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 6257ms
Starting structural reductions in SI_CTL mode, iteration 1 : 71/205 places, 110/258 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6403 ms. Remains : 71/205 places, 110/258 transitions.
[2026-05-23 07:28:42] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:28:42] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:28:42] [INFO ] Input system was already deterministic with 110 transitions.
RANDOM walk for 4693 steps (635 resets) in 26 ms. (173 steps per ms) remains 0/1 properties
FORMULA CO4-PT-06-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-23 07:28:42] [INFO ] Flatten gal took : 8 ms
[2026-05-23 07:28:42] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:28:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7535980678639870913.gal : 2 ms
[2026-05-23 07:28:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8811458158922436428.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7535980678639870913.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8811458158922436428.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 258/258 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 185 transition count 238
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 185 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 185 transition count 237
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 52 place count 174 transition count 225
Iterating global reduction 1 with 11 rules applied. Total rules applied 63 place count 174 transition count 225
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 172 transition count 223
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 172 transition count 223
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 171 transition count 222
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 171 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 171 transition count 221
Applied a total of 70 rules in 16 ms. Remains 171 /205 variables (removed 34) and now considering 221/258 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2210861029383236137.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1529640517679597690.kers'
[2026-05-23 07:28:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2210861029383236137.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1529640517679597690.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 221 rows 171 cols 502 entries
Finished phase 1 with 168 SingleSign rule and 0 generalized
[2026-05-23 07:28:42] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1529640517679597690.kers
Total runtime 1 ms.
[2026-05-23 07:28:42] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-23 07:28:42] [INFO ] Invariant cache hit.
[2026-05-23 07:28:42] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2026-05-23 07:28:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 221/392 variables, 171/174 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 0/392 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 176 constraints, problems are : Problem set: 0 solved, 220 unsolved in 14668 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 221/392 variables, 171/176 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 220/396 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 0/392 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 397 constraints, problems are : Problem set: 0 solved, 220 unsolved in 28602 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 43290ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 43291ms
Starting structural reductions in LTL mode, iteration 1 : 171/205 places, 221/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43464 ms. Remains : 171/205 places, 221/258 transitions.
[2026-05-23 07:29:25] [INFO ] Flatten gal took : 10 ms
[2026-05-23 07:29:25] [INFO ] Flatten gal took : 8 ms
[2026-05-23 07:29:25] [INFO ] Input system was already deterministic with 221 transitions.
[2026-05-23 07:29:25] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:29:25] [INFO ] Flatten gal took : 18 ms
[2026-05-23 07:29:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality5699225479602271913.gal : 2 ms
[2026-05-23 07:29:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality1269673288331380388.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/CTLCardinality5699225479602271913.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1269673288331380388.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,197295,0.101975,7752,2,777,5,13470,6,0,903,16033,0
Converting to forward existential form...Done !
original formula: !(E(EX((((p155==0)||(p318==1)) + EF((p297==0)))) U AG(!(((p213==0)&&(p216==1))))))
=> equivalent forward existential formula: [(FwdU(Init,EX((((p155==0)||(p318==1)) + E(TRUE U (p297==0))))) * !(E(TRUE U !(!(((p213==0)&&(p216==1)))))))] = ...160
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t16, t25, t30, t31, t33, t34, t41, t42, t45, t154, t177, t204, Intersect...245
(forward)formula 0,0,2.38781,93640,1,0,466,492586,469,317,5337,489172,678
FORMULA CO4-PT-06-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 258/258 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 186 transition count 239
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 186 transition count 239
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 49 place count 175 transition count 227
Iterating global reduction 0 with 11 rules applied. Total rules applied 60 place count 175 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 61 place count 175 transition count 226
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 173 transition count 224
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 173 transition count 224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 172 transition count 223
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 172 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 172 transition count 222
Applied a total of 68 rules in 21 ms. Remains 172 /205 variables (removed 33) and now considering 222/258 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1788794981517901146.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14537962561588152044.kers'
[2026-05-23 07:29:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1788794981517901146.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14537962561588152044.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 222 rows 172 cols 503 entries
Finished phase 1 with 169 SingleSign rule and 0 generalized
[2026-05-23 07:29:28] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14537962561588152044.kers
Total runtime 1 ms.
[2026-05-23 07:29:28] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-23 07:29:28] [INFO ] Invariant cache hit.
[2026-05-23 07:29:28] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2026-05-23 07:29:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 222/394 variables, 172/175 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 0/394 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 177 constraints, problems are : Problem set: 0 solved, 221 unsolved in 14830 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 222/394 variables, 172/177 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 221/398 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/394 variables, and 399 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 44871ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 44872ms
Starting structural reductions in LTL mode, iteration 1 : 172/205 places, 222/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45028 ms. Remains : 172/205 places, 222/258 transitions.
[2026-05-23 07:30:13] [INFO ] Flatten gal took : 9 ms
[2026-05-23 07:30:13] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:30:13] [INFO ] Input system was already deterministic with 222 transitions.
[2026-05-23 07:30:13] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:30:13] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:30:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality8808085884520726849.gal : 3 ms
[2026-05-23 07:30:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality968438142527811981.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/CTLCardinality8808085884520726849.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality968438142527811981.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,186579,0.08628,7184,2,741,5,10609,6,0,907,13794,0
Converting to forward existential form...Done !
original formula: EG((E(EF(((p266==0)||(p213==1))) U EX(((p294==0)||(p270==1)))) + (p186==0)))
=> equivalent forward existential formula: [FwdG(Init,(E(E(TRUE U ((p266==0)||(p213==1))) U EX(((p294==0)||(p270==1)))) + (p186==0)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t10, t16, t25, t30, t31, t33, t34, t38, t39, t42, t47, t124, t154, t177, ...261
(forward)formula 0,1,0.821074,34780,1,0,310,141838,471,187,5665,128340,489
FORMULA CO4-PT-06-CTLCardinality-2024-03 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 : 205/205 places, 258/258 transitions.
Graph (trivial) has 211 edges and 205 vertex of which 2 / 205 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 332 edges and 204 vertex of which 200 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 81 place count 199 transition count 172
Reduce places removed 79 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 80 rules applied. Total rules applied 161 place count 120 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 162 place count 119 transition count 171
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 162 place count 119 transition count 157
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 190 place count 105 transition count 157
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 198 place count 97 transition count 149
Iterating global reduction 3 with 8 rules applied. Total rules applied 206 place count 97 transition count 149
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 206 place count 97 transition count 147
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 210 place count 95 transition count 147
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 215 place count 90 transition count 142
Iterating global reduction 3 with 5 rules applied. Total rules applied 220 place count 90 transition count 142
Performed 11 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 242 place count 79 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 3 with 5 rules applied. Total rules applied 247 place count 79 transition count 124
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 252 place count 77 transition count 121
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 254 place count 76 transition count 120
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 255 place count 75 transition count 119
Iterating global reduction 6 with 1 rules applied. Total rules applied 256 place count 75 transition count 119
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 260 place count 75 transition count 115
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 6 with 1 rules applied. Total rules applied 261 place count 75 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 262 place count 74 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 264 place count 73 transition count 113
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 266 place count 71 transition count 111
Applied a total of 266 rules in 30 ms. Remains 71 /205 variables (removed 134) and now considering 111/258 (removed 147) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16885649295202506976.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3744673400167505421.kers'
[2026-05-23 07:30:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16885649295202506976.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3744673400167505421.kers]
Normalized transition count is 110 out of 111 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 110 rows 71 cols 265 entries
Finished phase 1 with 68 SingleSign rule and 0 generalized
[2026-05-23 07:30:14] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3744673400167505421.kers
Total runtime 0 ms.
[2026-05-23 07:30:14] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-23 07:30:14] [INFO ] Invariant cache hit.
[2026-05-23 07:30:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:30:14] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2026-05-23 07:30:14] [INFO ] Redundant transitions in 2 ms returned []
Running 101 sub problems to find dead transitions.
[2026-05-23 07:30:14] [INFO ] Invariant cache hit.
[2026-05-23 07:30:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 110/181 variables, 71/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 1/182 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 0/182 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 75 constraints, problems are : Problem set: 0 solved, 101 unsolved in 2958 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 110/181 variables, 71/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 101/175 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 1/182 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 176 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4126 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7096ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 7096ms
Starting structural reductions in SI_CTL mode, iteration 1 : 71/205 places, 111/258 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7219 ms. Remains : 71/205 places, 111/258 transitions.
[2026-05-23 07:30:21] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:30:21] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:30:21] [INFO ] Input system was already deterministic with 111 transitions.
[2026-05-23 07:30:21] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:30:21] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:30:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality970235188454620548.gal : 0 ms
[2026-05-23 07:30:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality4001172882639120417.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/CTLCardinality970235188454620548.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4001172882639120417.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,9721,0.019434,4600,2,202,5,2075,6,0,388,1967,0
Converting to forward existential form...Done !
original formula: AG(EF((p319==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p319==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t31, t42, t47, t74, Intersection with reachable at each step enabled. (destroyed/reverse...185
(forward)formula 0,1,0.083411,7572,1,0,145,17442,242,75,2344,12943,231
FORMULA CO4-PT-06-CTLCardinality-2024-04 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 : 205/205 places, 258/258 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 183 transition count 236
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 183 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 183 transition count 235
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 58 place count 170 transition count 221
Iterating global reduction 1 with 13 rules applied. Total rules applied 71 place count 170 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 72 place count 170 transition count 220
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 168 transition count 218
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 168 transition count 218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 167 transition count 217
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 167 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 79 place count 167 transition count 216
Applied a total of 79 rules in 8 ms. Remains 167 /205 variables (removed 38) and now considering 216/258 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6617222331557106145.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6509582471520333019.kers'
[2026-05-23 07:30:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6617222331557106145.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6509582471520333019.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 216 rows 167 cols 492 entries
Finished phase 1 with 164 SingleSign rule and 0 generalized
[2026-05-23 07:30:21] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6509582471520333019.kers
Total runtime 0 ms.
[2026-05-23 07:30:21] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-23 07:30:21] [INFO ] Invariant cache hit.
[2026-05-23 07:30:21] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2026-05-23 07:30:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 216/383 variables, 167/170 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 0/383 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 172 constraints, problems are : Problem set: 0 solved, 215 unsolved in 14074 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/383 variables, 167/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 215/387 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/383 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 388 constraints, problems are : Problem set: 0 solved, 215 unsolved in 25568 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 39658ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 39658ms
Starting structural reductions in LTL mode, iteration 1 : 167/205 places, 216/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39801 ms. Remains : 167/205 places, 216/258 transitions.
[2026-05-23 07:31:01] [INFO ] Flatten gal took : 12 ms
[2026-05-23 07:31:01] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:31:01] [INFO ] Input system was already deterministic with 216 transitions.
[2026-05-23 07:31:01] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:31:01] [INFO ] Flatten gal took : 10 ms
[2026-05-23 07:31:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality376710062286438671.gal : 2 ms
[2026-05-23 07:31:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality42579680874131846.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/CTLCardinality376710062286438671.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality42579680874131846.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 -...280
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,180279,0.090707,7676,2,766,5,12829,6,0,882,15697,0
Converting to forward existential form...Done !
original formula: EF(EX(EG((p1==0))))
=> equivalent forward existential formula: [FwdG(EY(FwdU(Init,TRUE)),(p1==0))] != FALSE
Hit Full ! (commute/partial/dont) 214/0/2
(forward)formula 0,1,0.315453,15480,1,0,27,57240,19,4,4070,22232,26
FORMULA CO4-PT-06-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 205/205 places, 258/258 transitions.
Graph (trivial) has 209 edges and 205 vertex of which 2 / 205 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 332 edges and 204 vertex of which 200 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 82 place count 199 transition count 171
Reduce places removed 80 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 81 rules applied. Total rules applied 163 place count 119 transition count 170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 164 place count 118 transition count 170
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 164 place count 118 transition count 157
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 190 place count 105 transition count 157
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 198 place count 97 transition count 149
Iterating global reduction 3 with 8 rules applied. Total rules applied 206 place count 97 transition count 149
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 206 place count 97 transition count 147
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 210 place count 95 transition count 147
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 215 place count 90 transition count 142
Iterating global reduction 3 with 5 rules applied. Total rules applied 220 place count 90 transition count 142
Performed 10 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 240 place count 80 transition count 130
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 3 with 6 rules applied. Total rules applied 246 place count 80 transition count 124
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 251 place count 78 transition count 121
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 253 place count 77 transition count 120
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 254 place count 76 transition count 119
Iterating global reduction 6 with 1 rules applied. Total rules applied 255 place count 76 transition count 119
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 257 place count 75 transition count 118
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 261 place count 75 transition count 114
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 6 with 1 rules applied. Total rules applied 262 place count 75 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 263 place count 74 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 265 place count 73 transition count 112
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 267 place count 71 transition count 110
Applied a total of 267 rules in 27 ms. Remains 71 /205 variables (removed 134) and now considering 110/258 (removed 148) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11188352819786273216.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15947269894408821038.kers'
[2026-05-23 07:31:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11188352819786273216.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15947269894408821038.kers]
Normalized transition count is 109 out of 110 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 109 rows 71 cols 223 entries
Finished phase 1 with 68 SingleSign rule and 0 generalized
[2026-05-23 07:31:01] [INFO ] Computed 3 invariants in 1 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15947269894408821038.kers
Total runtime 1 ms.
[2026-05-23 07:31:01] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-23 07:31:01] [INFO ] Invariant cache hit.
[2026-05-23 07:31:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:31:01] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2026-05-23 07:31:01] [INFO ] Redundant transitions in 2 ms returned []
Running 100 sub problems to find dead transitions.
[2026-05-23 07:31:01] [INFO ] Invariant cache hit.
[2026-05-23 07:31:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 109/180 variables, 71/74 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 1/181 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 0/181 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 75 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2934 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 109/180 variables, 71/74 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 100/174 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 1/181 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/181 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 175 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3263 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6202ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 6202ms
Starting structural reductions in SI_CTL mode, iteration 1 : 71/205 places, 110/258 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6324 ms. Remains : 71/205 places, 110/258 transitions.
[2026-05-23 07:31:08] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:31:08] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:31:08] [INFO ] Input system was already deterministic with 110 transitions.
[2026-05-23 07:31:08] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:31:08] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:31:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality6025397004794454678.gal : 1 ms
[2026-05-23 07:31:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality8082726660511822189.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/CTLCardinality6025397004794454678.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8082726660511822189.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,8065,0.016377,4456,2,212,5,1649,6,0,387,1403,0
Converting to forward existential form...Done !
original formula: EG(((p266==0)||(p149==1)))
=> equivalent forward existential formula: [FwdG(Init,((p266==0)||(p149==1)))] != FALSE
Hit Full ! (commute/partial/dont) 105/0/5
(forward)formula 0,1,0.050275,6036,1,0,10,10070,19,4,1803,5691,8
FORMULA CO4-PT-06-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 258/258 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 188 transition count 241
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 188 transition count 241
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 188 transition count 240
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 45 place count 178 transition count 229
Iterating global reduction 1 with 10 rules applied. Total rules applied 55 place count 178 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 178 transition count 228
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 176 transition count 226
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 176 transition count 226
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 175 transition count 225
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 175 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 175 transition count 224
Applied a total of 63 rules in 6 ms. Remains 175 /205 variables (removed 30) and now considering 224/258 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11951241799575381242.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6758258198314926837.kers'
[2026-05-23 07:31:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11951241799575381242.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6758258198314926837.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 224 rows 175 cols 510 entries
Finished phase 1 with 172 SingleSign rule and 0 generalized
[2026-05-23 07:31:08] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6758258198314926837.kers
Total runtime 0 ms.
[2026-05-23 07:31:08] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-23 07:31:08] [INFO ] Invariant cache hit.
[2026-05-23 07:31:08] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2026-05-23 07:31:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (OVERLAPS) 224/399 variables, 175/178 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 0/399 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 180 constraints, problems are : Problem set: 0 solved, 223 unsolved in 15454 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 224/399 variables, 175/180 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 223/403 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 1/404 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/399 variables, and 404 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45489ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 45489ms
Starting structural reductions in LTL mode, iteration 1 : 175/205 places, 224/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45631 ms. Remains : 175/205 places, 224/258 transitions.
[2026-05-23 07:31:53] [INFO ] Flatten gal took : 8 ms
[2026-05-23 07:31:53] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:31:53] [INFO ] Input system was already deterministic with 224 transitions.
[2026-05-23 07:31:53] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:31:53] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:31:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality12819494209390556053.gal : 1 ms
[2026-05-23 07:31:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality2551333652365266218.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/CTLCardinality12819494209390556053.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2551333652365266218.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,202525,0.112443,8644,2,955,5,16030,6,0,922,20997,0
Converting to forward existential form...Done !
original formula: !(A((A((!(EX(((p278==0)||(p350==1)))) + AF((p214==1))) U ((p135==0)||(p102==1))) + (p241!=0)) U (AF(!(EG(((p135==0)||(p231==1))))) * EG(E...182
=> equivalent forward existential formula: (([FwdG((FwdU(Init,!((!(EG(!(!(EG(((p135==0)||(p231==1))))))) * EG(E((p103==0) U (p237==1)))))) * !((!((E(!(((p1...771
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t16, t20, t26, t31, t32, t34, t35, t39, t40, t43, t155, t178, t205, Inte...250
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,15.1467,498196,1,0,1394,3.44678e+06,506,844,5422,3.05032e+06,1846
FORMULA CO4-PT-06-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 258/258 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 183 transition count 236
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 183 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 183 transition count 235
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 58 place count 170 transition count 221
Iterating global reduction 1 with 13 rules applied. Total rules applied 71 place count 170 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 72 place count 170 transition count 220
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 168 transition count 218
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 168 transition count 218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 167 transition count 217
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 167 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 79 place count 167 transition count 216
Applied a total of 79 rules in 14 ms. Remains 167 /205 variables (removed 38) and now considering 216/258 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10786917461415932282.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11602707822874137080.kers'
[2026-05-23 07:32:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10786917461415932282.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11602707822874137080.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 216 rows 167 cols 492 entries
Finished phase 1 with 164 SingleSign rule and 0 generalized
[2026-05-23 07:32:09] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11602707822874137080.kers
Total runtime 1 ms.
[2026-05-23 07:32:09] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-23 07:32:09] [INFO ] Invariant cache hit.
[2026-05-23 07:32:09] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2026-05-23 07:32:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 216/383 variables, 167/170 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 0/383 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 172 constraints, problems are : Problem set: 0 solved, 215 unsolved in 13983 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/383 variables, 167/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 215/387 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/383 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 388 constraints, problems are : Problem set: 0 solved, 215 unsolved in 26225 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 40219ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 40220ms
Starting structural reductions in LTL mode, iteration 1 : 167/205 places, 216/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40353 ms. Remains : 167/205 places, 216/258 transitions.
[2026-05-23 07:32:49] [INFO ] Flatten gal took : 10 ms
[2026-05-23 07:32:49] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:32:49] [INFO ] Input system was already deterministic with 216 transitions.
[2026-05-23 07:32:49] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:32:49] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:32:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality3535963760111728721.gal : 1 ms
[2026-05-23 07:32:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality9398365029661984949.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/CTLCardinality3535963760111728721.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9398365029661984949.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,180279,0.089576,7672,2,766,5,12829,6,0,882,15697,0
Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.098321,7672,1,0,6,12829,7,1,1071,15697,1
FORMULA CO4-PT-06-CTLCardinality-2024-12 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 : 205/205 places, 258/258 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 184 transition count 237
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 184 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 184 transition count 236
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 55 place count 172 transition count 223
Iterating global reduction 1 with 12 rules applied. Total rules applied 67 place count 172 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 172 transition count 222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 171 transition count 221
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 171 transition count 221
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 170 transition count 220
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 170 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 170 transition count 219
Applied a total of 73 rules in 8 ms. Remains 170 /205 variables (removed 35) and now considering 219/258 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8146277718751000580.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11483391453241220343.kers'
[2026-05-23 07:32:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8146277718751000580.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11483391453241220343.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 219 rows 170 cols 498 entries
Finished phase 1 with 167 SingleSign rule and 0 generalized
[2026-05-23 07:32:49] [INFO ] Computed 3 invariants in 2 ms
Computed 3 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11483391453241220343.kers
Total runtime 2 ms.
[2026-05-23 07:32:49] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-23 07:32:49] [INFO ] Invariant cache hit.
[2026-05-23 07:32:49] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2026-05-23 07:32:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 219/389 variables, 170/173 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/389 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 175 constraints, problems are : Problem set: 0 solved, 218 unsolved in 14389 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/389 variables, 170/175 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 218/393 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 0/389 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 389/389 variables, and 394 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 44406ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 44406ms
Starting structural reductions in LTL mode, iteration 1 : 170/205 places, 219/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44546 ms. Remains : 170/205 places, 219/258 transitions.
[2026-05-23 07:33:34] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:33:34] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:33:34] [INFO ] Input system was already deterministic with 219 transitions.
[2026-05-23 07:33:34] [INFO ] Flatten gal took : 8 ms
[2026-05-23 07:33:34] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:33:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality964712135931780178.gal : 2 ms
[2026-05-23 07:33:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality6539942437477346791.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/CTLCardinality964712135931780178.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6539942437477346791.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,184635,0.097572,7944,2,785,5,13780,6,0,897,16793,0
Converting to forward existential form...Done !
original formula: AF(((AF(((p201==0)&&(p6==1))) * EG((p218==1))) * (EX((p208==0)) * (p249==1))))
=> equivalent forward existential formula: [FwdG(Init,!(((!(EG(!(((p201==0)&&(p6==1))))) * EG((p218==1))) * (EX((p208==0)) * (p249==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t16, t25, t30, t31, t33, t34, t38, t39, t42, t152, t175, t202, Intersect...245
(forward)formula 0,0,4.06465,144048,1,0,700,916498,470,367,5317,844128,969
FORMULA CO4-PT-06-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2026-05-23 07:33:38] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:33:38] [INFO ] Flatten gal took : 5 ms
Total runtime 353342 ms.
BK_STOP 1779521618338
--------------------
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="CO4-PT-06"
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 CO4-PT-06, 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 r066-tall-177946967600321"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-06.tgz
mv CO4-PT-06 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 '
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 ;
