Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.0K Mar 5 17:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 5 17:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 5 17:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 5 17:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Mar 5 17:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Mar 5 17:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 5 17:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 5 17:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:45 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 91K 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 BusinessProcesses-PT-08-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-12
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-13
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-14
FORMULA_NAME BusinessProcesses-PT-08-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779613164868

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-24 08:59:26] [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-24 08:59:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 08:59:26] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2026-05-24 08:59:26] [INFO ] Transformed 393 places.
[2026-05-24 08:59:26] [INFO ] Transformed 344 transitions.
[2026-05-24 08:59:26] [INFO ] Found NUPN structural information;
[2026-05-24 08:59:26] [INFO ] Parsed PT model containing 393 places and 344 transitions and 911 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Deduced a syphon composed of 13 places in 5 ms
Reduce places removed 13 places and 13 transitions.
FORMULA BusinessProcesses-PT-08-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 75 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 331/331 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 374 transition count 331
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 54 place count 326 transition count 283
Iterating global reduction 1 with 48 rules applied. Total rules applied 102 place count 326 transition count 283
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 103 place count 326 transition count 282
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 127 place count 302 transition count 258
Iterating global reduction 2 with 24 rules applied. Total rules applied 151 place count 302 transition count 258
Applied a total of 151 rules in 79 ms. Remains 302 /380 variables (removed 78) and now considering 258/331 (removed 73) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2296234530336709956.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2718002620714320383.kers'
[2026-05-24 08:59:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2296234530336709956.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2718002620714320383.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 258 rows 302 cols 733 entries
Finished phase 1 with 250 SingleSign rule and 0 generalized
[2026-05-24 08:59:26] [INFO ] Computed 52 invariants in 1 ms
Computed 52 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2718002620714320383.kers
Total runtime 2 ms.
[2026-05-24 08:59:26] [INFO ] Implicit Places using invariants in 338 ms returned []
[2026-05-24 08:59:26] [INFO ] Invariant cache hit.
[2026-05-24 08:59:27] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 866 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2026-05-24 08:59:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 3/302 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 7/99 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 5/104 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 258/560 variables, 302/406 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/560 variables, 10/416 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/560 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/560 variables, and 421 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 302/302 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 67/67 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 3/302 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 67/119 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 258/560 variables, 302/427 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/560 variables, 257/684 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/560 variables, 9/693 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/560 variables, 4/697 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/560 variables, and 697 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 302/302 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 86/86 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60108ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60120ms
Starting structural reductions in LTL mode, iteration 1 : 302/380 places, 258/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61095 ms. Remains : 302/380 places, 258/331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 258/258 transitions.
Applied a total of 0 rules in 5 ms. Remains 302 /302 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2026-05-24 09:00:27] [INFO ] Invariant cache hit.
[2026-05-24 09:00:27] [INFO ] Implicit Places using invariants in 167 ms returned []
[2026-05-24 09:00:27] [INFO ] Invariant cache hit.
[2026-05-24 09:00:28] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 582 ms. Remains : 302/302 places, 258/258 transitions.
Support contains 75 out of 302 places after structural reductions.
[2026-05-24 09:00:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-24 09:00:28] [INFO ] Flatten gal took : 43 ms
FORMULA BusinessProcesses-PT-08-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 09:00:28] [INFO ] Flatten gal took : 17 ms
[2026-05-24 09:00:28] [INFO ] Input system was already deterministic with 258 transitions.
Support contains 68 out of 302 places (down from 75) after GAL structural reductions.
RANDOM walk for 40000 steps (334 resets) in 1535 ms. (26 steps per ms) remains 11/45 properties
BEST_FIRST walk for 40002 steps (58 resets) in 172 ms. (231 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (72 resets) in 246 ms. (161 steps per ms) remains 5/10 properties
BEST_FIRST walk for 40004 steps (74 resets) in 112 ms. (354 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (53 resets) in 102 ms. (388 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (61 resets) in 89 ms. (444 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (58 resets) in 74 ms. (533 steps per ms) remains 4/4 properties
[2026-05-24 09:00:29] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 153/166 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 107/273 variables, 26/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 233/506 variables, 273/325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/506 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 40/546 variables, 18/343 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 12/558 variables, 10/353 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/558 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/560 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/560 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/560 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 560/560 variables, and 354 constraints, problems are : Problem set: 0 solved, 4 unsolved in 511 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 302/302 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 153/166 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 107/273 variables, 26/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 233/506 variables, 273/338 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/506 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/506 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/506 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/506 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 40/546 variables, 18/360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/546 variables, 3/363 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/546 variables, 4/367 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/546 variables, 0/367 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 12/558 variables, 10/377 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/558 variables, 0/377 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/560 variables, 1/378 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/560 variables, 0/378 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/560 variables, 0/378 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 560/560 variables, and 378 constraints, problems are : Problem set: 1 solved, 3 unsolved in 2313 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 302/302 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 2833ms problems are : Problem set: 1 solved, 3 unsolved
Parikh walk visited 2 properties in 771 ms.
Support contains 7 out of 302 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 302/302 places, 258/258 transitions.
Graph (trivial) has 158 edges and 302 vertex of which 6 / 302 are part of one of the 1 SCC in 13 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 616 edges and 297 vertex of which 294 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 294 transition count 206
Reduce places removed 43 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 44 rules applied. Total rules applied 89 place count 251 transition count 205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 250 transition count 205
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 52 Pre rules applied. Total rules applied 90 place count 250 transition count 153
Deduced a syphon composed of 52 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 115 rules applied. Total rules applied 205 place count 187 transition count 153
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 227 place count 165 transition count 131
Iterating global reduction 3 with 22 rules applied. Total rules applied 249 place count 165 transition count 131
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 249 place count 165 transition count 129
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 254 place count 162 transition count 129
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 143 rules applied. Total rules applied 397 place count 90 transition count 58
Applied a total of 397 rules in 51 ms. Remains 90 /302 variables (removed 212) and now considering 58/258 (removed 200) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 90/302 places, 58/258 transitions.
RANDOM walk for 40000 steps (1532 resets) in 570 ms. (70 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (526 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Probably explored full state space saw : 2113 states, properties seen :0
Probabilistic random walk after 9496 steps, saw 2113 distinct states, run finished after 35 ms. (steps per millisecond=271 ) properties seen :0
Explored full state space saw : 2113 states, properties seen :0
Exhaustive walk after 9496 steps, saw 2113 distinct states, run finished after 17 ms. (steps per millisecond=558 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA BusinessProcesses-PT-08-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 09:00:32] [INFO ] Flatten gal took : 13 ms
[2026-05-24 09:00:32] [INFO ] Flatten gal took : 13 ms
[2026-05-24 09:00:33] [INFO ] Input system was already deterministic with 258 transitions.
Computed a total of 104 stabilizing places and 98 stable transitions
Graph (complete) has 628 edges and 302 vertex of which 299 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 ms
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 258/258 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 300 transition count 258
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 28 place count 274 transition count 232
Iterating global reduction 1 with 26 rules applied. Total rules applied 54 place count 274 transition count 232
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 67 place count 261 transition count 219
Iterating global reduction 1 with 13 rules applied. Total rules applied 80 place count 261 transition count 219
Applied a total of 80 rules in 13 ms. Remains 261 /302 variables (removed 41) and now considering 219/258 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5864755772553422629.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18259055157829331072.kers'
[2026-05-24 09:00:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5864755772553422629.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18259055157829331072.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 219 rows 261 cols 653 entries
Finished phase 1 with 211 SingleSign rule and 0 generalized
[2026-05-24 09:00:33] [INFO ] Computed 50 invariants in 1 ms
Computed 50 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18259055157829331072.kers
Total runtime 2 ms.
[2026-05-24 09:00:33] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-24 09:00:33] [INFO ] Invariant cache hit.
[2026-05-24 09:00:33] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2026-05-24 09:00:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/261 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 219/480 variables, 261/333 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 6/339 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/480 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/480 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 480/480 variables, and 342 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/261 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 28/78 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/480 variables, 261/339 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 218/557 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 6/563 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 4/567 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 1/568 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
SMT process timed out in 60053ms, After SMT, problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 60055ms
Starting structural reductions in LTL mode, iteration 1 : 261/302 places, 219/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60494 ms. Remains : 261/302 places, 219/258 transitions.
[2026-05-24 09:01:33] [INFO ] Flatten gal took : 12 ms
[2026-05-24 09:01:33] [INFO ] Flatten gal took : 10 ms
[2026-05-24 09:01:33] [INFO ] Input system was already deterministic with 219 transitions.
[2026-05-24 09:01:33] [INFO ] Flatten gal took : 10 ms
[2026-05-24 09:01:33] [INFO ] Flatten gal took : 9 ms
[2026-05-24 09:01:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality13593721517844070983.gal : 5 ms
[2026-05-24 09:01:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality12000876384618794622.ctl : 3 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/CTLCardinality13593721517844070983.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12000876384618794622.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.17707e+17,7.47795,219356,2,43236,5,454885,6,0,1263,1.41594e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-24 09:02:03] [INFO ] Flatten gal took : 8 ms
[2026-05-24 09:02:03] [INFO ] Applying decomposition
[2026-05-24 09:02:03] [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/graph10347317992095980489.txt' '-o' '/tmp/graph10347317992095980489.bin' '-w' '/tmp/graph10347317992095980489.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10347317992095980489.bin' '-l' '-1' '-v' '-w' '/tmp/graph10347317992095980489.weights' '-q' '0' '-e' '0.001'
[2026-05-24 09:02:03] [INFO ] Decomposing Gal with order
[2026-05-24 09:02:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 09:02:03] [INFO ] Removed a total of 88 redundant transitions.
[2026-05-24 09:02:03] [INFO ] Flatten gal took : 66 ms
[2026-05-24 09:02:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 15 ms.
[2026-05-24 09:02:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality11708613912067808764.gal : 6 ms
[2026-05-24 09:02:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality7297382715180491031.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/CTLCardinality11708613912067808764.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7297382715180491031.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,2.17707e+17,1.0117,37460,4671,26,50751,361,544,132675,36,792,0


Converting to forward existential form...Done !
original formula: AX(EG(EX(EF(((i17.u53.p179==0)&&(i10.i1.u89.p382==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(EX(E(TRUE U ((i17.u53.p179==0)&&(i10.i1.u89.p382==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t108, t158, t191, t195, t198, t202, t204, t205, t209, t214, t216, t217, i0.u70.t42, i0.u71.t3...836
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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 0,1,6.91166,241740,1,0,451016,361,3769,794942,198,792,958809
FORMULA BusinessProcesses-PT-08-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 258/258 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 300 transition count 258
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 27 place count 275 transition count 233
Iterating global reduction 1 with 25 rules applied. Total rules applied 52 place count 275 transition count 233
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 65 place count 262 transition count 220
Iterating global reduction 1 with 13 rules applied. Total rules applied 78 place count 262 transition count 220
Applied a total of 78 rules in 13 ms. Remains 262 /302 variables (removed 40) and now considering 220/258 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6504287103271096924.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10413938039894440533.kers'
[2026-05-24 09:02:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6504287103271096924.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10413938039894440533.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 220 rows 262 cols 655 entries
Finished phase 1 with 212 SingleSign rule and 0 generalized
[2026-05-24 09:02:10] [INFO ] Computed 50 invariants in 1 ms
Computed 50 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10413938039894440533.kers
Total runtime 1 ms.
[2026-05-24 09:02:11] [INFO ] Implicit Places using invariants in 121 ms returned []
[2026-05-24 09:02:11] [INFO ] Invariant cache hit.
[2026-05-24 09:02:11] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2026-05-24 09:02:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/262 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 220/482 variables, 262/333 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 6/339 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/482 variables, and 343 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/262 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 27/77 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 220/482 variables, 262/340 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 219/559 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 2/561 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 2/563 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 3/566 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 4/570 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 570 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60053ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 60054ms
Starting structural reductions in LTL mode, iteration 1 : 262/302 places, 220/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60545 ms. Remains : 262/302 places, 220/258 transitions.
[2026-05-24 09:03:11] [INFO ] Flatten gal took : 9 ms
[2026-05-24 09:03:11] [INFO ] Flatten gal took : 18 ms
[2026-05-24 09:03:11] [INFO ] Input system was already deterministic with 220 transitions.
[2026-05-24 09:03:11] [INFO ] Flatten gal took : 6 ms
[2026-05-24 09:03:11] [INFO ] Flatten gal took : 6 ms
[2026-05-24 09:03:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality6110829581803753201.gal : 2 ms
[2026-05-24 09:03:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality12031154086544522662.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/CTLCardinality6110829581803753201.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12031154086544522662.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.34258e+17,8.15829,250824,2,50335,5,501926,6,0,1268,1.62982e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-24 09:03:41] [INFO ] Flatten gal took : 22 ms
[2026-05-24 09:03:41] [INFO ] Applying decomposition
[2026-05-24 09:03:41] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6306793746949825622.txt' '-o' '/tmp/graph6306793746949825622.bin' '-w' '/tmp/graph6306793746949825622.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6306793746949825622.bin' '-l' '-1' '-v' '-w' '/tmp/graph6306793746949825622.weights' '-q' '0' '-e' '0.001'
[2026-05-24 09:03:41] [INFO ] Decomposing Gal with order
[2026-05-24 09:03:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 09:03:41] [INFO ] Removed a total of 85 redundant transitions.
[2026-05-24 09:03:41] [INFO ] Flatten gal took : 15 ms
[2026-05-24 09:03:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 5 ms.
[2026-05-24 09:03:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality4401287401714710158.gal : 4 ms
[2026-05-24 09:03:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality8659804549523886802.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/CTLCardinality4401287401714710158.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8659804549523886802.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.34258e+17,3.18092,89932,7829,27,117773,446,533,321727,43,879,0


Converting to forward existential form...Done !
original formula: EG(EF(((i18.i0.u25.p76==1) + AX(((i3.i1.u92.p349==0)&&(i13.i0.u72.p264==1))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((i18.i0.u25.p76==1) + !(EX(!(((i3.i1.u92.p349==0)&&(i13.i0.u72.p264==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t107, t159, t192, t200, t203, t207, t210, t215, t217, t218, i0.i0.u41.t100, i0.i1.u39.t103, i...833
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 302/302 places, 258/258 transitions.
Graph (trivial) has 169 edges and 302 vertex of which 6 / 302 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 621 edges and 297 vertex of which 294 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 293 transition count 202
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 98 place count 245 transition count 202
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 98 place count 245 transition count 148
Deduced a syphon composed of 54 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 119 rules applied. Total rules applied 217 place count 180 transition count 148
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 243 place count 154 transition count 122
Iterating global reduction 2 with 26 rules applied. Total rules applied 269 place count 154 transition count 122
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 269 place count 154 transition count 119
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 276 place count 150 transition count 119
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 418 place count 78 transition count 49
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 420 place count 77 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 421 place count 76 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 422 place count 75 transition count 47
Applied a total of 422 rules in 48 ms. Remains 75 /302 variables (removed 227) and now considering 47/258 (removed 211) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15278474371286230086.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6756941854114702048.kers'
[2026-05-24 09:04:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15278474371286230086.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6756941854114702048.kers]
Normalized transition count is 46 out of 47 initially.
Culling duplicate invariants (modulo rational): removing 35 columns.
Culled 35 columns in 0 ms.
// Phase 1: matrix 46 rows 40 cols 133 entries
Finished phase 1 with 40 SingleSign rule and 0 generalized
[2026-05-24 09:04:11] [INFO ] Computed 35 invariants in 0 ms
Computed 35 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6756941854114702048.kers
Total runtime 0 ms.
[2026-05-24 09:04:11] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-24 09:04:11] [INFO ] Invariant cache hit.
[2026-05-24 09:04:11] [INFO ] Implicit Places using invariants and state equation in 109 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 17, 19, 20, 21, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 156 ms to find 38 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 37/302 places, 47/258 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 37 transition count 41
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 31 transition count 41
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 25 transition count 35
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 25 transition count 35
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 2 with 3 rules applied. Total rules applied 27 place count 25 transition count 32
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 30 place count 22 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 31 place count 22 transition count 31
Applied a total of 31 rules in 5 ms. Remains 22 /37 variables (removed 15) and now considering 31/47 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-230669967181749702.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3571047407139678765.kers'
[2026-05-24 09:04:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-230669967181749702.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3571047407139678765.kers]
Normalized transition count is 30 out of 31 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 30 rows 22 cols 73 entries
Finished phase 1 with 22 SingleSign rule and 0 generalized
[2026-05-24 09:04:11] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3571047407139678765.kers
Total runtime 0 ms.
[2026-05-24 09:04:11] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-24 09:04:11] [INFO ] Invariant cache hit.
[2026-05-24 09:04:11] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 22/302 places, 31/258 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 255 ms. Remains : 22/302 places, 31/258 transitions.
[2026-05-24 09:04:11] [INFO ] Flatten gal took : 2 ms
[2026-05-24 09:04:11] [INFO ] Flatten gal took : 1 ms
[2026-05-24 09:04:11] [INFO ] Input system was already deterministic with 31 transitions.
[2026-05-24 09:04:11] [INFO ] Flatten gal took : 1 ms
[2026-05-24 09:04:11] [INFO ] Flatten gal took : 1 ms
[2026-05-24 09:04:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality686550477471387816.gal : 0 ms
[2026-05-24 09:04:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3631796330136907420.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality686550477471387816.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3631796330136907420.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 3252 steps (1048 resets) in 19 ms. (162 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-08-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.

java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 258/258 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 300 transition count 258
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 26 place count 276 transition count 234
Iterating global reduction 1 with 24 rules applied. Total rules applied 50 place count 276 transition count 234
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 63 place count 263 transition count 221
Iterating global reduction 1 with 13 rules applied. Total rules applied 76 place count 263 transition count 221
Applied a total of 76 rules in 12 ms. Remains 263 /302 variables (removed 39) and now considering 221/258 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6981689418178746121.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2996674851341748429.kers'
[2026-05-24 09:04:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6981689418178746121.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2996674851341748429.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 221 rows 263 cols 657 entries
Finished phase 1 with 213 SingleSign rule and 0 generalized
[2026-05-24 09:04:12] [INFO ] Computed 50 invariants in 1 ms
Computed 50 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2996674851341748429.kers
Total runtime 1 ms.
[2026-05-24 09:04:12] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-24 09:04:12] [INFO ] Invariant cache hit.
[2026-05-24 09:04:12] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2026-05-24 09:04:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 8/78 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 221/484 variables, 263/341 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 7/348 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 2/350 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 2/352 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 484/484 variables, and 352 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 35/85 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 221/484 variables, 263/349 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 220/569 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 8/577 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 2/579 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/484 variables, 3/582 constraints. Problems are: Problem set: 0 solved, 220 unsolved
SMT process timed out in 60042ms, After SMT, problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 60043ms
Starting structural reductions in LTL mode, iteration 1 : 263/302 places, 221/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60519 ms. Remains : 263/302 places, 221/258 transitions.
[2026-05-24 09:05:12] [INFO ] Flatten gal took : 8 ms
[2026-05-24 09:05:12] [INFO ] Flatten gal took : 6 ms
[2026-05-24 09:05:12] [INFO ] Input system was already deterministic with 221 transitions.
[2026-05-24 09:05:12] [INFO ] Flatten gal took : 6 ms
[2026-05-24 09:05:12] [INFO ] Flatten gal took : 5 ms
[2026-05-24 09:05:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality3145997458880529101.gal : 1 ms
[2026-05-24 09:05:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality2778747286512721481.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/CTLCardinality3145997458880529101.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2778747286512721481.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.34314e+17,11.7205,347720,2,53576,5,646114,6,0,1273,2.32599e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-24 09:05:42] [INFO ] Flatten gal took : 5 ms
[2026-05-24 09:05:42] [INFO ] Applying decomposition
[2026-05-24 09:05:42] [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/graph6950144764646804416.txt' '-o' '/tmp/graph6950144764646804416.bin' '-w' '/tmp/graph6950144764646804416.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6950144764646804416.bin' '-l' '-1' '-v' '-w' '/tmp/graph6950144764646804416.weights' '-q' '0' '-e' '0.001'
[2026-05-24 09:05:42] [INFO ] Decomposing Gal with order
[2026-05-24 09:05:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 09:05:42] [INFO ] Removed a total of 89 redundant transitions.
[2026-05-24 09:05:42] [INFO ] Flatten gal took : 26 ms
[2026-05-24 09:05:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 5 ms.
[2026-05-24 09:05:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality1269479202531098615.gal : 3 ms
[2026-05-24 09:05:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality11175825182153701907.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/CTLCardinality1269479202531098615.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11175825182153701907.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,2.34314e+17,2.17346,66356,7259,27,78245,309,578,257432,38,670,0


Converting to forward existential form...Done !
original formula: E(AF(AG(AF(((i2.u4.p9==0)||(i10.i0.u33.p112==1))))) U ((EF(EG(AG((i0.i2.u77.p288==1)))) + AG(AF(AX(((i3.i1.u67.p240==0)||(i6.u82.p324==1)...330
=> equivalent forward existential formula: (([FwdG(FwdU(FwdU(Init,!(EG(!(!(E(TRUE U !(!(EG(!(((i2.u4.p9==0)||(i10.i0.u33.p112==1)))))))))))),TRUE),!(E(TRUE...841
Reverse transition relation is NOT exact ! Due to transitions t108, t160, t192, t197, t200, t204, t207, t208, t211, t216, t218, t219, i0.i0.u75.t32, i0.i1....879
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 1
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 258/258 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 301 transition count 258
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 25 place count 277 transition count 234
Iterating global reduction 1 with 24 rules applied. Total rules applied 49 place count 277 transition count 234
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 61 place count 265 transition count 222
Iterating global reduction 1 with 12 rules applied. Total rules applied 73 place count 265 transition count 222
Applied a total of 73 rules in 18 ms. Remains 265 /302 variables (removed 37) and now considering 222/258 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16293631123740267588.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15226290525080429129.kers'
[2026-05-24 09:06:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16293631123740267588.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15226290525080429129.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 222 rows 265 cols 660 entries
Finished phase 1 with 214 SingleSign rule and 0 generalized
[2026-05-24 09:06:12] [INFO ] Computed 51 invariants in 1 ms
Computed 51 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15226290525080429129.kers
Total runtime 2 ms.
[2026-05-24 09:06:12] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-24 09:06:12] [INFO ] Invariant cache hit.
[2026-05-24 09:06:13] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2026-05-24 09:06:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 2/265 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 222/487 variables, 265/341 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 5/346 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 3/350 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 487/487 variables, and 350 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 2/265 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 30/81 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 222/487 variables, 265/346 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/487 variables, 221/567 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 6/573 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 3/576 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 487/487 variables, and 584 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 0/4 constraints]
After SMT, in 60065ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 60066ms
Starting structural reductions in LTL mode, iteration 1 : 265/302 places, 222/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60587 ms. Remains : 265/302 places, 222/258 transitions.
[2026-05-24 09:07:13] [INFO ] Flatten gal took : 5 ms
[2026-05-24 09:07:13] [INFO ] Flatten gal took : 4 ms
[2026-05-24 09:07:13] [INFO ] Input system was already deterministic with 222 transitions.
[2026-05-24 09:07:13] [INFO ] Flatten gal took : 4 ms
[2026-05-24 09:07:13] [INFO ] Flatten gal took : 4 ms
[2026-05-24 09:07:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality351286647283292539.gal : 2 ms
[2026-05-24 09:07:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality15409921701922143445.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/CTLCardinality351286647283292539.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15409921701922143445.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.34258e+17,9.25872,262004,2,53595,5,509772,6,0,1279,1.67994e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-24 09:07:43] [INFO ] Flatten gal took : 10 ms
[2026-05-24 09:07:43] [INFO ] Applying decomposition
[2026-05-24 09:07:43] [INFO ] Flatten gal took : 4 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/graph15320672883007991001.txt' '-o' '/tmp/graph15320672883007991001.bin' '-w' '/tmp/graph15320672883007991001.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15320672883007991001.bin' '-l' '-1' '-v' '-w' '/tmp/graph15320672883007991001.weights' '-q' '0' '-e' '0.001'
[2026-05-24 09:07:43] [INFO ] Decomposing Gal with order
[2026-05-24 09:07:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 09:07:43] [INFO ] Removed a total of 88 redundant transitions.
[2026-05-24 09:07:43] [INFO ] Flatten gal took : 10 ms
[2026-05-24 09:07:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 4 ms.
[2026-05-24 09:07:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality10836374709863669565.gal : 3 ms
[2026-05-24 09:07:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality9299126336540851319.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/CTLCardinality10836374709863669565.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9299126336540851319.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,2.34258e+17,0.631935,27428,4417,24,40468,403,536,83225,38,834,0


Converting to forward existential form...Done !
original formula: AG((EG(((EX((i16.i1.u56.p195==1)) + (i6.u15.p46==0)) + ((i0.i0.u37.p134==0)||((i7.u28.p98==0)&&(i5.u23.p76==1))))) + EF((((i12.u19.p63==0...198
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(E(TRUE U (((i12.u19.p63==0)&&(u32.p108==1))||(i18.i1.u89.p374==0))))) * !(EG(((EX((i16.i1...261
Reverse transition relation is NOT exact ! Due to transitions t109, t161, t194, t198, t201, t205, t207, t208, t212, t217, t219, t220, i0.i0.u40.t102, i0.i1...859
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 258/258 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 300 transition count 258
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 26 place count 276 transition count 234
Iterating global reduction 1 with 24 rules applied. Total rules applied 50 place count 276 transition count 234
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 63 place count 263 transition count 221
Iterating global reduction 1 with 13 rules applied. Total rules applied 76 place count 263 transition count 221
Applied a total of 76 rules in 14 ms. Remains 263 /302 variables (removed 39) and now considering 221/258 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10819026340855926587.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16165894653959351586.kers'
[2026-05-24 09:08:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10819026340855926587.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16165894653959351586.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 221 rows 263 cols 657 entries
Finished phase 1 with 213 SingleSign rule and 0 generalized
[2026-05-24 09:08:13] [INFO ] Computed 50 invariants in 2 ms
Computed 50 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16165894653959351586.kers
Total runtime 3 ms.
[2026-05-24 09:08:13] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-24 09:08:13] [INFO ] Invariant cache hit.
[2026-05-24 09:08:13] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2026-05-24 09:08:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 221/484 variables, 263/340 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 5/345 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/484 variables, 4/350 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/484 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 484/484 variables, and 350 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 32/82 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 221/484 variables, 263/345 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 220/565 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 3/568 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 4/572 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 3/575 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/484 variables, 5/580 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 484/484 variables, and 580 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 60042ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 60046ms
Starting structural reductions in LTL mode, iteration 1 : 263/302 places, 221/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60412 ms. Remains : 263/302 places, 221/258 transitions.
[2026-05-24 09:09:14] [INFO ] Flatten gal took : 3 ms
[2026-05-24 09:09:14] [INFO ] Flatten gal took : 7 ms
[2026-05-24 09:09:14] [INFO ] Input system was already deterministic with 221 transitions.
[2026-05-24 09:09:14] [INFO ] Flatten gal took : 3 ms
[2026-05-24 09:09:14] [INFO ] Flatten gal took : 4 ms
[2026-05-24 09:09:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality4563960632475596185.gal : 2 ms
[2026-05-24 09:09:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality1695640205041768103.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/CTLCardinality4563960632475596185.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1695640205041768103.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.18881e+17,7.93888,239968,2,48938,5,482417,6,0,1273,1.55238e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-24 09:09:44] [INFO ] Flatten gal took : 11 ms
[2026-05-24 09:09:44] [INFO ] Applying decomposition
[2026-05-24 09:09:44] [INFO ] Flatten gal took : 4 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/graph2387461498413971885.txt' '-o' '/tmp/graph2387461498413971885.bin' '-w' '/tmp/graph2387461498413971885.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2387461498413971885.bin' '-l' '-1' '-v' '-w' '/tmp/graph2387461498413971885.weights' '-q' '0' '-e' '0.001'
[2026-05-24 09:09:44] [INFO ] Decomposing Gal with order
[2026-05-24 09:09:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 09:09:44] [INFO ] Removed a total of 88 redundant transitions.
[2026-05-24 09:09:44] [INFO ] Flatten gal took : 9 ms
[2026-05-24 09:09:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 4 ms.
[2026-05-24 09:09:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality1713336364740082988.gal : 3 ms
[2026-05-24 09:09:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality7262454020049248577.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/CTLCardinality1713336364740082988.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7262454020049248577.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.18881e+17,0.709042,29044,4563,24,37388,351,581,96240,38,776,0


Converting to forward existential form...Done !
original formula: ((E(AF(((i14.i0.u55.p192==0)||(i11.u62.p222==1))) U AF((i3.i1.u23.p64==1))) * EF((((i16.u81.p319==0) + ((EX((i12.i1.u59.p206==0)) * !(E((...339
=> equivalent forward existential formula: [(EY((Init * (E(!(EG(!(((i14.i0.u55.p192==0)||(i11.u62.p222==1))))) U !(EG(!((i3.i1.u23.p64==1))))) * E(TRUE U (...402
Reverse transition relation is NOT exact ! Due to transitions t109, t193, t197, t200, t206, t207, t216, t218, t219, i0.i0.u75.t30, i0.i1.u41.t102, i0.i2.u3...859
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 a local SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 258/258 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 300 transition count 258
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 25 place count 277 transition count 235
Iterating global reduction 1 with 23 rules applied. Total rules applied 48 place count 277 transition count 235
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 60 place count 265 transition count 223
Iterating global reduction 1 with 12 rules applied. Total rules applied 72 place count 265 transition count 223
Applied a total of 72 rules in 11 ms. Remains 265 /302 variables (removed 37) and now considering 223/258 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7006189278479457119.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17154446772242618377.kers'
[2026-05-24 09:10:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7006189278479457119.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17154446772242618377.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 223 rows 265 cols 661 entries
Finished phase 1 with 215 SingleSign rule and 0 generalized
[2026-05-24 09:10:14] [INFO ] Computed 50 invariants in 1 ms
Computed 50 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17154446772242618377.kers
Total runtime 2 ms.
[2026-05-24 09:10:14] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-24 09:10:14] [INFO ] Invariant cache hit.
[2026-05-24 09:10:14] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2026-05-24 09:10:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (OVERLAPS) 223/488 variables, 265/340 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 6/346 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 3/349 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 10 (OVERLAPS) 0/488 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 349 constraints, problems are : Problem set: 0 solved, 222 unsolved in 29866 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 31/81 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 223/488 variables, 265/347 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 222/569 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 8/577 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 3/580 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 4/584 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 586 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 0/3 constraints]
After SMT, in 59894ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 59895ms
Starting structural reductions in LTL mode, iteration 1 : 265/302 places, 223/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60350 ms. Remains : 265/302 places, 223/258 transitions.
[2026-05-24 09:11:14] [INFO ] Flatten gal took : 3 ms
[2026-05-24 09:11:14] [INFO ] Flatten gal took : 4 ms
[2026-05-24 09:11:14] [INFO ] Input system was already deterministic with 223 transitions.
[2026-05-24 09:11:14] [INFO ] Flatten gal took : 5 ms
[2026-05-24 09:11:14] [INFO ] Flatten gal took : 3 ms
[2026-05-24 09:11:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality10766902401708059086.gal : 1 ms
[2026-05-24 09:11:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality5139278586861334324.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/CTLCardinality10766902401708059086.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5139278586861334324.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.19665e+17,7.27299,228500,2,45756,5,478342,6,0,1283,1.46987e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-24 09:11:44] [INFO ] Flatten gal took : 8 ms
[2026-05-24 09:11:44] [INFO ] Applying decomposition
[2026-05-24 09:11:44] [INFO ] Flatten gal took : 3 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/graph9803992712763145523.txt' '-o' '/tmp/graph9803992712763145523.bin' '-w' '/tmp/graph9803992712763145523.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9803992712763145523.bin' '-l' '-1' '-v' '-w' '/tmp/graph9803992712763145523.weights' '-q' '0' '-e' '0.001'
[2026-05-24 09:11:44] [INFO ] Decomposing Gal with order
[2026-05-24 09:11:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 09:11:44] [INFO ] Removed a total of 86 redundant transitions.
[2026-05-24 09:11:44] [INFO ] Flatten gal took : 10 ms
[2026-05-24 09:11:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2026-05-24 09:11:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality13411326965688862011.gal : 3 ms
[2026-05-24 09:11:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality15288962112443447542.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/CTLCardinality13411326965688862011.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15288962112443447542.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 -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.19665e+17,3.75886,112968,6156,27,158160,369,547,414927,41,834,0


Converting to forward existential form...Done !
original formula: AG((EG((i18.u50.p166==1)) + (AF((EX((i4.i0.u81.p323==0)) + ((i18.u51.p172==0)&&(i9.u22.p68==1)))) * ((EF((AX(((i8.u19.p56==0)||(i1.u40.p1...299
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * !(EG((i18.u50.p166==1)))),!((EX((i4.i0.u81.p323==0)) + ((i18.u51.p172==0)&&(i9.u22.p68...450
Reverse transition relation is NOT exact ! Due to transitions t109, t162, t195, t199, t206, t208, t209, t210, t213, t220, t221, i0.i0.u74.t34, i0.i0.u75.t3...856
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
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,0,14.7113,449856,1,0,815333,369,3613,1.47938e+06,205,834,1709658
FORMULA BusinessProcesses-PT-08-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 302/302 places, 258/258 transitions.
Graph (trivial) has 166 edges and 302 vertex of which 6 / 302 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 621 edges and 297 vertex of which 294 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 293 transition count 203
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 96 place count 246 transition count 203
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 53 Pre rules applied. Total rules applied 96 place count 246 transition count 150
Deduced a syphon composed of 53 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 117 rules applied. Total rules applied 213 place count 182 transition count 150
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 237 place count 158 transition count 126
Iterating global reduction 2 with 24 rules applied. Total rules applied 261 place count 158 transition count 126
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 261 place count 158 transition count 123
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 268 place count 154 transition count 123
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 412 place count 81 transition count 52
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 414 place count 80 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 415 place count 79 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 416 place count 78 transition count 50
Applied a total of 416 rules in 24 ms. Remains 78 /302 variables (removed 224) and now considering 50/258 (removed 208) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12652014714038533448.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6510108337136475338.kers'
[2026-05-24 09:11:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12652014714038533448.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6510108337136475338.kers]
Normalized transition count is 49 out of 50 initially.
Culling duplicate invariants (modulo rational): removing 34 columns.
Culled 34 columns in 0 ms.
// Phase 1: matrix 49 rows 44 cols 141 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-24 09:11:59] [INFO ] Computed 35 invariants in 0 ms
Computed 35 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6510108337136475338.kers
Total runtime 0 ms.
[2026-05-24 09:11:59] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-24 09:11:59] [INFO ] Invariant cache hit.
[2026-05-24 09:11:59] [INFO ] Implicit Places using invariants and state equation in 107 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 17, 19, 20, 21, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 47, 49, 51, 53, 55, 57, 59]
Discarding 37 places :
Implicit Place search using SMT with State Equation took 162 ms to find 37 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 41/302 places, 50/258 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 41 transition count 44
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 35 transition count 44
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 29 transition count 38
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 29 transition count 38
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 2 with 3 rules applied. Total rules applied 27 place count 29 transition count 35
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 30 place count 26 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 31 place count 26 transition count 34
Applied a total of 31 rules in 4 ms. Remains 26 /41 variables (removed 15) and now considering 34/50 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16737045746041427291.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9544618024750585743.kers'
[2026-05-24 09:11:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16737045746041427291.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9544618024750585743.kers]
Normalized transition count is 33 out of 34 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 33 rows 26 cols 83 entries
Finished phase 1 with 25 SingleSign rule and 0 generalized
[2026-05-24 09:11:59] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9544618024750585743.kers
Total runtime 0 ms.
[2026-05-24 09:11:59] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-24 09:11:59] [INFO ] Invariant cache hit.
[2026-05-24 09:11:59] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 26/302 places, 34/258 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 262 ms. Remains : 26/302 places, 34/258 transitions.
[2026-05-24 09:11:59] [INFO ] Flatten gal took : 1 ms
[2026-05-24 09:11:59] [INFO ] Flatten gal took : 0 ms
[2026-05-24 09:11:59] [INFO ] Input system was already deterministic with 34 transitions.
[2026-05-24 09:11:59] [INFO ] Flatten gal took : 0 ms
[2026-05-24 09:11:59] [INFO ] Flatten gal took : 0 ms
[2026-05-24 09:11:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality3732420611503252831.gal : 0 ms
[2026-05-24 09:11:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality4483697291372864871.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/CTLCardinality3732420611503252831.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4483697291372864871.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,76,0.006997,4100,2,77,5,670,6,0,138,644,0


Converting to forward existential form...Done !
original formula: AG(EF(((p321==0)||(p250==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p321==0)||(p250==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t5, t20, t29, t30, t32, Intersection with reachable at each step enabled. (destr...195
(forward)formula 0,1,0.016013,4404,1,0,57,2134,88,34,817,1932,80
FORMULA BusinessProcesses-PT-08-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 258/258 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 300 transition count 258
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 26 place count 276 transition count 234
Iterating global reduction 1 with 24 rules applied. Total rules applied 50 place count 276 transition count 234
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 63 place count 263 transition count 221
Iterating global reduction 1 with 13 rules applied. Total rules applied 76 place count 263 transition count 221
Applied a total of 76 rules in 16 ms. Remains 263 /302 variables (removed 39) and now considering 221/258 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6992437709497764239.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-460076446370262528.kers'
[2026-05-24 09:11:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6992437709497764239.kers, --Pflows, --basisKERS=/tmp/petrispot-output-460076446370262528.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 221 rows 263 cols 657 entries
Finished phase 1 with 213 SingleSign rule and 0 generalized
[2026-05-24 09:11:59] [INFO ] Computed 50 invariants in 1 ms
Computed 50 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-460076446370262528.kers
Total runtime 1 ms.
[2026-05-24 09:11:59] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-24 09:11:59] [INFO ] Invariant cache hit.
[2026-05-24 09:12:00] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2026-05-24 09:12:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 221/484 variables, 263/337 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 5/342 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 5/348 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/484 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 484/484 variables, and 348 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 29/79 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 221/484 variables, 263/343 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 220/563 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 6/569 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 3/572 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/484 variables, 2/574 constraints. Problems are: Problem set: 0 solved, 220 unsolved
SMT process timed out in 60038ms, After SMT, problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 60039ms
Starting structural reductions in LTL mode, iteration 1 : 263/302 places, 221/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60535 ms. Remains : 263/302 places, 221/258 transitions.
[2026-05-24 09:13:00] [INFO ] Flatten gal took : 7 ms
[2026-05-24 09:13:00] [INFO ] Flatten gal took : 4 ms
[2026-05-24 09:13:00] [INFO ] Input system was already deterministic with 221 transitions.
[2026-05-24 09:13:00] [INFO ] Flatten gal took : 3 ms
[2026-05-24 09:13:00] [INFO ] Flatten gal took : 4 ms
[2026-05-24 09:13:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality927631641999362531.gal : 1 ms
[2026-05-24 09:13:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality17698515549667685375.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/CTLCardinality927631641999362531.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17698515549667685375.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.17911e+17,11.9035,340088,2,50179,5,629192,6,0,1273,2.29083e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-24 09:13:30] [INFO ] Flatten gal took : 3 ms
[2026-05-24 09:13:30] [INFO ] Applying decomposition
[2026-05-24 09:13:30] [INFO ] Flatten gal took : 3 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/graph431456610717496488.txt' '-o' '/tmp/graph431456610717496488.bin' '-w' '/tmp/graph431456610717496488.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph431456610717496488.bin' '-l' '-1' '-v' '-w' '/tmp/graph431456610717496488.weights' '-q' '0' '-e' '0.001'
[2026-05-24 09:13:30] [INFO ] Decomposing Gal with order
[2026-05-24 09:13:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 09:13:30] [INFO ] Removed a total of 87 redundant transitions.
[2026-05-24 09:13:30] [INFO ] Flatten gal took : 11 ms
[2026-05-24 09:13:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 3 ms.
[2026-05-24 09:13:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality9395643718235876079.gal : 2 ms
[2026-05-24 09:13:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality7680614660643591014.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/CTLCardinality9395643718235876079.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7680614660643591014.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 258/258 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 300 transition count 258
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 28 place count 274 transition count 232
Iterating global reduction 1 with 26 rules applied. Total rules applied 54 place count 274 transition count 232
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 67 place count 261 transition count 219
Iterating global reduction 1 with 13 rules applied. Total rules applied 80 place count 261 transition count 219
Applied a total of 80 rules in 10 ms. Remains 261 /302 variables (removed 41) and now considering 219/258 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16211853435767588766.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17020333141051189049.kers'
[2026-05-24 09:14:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16211853435767588766.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17020333141051189049.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 219 rows 261 cols 653 entries
Finished phase 1 with 211 SingleSign rule and 0 generalized
[2026-05-24 09:14:00] [INFO ] Computed 50 invariants in 1 ms
Computed 50 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17020333141051189049.kers
Total runtime 2 ms.
[2026-05-24 09:14:00] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-24 09:14:00] [INFO ] Invariant cache hit.
[2026-05-24 09:14:00] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2026-05-24 09:14:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/261 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/480 variables, 261/333 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 6/339 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/480 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (OVERLAPS) 0/480 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 342 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/261 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 28/78 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/480 variables, 261/339 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 218/557 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 7/564 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 3/567 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 4/571 constraints. Problems are: Problem set: 0 solved, 218 unsolved
SMT process timed out in 60043ms, After SMT, problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 60044ms
Starting structural reductions in LTL mode, iteration 1 : 261/302 places, 219/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60402 ms. Remains : 261/302 places, 219/258 transitions.
[2026-05-24 09:15:00] [INFO ] Flatten gal took : 4 ms
[2026-05-24 09:15:00] [INFO ] Flatten gal took : 2 ms
[2026-05-24 09:15:00] [INFO ] Input system was already deterministic with 219 transitions.
[2026-05-24 09:15:00] [INFO ] Flatten gal took : 3 ms
[2026-05-24 09:15:01] [INFO ] Flatten gal took : 2 ms
[2026-05-24 09:15:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality279558838231802698.gal : 1 ms
[2026-05-24 09:15:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality1810349194367008363.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/CTLCardinality279558838231802698.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1810349194367008363.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,2.21439e+17,7.36861,223624,2,47400,5,468047,6,0,1263,1.40628e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-24 09:15:31] [INFO ] Flatten gal took : 7 ms
[2026-05-24 09:15:31] [INFO ] Applying decomposition
[2026-05-24 09:15:31] [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/graph15277127921842639347.txt' '-o' '/tmp/graph15277127921842639347.bin' '-w' '/tmp/graph15277127921842639347.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15277127921842639347.bin' '-l' '-1' '-v' '-w' '/tmp/graph15277127921842639347.weights' '-q' '0' '-e' '0.001'
[2026-05-24 09:15:31] [INFO ] Decomposing Gal with order
[2026-05-24 09:15:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 09:15:31] [INFO ] Removed a total of 87 redundant transitions.
[2026-05-24 09:15:31] [INFO ] Flatten gal took : 10 ms
[2026-05-24 09:15:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 1 ms.
[2026-05-24 09:15:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality4495717662760827927.gal : 2 ms
[2026-05-24 09:15:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality17046300982438396780.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/CTLCardinality4495717662760827927.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17046300982438396780.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,2.21439e+17,7.96096,218228,11485,33,273929,308,540,912045,41,740,0


Converting to forward existential form...Done !
original formula: EF((AX(((i11.i0.u33.p115==1) * EG((i17.u49.p167==0)))) * (AG((i7.u18.p54==1)) + EX((i7.u80.p326==1)))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EX(!(((i11.i0.u33.p115==1) * EG((i17.u49.p167==0))))))) * !(E(TRUE U !((i7.u18.p54==1)))...283
Reverse transition relation is NOT exact ! Due to transitions t158, t191, t195, t199, t202, t204, t205, t209, t214, t216, t217, i0.u71.t35, i0.u72.t32, i1....878
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 302/302 places, 258/258 transitions.
Graph (trivial) has 167 edges and 302 vertex of which 6 / 302 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 621 edges and 297 vertex of which 294 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 293 transition count 203
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 96 place count 246 transition count 203
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 96 place count 246 transition count 148
Deduced a syphon composed of 55 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 121 rules applied. Total rules applied 217 place count 180 transition count 148
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 243 place count 154 transition count 122
Iterating global reduction 2 with 26 rules applied. Total rules applied 269 place count 154 transition count 122
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 269 place count 154 transition count 120
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 274 place count 151 transition count 120
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 141 rules applied. Total rules applied 415 place count 80 transition count 50
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 417 place count 79 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 418 place count 78 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 419 place count 77 transition count 48
Applied a total of 419 rules in 23 ms. Remains 77 /302 variables (removed 225) and now considering 48/258 (removed 210) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7316319394197716185.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17099706242495145905.kers'
[2026-05-24 09:16:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7316319394197716185.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17099706242495145905.kers]
Normalized transition count is 47 out of 48 initially.
Culling duplicate invariants (modulo rational): removing 35 columns.
Culled 35 columns in 0 ms.
// Phase 1: matrix 47 rows 42 cols 139 entries
Finished phase 1 with 41 SingleSign rule and 0 generalized
[2026-05-24 09:16:01] [INFO ] Computed 36 invariants in 0 ms
Computed 36 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17099706242495145905.kers
Total runtime 0 ms.
[2026-05-24 09:16:01] [INFO ] Implicit Places using invariants in 49 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 76/302 places, 48/258 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 75 ms. Remains : 76/302 places, 48/258 transitions.
[2026-05-24 09:16:01] [INFO ] Flatten gal took : 1 ms
[2026-05-24 09:16:01] [INFO ] Flatten gal took : 1 ms
[2026-05-24 09:16:01] [INFO ] Input system was already deterministic with 48 transitions.
[2026-05-24 09:16:01] [INFO ] Flatten gal took : 1 ms
[2026-05-24 09:16:01] [INFO ] Flatten gal took : 1 ms
[2026-05-24 09:16:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality5852643418334886405.gal : 1 ms
[2026-05-24 09:16:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality318078695159914612.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/CTLCardinality5852643418334886405.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality318078695159914612.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,67,0.019017,4552,2,253,5,1832,6,0,349,1887,0


Converting to forward existential form...Done !
original formula: EF(EG((p27==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p27==1))] != FALSE
Hit Full ! (commute/partial/dont) 46/0/2
(forward)formula 0,0,0.039104,5348,1,0,8,5305,19,2,1821,1964,8
FORMULA BusinessProcesses-PT-08-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 302/302 places, 258/258 transitions.
Graph (trivial) has 168 edges and 302 vertex of which 6 / 302 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 621 edges and 297 vertex of which 294 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 293 transition count 203
Reduce places removed 47 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 246 transition count 202
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 245 transition count 202
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 53 Pre rules applied. Total rules applied 98 place count 245 transition count 149
Deduced a syphon composed of 53 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 214 place count 182 transition count 149
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 240 place count 156 transition count 123
Iterating global reduction 3 with 26 rules applied. Total rules applied 266 place count 156 transition count 123
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 266 place count 156 transition count 120
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 273 place count 152 transition count 120
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 415 place count 80 transition count 50
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 3 with 2 rules applied. Total rules applied 417 place count 79 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 418 place count 78 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 419 place count 77 transition count 48
Applied a total of 419 rules in 24 ms. Remains 77 /302 variables (removed 225) and now considering 48/258 (removed 210) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10617559435041450325.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11603890778201928034.kers'
[2026-05-24 09:16:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10617559435041450325.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11603890778201928034.kers]
Normalized transition count is 47 out of 48 initially.
Culling duplicate invariants (modulo rational): removing 35 columns.
Culled 35 columns in 0 ms.
// Phase 1: matrix 47 rows 42 cols 137 entries
Finished phase 1 with 41 SingleSign rule and 0 generalized
[2026-05-24 09:16:01] [INFO ] Computed 36 invariants in 0 ms
Computed 36 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11603890778201928034.kers
Total runtime 0 ms.
[2026-05-24 09:16:01] [INFO ] Implicit Places using invariants in 50 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 76/302 places, 48/258 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 86 ms. Remains : 76/302 places, 48/258 transitions.
[2026-05-24 09:16:01] [INFO ] Flatten gal took : 1 ms
[2026-05-24 09:16:01] [INFO ] Flatten gal took : 1 ms
[2026-05-24 09:16:01] [INFO ] Input system was already deterministic with 48 transitions.
[2026-05-24 09:16:01] [INFO ] Flatten gal took : 1 ms
[2026-05-24 09:16:01] [INFO ] Flatten gal took : 1 ms
[2026-05-24 09:16:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality170219980674620852.gal : 1 ms
[2026-05-24 09:16:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5063638336519507982.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality170219980674620852.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5063638336519507982.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 21865 steps (6384 resets) in 71 ms. (303 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-08-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 09:16:01] [INFO ] Flatten gal took : 4 ms
[2026-05-24 09:16:01] [INFO ] Flatten gal took : 3 ms
[2026-05-24 09:16:01] [INFO ] Applying decomposition
[2026-05-24 09:16:01] [INFO ] Flatten gal took : 3 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/graph14856980131961811226.txt' '-o' '/tmp/graph14856980131961811226.bin' '-w' '/tmp/graph14856980131961811226.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14856980131961811226.bin' '-l' '-1' '-v' '-w' '/tmp/graph14856980131961811226.weights' '-q' '0' '-e' '0.001'
[2026-05-24 09:16:01] [INFO ] Decomposing Gal with order
[2026-05-24 09:16:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 09:16:01] [INFO ] Removed a total of 83 redundant transitions.
[2026-05-24 09:16:01] [INFO ] Flatten gal took : 13 ms
[2026-05-24 09:16:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2026-05-24 09:16:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality15220197130534665152.gal : 3 ms
[2026-05-24 09:16:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality10876976381028458942.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/CTLCardinality15220197130534665152.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10876976381028458942.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 -...264
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.62878e+17,4.26217,124184,8614,27,155183,314,682,495414,44,766,0


Converting to forward existential form...Done !
original formula: EG(EF(((i6.u26.p76==1) + AX(((i21.i1.u100.p349==0)&&(i18.i1.u81.p264==1))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((i6.u26.p76==1) + !(EX(!(((i21.i1.u100.p349==0)&&(i18.i1.u81.p264==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t195, i0.i0.u48.t123, i0.i1.u46.t126, i0.i2.t47, i0.i2.u88.t48, i1.u34.t149, i2.u32.t153, i3....1185
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 a local SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
(forward)formula 0,1,238.357,2781168,1,0,3.74124e+06,314,3675,9.65389e+06,169,910,2223157
FORMULA BusinessProcesses-PT-08-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(AF(AG(AF(((i10.i1.u3.p9==0)||(i9.u38.p112==1))))) U ((EF(EG(AG((i0.i2.u87.p288==1)))) + AG(AF(AX(((i15.u74.p240==0)||(i3.u96.p324==1)))...323
=> equivalent forward existential formula: (([FwdG(FwdU(FwdU(Init,!(EG(!(!(E(TRUE U !(!(EG(!(((i10.i1.u3.p9==0)||(i9.u38.p112==1)))))))))))),TRUE),!(E(TRUE...828
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Detected timeout of ITS tools.
[2026-05-24 09:41:32] [INFO ] Applying decomposition
[2026-05-24 09:41:32] [INFO ] Flatten gal took : 4 ms
[2026-05-24 09:41:32] [INFO ] Decomposing Gal with order
[2026-05-24 09:41:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 09:41:32] [INFO ] Removed a total of 11 redundant transitions.
[2026-05-24 09:41:32] [INFO ] Flatten gal took : 9 ms
[2026-05-24 09:41:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2026-05-24 09:41:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality9476403015372255214.gal : 4 ms
[2026-05-24 09:41:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality12064803519780743045.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/CTLCardinality9476403015372255214.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12064803519780743045.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 5 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.62878e+17,92.9314,2459556,48476,1084,1.53199e+06,2504,1029,2.94197e+07,363,19512,0


Converting to forward existential form...Done !

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-08"
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 BusinessProcesses-PT-08, 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 r034-tall-177946842000505"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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