Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.1K Mar 6 10:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 6 10:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 10:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 6 10:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 6 10:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Mar 6 10:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 6 10:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 6 10:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 77K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME Champagne-PT-H04T1U-CTLCardinality-2024-00
FORMULA_NAME Champagne-PT-H04T1U-CTLCardinality-2024-01
FORMULA_NAME Champagne-PT-H04T1U-CTLCardinality-2024-02
FORMULA_NAME Champagne-PT-H04T1U-CTLCardinality-2024-03
FORMULA_NAME Champagne-PT-H04T1U-CTLCardinality-2024-04
FORMULA_NAME Champagne-PT-H04T1U-CTLCardinality-2024-05
FORMULA_NAME Champagne-PT-H04T1U-CTLCardinality-2024-06
FORMULA_NAME Champagne-PT-H04T1U-CTLCardinality-2024-07
FORMULA_NAME Champagne-PT-H04T1U-CTLCardinality-2024-08
FORMULA_NAME Champagne-PT-H04T1U-CTLCardinality-2024-09
FORMULA_NAME Champagne-PT-H04T1U-CTLCardinality-2024-10
FORMULA_NAME Champagne-PT-H04T1U-CTLCardinality-2024-11
FORMULA_NAME Champagne-PT-H04T1U-CTLCardinality-2024-12
FORMULA_NAME Champagne-PT-H04T1U-CTLCardinality-2024-13
FORMULA_NAME Champagne-PT-H04T1U-CTLCardinality-2024-14
FORMULA_NAME Champagne-PT-H04T1U-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779480086061

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H04T1U
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-22 20:01:28] [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-22 20:01:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 20:01:28] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2026-05-22 20:01:28] [INFO ] Transformed 285 places.
[2026-05-22 20:01:28] [INFO ] Transformed 351 transitions.
[2026-05-22 20:01:28] [INFO ] Found NUPN structural information;
[2026-05-22 20:01:28] [INFO ] Parsed PT model containing 285 places and 351 transitions and 820 arcs in 411 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 35 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Champagne-PT-H04T1U-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 102 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 351/351 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 251 transition count 317
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 251 transition count 317
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 80 place count 239 transition count 305
Iterating global reduction 0 with 12 rules applied. Total rules applied 92 place count 239 transition count 305
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 95 place count 236 transition count 302
Iterating global reduction 0 with 3 rules applied. Total rules applied 98 place count 236 transition count 302
Applied a total of 98 rules in 138 ms. Remains 236 /285 variables (removed 49) and now considering 302/351 (removed 49) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10249224486474902886.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4271164923452206513.kers'
[2026-05-22 20:01:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10249224486474902886.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4271164923452206513.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 302 rows 236 cols 722 entries
Finished phase 1 with 225 SingleSign rule and 0 generalized
[2026-05-22 20:01:29] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-4271164923452206513.kers
Total runtime 5 ms.
[2026-05-22 20:01:29] [INFO ] Implicit Places using invariants in 549 ms returned []
[2026-05-22 20:01:29] [INFO ] Invariant cache hit.
[2026-05-22 20:01:30] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 1227 ms to find 0 implicit places.
Running 301 sub problems to find dead transitions.
[2026-05-22 20:01:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 14/25 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 9/34 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (OVERLAPS) 302/538 variables, 236/270 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 538/538 variables, and 271 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (OVERLAPS) 302/538 variables, 236/273 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 301/574 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 3/577 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 2/579 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 538/538 variables, and 579 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60304ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 60338ms
Starting structural reductions in LTL mode, iteration 1 : 236/285 places, 302/351 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61906 ms. Remains : 236/285 places, 302/351 transitions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 302/302 transitions.
Applied a total of 0 rules in 8 ms. Remains 236 /236 variables (removed 0) and now considering 302/302 (removed 0) transitions.
[2026-05-22 20:02:31] [INFO ] Invariant cache hit.
[2026-05-22 20:02:31] [INFO ] Implicit Places using invariants in 122 ms returned []
[2026-05-22 20:02:31] [INFO ] Invariant cache hit.
[2026-05-22 20:02:31] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 427 ms. Remains : 236/236 places, 302/302 transitions.
Support contains 102 out of 236 places after structural reductions.
[2026-05-22 20:02:31] [INFO ] Flatten gal took : 98 ms
[2026-05-22 20:02:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Champagne-PT-H04T1U-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-22 20:02:31] [INFO ] Flatten gal took : 44 ms
[2026-05-22 20:02:32] [INFO ] Input system was already deterministic with 302 transitions.
Support contains 82 out of 236 places (down from 102) after GAL structural reductions.
RANDOM walk for 40000 steps (217 resets) in 1724 ms. (23 steps per ms) remains 1/49 properties
BEST_FIRST walk for 40004 steps (28 resets) in 271 ms. (147 steps per ms) remains 1/1 properties
[2026-05-22 20:02:32] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 66/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 166/236 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 302/538 variables, 236/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/538 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 538/538 variables, and 247 constraints, problems are : Problem set: 0 solved, 1 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 66/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 166/236 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 302/538 variables, 236/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/538 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 538/538 variables, and 248 constraints, problems are : Problem set: 0 solved, 1 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 583ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 144 ms.
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 302/302 transitions.
Graph (trivial) has 240 edges and 236 vertex of which 97 / 236 are part of one of the 10 SCC in 14 ms
Free SCC test removed 87 places
Drop transitions (Empty/Sink Transition effects.) removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 149 transition count 141
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 69 rules applied. Total rules applied 123 place count 96 transition count 125
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 130 place count 89 transition count 125
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 130 place count 89 transition count 124
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 132 place count 88 transition count 124
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 154 place count 66 transition count 100
Iterating global reduction 3 with 22 rules applied. Total rules applied 176 place count 66 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 177 place count 66 transition count 99
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 177 place count 66 transition count 95
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 185 place count 62 transition count 95
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 189 place count 58 transition count 84
Iterating global reduction 4 with 4 rules applied. Total rules applied 193 place count 58 transition count 84
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 197 place count 58 transition count 80
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 235 place count 39 transition count 61
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 236 place count 38 transition count 57
Iterating global reduction 5 with 1 rules applied. Total rules applied 237 place count 38 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 238 place count 38 transition count 56
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 244 place count 35 transition count 65
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 250 place count 35 transition count 59
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 254 place count 35 transition count 55
Free-agglomeration rule applied 15 times.
Iterating global reduction 7 with 15 rules applied. Total rules applied 269 place count 35 transition count 40
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 33 rules applied. Total rules applied 302 place count 20 transition count 22
Ensure Unique test removed 1 places
Iterating post reduction 8 with 1 rules applied. Total rules applied 303 place count 19 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 307 place count 19 transition count 18
Ensure Unique test removed 3 places
Iterating post reduction 9 with 3 rules applied. Total rules applied 310 place count 16 transition count 18
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 311 place count 16 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 312 place count 15 transition count 17
Applied a total of 312 rules in 161 ms. Remains 15 /236 variables (removed 221) and now considering 17/302 (removed 285) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 15/236 places, 17/302 transitions.
RANDOM walk for 149 steps (0 resets) in 7 ms. (18 steps per ms) remains 0/1 properties
[2026-05-22 20:02:33] [INFO ] Flatten gal took : 29 ms
[2026-05-22 20:02:33] [INFO ] Flatten gal took : 31 ms
[2026-05-22 20:02:33] [INFO ] Input system was already deterministic with 302 transitions.
Computed a total of 33 stabilizing places and 33 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 302/302 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 192 transition count 258
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 192 transition count 258
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 115 place count 165 transition count 231
Iterating global reduction 0 with 27 rules applied. Total rules applied 142 place count 165 transition count 231
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 156 place count 151 transition count 217
Iterating global reduction 0 with 14 rules applied. Total rules applied 170 place count 151 transition count 217
Applied a total of 170 rules in 20 ms. Remains 151 /236 variables (removed 85) and now considering 217/302 (removed 85) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2583850734766775107.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7094690524322421360.kers'
[2026-05-22 20:02:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2583850734766775107.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7094690524322421360.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 217 rows 151 cols 552 entries
Finished phase 1 with 140 SingleSign rule and 0 generalized
[2026-05-22 20:02:33] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7094690524322421360.kers
Total runtime 2 ms.
[2026-05-22 20:02:34] [INFO ] Implicit Places using invariants in 136 ms returned []
[2026-05-22 20:02:34] [INFO ] Invariant cache hit.
[2026-05-22 20:02:34] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2026-05-22 20:02:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 217/368 variables, 151/162 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 0/368 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 162 constraints, problems are : Problem set: 0 solved, 216 unsolved in 17488 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 217/368 variables, 151/162 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 216/378 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 0/368 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 381 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 47564ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 47567ms
Starting structural reductions in LTL mode, iteration 1 : 151/236 places, 217/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47949 ms. Remains : 151/236 places, 217/302 transitions.
[2026-05-22 20:03:21] [INFO ] Flatten gal took : 20 ms
[2026-05-22 20:03:21] [INFO ] Flatten gal took : 20 ms
[2026-05-22 20:03:21] [INFO ] Input system was already deterministic with 217 transitions.
[2026-05-22 20:03:21] [INFO ] Flatten gal took : 21 ms
[2026-05-22 20:03:21] [INFO ] Flatten gal took : 20 ms
[2026-05-22 20:03:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality12885137481663981638.gal : 11 ms
[2026-05-22 20:03:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality10283831210804151454.ctl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12885137481663981638.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10283831210804151454.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.53064e+12,0.136605,5644,2,712,5,7237,6,0,823,5948,0


Converting to forward existential form...Done !
original formula: EF((EX(EF((p169==0))) * EF(AG((p242==1)))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * EX(E(TRUE U (p169==0)))),TRUE) * !(E(TRUE U !((p242==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t34, t39, t53, t63, t68, t83, t97, t112, t127, t142, t156, Intersection with reachable a...225
(forward)formula 0,0,0.68633,19260,1,0,291,80712,456,174,4806,60409,444
FORMULA Champagne-PT-H04T1U-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 302/302 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 191 transition count 257
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 191 transition count 257
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 118 place count 163 transition count 229
Iterating global reduction 0 with 28 rules applied. Total rules applied 146 place count 163 transition count 229
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 160 place count 149 transition count 215
Iterating global reduction 0 with 14 rules applied. Total rules applied 174 place count 149 transition count 215
Applied a total of 174 rules in 17 ms. Remains 149 /236 variables (removed 87) and now considering 215/302 (removed 87) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7497295976489288656.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5360899360505042276.kers'
[2026-05-22 20:03:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7497295976489288656.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5360899360505042276.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 215 rows 149 cols 548 entries
Finished phase 1 with 138 SingleSign rule and 0 generalized
[2026-05-22 20:03:22] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5360899360505042276.kers
Total runtime 2 ms.
[2026-05-22 20:03:22] [INFO ] Implicit Places using invariants in 120 ms returned []
[2026-05-22 20:03:22] [INFO ] Invariant cache hit.
[2026-05-22 20:03:23] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2026-05-22 20:03:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 215/364 variables, 149/160 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 0/364 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 160 constraints, problems are : Problem set: 0 solved, 214 unsolved in 17215 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 215/364 variables, 149/160 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 214/374 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 0/364 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/364 variables, and 377 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 47283ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 47285ms
Starting structural reductions in LTL mode, iteration 1 : 149/236 places, 215/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47702 ms. Remains : 149/236 places, 215/302 transitions.
[2026-05-22 20:04:10] [INFO ] Flatten gal took : 21 ms
[2026-05-22 20:04:10] [INFO ] Flatten gal took : 17 ms
[2026-05-22 20:04:10] [INFO ] Input system was already deterministic with 215 transitions.
[2026-05-22 20:04:10] [INFO ] Flatten gal took : 17 ms
[2026-05-22 20:04:10] [INFO ] Flatten gal took : 16 ms
[2026-05-22 20:04:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality13650750992255527262.gal : 6 ms
[2026-05-22 20:04:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality8658454623949063646.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/CTLCardinality13650750992255527262.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8658454623949063646.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.32718e+12,0.11272,5672,2,706,5,7125,6,0,813,5854,0


Converting to forward existential form...Done !
original formula: AX(AG(A(!(EG((p106==1))) U (p109==0))))
=> equivalent forward existential formula: ([FwdG((FwdU(FwdU(EY(Init),TRUE),!((p109==0))) * !((p109==0))),(p106==1))] = FALSE * [FwdG(FwdU(EY(Init),TRUE),!...177
Hit Full ! (commute/partial/dont) 213/0/2
(forward)formula 0,0,0.485812,12632,1,0,14,50794,21,4,3884,15613,15
FORMULA Champagne-PT-H04T1U-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 302/302 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 192 transition count 258
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 192 transition count 258
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 115 place count 165 transition count 231
Iterating global reduction 0 with 27 rules applied. Total rules applied 142 place count 165 transition count 231
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 155 place count 152 transition count 218
Iterating global reduction 0 with 13 rules applied. Total rules applied 168 place count 152 transition count 218
Applied a total of 168 rules in 13 ms. Remains 152 /236 variables (removed 84) and now considering 218/302 (removed 84) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6175859744846311993.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14754396170968231539.kers'
[2026-05-22 20:04:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6175859744846311993.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14754396170968231539.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 218 rows 152 cols 554 entries
Finished phase 1 with 141 SingleSign rule and 0 generalized
[2026-05-22 20:04:11] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14754396170968231539.kers
Total runtime 2 ms.
[2026-05-22 20:04:11] [INFO ] Implicit Places using invariants in 133 ms returned []
[2026-05-22 20:04:11] [INFO ] Invariant cache hit.
[2026-05-22 20:04:11] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2026-05-22 20:04:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 218/370 variables, 152/163 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 0/370 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 163 constraints, problems are : Problem set: 0 solved, 217 unsolved in 17793 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 218/370 variables, 152/163 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 217/380 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 0/370 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 382 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 47849ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 47851ms
Starting structural reductions in LTL mode, iteration 1 : 152/236 places, 218/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48236 ms. Remains : 152/236 places, 218/302 transitions.
[2026-05-22 20:04:59] [INFO ] Flatten gal took : 14 ms
[2026-05-22 20:04:59] [INFO ] Flatten gal took : 13 ms
[2026-05-22 20:04:59] [INFO ] Input system was already deterministic with 218 transitions.
[2026-05-22 20:04:59] [INFO ] Flatten gal took : 15 ms
[2026-05-22 20:04:59] [INFO ] Flatten gal took : 14 ms
[2026-05-22 20:04:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality7139794510996035600.gal : 4 ms
[2026-05-22 20:04:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality2255988517935345005.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/CTLCardinality7139794510996035600.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2255988517935345005.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.63238e+12,0.117777,5704,2,712,5,7193,6,0,828,5891,0


Converting to forward existential form...Done !
original formula: E(((p100==1) * !(EX(((p266==0)||(p40==1))))) U AG(EF(!(EX(TRUE)))))
=> equivalent forward existential formula: [(FwdU(Init,((p100==1) * !(EX(((p266==0)||(p40==1)))))) * !(E(TRUE U !(E(TRUE U !(EX(TRUE)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t35, t40, t54, t64, t69, t84, t98, t113, t128, t143, t157, Intersection with reachable a...225
(forward)formula 0,1,1.37732,35704,1,0,333,181733,462,200,4922,152290,499
FORMULA Champagne-PT-H04T1U-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 236/236 places, 302/302 transitions.
Graph (trivial) has 234 edges and 236 vertex of which 95 / 236 are part of one of the 10 SCC in 1 ms
Free SCC test removed 85 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 150 transition count 155
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 64 rules applied. Total rules applied 115 place count 100 transition count 141
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 122 place count 94 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 123 place count 93 transition count 140
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 123 place count 93 transition count 137
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 129 place count 90 transition count 137
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 152 place count 67 transition count 112
Iterating global reduction 4 with 23 rules applied. Total rules applied 175 place count 67 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 176 place count 67 transition count 111
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 176 place count 67 transition count 110
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 178 place count 66 transition count 110
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 182 place count 62 transition count 99
Iterating global reduction 5 with 4 rules applied. Total rules applied 186 place count 62 transition count 99
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 190 place count 62 transition count 95
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 228 place count 43 transition count 76
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 229 place count 42 transition count 72
Iterating global reduction 6 with 1 rules applied. Total rules applied 230 place count 42 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 231 place count 42 transition count 71
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 233 place count 40 transition count 69
Applied a total of 233 rules in 37 ms. Remains 40 /236 variables (removed 196) and now considering 69/302 (removed 233) transitions.
[2026-05-22 20:05:00] [INFO ] Flow matrix only has 48 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4118006554206815050.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10210841549511547915.kers'
[2026-05-22 20:05:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4118006554206815050.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10210841549511547915.kers]
Normalized transition count is 47 out of 48 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 47 rows 39 cols 124 entries
Finished phase 1 with 29 SingleSign rule and 0 generalized
[2026-05-22 20:05:00] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10210841549511547915.kers
Total runtime 1 ms.
[2026-05-22 20:05:00] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-22 20:05:00] [INFO ] Flow matrix only has 48 transitions (discarded 21 similar events)
[2026-05-22 20:05:00] [INFO ] Invariant cache hit.
[2026-05-22 20:05:00] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2026-05-22 20:05:00] [INFO ] Redundant transitions in 1 ms returned []
Running 40 sub problems to find dead transitions.
[2026-05-22 20:05:00] [INFO ] Flow matrix only has 48 transitions (discarded 21 similar events)
[2026-05-22 20:05:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 3/40 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 47/87 variables, 40/51 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/87 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/88 variables, and 51 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1316 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 3/40 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 47/87 variables, 40/51 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 40/91 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/87 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/88 variables, and 91 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1383 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2708ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 2708ms
Starting structural reductions in SI_CTL mode, iteration 1 : 40/236 places, 69/302 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2903 ms. Remains : 40/236 places, 69/302 transitions.
[2026-05-22 20:05:03] [INFO ] Flatten gal took : 5 ms
[2026-05-22 20:05:03] [INFO ] Flatten gal took : 4 ms
[2026-05-22 20:05:03] [INFO ] Input system was already deterministic with 69 transitions.
[2026-05-22 20:05:03] [INFO ] Flatten gal took : 4 ms
[2026-05-22 20:05:03] [INFO ] Flatten gal took : 4 ms
[2026-05-22 20:05:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality16521758610428488957.gal : 1 ms
[2026-05-22 20:05:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality14920728135302140543.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/CTLCardinality16521758610428488957.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14920728135302140543.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,933120,0.02337,4252,2,172,5,1369,6,0,221,927,0


Converting to forward existential form...Done !
original formula: EG(AF((AG((((p119==0)&&((p102==0)||(p31==1)))||(p74==0))) + EG(((p148!=0)&&(p13!=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((!(E(TRUE U !((((p119==0)&&((p102==0)||(p31==1)))||(p74==0))))) + EG(((p148!=0)&&(p13!=1))))))...167
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,0.145384,6692,1,0,15,16857,33,9,1142,13540,10
FORMULA Champagne-PT-H04T1U-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 236/236 places, 302/302 transitions.
Graph (trivial) has 230 edges and 236 vertex of which 84 / 236 are part of one of the 9 SCC in 1 ms
Free SCC test removed 75 places
Ensure Unique test removed 85 transitions
Reduce isomorphic transitions removed 85 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 160 transition count 162
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 70 rules applied. Total rules applied 125 place count 106 transition count 146
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 134 place count 99 transition count 144
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 136 place count 97 transition count 144
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 136 place count 97 transition count 141
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 142 place count 94 transition count 141
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 161 place count 75 transition count 120
Iterating global reduction 4 with 19 rules applied. Total rules applied 180 place count 75 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 181 place count 75 transition count 119
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 183 place count 73 transition count 114
Iterating global reduction 5 with 2 rules applied. Total rules applied 185 place count 73 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 187 place count 73 transition count 112
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 233 place count 50 transition count 89
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 235 place count 48 transition count 87
Applied a total of 235 rules in 41 ms. Remains 48 /236 variables (removed 188) and now considering 87/302 (removed 215) transitions.
[2026-05-22 20:05:03] [INFO ] Flow matrix only has 62 transitions (discarded 25 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16873462707933074429.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5591716875411122173.kers'
[2026-05-22 20:05:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16873462707933074429.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5591716875411122173.kers]
Normalized transition count is 61 out of 62 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 61 rows 46 cols 154 entries
Finished phase 1 with 37 SingleSign rule and 0 generalized
[2026-05-22 20:05:03] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5591716875411122173.kers
Total runtime 1 ms.
[2026-05-22 20:05:03] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-22 20:05:03] [INFO ] Flow matrix only has 62 transitions (discarded 25 similar events)
[2026-05-22 20:05:03] [INFO ] Invariant cache hit.
[2026-05-22 20:05:04] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2026-05-22 20:05:04] [INFO ] Redundant transitions in 2 ms returned []
Running 57 sub problems to find dead transitions.
[2026-05-22 20:05:04] [INFO ] Flow matrix only has 62 transitions (discarded 25 similar events)
[2026-05-22 20:05:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 3/48 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 61/109 variables, 48/59 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 0/109 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/110 variables, and 59 constraints, problems are : Problem set: 0 solved, 57 unsolved in 2151 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 48/48 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 3/48 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 61/109 variables, 48/59 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 57/116 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 0/109 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/110 variables, and 116 constraints, problems are : Problem set: 0 solved, 57 unsolved in 2207 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 48/48 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4377ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 4377ms
Starting structural reductions in SI_CTL mode, iteration 1 : 48/236 places, 87/302 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4605 ms. Remains : 48/236 places, 87/302 transitions.
[2026-05-22 20:05:08] [INFO ] Flatten gal took : 8 ms
[2026-05-22 20:05:08] [INFO ] Flatten gal took : 6 ms
[2026-05-22 20:05:08] [INFO ] Input system was already deterministic with 87 transitions.
[2026-05-22 20:05:08] [INFO ] Flatten gal took : 5 ms
[2026-05-22 20:05:08] [INFO ] Flatten gal took : 4 ms
[2026-05-22 20:05:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality9281937451793212507.gal : 1 ms
[2026-05-22 20:05:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality5424097609427600572.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/CTLCardinality9281937451793212507.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5424097609427600572.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (EG(((p20==0)&&(p130==1))) + AG(((((p142==0)&&(p268==1))&&(p34==1)) + EF((((p168==0)&&(p120==1))||((p148==0)&&(p144==1)))))))
=> equivalent forward existential formula: [((FwdU((Init * !(EG(((p20==0)&&(p130==1))))),TRUE) * !((((p142==0)&&(p268==1))&&(p34==1)))) * !(E(TRUE U (((p16...209
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.180378,7276,1,0,16,20595,26,9,1384,11894,12
FORMULA Champagne-PT-H04T1U-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 236/236 places, 302/302 transitions.
Graph (trivial) has 239 edges and 236 vertex of which 90 / 236 are part of one of the 10 SCC in 1 ms
Free SCC test removed 80 places
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 155 transition count 155
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 75 rules applied. Total rules applied 133 place count 98 transition count 137
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 142 place count 90 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 143 place count 89 transition count 136
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 143 place count 89 transition count 134
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 147 place count 87 transition count 134
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 172 place count 62 transition count 107
Iterating global reduction 4 with 25 rules applied. Total rules applied 197 place count 62 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 198 place count 62 transition count 106
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 198 place count 62 transition count 105
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 200 place count 61 transition count 105
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 204 place count 57 transition count 93
Iterating global reduction 5 with 4 rules applied. Total rules applied 208 place count 57 transition count 93
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 212 place count 57 transition count 89
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 250 place count 38 transition count 70
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 251 place count 37 transition count 66
Iterating global reduction 6 with 1 rules applied. Total rules applied 252 place count 37 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 253 place count 37 transition count 65
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 255 place count 35 transition count 63
Applied a total of 255 rules in 38 ms. Remains 35 /236 variables (removed 201) and now considering 63/302 (removed 239) transitions.
[2026-05-22 20:05:08] [INFO ] Flow matrix only has 37 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16419403998665189614.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9238831828584989074.kers'
[2026-05-22 20:05:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16419403998665189614.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9238831828584989074.kers]
Normalized transition count is 36 out of 37 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 36 rows 32 cols 86 entries
Finished phase 1 with 24 SingleSign rule and 0 generalized
[2026-05-22 20:05:08] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9238831828584989074.kers
Total runtime 0 ms.
[2026-05-22 20:05:08] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-22 20:05:08] [INFO ] Flow matrix only has 37 transitions (discarded 26 similar events)
[2026-05-22 20:05:08] [INFO ] Invariant cache hit.
[2026-05-22 20:05:08] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2026-05-22 20:05:08] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2026-05-22 20:05:08] [INFO ] Flow matrix only has 37 transitions (discarded 26 similar events)
[2026-05-22 20:05:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/35 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 36/71 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 0/71 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 71/72 variables, and 46 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1095 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/35 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 36/71 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 32/78 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/71 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 71/72 variables, and 78 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1076 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2177ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2178ms
Starting structural reductions in SI_CTL mode, iteration 1 : 35/236 places, 63/302 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2377 ms. Remains : 35/236 places, 63/302 transitions.
[2026-05-22 20:05:11] [INFO ] Flatten gal took : 4 ms
[2026-05-22 20:05:11] [INFO ] Flatten gal took : 4 ms
[2026-05-22 20:05:11] [INFO ] Input system was already deterministic with 63 transitions.
[2026-05-22 20:05:11] [INFO ] Flatten gal took : 3 ms
[2026-05-22 20:05:11] [INFO ] Flatten gal took : 3 ms
[2026-05-22 20:05:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality2733327965475705763.gal : 1 ms
[2026-05-22 20:05:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality13092402249172350291.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/CTLCardinality2733327965475705763.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13092402249172350291.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,174960,0.016234,4188,2,60,5,489,6,0,196,296,0


Converting to forward existential form...Done !
original formula: (AG((p221!=1)) * (EF((p90==1)) + AF((p277==0))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !((p221!=1)))] = FALSE * [FwdG((Init * !(E(TRUE U (p90==1)))),!((p277==0)))] = FALSE)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.044798,4812,1,0,14,3311,26,6,946,2247,9
FORMULA Champagne-PT-H04T1U-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 302/302 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 192 transition count 258
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 192 transition count 258
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 115 place count 165 transition count 231
Iterating global reduction 0 with 27 rules applied. Total rules applied 142 place count 165 transition count 231
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 155 place count 152 transition count 218
Iterating global reduction 0 with 13 rules applied. Total rules applied 168 place count 152 transition count 218
Applied a total of 168 rules in 17 ms. Remains 152 /236 variables (removed 84) and now considering 218/302 (removed 84) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14385656504928806050.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11820174470590082986.kers'
[2026-05-22 20:05:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14385656504928806050.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11820174470590082986.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 218 rows 152 cols 554 entries
Finished phase 1 with 141 SingleSign rule and 0 generalized
[2026-05-22 20:05:11] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11820174470590082986.kers
Total runtime 2 ms.
[2026-05-22 20:05:11] [INFO ] Implicit Places using invariants in 123 ms returned []
[2026-05-22 20:05:11] [INFO ] Invariant cache hit.
[2026-05-22 20:05:11] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2026-05-22 20:05:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 218/370 variables, 152/163 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 0/370 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 163 constraints, problems are : Problem set: 0 solved, 217 unsolved in 17951 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 218/370 variables, 152/163 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 217/380 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 0/370 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 382 constraints, problems are : Problem set: 0 solved, 217 unsolved in 28228 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46201ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 46202ms
Starting structural reductions in LTL mode, iteration 1 : 152/236 places, 218/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46600 ms. Remains : 152/236 places, 218/302 transitions.
[2026-05-22 20:05:57] [INFO ] Flatten gal took : 11 ms
[2026-05-22 20:05:57] [INFO ] Flatten gal took : 10 ms
[2026-05-22 20:05:57] [INFO ] Input system was already deterministic with 218 transitions.
[2026-05-22 20:05:57] [INFO ] Flatten gal took : 11 ms
[2026-05-22 20:05:57] [INFO ] Flatten gal took : 11 ms
[2026-05-22 20:05:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality1981898833241006149.gal : 3 ms
[2026-05-22 20:05:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality5013849584109729194.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/CTLCardinality1981898833241006149.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5013849584109729194.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.65872e+12,0.104807,5736,2,724,5,7301,6,0,828,5994,0


Converting to forward existential form...Done !
original formula: (EF(AG(EX(EF(((p70==0)&&(p280==1)))))) + AF((p204==1)))
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U !(E(TRUE U !(EX(E(TRUE U ((p70==0)&&(p280==1)))))))))),!((p204==1)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t32, t37, t51, t61, t66, t81, t95, t110, t126, t143, t157, Intersection with reachable a...225
Hit Full ! (commute/partial/dont) 216/0/2
(forward)formula 0,0,2.80124,64720,1,0,359,346572,468,212,5260,313233,536
FORMULA Champagne-PT-H04T1U-CTLCardinality-2024-07 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 : 236/236 places, 302/302 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 194 transition count 260
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 194 transition count 260
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 109 place count 169 transition count 235
Iterating global reduction 0 with 25 rules applied. Total rules applied 134 place count 169 transition count 235
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 148 place count 155 transition count 221
Iterating global reduction 0 with 14 rules applied. Total rules applied 162 place count 155 transition count 221
Applied a total of 162 rules in 12 ms. Remains 155 /236 variables (removed 81) and now considering 221/302 (removed 81) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8165542321789965063.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5162953495229459290.kers'
[2026-05-22 20:06:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8165542321789965063.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5162953495229459290.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 221 rows 155 cols 560 entries
Finished phase 1 with 144 SingleSign rule and 0 generalized
[2026-05-22 20:06:00] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5162953495229459290.kers
Total runtime 3 ms.
[2026-05-22 20:06:00] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-22 20:06:00] [INFO ] Invariant cache hit.
[2026-05-22 20:06:00] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2026-05-22 20:06:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 221/376 variables, 155/166 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 0/376 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 166 constraints, problems are : Problem set: 0 solved, 220 unsolved in 17486 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 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/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 221/376 variables, 155/166 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 220/386 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 389 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 47522ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 47523ms
Starting structural reductions in LTL mode, iteration 1 : 155/236 places, 221/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47787 ms. Remains : 155/236 places, 221/302 transitions.
[2026-05-22 20:06:48] [INFO ] Flatten gal took : 11 ms
[2026-05-22 20:06:48] [INFO ] Flatten gal took : 11 ms
[2026-05-22 20:06:48] [INFO ] Input system was already deterministic with 221 transitions.
[2026-05-22 20:06:48] [INFO ] Flatten gal took : 11 ms
[2026-05-22 20:06:48] [INFO ] Flatten gal took : 10 ms
[2026-05-22 20:06:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality8641073891326243196.gal : 3 ms
[2026-05-22 20:06:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality18293062846705859934.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/CTLCardinality8641073891326243196.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18293062846705859934.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.03508e+12,0.138727,6180,2,733,5,9343,6,0,843,8626,0


Converting to forward existential form...Done !
original formula: EF(((EG((p214==1)) * (p257==0)) * A(AX((p134!=0)) U AF((((p259==0)||(p208==1))||(p124==1))))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (EG((p214==1)) * (p257==0))) * !(EG(!(!(EG(!((((p259==0)||(p208==1))||(p124==1))))))))) * ...298
Reverse transition relation is NOT exact ! Due to transitions t3, t34, t39, t54, t65, t70, t85, t99, t116, t131, t146, t160, Intersection with reachable a...225
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,2.71709,65612,1,0,722,347727,479,401,5122,424688,919
FORMULA Champagne-PT-H04T1U-CTLCardinality-2024-08 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 : 236/236 places, 302/302 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 199 transition count 265
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 199 transition count 265
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 99 place count 174 transition count 240
Iterating global reduction 0 with 25 rules applied. Total rules applied 124 place count 174 transition count 240
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 134 place count 164 transition count 230
Iterating global reduction 0 with 10 rules applied. Total rules applied 144 place count 164 transition count 230
Applied a total of 144 rules in 9 ms. Remains 164 /236 variables (removed 72) and now considering 230/302 (removed 72) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13211624046101964841.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9912514472295384203.kers'
[2026-05-22 20:06:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13211624046101964841.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9912514472295384203.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 230 rows 164 cols 578 entries
Finished phase 1 with 153 SingleSign rule and 0 generalized
[2026-05-22 20:06:51] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9912514472295384203.kers
Total runtime 2 ms.
[2026-05-22 20:06:51] [INFO ] Implicit Places using invariants in 133 ms returned []
[2026-05-22 20:06:51] [INFO ] Invariant cache hit.
[2026-05-22 20:06:51] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
Running 229 sub problems to find dead transitions.
[2026-05-22 20:06:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (OVERLAPS) 230/394 variables, 164/179 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (OVERLAPS) 0/394 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 180 constraints, problems are : Problem set: 0 solved, 229 unsolved in 24858 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (OVERLAPS) 230/394 variables, 164/180 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 229/409 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 4/413 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (OVERLAPS) 0/394 variables, 4/417 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 10 (OVERLAPS) 0/394 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/394 variables, and 419 constraints, problems are : Problem set: 0 solved, 229 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54898ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 54899ms
Starting structural reductions in LTL mode, iteration 1 : 164/236 places, 230/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55295 ms. Remains : 164/236 places, 230/302 transitions.
[2026-05-22 20:07:46] [INFO ] Flatten gal took : 8 ms
[2026-05-22 20:07:46] [INFO ] Flatten gal took : 10 ms
[2026-05-22 20:07:46] [INFO ] Input system was already deterministic with 230 transitions.
[2026-05-22 20:07:46] [INFO ] Flatten gal took : 8 ms
[2026-05-22 20:07:46] [INFO ] Flatten gal took : 7 ms
[2026-05-22 20:07:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality16185189485612045679.gal : 3 ms
[2026-05-22 20:07:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality3026410411541968038.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/CTLCardinality16185189485612045679.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3026410411541968038.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.82893e+12,0.213213,7320,2,1186,5,15173,6,0,888,14824,0


Converting to forward existential form...Done !
original formula: AG(((AF(((((p132==0)||(p213==1))&&((p140==0)||(p139==1)))||((p129==0)&&(p116==1)))) * (EF(EX(((p236==0)||(p79==1)))) + AF((p270==1)))) + ...259
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * !((E(TRUE U !(EX(!(EX(((p48==0)||(p229==1))))))) * (!(!((E(!((p173!=1)) U (!(EX(TRUE))...582
Reverse transition relation is NOT exact ! Due to transitions t3, t12, t19, t34, t35, t40, t48, t55, t65, t71, t84, t87, t105, t111, t118, t122, t133, t138...281
Hit Full ! (commute/partial/dont) 227/0/3
(forward)formula 0,0,1.65012,38388,1,0,353,178513,500,208,5596,167426,518
FORMULA Champagne-PT-H04T1U-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 302/302 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 196 transition count 262
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 196 transition count 262
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 105 place count 171 transition count 237
Iterating global reduction 0 with 25 rules applied. Total rules applied 130 place count 171 transition count 237
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 142 place count 159 transition count 225
Iterating global reduction 0 with 12 rules applied. Total rules applied 154 place count 159 transition count 225
Applied a total of 154 rules in 11 ms. Remains 159 /236 variables (removed 77) and now considering 225/302 (removed 77) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6954294966430517151.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13704216907845398539.kers'
[2026-05-22 20:07:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6954294966430517151.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13704216907845398539.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 225 rows 159 cols 568 entries
Finished phase 1 with 148 SingleSign rule and 0 generalized
[2026-05-22 20:07:48] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13704216907845398539.kers
Total runtime 3 ms.
[2026-05-22 20:07:48] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-22 20:07:48] [INFO ] Invariant cache hit.
[2026-05-22 20:07:48] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2026-05-22 20:07:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 225/384 variables, 159/172 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (OVERLAPS) 0/384 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 172 constraints, problems are : Problem set: 0 solved, 224 unsolved in 21659 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 225/384 variables, 159/172 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 224/396 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (OVERLAPS) 0/384 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/384 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/384 variables, and 398 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51691ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 51692ms
Starting structural reductions in LTL mode, iteration 1 : 159/236 places, 225/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51962 ms. Remains : 159/236 places, 225/302 transitions.
[2026-05-22 20:08:40] [INFO ] Flatten gal took : 9 ms
[2026-05-22 20:08:40] [INFO ] Flatten gal took : 7 ms
[2026-05-22 20:08:40] [INFO ] Input system was already deterministic with 225 transitions.
[2026-05-22 20:08:40] [INFO ] Flatten gal took : 8 ms
[2026-05-22 20:08:40] [INFO ] Flatten gal took : 7 ms
[2026-05-22 20:08:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality18107967528217108187.gal : 3 ms
[2026-05-22 20:08:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality11026904112505659209.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/CTLCardinality18107967528217108187.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11026904112505659209.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.66159e+12,0.182254,6948,2,1008,5,13916,6,0,863,12606,0


Converting to forward existential form...Done !
original formula: EX(AG((AF(((p234==0)||(p78==1))) * ((E(((p98==0)||(p244==1)) U (p133==1)) + (p278==0)) + (p283==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((!(EG(!(((p234==0)||(p78==1))))) * ((E(((p98==0)||(p244==1)) U (p133==1)) + (p278==0))...183
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t32, t38, t43, t57, t67, t72, t87, t97, t102, t116, t118, t130, t134, t144, t149, t16...258
Detected timeout of ITS tools.
[2026-05-22 20:09:10] [INFO ] Flatten gal took : 6 ms
[2026-05-22 20:09:10] [INFO ] Applying decomposition
[2026-05-22 20:09:10] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5375761377940422376.txt' '-o' '/tmp/graph5375761377940422376.bin' '-w' '/tmp/graph5375761377940422376.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5375761377940422376.bin' '-l' '-1' '-v' '-w' '/tmp/graph5375761377940422376.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:09:10] [INFO ] Decomposing Gal with order
[2026-05-22 20:09:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:09:10] [INFO ] Removed a total of 140 redundant transitions.
[2026-05-22 20:09:10] [INFO ] Flatten gal took : 88 ms
[2026-05-22 20:09:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2026-05-22 20:09:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality599907472419322453.gal : 7 ms
[2026-05-22 20:09:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality8596009265196560930.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/CTLCardinality599907472419322453.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8596009265196560930.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.66159e+12,0.068762,5908,413,25,3414,468,453,3628,65,1126,0


Converting to forward existential form...Done !
original formula: EX(AG((AF(((i0.u35.p234==0)||(i3.i0.u14.p78==1))) * ((E(((i4.i1.u19.p98==0)||(i10.u47.p244==1)) U (i6.i0.u29.p133==1)) + (i11.i0.u52.p278...187
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((!(EG(!(((i0.u35.p234==0)||(i3.i0.u14.p78==1))))) * ((E(((i4.i1.u19.p98==0)||(i10.u47....250
Reverse transition relation is NOT exact ! Due to transitions t3, t38, t67, t144, i1.i0.t163, i2.i0.t149, i3.i0.t130, i3.i0.u13.t134, i4.i1.t116, i4.i1.u16...354
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,0,1.09426,34560,1,0,63180,620,2921,97054,341,1289,118170
FORMULA Champagne-PT-H04T1U-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 302/302 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 191 transition count 257
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 191 transition count 257
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 118 place count 163 transition count 229
Iterating global reduction 0 with 28 rules applied. Total rules applied 146 place count 163 transition count 229
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 160 place count 149 transition count 215
Iterating global reduction 0 with 14 rules applied. Total rules applied 174 place count 149 transition count 215
Applied a total of 174 rules in 7 ms. Remains 149 /236 variables (removed 87) and now considering 215/302 (removed 87) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4218278261944427584.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15109358757450928242.kers'
[2026-05-22 20:09:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4218278261944427584.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15109358757450928242.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 215 rows 149 cols 548 entries
Finished phase 1 with 138 SingleSign rule and 0 generalized
[2026-05-22 20:09:11] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15109358757450928242.kers
Total runtime 4 ms.
[2026-05-22 20:09:11] [INFO ] Implicit Places using invariants in 111 ms returned []
[2026-05-22 20:09:11] [INFO ] Invariant cache hit.
[2026-05-22 20:09:12] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2026-05-22 20:09:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 215/364 variables, 149/160 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 0/364 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 160 constraints, problems are : Problem set: 0 solved, 214 unsolved in 16259 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 215/364 variables, 149/160 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 214/374 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 0/364 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/364 variables, and 377 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46296ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 46296ms
Starting structural reductions in LTL mode, iteration 1 : 149/236 places, 215/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46576 ms. Remains : 149/236 places, 215/302 transitions.
[2026-05-22 20:09:58] [INFO ] Flatten gal took : 12 ms
[2026-05-22 20:09:58] [INFO ] Flatten gal took : 12 ms
[2026-05-22 20:09:58] [INFO ] Input system was already deterministic with 215 transitions.
[2026-05-22 20:09:58] [INFO ] Flatten gal took : 8 ms
[2026-05-22 20:09:58] [INFO ] Flatten gal took : 8 ms
[2026-05-22 20:09:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality4806446967449835178.gal : 2 ms
[2026-05-22 20:09:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality8843518958345377501.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/CTLCardinality4806446967449835178.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8843518958345377501.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.32718e+12,0.109795,5696,2,706,5,7125,6,0,813,5854,0


Converting to forward existential form...Done !
original formula: EG(EF(!(E(!(EX((p152==1))) U (AG((p1==0)) * ((p16==0)||(p134==1)))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(E(!(EX((p152==1))) U (!(E(TRUE U !((p1==0)))) * ((p16==0)||(p134==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t32, t37, t51, t61, t66, t81, t95, t110, t125, t140, t154, Intersection with reachable a...225
(forward)formula 0,1,6.3368,140728,1,0,627,660639,463,404,4964,1.00302e+06,719
FORMULA Champagne-PT-H04T1U-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 302/302 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 195 transition count 261
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 195 transition count 261
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 105 place count 172 transition count 238
Iterating global reduction 0 with 23 rules applied. Total rules applied 128 place count 172 transition count 238
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 139 place count 161 transition count 227
Iterating global reduction 0 with 11 rules applied. Total rules applied 150 place count 161 transition count 227
Applied a total of 150 rules in 9 ms. Remains 161 /236 variables (removed 75) and now considering 227/302 (removed 75) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6228564839458288922.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14947121075642115414.kers'
[2026-05-22 20:10:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6228564839458288922.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14947121075642115414.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 227 rows 161 cols 572 entries
Finished phase 1 with 150 SingleSign rule and 0 generalized
[2026-05-22 20:10:04] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14947121075642115414.kers
Total runtime 1 ms.
[2026-05-22 20:10:04] [INFO ] Implicit Places using invariants in 111 ms returned []
[2026-05-22 20:10:04] [INFO ] Invariant cache hit.
[2026-05-22 20:10:05] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2026-05-22 20:10:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 227/388 variables, 161/172 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (OVERLAPS) 0/388 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 172 constraints, problems are : Problem set: 0 solved, 226 unsolved in 19279 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 227/388 variables, 161/172 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 226/398 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 0/388 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/388 variables, and 401 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 49321ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 49322ms
Starting structural reductions in LTL mode, iteration 1 : 161/236 places, 227/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49628 ms. Remains : 161/236 places, 227/302 transitions.
[2026-05-22 20:10:54] [INFO ] Flatten gal took : 10 ms
[2026-05-22 20:10:54] [INFO ] Flatten gal took : 8 ms
[2026-05-22 20:10:54] [INFO ] Input system was already deterministic with 227 transitions.
[2026-05-22 20:10:54] [INFO ] Flatten gal took : 9 ms
[2026-05-22 20:10:54] [INFO ] Flatten gal took : 8 ms
[2026-05-22 20:10:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality8916357356935201268.gal : 3 ms
[2026-05-22 20:10:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality11955776438916282577.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/CTLCardinality8916357356935201268.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11955776438916282577.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.18067e+12,0.139004,6208,2,763,5,9614,6,0,873,8567,0


Converting to forward existential form...Done !
original formula: A((p0==0) U E(!((((p4==0)||(p276==1)) + (EF((p155==1)) + EX(((p42==0)&&((p115==0)||(p255==1))))))) U EF((!(EF((p74==0))) * !((((p90==1)||...181
=> equivalent forward existential formula: [((Init * !(EG(!(E(!((((p4==0)||(p276==1)) + (E(TRUE U (p155==1)) + EX(((p42==0)&&((p115==0)||(p255==1))))))) U ...612
Reverse transition relation is NOT exact ! Due to transitions t3, t36, t41, t55, t65, t70, t87, t102, t118, t133, t148, t164, Intersection with reachable ...226
(forward)formula 0,0,1.87317,43332,1,0,359,227187,488,218,5277,196854,547
FORMULA Champagne-PT-H04T1U-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 236/236 places, 302/302 transitions.
Graph (trivial) has 226 edges and 236 vertex of which 82 / 236 are part of one of the 9 SCC in 4 ms
Free SCC test removed 73 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 162 transition count 167
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 67 rules applied. Total rules applied 120 place count 110 transition count 152
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 129 place count 103 transition count 150
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 131 place count 101 transition count 150
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 131 place count 101 transition count 148
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 135 place count 99 transition count 148
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 157 place count 77 transition count 124
Iterating global reduction 4 with 22 rules applied. Total rules applied 179 place count 77 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 180 place count 77 transition count 123
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 180 place count 77 transition count 122
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 182 place count 76 transition count 122
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 183 place count 75 transition count 118
Iterating global reduction 5 with 1 rules applied. Total rules applied 184 place count 75 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 185 place count 75 transition count 117
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 227 place count 54 transition count 96
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 228 place count 53 transition count 92
Iterating global reduction 6 with 1 rules applied. Total rules applied 229 place count 53 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 230 place count 53 transition count 91
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 232 place count 51 transition count 89
Applied a total of 232 rules in 41 ms. Remains 51 /236 variables (removed 185) and now considering 89/302 (removed 213) transitions.
[2026-05-22 20:10:56] [INFO ] Flow matrix only has 63 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14969849214225362071.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10030893084966870043.kers'
[2026-05-22 20:10:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14969849214225362071.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10030893084966870043.kers]
Normalized transition count is 62 out of 63 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 62 rows 50 cols 150 entries
Finished phase 1 with 40 SingleSign rule and 0 generalized
[2026-05-22 20:10:56] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10030893084966870043.kers
Total runtime 1 ms.
[2026-05-22 20:10:56] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-22 20:10:56] [INFO ] Flow matrix only has 63 transitions (discarded 26 similar events)
[2026-05-22 20:10:56] [INFO ] Invariant cache hit.
[2026-05-22 20:10:56] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2026-05-22 20:10:56] [INFO ] Redundant transitions in 2 ms returned []
Running 56 sub problems to find dead transitions.
[2026-05-22 20:10:56] [INFO ] Flow matrix only has 63 transitions (discarded 26 similar events)
[2026-05-22 20:10:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 3/51 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 62/113 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 0/113 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/114 variables, and 62 constraints, problems are : Problem set: 0 solved, 56 unsolved in 2216 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 3/51 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 62/113 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 56/118 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/113 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/114 variables, and 119 constraints, problems are : Problem set: 0 solved, 56 unsolved in 2836 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 5060ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 5060ms
Starting structural reductions in SI_CTL mode, iteration 1 : 51/236 places, 89/302 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5288 ms. Remains : 51/236 places, 89/302 transitions.
[2026-05-22 20:11:01] [INFO ] Flatten gal took : 4 ms
[2026-05-22 20:11:01] [INFO ] Flatten gal took : 3 ms
[2026-05-22 20:11:01] [INFO ] Input system was already deterministic with 89 transitions.
[2026-05-22 20:11:01] [INFO ] Flatten gal took : 3 ms
[2026-05-22 20:11:01] [INFO ] Flatten gal took : 3 ms
[2026-05-22 20:11:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality12900701041248584237.gal : 1 ms
[2026-05-22 20:11:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality11807255632285880678.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/CTLCardinality12900701041248584237.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11807255632285880678.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (AG((A(A(AG(((p244==0)||(p7==1))) U (((p118==0)||(p17==1))&&(p221==1))) U !(((p269==0)||(p59==1)))) + EF(((p13==0)||(p53==1))))) + EF((p2...163
=> equivalent forward existential formula: (([(FwdU((FwdU((FwdU((FwdU((Init * !(E(TRUE U (p224==1)))),TRUE) * !(E(TRUE U ((p13==0)||(p53==1))))),!(!(((p269...658
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.119477,5436,1,0,14,7047,42,4,1374,3074,11
FORMULA Champagne-PT-H04T1U-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 302/302 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 200 transition count 266
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 200 transition count 266
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 94 place count 178 transition count 244
Iterating global reduction 0 with 22 rules applied. Total rules applied 116 place count 178 transition count 244
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 128 place count 166 transition count 232
Iterating global reduction 0 with 12 rules applied. Total rules applied 140 place count 166 transition count 232
Applied a total of 140 rules in 11 ms. Remains 166 /236 variables (removed 70) and now considering 232/302 (removed 70) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1493225012477839196.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9133173217880294075.kers'
[2026-05-22 20:11:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1493225012477839196.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9133173217880294075.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 232 rows 166 cols 582 entries
Finished phase 1 with 155 SingleSign rule and 0 generalized
[2026-05-22 20:11:01] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9133173217880294075.kers
Total runtime 2 ms.
[2026-05-22 20:11:02] [INFO ] Implicit Places using invariants in 107 ms returned []
[2026-05-22 20:11:02] [INFO ] Invariant cache hit.
[2026-05-22 20:11:02] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2026-05-22 20:11:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (OVERLAPS) 232/398 variables, 166/177 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (OVERLAPS) 0/398 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 177 constraints, problems are : Problem set: 0 solved, 231 unsolved in 19878 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (OVERLAPS) 232/398 variables, 166/177 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 231/408 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 3/411 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 398/398 variables, and 414 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 49922ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 49923ms
Starting structural reductions in LTL mode, iteration 1 : 166/236 places, 232/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50296 ms. Remains : 166/236 places, 232/302 transitions.
[2026-05-22 20:11:52] [INFO ] Flatten gal took : 7 ms
[2026-05-22 20:11:52] [INFO ] Flatten gal took : 7 ms
[2026-05-22 20:11:52] [INFO ] Input system was already deterministic with 232 transitions.
[2026-05-22 20:11:52] [INFO ] Flatten gal took : 7 ms
[2026-05-22 20:11:52] [INFO ] Flatten gal took : 6 ms
[2026-05-22 20:11:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality4277475352754856393.gal : 2 ms
[2026-05-22 20:11:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality8176913464375876771.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/CTLCardinality4277475352754856393.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8176913464375876771.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,4.41785e+12,0.208038,7528,2,1067,5,15560,6,0,898,16404,0


Converting to forward existential form...Done !
original formula: (AG(((p228==0) * EF(((p247==1)&&((p222==0)||(p103==1)))))) + A(AX((((p114==0)||(p201==1))||((p30==0)||(p34==1)))) U A((((p78==0)||(p247==...201
=> equivalent forward existential formula: ([(FwdU((Init * !(!((E(!(!((E(!(!(((p243==0)||(p124==1)))) U (!((((p78==0)||(p247==1))&&(p279==1))) * !(!(((p243...1230
Reverse transition relation is NOT exact ! Due to transitions t3, t34, t38, t40, t46, t56, t68, t73, t88, t98, t102, t118, t122, t134, t138, t153, t163, t1...259
Detected timeout of ITS tools.
[2026-05-22 20:12:22] [INFO ] Flatten gal took : 8 ms
[2026-05-22 20:12:22] [INFO ] Applying decomposition
[2026-05-22 20:12:22] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15445289322325347089.txt' '-o' '/tmp/graph15445289322325347089.bin' '-w' '/tmp/graph15445289322325347089.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15445289322325347089.bin' '-l' '-1' '-v' '-w' '/tmp/graph15445289322325347089.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:12:22] [INFO ] Decomposing Gal with order
[2026-05-22 20:12:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:12:22] [INFO ] Removed a total of 127 redundant transitions.
[2026-05-22 20:12:22] [INFO ] Flatten gal took : 24 ms
[2026-05-22 20:12:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 9 ms.
[2026-05-22 20:12:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality12618644971017737501.gal : 8 ms
[2026-05-22 20:12:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality508914460264310789.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/CTLCardinality12618644971017737501.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality508914460264310789.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.41785e+12,0.130187,6284,428,24,4044,618,485,4636,68,1546,0


Converting to forward existential form...Done !
original formula: (AG(((i9.i2.u48.p228==0) * EF(((i10.i1.u51.p247==1)&&((i9.i1.u46.p222==0)||(i4.u15.p103==1)))))) + A(AX((((i5.i1.u22.p114==0)||(i8.u40.p2...321
=> equivalent forward existential formula: ([(FwdU((Init * !(!((E(!(!((E(!(!(((i10.i1.u51.p243==0)||(i5.i1.u26.p124==1)))) U (!((((i3.i0.u10.p78==0)||(i10....1896
Reverse transition relation is NOT exact ! Due to transitions t3, t34, t68, i1.i0.u5.t168, i2.t153, i2.u9.t163, i3.i0.t134, i3.i0.u14.t138, i4.t118, i4.u18...360
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,0,4.34645,99164,1,0,177978,1151,3628,268918,396,2867,204321
FORMULA Champagne-PT-H04T1U-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2026-05-22 20:12:26] [INFO ] Flatten gal took : 5 ms
[2026-05-22 20:12:26] [INFO ] Flatten gal took : 4 ms
Total runtime 658408 ms.

BK_STOP 1779480746942

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Champagne-PT-H04T1U"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is Champagne-PT-H04T1U, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r050-smll-177946901000009"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Champagne-PT-H04T1U.tgz
mv Champagne-PT-H04T1U execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;