Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.8K Mar 7 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Mar 7 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 7 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 7 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 11:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 11:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Mar 7 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Mar 7 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Mar 7 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 89K Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779700559858

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-25 09:16:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 09:16:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:16:01] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2026-05-25 09:16:01] [INFO ] Transformed 196 places.
[2026-05-25 09:16:01] [INFO ] Transformed 392 transitions.
[2026-05-25 09:16:01] [INFO ] Found NUPN structural information;
[2026-05-25 09:16:01] [INFO ] Parsed PT model containing 196 places and 392 transitions and 1186 arcs in 196 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-16-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 96 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 390/390 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 181 transition count 365
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 181 transition count 365
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 36 place count 181 transition count 359
Applied a total of 36 rules in 26 ms. Remains 181 /196 variables (removed 15) and now considering 359/390 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4760644174975779423.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17038335834029631824.kers'
[2026-05-25 09:16:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4760644174975779423.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17038335834029631824.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 359 rows 181 cols 1108 entries
Finished phase 1 with 173 SingleSign rule and 1 generalized
[2026-05-25 09:16:02] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17038335834029631824.kers
Total runtime 3 ms.
[2026-05-25 09:16:02] [INFO ] Implicit Places using invariants in 350 ms returned []
[2026-05-25 09:16:02] [INFO ] Invariant cache hit.
[2026-05-25 09:16:02] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 765 ms to find 0 implicit places.
Running 358 sub problems to find dead transitions.
[2026-05-25 09:16:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 5 (OVERLAPS) 359/540 variables, 181/216 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/540 variables, and 218 constraints, problems are : Problem set: 0 solved, 358 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 358/358 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 358 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 5 (OVERLAPS) 359/540 variables, 181/222 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 358/580 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 2/582 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/540 variables, and 582 constraints, problems are : Problem set: 0 solved, 358 unsolved in 30081 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 358/358 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60299ms problems are : Problem set: 0 solved, 358 unsolved
Search for dead transitions found 0 dead transitions in 60327ms
Starting structural reductions in LTL mode, iteration 1 : 181/196 places, 359/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61196 ms. Remains : 181/196 places, 359/390 transitions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 359/359 transitions.
Applied a total of 0 rules in 3 ms. Remains 181 /181 variables (removed 0) and now considering 359/359 (removed 0) transitions.
[2026-05-25 09:17:03] [INFO ] Invariant cache hit.
[2026-05-25 09:17:03] [INFO ] Implicit Places using invariants in 100 ms returned []
[2026-05-25 09:17:03] [INFO ] Invariant cache hit.
[2026-05-25 09:17:03] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 382 ms. Remains : 181/181 places, 359/359 transitions.
Support contains 96 out of 181 places after structural reductions.
[2026-05-25 09:17:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-25 09:17:03] [INFO ] Flatten gal took : 90 ms
FORMULA MedleyA-PT-16-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 09:17:03] [INFO ] Flatten gal took : 18 ms
[2026-05-25 09:17:03] [INFO ] Input system was already deterministic with 359 transitions.
RANDOM walk for 40000 steps (8 resets) in 1300 ms. (30 steps per ms) remains 47/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 66 ms. (59 steps per ms) remains 42/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 42 ms. (93 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 40/42 properties
BEST_FIRST walk for 4001 steps (8 resets) in 36 ms. (108 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 38/38 properties
[2026-05-25 09:17:04] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 116/181 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 359/540 variables, 181/188 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 0/540 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 540/540 variables, and 188 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1218 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp30 is UNSAT
At refinement iteration 1 (OVERLAPS) 116/181 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 12/19 constraints. Problems are: Problem set: 2 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 1/20 constraints. Problems are: Problem set: 2 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 359/540 variables, 181/201 constraints. Problems are: Problem set: 2 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 36/237 constraints. Problems are: Problem set: 2 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 1/238 constraints. Problems are: Problem set: 2 solved, 36 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/540 variables, and 238 constraints, problems are : Problem set: 2 solved, 36 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 36/38 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6250ms problems are : Problem set: 2 solved, 36 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 63 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 359/359 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 181 transition count 345
Reduce places removed 14 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 20 rules applied. Total rules applied 34 place count 167 transition count 339
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 41 place count 161 transition count 338
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 41 place count 161 transition count 335
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 47 place count 158 transition count 335
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 54 place count 151 transition count 324
Iterating global reduction 3 with 7 rules applied. Total rules applied 61 place count 151 transition count 324
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 61 place count 151 transition count 323
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 63 place count 150 transition count 323
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 93 place count 135 transition count 308
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 135 transition count 307
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -55
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 110 place count 127 transition count 362
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 122 place count 127 transition count 350
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 130 place count 127 transition count 342
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 131 place count 126 transition count 341
Iterating global reduction 5 with 1 rules applied. Total rules applied 132 place count 126 transition count 341
Free-agglomeration rule applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 143 place count 126 transition count 330
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 154 place count 115 transition count 330
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 156 place count 115 transition count 328
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 158 place count 115 transition count 328
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 159 place count 114 transition count 327
Applied a total of 159 rules in 145 ms. Remains 114 /181 variables (removed 67) and now considering 327/359 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 114/181 places, 327/359 transitions.
RANDOM walk for 40000 steps (8 resets) in 417 ms. (95 steps per ms) remains 29/36 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 27/29 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 24/26 properties
BEST_FIRST walk for 4000 steps (8 resets) in 30 ms. (129 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 30 ms. (129 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 37 ms. (105 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 20/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 36 ms. (108 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (8 resets) in 41 ms. (95 steps per ms) remains 17/20 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (8 resets) in 23 ms. (166 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 14/14 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14200309946396674763.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15019744838789088812.kers'
[2026-05-25 09:17:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14200309946396674763.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15019744838789088812.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 327 rows 112 cols 1086 entries
Finished phase 1 with 106 SingleSign rule and 1 generalized
[2026-05-25 09:17:11] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15019744838789088812.kers
Total runtime 2 ms.
[2026-05-25 09:17:11] [INFO ] State equation strengthened by 17 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 85/111 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 1/112 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 325/437 variables, 112/118 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 16/134 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 4/441 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/441 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/441 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 0/441 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 441/441 variables, and 138 constraints, problems are : Problem set: 0 solved, 14 unsolved in 783 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 114/114 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 85/111 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 1/112 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 325/437 variables, 112/123 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 16/139 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/437 variables, 8/147 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/437 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/437 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 4/441 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/441 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/441 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/441 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/441 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/441 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (OVERLAPS) 0/441 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 441/441 variables, and 160 constraints, problems are : Problem set: 0 solved, 14 unsolved in 3959 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 114/114 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4772ms problems are : Problem set: 0 solved, 14 unsolved
Finished Parikh walk after 11094 steps, including 708 resets, run visited all 1 properties in 14 ms. (steps per millisecond=792 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 14 properties in 855 ms.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
[2026-05-25 09:17:17] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-25 09:17:17] [INFO ] Flatten gal took : 33 ms
FORMULA MedleyA-PT-16-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 09:17:17] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:17:17] [INFO ] Input system was already deterministic with 359 transitions.
Support contains 92 out of 181 places (down from 94) after GAL structural reductions.
Computed a total of 19 stabilizing places and 19 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 181/181 places, 359/359 transitions.
Graph (trivial) has 199 edges and 181 vertex of which 13 / 181 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 170 transition count 313
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 37 rules applied. Total rules applied 73 place count 135 transition count 311
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 134 transition count 311
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 74 place count 134 transition count 306
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 84 place count 129 transition count 306
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 109 place count 104 transition count 265
Iterating global reduction 3 with 25 rules applied. Total rules applied 134 place count 104 transition count 265
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 10 rules applied. Total rules applied 144 place count 104 transition count 255
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 145 place count 103 transition count 255
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 145 place count 103 transition count 250
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 155 place count 98 transition count 250
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 158 place count 95 transition count 241
Iterating global reduction 5 with 3 rules applied. Total rules applied 161 place count 95 transition count 241
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 185 place count 83 transition count 229
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 187 place count 81 transition count 225
Iterating global reduction 5 with 2 rules applied. Total rules applied 189 place count 81 transition count 225
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 203 place count 81 transition count 211
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 203 place count 81 transition count 210
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 205 place count 80 transition count 210
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 215 place count 75 transition count 205
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 216 place count 74 transition count 204
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 87 edges and 72 vertex of which 27 / 72 are part of one of the 10 SCC in 0 ms
Free SCC test removed 17 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 219 place count 55 transition count 204
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 6 with 43 rules applied. Total rules applied 262 place count 55 transition count 161
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 264 place count 53 transition count 144
Iterating global reduction 7 with 2 rules applied. Total rules applied 266 place count 53 transition count 144
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 7 with 41 rules applied. Total rules applied 307 place count 53 transition count 103
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 7 with 5 rules applied. Total rules applied 312 place count 53 transition count 98
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 317 place count 48 transition count 98
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 319 place count 46 transition count 93
Iterating global reduction 9 with 2 rules applied. Total rules applied 321 place count 46 transition count 93
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 325 place count 44 transition count 91
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 328 place count 44 transition count 88
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 9 with 2 rules applied. Total rules applied 330 place count 44 transition count 86
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 332 place count 42 transition count 86
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 332 place count 42 transition count 85
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 334 place count 41 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 335 place count 41 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 337 place count 40 transition count 83
Applied a total of 337 rules in 106 ms. Remains 40 /181 variables (removed 141) and now considering 83/359 (removed 276) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6093961204897095949.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14186373521569042227.kers'
[2026-05-25 09:17:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6093961204897095949.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14186373521569042227.kers]
Normalized transition count is 82 out of 83 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 82 rows 40 cols 278 entries
Finished phase 1 with 34 SingleSign rule and 1 generalized
[2026-05-25 09:17:17] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14186373521569042227.kers
Total runtime 1 ms.
[2026-05-25 09:17:17] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-25 09:17:17] [INFO ] Invariant cache hit.
[2026-05-25 09:17:17] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:17:17] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2026-05-25 09:17:17] [INFO ] Redundant transitions in 15 ms returned [78]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 78 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-821884696655672327.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12840194875860611979.kers'
[2026-05-25 09:17:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-821884696655672327.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12840194875860611979.kers]
Normalized transition count is 81 out of 82 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 81 rows 40 cols 274 entries
Finished phase 1 with 34 SingleSign rule and 1 generalized
[2026-05-25 09:17:17] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12840194875860611979.kers
Total runtime 0 ms.
[2026-05-25 09:17:17] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 81/121 variables, 40/51 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 0/121 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/122 variables, and 67 constraints, problems are : Problem set: 0 solved, 78 unsolved in 4695 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 40/40 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 81/121 variables, 40/51 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 78/145 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 0/121 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/122 variables, and 145 constraints, problems are : Problem set: 0 solved, 78 unsolved in 3968 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 40/40 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8703ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 8704ms
Starting structural reductions in SI_CTL mode, iteration 1 : 40/181 places, 82/359 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 40 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 39 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 38 transition count 80
Applied a total of 4 rules in 4 ms. Remains 38 /40 variables (removed 2) and now considering 80/82 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17075811682347282961.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1138934153277424682.kers'
[2026-05-25 09:17:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17075811682347282961.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1138934153277424682.kers]
Normalized transition count is 79 out of 80 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 79 rows 38 cols 270 entries
Finished phase 1 with 32 SingleSign rule and 1 generalized
[2026-05-25 09:17:26] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1138934153277424682.kers
Total runtime 0 ms.
[2026-05-25 09:17:26] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-25 09:17:26] [INFO ] Invariant cache hit.
[2026-05-25 09:17:26] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:17:26] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 38/181 places, 80/359 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 9289 ms. Remains : 38/181 places, 80/359 transitions.
[2026-05-25 09:17:26] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:17:26] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:17:26] [INFO ] Input system was already deterministic with 80 transitions.
[2026-05-25 09:17:26] [INFO ] Flatten gal took : 17 ms
[2026-05-25 09:17:26] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:17:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality4655111364810049505.gal : 2 ms
[2026-05-25 09:17:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality6835081009150921063.ctl : 7 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/CTLCardinality4655111364810049505.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6835081009150921063.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,2665,0.05954,6380,2,848,5,7792,5,0,233,6284,0


Converting to forward existential form...Done !
original formula: EG(EF(((p62==0)||(p78==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((p62==0)||(p78==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t10, t12, t14, t17, t18, t20, t22, t24, t54, t57, t60, t61, Intersection with reacha...228
(forward)formula 0,1,0.364873,16848,1,0,164,55499,182,81,1996,39733,173
FORMULA MedleyA-PT-16-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 359/359 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 158 transition count 324
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 158 transition count 324
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 53 place count 158 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 157 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 157 transition count 316
Applied a total of 55 rules in 9 ms. Remains 157 /181 variables (removed 24) and now considering 316/359 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6183328412524450170.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4798259451304668732.kers'
[2026-05-25 09:17:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6183328412524450170.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4798259451304668732.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 316 rows 157 cols 1008 entries
Finished phase 1 with 149 SingleSign rule and 1 generalized
[2026-05-25 09:17:27] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4798259451304668732.kers
Total runtime 1 ms.
[2026-05-25 09:17:27] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-25 09:17:27] [INFO ] Invariant cache hit.
[2026-05-25 09:17:27] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 315 sub problems to find dead transitions.
[2026-05-25 09:17:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (OVERLAPS) 316/473 variables, 157/186 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 3/189 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 473/473 variables, and 189 constraints, problems are : Problem set: 0 solved, 315 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 315 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 316/473 variables, 157/189 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 315/504 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 473/473 variables, and 506 constraints, problems are : Problem set: 0 solved, 315 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60143ms problems are : Problem set: 0 solved, 315 unsolved
Search for dead transitions found 0 dead transitions in 60144ms
Starting structural reductions in LTL mode, iteration 1 : 157/181 places, 316/359 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60472 ms. Remains : 157/181 places, 316/359 transitions.
[2026-05-25 09:18:27] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:18:27] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:18:27] [INFO ] Input system was already deterministic with 316 transitions.
[2026-05-25 09:18:27] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:18:27] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:18:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality3732740866696616608.gal : 5 ms
[2026-05-25 09:18:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality17538812030109812050.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/CTLCardinality3732740866696616608.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17538812030109812050.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.58157e+06,0.994027,41708,2,8682,5,117802,6,0,946,164456,0


Converting to forward existential form...Done !
original formula: ((AG(((p111==0)||(p37==1))) + EG((((EX(((p28==0)||(p121==1))) + (((p76==0)||(p24==1))&&(p117==1))) * (p26==0)) * (p44==1)))) + EX((p106==...159
=> equivalent forward existential formula: [(FwdU(((Init * !(EX((p106==1)))) * !(EG((((EX(((p28==0)||(p121==1))) + (((p76==0)||(p24==1))&&(p117==1))) * (p2...219
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t25, t26, t27, t29, t33, t34, t39, t43, t46, t50, t53, t55, t57, t58, t64, t65,...580
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,6.6942,205084,1,0,620,965788,663,303,7469,895107,678
FORMULA MedleyA-PT-16-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 181/181 places, 359/359 transitions.
Graph (trivial) has 190 edges and 181 vertex of which 9 / 181 are part of one of the 2 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 173 transition count 317
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 139 transition count 315
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 138 transition count 315
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 72 place count 138 transition count 309
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 84 place count 132 transition count 309
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 107 place count 109 transition count 273
Iterating global reduction 3 with 23 rules applied. Total rules applied 130 place count 109 transition count 273
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 8 rules applied. Total rules applied 138 place count 109 transition count 265
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 139 place count 108 transition count 265
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 139 place count 108 transition count 259
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 151 place count 102 transition count 259
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 154 place count 99 transition count 250
Iterating global reduction 5 with 3 rules applied. Total rules applied 157 place count 99 transition count 250
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 179 place count 88 transition count 239
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 181 place count 86 transition count 235
Iterating global reduction 5 with 2 rules applied. Total rules applied 183 place count 86 transition count 235
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 5 with 15 rules applied. Total rules applied 198 place count 86 transition count 220
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 86 transition count 219
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 85 transition count 219
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 210 place count 80 transition count 214
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 211 place count 80 transition count 214
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 212 place count 79 transition count 213
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 86 edges and 77 vertex of which 27 / 77 are part of one of the 10 SCC in 0 ms
Free SCC test removed 17 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 215 place count 60 transition count 213
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 6 with 40 rules applied. Total rules applied 255 place count 60 transition count 173
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 256 place count 59 transition count 163
Iterating global reduction 7 with 1 rules applied. Total rules applied 257 place count 59 transition count 163
Drop transitions (Redundant composition of simpler transitions.) removed 51 transitions
Redundant transition composition rules discarded 51 transitions
Iterating global reduction 7 with 51 rules applied. Total rules applied 308 place count 59 transition count 112
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 7 with 5 rules applied. Total rules applied 313 place count 59 transition count 107
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 318 place count 54 transition count 107
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 319 place count 53 transition count 104
Iterating global reduction 9 with 1 rules applied. Total rules applied 320 place count 53 transition count 104
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 324 place count 51 transition count 102
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 326 place count 51 transition count 100
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 1 rules applied. Total rules applied 327 place count 51 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 328 place count 50 transition count 99
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 329 place count 50 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 331 place count 49 transition count 97
Applied a total of 331 rules in 77 ms. Remains 49 /181 variables (removed 132) and now considering 97/359 (removed 262) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12160940816625294121.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6791665348727162980.kers'
[2026-05-25 09:18:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12160940816625294121.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6791665348727162980.kers]
Normalized transition count is 96 out of 97 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 96 rows 49 cols 314 entries
Finished phase 1 with 43 SingleSign rule and 1 generalized
[2026-05-25 09:18:34] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6791665348727162980.kers
Total runtime 1 ms.
[2026-05-25 09:18:34] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-25 09:18:34] [INFO ] Invariant cache hit.
[2026-05-25 09:18:34] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:18:34] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2026-05-25 09:18:34] [INFO ] Redundant transitions in 12 ms returned [90, 92]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 91 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7865521391482553571.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4173177786386084646.kers'
[2026-05-25 09:18:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7865521391482553571.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4173177786386084646.kers]
Normalized transition count is 94 out of 95 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 94 rows 49 cols 306 entries
Finished phase 1 with 43 SingleSign rule and 1 generalized
[2026-05-25 09:18:34] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4173177786386084646.kers
Total runtime 0 ms.
[2026-05-25 09:18:34] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 94/143 variables, 49/62 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 16/78 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/143 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/144 variables, and 78 constraints, problems are : Problem set: 0 solved, 91 unsolved in 3173 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 49/49 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (OVERLAPS) 94/143 variables, 49/62 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 16/78 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 91/169 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/143 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/144 variables, and 169 constraints, problems are : Problem set: 0 solved, 91 unsolved in 3537 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 49/49 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6745ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 6758ms
Starting structural reductions in SI_CTL mode, iteration 1 : 49/181 places, 95/359 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 49 transition count 92
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 46 transition count 92
Applied a total of 6 rules in 4 ms. Remains 46 /49 variables (removed 3) and now considering 92/95 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9216821582076207397.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15158934492352860816.kers'
[2026-05-25 09:18:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9216821582076207397.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15158934492352860816.kers]
Normalized transition count is 91 out of 92 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 91 rows 46 cols 300 entries
Finished phase 1 with 40 SingleSign rule and 1 generalized
[2026-05-25 09:18:41] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15158934492352860816.kers
Total runtime 1 ms.
[2026-05-25 09:18:41] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-25 09:18:41] [INFO ] Invariant cache hit.
[2026-05-25 09:18:41] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:18:41] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 46/181 places, 92/359 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 7156 ms. Remains : 46/181 places, 92/359 transitions.
[2026-05-25 09:18:41] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:18:41] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:18:41] [INFO ] Input system was already deterministic with 92 transitions.
[2026-05-25 09:18:41] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:18:41] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:18:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality863597253872701551.gal : 2 ms
[2026-05-25 09:18:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality5646688056452467627.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/CTLCardinality863597253872701551.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5646688056452467627.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6655,0.056091,6652,2,1216,5,7907,5,0,277,7447,0


Converting to forward existential form...Done !
original formula: A((AF(!(E((((p177==0)||(p150==1))||(p35==1)) U (p80==0)))) * ((p130==0)||(p41==1))) U EG(EF((p49==0))))
=> equivalent forward existential formula: [((Init * !(EG(!(EG(E(TRUE U (p49==0))))))) * !(E(!(EG(E(TRUE U (p49==0)))) U (!((!(EG(!(!(E((((p177==0)||(p150=...254
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t11, t12, t13, t14, t15, t17, t19, t21, t24, t25, t27, t29, t31, t34, t35, t36, t41, ...293
(forward)formula 0,1,0.313902,18704,1,0,198,64637,211,97,2248,49995,198
FORMULA MedleyA-PT-16-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 359/359 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 154 transition count 318
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 154 transition count 318
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 63 place count 154 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 153 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 153 transition count 308
Applied a total of 65 rules in 4 ms. Remains 153 /181 variables (removed 28) and now considering 308/359 (removed 51) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3259244957636316324.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8754908815293184964.kers'
[2026-05-25 09:18:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3259244957636316324.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8754908815293184964.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 308 rows 153 cols 988 entries
Finished phase 1 with 145 SingleSign rule and 1 generalized
[2026-05-25 09:18:42] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8754908815293184964.kers
Total runtime 1 ms.
[2026-05-25 09:18:42] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-25 09:18:42] [INFO ] Invariant cache hit.
[2026-05-25 09:18:42] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2026-05-25 09:18:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 308/461 variables, 153/179 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 461/461 variables, and 180 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 308/461 variables, 153/180 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 307/487 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/461 variables, and 491 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60081ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 60082ms
Starting structural reductions in LTL mode, iteration 1 : 153/181 places, 308/359 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60345 ms. Remains : 153/181 places, 308/359 transitions.
[2026-05-25 09:19:42] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:19:42] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:19:42] [INFO ] Input system was already deterministic with 308 transitions.
[2026-05-25 09:19:42] [INFO ] Flatten gal took : 17 ms
[2026-05-25 09:19:42] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:19:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality2294517024228955483.gal : 18 ms
[2026-05-25 09:19:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality18002988961524334929.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/CTLCardinality2294517024228955483.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18002988961524334929.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.44045e+06,0.760462,33224,2,8255,5,98462,6,0,922,124395,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.771808,33224,1,0,6,98462,7,1,1244,124395,1
FORMULA MedleyA-PT-16-CTLCardinality-2024-05 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 : 181/181 places, 359/359 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 157 transition count 324
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 157 transition count 324
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 57 place count 157 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 156 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 156 transition count 314
Applied a total of 59 rules in 14 ms. Remains 156 /181 variables (removed 25) and now considering 314/359 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5453154539656997208.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3184655199169035774.kers'
[2026-05-25 09:19:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5453154539656997208.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3184655199169035774.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 314 rows 156 cols 1000 entries
Finished phase 1 with 148 SingleSign rule and 1 generalized
[2026-05-25 09:19:43] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3184655199169035774.kers
Total runtime 3 ms.
[2026-05-25 09:19:43] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-25 09:19:43] [INFO ] Invariant cache hit.
[2026-05-25 09:19:43] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 313 sub problems to find dead transitions.
[2026-05-25 09:19:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (OVERLAPS) 314/470 variables, 156/180 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 5/185 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/470 variables, and 185 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (OVERLAPS) 314/470 variables, 156/185 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 313/498 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 313 unsolved
SMT process timed out in 60094ms, After SMT, problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 60095ms
Starting structural reductions in LTL mode, iteration 1 : 156/181 places, 314/359 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60448 ms. Remains : 156/181 places, 314/359 transitions.
[2026-05-25 09:20:43] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:20:43] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:20:43] [INFO ] Input system was already deterministic with 314 transitions.
[2026-05-25 09:20:43] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:20:43] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:20:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality44619972291982771.gal : 2 ms
[2026-05-25 09:20:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality13707013157999976798.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/CTLCardinality44619972291982771.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13707013157999976798.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.71773e+06,0.797626,34740,2,8590,5,101772,6,0,940,130883,0


Converting to forward existential form...Done !
original formula: ((AX((!(A((p73==1) U ((p21==0)||(p6==1)))) * EG((p155==0)))) + AF(((p23==0)&&(p8==1)))) + AG(AX(EG(((p125==0)&&(p187==1))))))
=> equivalent forward existential formula: [(EY(FwdU((Init * !((!(EX(!((!(!((E(!(((p21==0)||(p6==1))) U (!((p73==1)) * !(((p21==0)||(p6==1))))) + EG(!(((p2...279
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t24, t27, t28, t29, t31, t32, t35, t36, t41, t45, t48, t52, t55, t57, t59, t60,...575
(forward)formula 0,0,7.68728,233500,1,0,701,1.23769e+06,672,340,7280,1.06318e+06,788
FORMULA MedleyA-PT-16-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 181/181 places, 359/359 transitions.
Graph (trivial) has 201 edges and 181 vertex of which 13 / 181 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 170 transition count 312
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 40 rules applied. Total rules applied 77 place count 134 transition count 308
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 132 transition count 308
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 79 place count 132 transition count 303
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 89 place count 127 transition count 303
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 115 place count 101 transition count 260
Iterating global reduction 3 with 26 rules applied. Total rules applied 141 place count 101 transition count 260
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 8 rules applied. Total rules applied 149 place count 101 transition count 252
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 150 place count 100 transition count 252
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 150 place count 100 transition count 247
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 160 place count 95 transition count 247
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 163 place count 92 transition count 238
Iterating global reduction 5 with 3 rules applied. Total rules applied 166 place count 92 transition count 238
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 188 place count 81 transition count 227
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 190 place count 79 transition count 223
Iterating global reduction 5 with 2 rules applied. Total rules applied 192 place count 79 transition count 223
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 204 place count 79 transition count 211
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 204 place count 79 transition count 209
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 208 place count 77 transition count 209
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 216 place count 73 transition count 205
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 217 place count 72 transition count 204
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 78 edges and 71 vertex of which 13 / 71 are part of one of the 5 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 219 place count 63 transition count 204
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 238 place count 63 transition count 185
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 239 place count 62 transition count 173
Iterating global reduction 7 with 1 rules applied. Total rules applied 240 place count 62 transition count 173
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 246 place count 62 transition count 167
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 247 place count 62 transition count 166
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 248 place count 61 transition count 166
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 249 place count 60 transition count 158
Iterating global reduction 9 with 1 rules applied. Total rules applied 250 place count 60 transition count 158
Applied a total of 250 rules in 67 ms. Remains 60 /181 variables (removed 121) and now considering 158/359 (removed 201) transitions.
[2026-05-25 09:20:51] [INFO ] Flow matrix only has 126 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8548021629377896315.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6188944760361332703.kers'
[2026-05-25 09:20:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8548021629377896315.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6188944760361332703.kers]
Normalized transition count is 125 out of 126 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 125 rows 59 cols 377 entries
Finished phase 1 with 53 SingleSign rule and 1 generalized
[2026-05-25 09:20:51] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6188944760361332703.kers
Total runtime 0 ms.
[2026-05-25 09:20:51] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-25 09:20:51] [INFO ] Flow matrix only has 126 transitions (discarded 32 similar events)
[2026-05-25 09:20:51] [INFO ] Invariant cache hit.
[2026-05-25 09:20:51] [INFO ] State equation strengthened by 19 read => feed constraints.
[2026-05-25 09:20:51] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2026-05-25 09:20:51] [INFO ] Redundant transitions in 2 ms returned []
Running 153 sub problems to find dead transitions.
[2026-05-25 09:20:51] [INFO ] Flow matrix only has 126 transitions (discarded 32 similar events)
[2026-05-25 09:20:51] [INFO ] Invariant cache hit.
[2026-05-25 09:20:51] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 125/185 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 19/92 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (OVERLAPS) 0/185 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/186 variables, and 92 constraints, problems are : Problem set: 0 solved, 153 unsolved in 5912 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 60/60 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 125/185 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 19/92 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 153/245 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (OVERLAPS) 0/185 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/186 variables, and 245 constraints, problems are : Problem set: 0 solved, 153 unsolved in 6384 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 60/60 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12331ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 12331ms
Starting structural reductions in SI_CTL mode, iteration 1 : 60/181 places, 158/359 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12550 ms. Remains : 60/181 places, 158/359 transitions.
[2026-05-25 09:21:04] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:21:04] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:21:04] [INFO ] Input system was already deterministic with 158 transitions.
[2026-05-25 09:21:04] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:21:04] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:21:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality2049203827862676254.gal : 2 ms
[2026-05-25 09:21:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality7019273332767840450.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/CTLCardinality2049203827862676254.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7019273332767840450.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,32758,0.067912,6744,2,1184,5,8641,6,0,394,7590,0


Converting to forward existential form...Done !
original formula: AF((p57==1))
=> equivalent forward existential formula: [FwdG(Init,!((p57==1)))] = FALSE
Hit Full ! (commute/partial/dont) 153/0/5
(forward)formula 0,0,0.216557,12748,1,0,7,36383,20,2,2163,23053,8
FORMULA MedleyA-PT-16-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 359/359 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 158 transition count 322
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 158 transition count 322
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 55 place count 158 transition count 313
Applied a total of 55 rules in 2 ms. Remains 158 /181 variables (removed 23) and now considering 313/359 (removed 46) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15655821204583381094.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6698836785690402433.kers'
[2026-05-25 09:21:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15655821204583381094.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6698836785690402433.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 313 rows 158 cols 998 entries
Finished phase 1 with 150 SingleSign rule and 1 generalized
[2026-05-25 09:21:04] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6698836785690402433.kers
Total runtime 1 ms.
[2026-05-25 09:21:04] [INFO ] Implicit Places using invariants in 117 ms returned []
[2026-05-25 09:21:04] [INFO ] Invariant cache hit.
[2026-05-25 09:21:04] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Running 312 sub problems to find dead transitions.
[2026-05-25 09:21:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 10 (OVERLAPS) 313/471 variables, 158/192 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 471/471 variables, and 193 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 312 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (OVERLAPS) 313/471 variables, 158/194 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 312/506 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 471/471 variables, and 507 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60077ms problems are : Problem set: 0 solved, 312 unsolved
Search for dead transitions found 0 dead transitions in 60078ms
Starting structural reductions in LTL mode, iteration 1 : 158/181 places, 313/359 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60429 ms. Remains : 158/181 places, 313/359 transitions.
[2026-05-25 09:22:04] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:22:04] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:22:04] [INFO ] Input system was already deterministic with 313 transitions.
[2026-05-25 09:22:04] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:22:04] [INFO ] Flatten gal took : 15 ms
[2026-05-25 09:22:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality15287699714500785653.gal : 2 ms
[2026-05-25 09:22:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality9757770596817458727.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/CTLCardinality15287699714500785653.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9757770596817458727.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,8.19679e+06,1.63816,54796,2,12848,5,162035,6,0,947,217976,0


Converting to forward existential form...Done !
original formula: AG((((EF(((p101==1)||(p111==1))) + (p106==0)) + ((p126==0)&&(p186==1))) * (AG(((p178==0)||(p17==1))) + AX(EX(((p59==0)||(p38==1)))))))
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * !(((p126==0)&&(p186==1)))) * !((p106==0))) * !(E(TRUE U ((p101==1)||(p111==1)))))] = FALS...266
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t13, t16, t20, t27, t28, t29, t31, t35, t36, t41, t45, t48, t52, t55, t57, t59, t60, ...557
(forward)formula 0,0,15.9135,410844,1,0,620,2.4696e+06,649,318,7178,1.68126e+06,705
FORMULA MedleyA-PT-16-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 359/359 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 160 transition count 328
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 160 transition count 328
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 160 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 159 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 159 transition count 325
Applied a total of 46 rules in 4 ms. Remains 159 /181 variables (removed 22) and now considering 325/359 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6263048511992716077.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-297337597107758626.kers'
[2026-05-25 09:22:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6263048511992716077.kers, --Pflows, --basisKERS=/tmp/petrispot-output-297337597107758626.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 325 rows 159 cols 1036 entries
Finished phase 1 with 151 SingleSign rule and 1 generalized
[2026-05-25 09:22:20] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-297337597107758626.kers
Total runtime 4 ms.
[2026-05-25 09:22:21] [INFO ] Implicit Places using invariants in 140 ms returned []
[2026-05-25 09:22:21] [INFO ] Invariant cache hit.
[2026-05-25 09:22:21] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2026-05-25 09:22:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (OVERLAPS) 325/484 variables, 159/191 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 484/484 variables, and 195 constraints, problems are : Problem set: 0 solved, 324 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (OVERLAPS) 325/484 variables, 159/199 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 324/523 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 484/484 variables, and 524 constraints, problems are : Problem set: 0 solved, 324 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60106ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Starting structural reductions in LTL mode, iteration 1 : 159/181 places, 325/359 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60430 ms. Remains : 159/181 places, 325/359 transitions.
[2026-05-25 09:23:21] [INFO ] Flatten gal took : 16 ms
[2026-05-25 09:23:21] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:23:21] [INFO ] Input system was already deterministic with 325 transitions.
[2026-05-25 09:23:21] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:23:21] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:23:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality17577232227389443217.gal : 2 ms
[2026-05-25 09:23:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality10349879810148266166.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/CTLCardinality17577232227389443217.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10349879810148266166.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,8.16866e+06,1.32222,47864,2,11078,5,136411,6,0,963,201603,0


Converting to forward existential form...Done !
original formula: ((AX(EF((p12==1))) + AG(!(E((p136==1) U ((p165==0)||(p92==1)))))) + EG((EX((AX(((p7==0)||(p87==1))) * (p175==1))) + ((((((p108==0)&&(p19=...231
=> equivalent forward existential formula: [(FwdU(FwdU(((Init * !(EG((EX((!(EX(!(((p7==0)||(p87==1))))) * (p175==1))) + ((((((p108==0)&&(p19==1))||(p13==0)...322
Reverse transition relation is NOT exact ! Due to transitions t4, t12, t13, t15, t19, t26, t27, t28, t30, t34, t35, t40, t44, t47, t51, t54, t55, t56, t58,...628
Detected timeout of ITS tools.
[2026-05-25 09:23:51] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:23:51] [INFO ] Applying decomposition
[2026-05-25 09:23:51] [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/graph7395586307259989175.txt' '-o' '/tmp/graph7395586307259989175.bin' '-w' '/tmp/graph7395586307259989175.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7395586307259989175.bin' '-l' '-1' '-v' '-w' '/tmp/graph7395586307259989175.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:23:51] [INFO ] Decomposing Gal with order
[2026-05-25 09:23:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:23:51] [INFO ] Removed a total of 406 redundant transitions.
[2026-05-25 09:23:51] [INFO ] Flatten gal took : 70 ms
[2026-05-25 09:23:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 12 ms.
[2026-05-25 09:23:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality10351639628491861315.gal : 3 ms
[2026-05-25 09:23:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality9729000437872875425.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/CTLCardinality10351639628491861315.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9729000437872875425.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.16866e+06,0.477806,22872,1238,28,33738,355,682,73688,53,1446,0


Converting to forward existential form...Done !
original formula: ((AX(EF((i0.u4.p12==1))) + AG(!(E((i6.i1.u48.p136==1) U ((i8.i1.u59.p165==0)||(i5.u35.p92==1)))))) + EG((EX((AX(((i0.u3.p7==0)||(i4.i0.u3...349
=> equivalent forward existential formula: [(FwdU(FwdU(((Init * !(EG((EX((!(EX(!(((i0.u3.p7==0)||(i4.i0.u33.p87==1))))) * (i8.i3.u50.p175==1))) + ((((((i3....440
Reverse transition relation is NOT exact ! Due to transitions t26, t56, t58, t86, t96, t102, t120, t121, t167, t169, t175, t177, t184, t185, t187, t188, t1...911
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
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 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
(forward)formula 0,1,2.67506,102416,1,0,154739,355,4200,523151,242,1446,423496
FORMULA MedleyA-PT-16-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 181/181 places, 359/359 transitions.
Graph (trivial) has 131 edges and 181 vertex of which 4 / 181 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 177 transition count 336
Reduce places removed 19 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 26 rules applied. Total rules applied 46 place count 158 transition count 329
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 55 place count 151 transition count 327
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 150 transition count 327
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 56 place count 150 transition count 323
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 64 place count 146 transition count 323
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 78 place count 132 transition count 299
Iterating global reduction 4 with 14 rules applied. Total rules applied 92 place count 132 transition count 299
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 98 place count 132 transition count 293
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 99 place count 131 transition count 289
Iterating global reduction 5 with 1 rules applied. Total rules applied 100 place count 131 transition count 289
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 126 place count 118 transition count 276
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 127 place count 117 transition count 274
Iterating global reduction 5 with 1 rules applied. Total rules applied 128 place count 117 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 134 place count 117 transition count 268
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 138 place count 115 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 139 place count 114 transition count 265
Applied a total of 139 rules in 19 ms. Remains 114 /181 variables (removed 67) and now considering 265/359 (removed 94) transitions.
[2026-05-25 09:23:54] [INFO ] Flow matrix only has 264 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1367846362804572636.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2314809556098595262.kers'
[2026-05-25 09:23:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1367846362804572636.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2314809556098595262.kers]
Normalized transition count is 263 out of 264 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 263 rows 113 cols 831 entries
Finished phase 1 with 106 SingleSign rule and 1 generalized
[2026-05-25 09:23:54] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2314809556098595262.kers
Total runtime 4 ms.
[2026-05-25 09:23:54] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-25 09:23:54] [INFO ] Flow matrix only has 264 transitions (discarded 1 similar events)
[2026-05-25 09:23:54] [INFO ] Invariant cache hit.
[2026-05-25 09:23:54] [INFO ] State equation strengthened by 17 read => feed constraints.
[2026-05-25 09:23:54] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2026-05-25 09:23:54] [INFO ] Redundant transitions in 7 ms returned []
Running 261 sub problems to find dead transitions.
[2026-05-25 09:23:54] [INFO ] Flow matrix only has 264 transitions (discarded 1 similar events)
[2026-05-25 09:23:54] [INFO ] Invariant cache hit.
[2026-05-25 09:23:54] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 4/114 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 263/377 variables, 114/133 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 16/149 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/377 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (OVERLAPS) 1/378 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 11 (OVERLAPS) 0/378 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 13 (OVERLAPS) 0/378 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 152 constraints, problems are : Problem set: 0 solved, 261 unsolved in 28923 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 114/114 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 4/114 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (OVERLAPS) 263/377 variables, 114/138 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/377 variables, 16/154 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 261/415 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 377/378 variables, and 417 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 114/114 constraints, ReadFeed: 16/17 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59000ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 59001ms
Starting structural reductions in SI_CTL mode, iteration 1 : 114/181 places, 265/359 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59279 ms. Remains : 114/181 places, 265/359 transitions.
[2026-05-25 09:24:53] [INFO ] Flatten gal took : 20 ms
[2026-05-25 09:24:53] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:24:53] [INFO ] Input system was already deterministic with 265 transitions.
[2026-05-25 09:24:53] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:24:53] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:24:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality10033542684159971596.gal : 1 ms
[2026-05-25 09:24:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality76339211249017740.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/CTLCardinality10033542684159971596.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality76339211249017740.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,989428,0.405492,18960,2,3786,5,52264,6,0,718,63052,0


Converting to forward existential form...Done !
original formula: A((!(((A((p68==1) U ((p66==0)||(p134==1))) * ((p120==0)||(p187==1))) + !(((p20==1)&&(p49==0))))) * E(((((p83==0)||(p118==1)) * AF((p80==0...531
=> equivalent forward existential formula: [((Init * !(EG(!(!(((((p42==0)||(p174==1)) * !((E(!((E(((p155==0)||(p129==1)) U ((p51==0)||(p104==1))) * ((p3==0...2163
Reverse transition relation is NOT exact ! Due to transitions t9, t12, t17, t18, t21, t23, t29, t32, t34, t35, t36, t37, t39, t44, t52, t54, t58, t59, t64,...494
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2026-05-25 09:25:23] [INFO ] Flatten gal took : 19 ms
[2026-05-25 09:25:23] [INFO ] Applying decomposition
[2026-05-25 09:25:23] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3815240468297074068.txt' '-o' '/tmp/graph3815240468297074068.bin' '-w' '/tmp/graph3815240468297074068.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3815240468297074068.bin' '-l' '-1' '-v' '-w' '/tmp/graph3815240468297074068.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:25:23] [INFO ] Decomposing Gal with order
[2026-05-25 09:25:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:25:24] [INFO ] Removed a total of 347 redundant transitions.
[2026-05-25 09:25:24] [INFO ] Flatten gal took : 29 ms
[2026-05-25 09:25:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 6 ms.
[2026-05-25 09:25:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality11434512317712957613.gal : 1 ms
[2026-05-25 09:25:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality9038431529644580395.ctl : 2 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/CTLCardinality11434512317712957613.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9038431529644580395.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,989428,0.388753,22040,826,55,31314,636,562,97056,77,2402,0


Converting to forward existential form...Done !
original formula: A((!(((A((i1.u13.p68==1) U ((i1.u12.p66==0)||(i4.u27.p134==1))) * ((i6.u20.p120==0)||(i7.i1.u40.p187==1))) + !(((i0.u1.p20==1)&&(i7.i1.u9...818
=> equivalent forward existential formula: [((Init * !(EG(!(!(((((i7.i0.u5.p42==0)||(i5.u36.p174==1)) * !((E(!((E(((i6.u33.p155==0)||(i4.u26.p129==1)) U ((...3258
Reverse transition relation is NOT exact ! Due to transitions t21, t23, t54, t58, t64, t109, t110, t111, t113, t211, t212, t240, t242, t248, t250, i0.t106,...675
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,18.8115,614636,1,0,318079,1164,3562,6.84018e+06,382,6011,650472
FORMULA MedleyA-PT-16-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 359/359 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 159 transition count 326
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 159 transition count 326
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 53 place count 159 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 158 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 158 transition count 316
Applied a total of 55 rules in 5 ms. Remains 158 /181 variables (removed 23) and now considering 316/359 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17399203847727394159.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15617399103759625209.kers'
[2026-05-25 09:25:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17399203847727394159.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15617399103759625209.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 316 rows 158 cols 1004 entries
Finished phase 1 with 150 SingleSign rule and 1 generalized
[2026-05-25 09:25:43] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15617399103759625209.kers
Total runtime 2 ms.
[2026-05-25 09:25:43] [INFO ] Implicit Places using invariants in 130 ms returned []
[2026-05-25 09:25:43] [INFO ] Invariant cache hit.
[2026-05-25 09:25:43] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Running 315 sub problems to find dead transitions.
[2026-05-25 09:25:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (OVERLAPS) 316/474 variables, 158/190 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (OVERLAPS) 0/474 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 474/474 variables, and 192 constraints, problems are : Problem set: 0 solved, 315 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 315 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 316/474 variables, 158/191 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 315/506 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 2/509 constraints. Problems are: Problem set: 0 solved, 315 unsolved
SMT process timed out in 60102ms, After SMT, problems are : Problem set: 0 solved, 315 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Starting structural reductions in LTL mode, iteration 1 : 158/181 places, 316/359 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60471 ms. Remains : 158/181 places, 316/359 transitions.
[2026-05-25 09:26:43] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:26:43] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:26:43] [INFO ] Input system was already deterministic with 316 transitions.
[2026-05-25 09:26:43] [INFO ] Flatten gal took : 17 ms
[2026-05-25 09:26:43] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:26:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality5416465315642843809.gal : 4 ms
[2026-05-25 09:26:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality4890746808552834951.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/CTLCardinality5416465315642843809.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4890746808552834951.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,5.84672e+06,0.860157,32196,2,7491,5,94720,6,0,950,126145,0


Converting to forward existential form...Done !
original formula: ((EF(AG((p93==0))) + AX(((p115==0)&&(p190==1)))) + ((EX(((EF(((p76==0)||(p60==1))) * (p52==0)) * (p158==1))) * EG(EF(((p133==0)||(p89==1)...208
=> equivalent forward existential formula: (([((Init * !((E(TRUE U !(E(TRUE U !((p93==0))))) + !(EX(!(((p115==0)&&(p190==1)))))))) * !(EX(((E(TRUE U ((p76=...503
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t25, t26, t27, t28, t29, t31, t35, t36, t41, t45, t48, t52, t55, t57, t59, t60,...584
(forward)formula 0,1,21.272,485716,1,0,698,3.08196e+06,677,340,7286,2.12154e+06,785
FORMULA MedleyA-PT-16-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 181/181 places, 359/359 transitions.
Graph (trivial) has 199 edges and 181 vertex of which 13 / 181 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 170 transition count 313
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 74 place count 135 transition count 310
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 134 transition count 310
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 75 place count 134 transition count 305
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 85 place count 129 transition count 305
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 110 place count 104 transition count 264
Iterating global reduction 3 with 25 rules applied. Total rules applied 135 place count 104 transition count 264
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 10 rules applied. Total rules applied 145 place count 104 transition count 254
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 146 place count 103 transition count 254
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 146 place count 103 transition count 249
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 156 place count 98 transition count 249
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 159 place count 95 transition count 240
Iterating global reduction 5 with 3 rules applied. Total rules applied 162 place count 95 transition count 240
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 184 place count 84 transition count 229
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 186 place count 82 transition count 225
Iterating global reduction 5 with 2 rules applied. Total rules applied 188 place count 82 transition count 225
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 201 place count 82 transition count 212
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 201 place count 82 transition count 211
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 203 place count 81 transition count 211
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 213 place count 76 transition count 206
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 214 place count 75 transition count 205
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 88 edges and 73 vertex of which 25 / 73 are part of one of the 10 SCC in 0 ms
Free SCC test removed 15 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 217 place count 58 transition count 205
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 6 with 37 rules applied. Total rules applied 254 place count 58 transition count 168
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 256 place count 56 transition count 150
Iterating global reduction 7 with 2 rules applied. Total rules applied 258 place count 56 transition count 150
Drop transitions (Redundant composition of simpler transitions.) removed 43 transitions
Redundant transition composition rules discarded 43 transitions
Iterating global reduction 7 with 43 rules applied. Total rules applied 301 place count 56 transition count 107
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 7 with 6 rules applied. Total rules applied 307 place count 56 transition count 101
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 313 place count 50 transition count 101
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 315 place count 48 transition count 96
Iterating global reduction 9 with 2 rules applied. Total rules applied 317 place count 48 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 321 place count 46 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 324 place count 46 transition count 91
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 9 with 2 rules applied. Total rules applied 326 place count 46 transition count 89
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 328 place count 44 transition count 89
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 328 place count 44 transition count 88
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 330 place count 43 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 331 place count 43 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 333 place count 42 transition count 86
Applied a total of 333 rules in 69 ms. Remains 42 /181 variables (removed 139) and now considering 86/359 (removed 273) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14983191267423532680.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12636127667721217897.kers'
[2026-05-25 09:27:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14983191267423532680.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12636127667721217897.kers]
Normalized transition count is 85 out of 86 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 85 rows 42 cols 284 entries
Finished phase 1 with 36 SingleSign rule and 1 generalized
[2026-05-25 09:27:05] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12636127667721217897.kers
Total runtime 0 ms.
[2026-05-25 09:27:05] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-25 09:27:05] [INFO ] Invariant cache hit.
[2026-05-25 09:27:05] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:27:05] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2026-05-25 09:27:05] [INFO ] Redundant transitions in 17 ms returned [81]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 81 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15715152131963431213.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14171370554035218875.kers'
[2026-05-25 09:27:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15715152131963431213.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14171370554035218875.kers]
Normalized transition count is 84 out of 85 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 84 rows 42 cols 280 entries
Finished phase 1 with 36 SingleSign rule and 1 generalized
[2026-05-25 09:27:05] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14171370554035218875.kers
Total runtime 1 ms.
[2026-05-25 09:27:05] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 84/126 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 0/126 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/127 variables, and 70 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2718 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 84/126 variables, 42/55 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 16/71 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 81/152 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/127 variables, and 152 constraints, problems are : Problem set: 0 solved, 81 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7757ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 7757ms
Starting structural reductions in SI_CTL mode, iteration 1 : 42/181 places, 85/359 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 42 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 41 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 40 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 40 transition count 82
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 40 transition count 81
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 39 transition count 81
Applied a total of 7 rules in 5 ms. Remains 39 /42 variables (removed 3) and now considering 81/85 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17108808350823510276.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11606459428439016773.kers'
[2026-05-25 09:27:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17108808350823510276.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11606459428439016773.kers]
Normalized transition count is 80 out of 81 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 80 rows 39 cols 272 entries
Finished phase 1 with 33 SingleSign rule and 1 generalized
[2026-05-25 09:27:13] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11606459428439016773.kers
Total runtime 0 ms.
[2026-05-25 09:27:13] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-25 09:27:13] [INFO ] Invariant cache hit.
[2026-05-25 09:27:13] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:27:13] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 39/181 places, 81/359 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 8130 ms. Remains : 39/181 places, 81/359 transitions.
[2026-05-25 09:27:13] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:27:13] [INFO ] Flatten gal took : 1 ms
[2026-05-25 09:27:13] [INFO ] Input system was already deterministic with 81 transitions.
[2026-05-25 09:27:13] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:27:13] [INFO ] Flatten gal took : 1 ms
[2026-05-25 09:27:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality7563788483169904685.gal : 0 ms
[2026-05-25 09:27:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality13369360641099753965.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/CTLCardinality7563788483169904685.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13369360641099753965.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,3060,0.030385,5248,2,589,5,4424,5,0,238,3466,0


Converting to forward existential form...Done !
original formula: EF(EG(((p180==0)&&(p144==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((p180==0)&&(p144==1)))] != FALSE
Hit Full ! (commute/partial/dont) 73/7/8
(forward)formula 0,1,0.080834,7444,1,0,7,15504,18,1,1420,7096,8
FORMULA MedleyA-PT-16-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 359/359 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 154 transition count 318
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 154 transition count 318
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 63 place count 154 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 153 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 153 transition count 308
Applied a total of 65 rules in 3 ms. Remains 153 /181 variables (removed 28) and now considering 308/359 (removed 51) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8584199417817526557.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11170583554419537796.kers'
[2026-05-25 09:27:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8584199417817526557.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11170583554419537796.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 308 rows 153 cols 988 entries
Finished phase 1 with 145 SingleSign rule and 1 generalized
[2026-05-25 09:27:13] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11170583554419537796.kers
Total runtime 1 ms.
[2026-05-25 09:27:13] [INFO ] Implicit Places using invariants in 129 ms returned []
[2026-05-25 09:27:13] [INFO ] Invariant cache hit.
[2026-05-25 09:27:13] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2026-05-25 09:27:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 308/461 variables, 153/179 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 0/461 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 180 constraints, problems are : Problem set: 0 solved, 307 unsolved in 28377 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 308/461 variables, 153/180 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 307/487 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/461 variables, and 491 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 58447ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 58448ms
Starting structural reductions in LTL mode, iteration 1 : 153/181 places, 308/359 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58712 ms. Remains : 153/181 places, 308/359 transitions.
[2026-05-25 09:28:12] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:28:12] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:28:12] [INFO ] Input system was already deterministic with 308 transitions.
[2026-05-25 09:28:12] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:28:12] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:28:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality7692014074532625988.gal : 4 ms
[2026-05-25 09:28:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality7537627802053822244.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/CTLCardinality7692014074532625988.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7537627802053822244.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,5.44045e+06,0.92989,33336,2,8255,5,98462,6,0,922,124395,0


Converting to forward existential form...Done !
original formula: AF((AX(EG((p53==1))) * ((AX((p181==0)) + (p131==1)) + (((p111==1)&&(p79==1))&&((p160==1)&&((p168==0)||(p128==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(EG((p53==1))))) * ((!(EX(!((p181==0)))) + (p131==1)) + (((p111==1)&&(p79==1))&&((p160==1)&&...192
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t25, t26, t27, t29, t33, t34, t39, t43, t46, t50, t53, t55, t57, t58, t64, t65,...541
(forward)formula 0,0,17.3427,477184,1,0,952,1.92932e+06,646,531,6866,3.04957e+06,920
FORMULA MedleyA-PT-16-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 09:28:29] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:28:29] [INFO ] Flatten gal took : 14 ms
Total runtime 748004 ms.

BK_STOP 1779701309729

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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