fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r146-tall-177961074100334
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for GPPP-PT-C0100N0000001000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16204.911 3600000.00 5104788.00 233452.10 TFTFTTFFTTTTF?TF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r146-tall-177961074100334.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 GPPP-PT-C0100N0000001000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074100334
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.5K Mar 7 11:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Mar 7 11:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 7 11:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Mar 7 11:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 10:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 15 10:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 11:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Mar 7 11:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 7 11:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Mar 7 11:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1 Mar 3 18:30 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-00
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-01
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-02
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-03
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-04
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-05
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-06
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-07
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-08
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-09
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-10
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-11
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-12
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-13
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-14
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779718143775

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0100N0000001000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-25 14:09:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 14:09:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 14:09:05] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2026-05-25 14:09:05] [INFO ] Transformed 33 places.
[2026-05-25 14:09:05] [INFO ] Transformed 22 transitions.
[2026-05-25 14:09:05] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 120 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40644 steps (12 resets) in 378 ms. (107 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 148 ms. (26 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 16/16 properties
[2026-05-25 14:09:05] [INFO ] Flatten gal took : 49 ms
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
[2026-05-25 14:09:05] [INFO ] Flatten gal took : 7 ms
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 16/16 properties
[2026-05-25 14:09:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9379236897644989772.gal : 6 ms
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 16/16 properties
[2026-05-25 14:09:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality167018182463752755.prop : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9379236897644989772.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality167018182463752755.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 16/16 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality167018182463752755.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :4 after 8
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :8 after 22
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :22 after 54
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :54 after 77
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :77 after 214
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :214 after 950
BEST_FIRST walk for 4002 steps (8 resets) in 77 ms. (51 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :950 after 3084
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :3084 after 16875
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :16875 after 96702
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :96702 after 640134
Interrupted probabilistic random walk after 528422 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :0 out of 16
Probabilistic random walk after 528422 steps, saw 106691 distinct states, run finished after 3007 ms. (steps per millisecond=175 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1838601357894671706.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11172334626989252878.kers'
[2026-05-25 14:09:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1838601357894671706.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11172334626989252878.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 22 rows 27 cols 71 entries
Finished phase 1 with 13 SingleSign rule and 8 generalized
[2026-05-25 14:09:10] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11172334626989252878.kers
Total runtime 3 ms.
Problem GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-03 is UNSAT
FORMULA GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-06 is UNSAT
FORMULA GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 14 unsolved
Problem GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-02 is UNSAT
FORMULA GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-04 is UNSAT
FORMULA GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-07 is UNSAT
FORMULA GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-08 is UNSAT
FORMULA GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-09 is UNSAT
FORMULA GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-10 is UNSAT
FORMULA GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-11 is UNSAT
FORMULA GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-12 is UNSAT
FORMULA GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-14 is UNSAT
FORMULA GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-15 is UNSAT
FORMULA GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 4/12 constraints. Problems are: Problem set: 12 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 12 solved, 4 unsolved
Problem GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-00 is UNSAT
FORMULA GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 22/55 variables, 33/45 constraints. Problems are: Problem set: 13 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/45 constraints. Problems are: Problem set: 13 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/55 variables, 0/45 constraints. Problems are: Problem set: 13 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 45 constraints, problems are : Problem set: 13 solved, 3 unsolved in 1045 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 13 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 13 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 13 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 13 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 13 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 13 solved, 3 unsolved
Problem GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-01 is UNSAT
FORMULA GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 2/32 variables, 3/11 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 1/12 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/33 variables, 1/13 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 14 solved, 2 unsolved
Problem GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-05 is UNSAT
FORMULA GPPP-PT-C0100N0000001000-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 55/55 variables, and 46 constraints, problems are : Problem set: 15 solved, 1 unsolved in 1901 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 0/16 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3073ms problems are : Problem set: 15 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 2 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 6 place count 29 transition count 18
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 27 transition count 17
Applied a total of 9 rules in 39 ms. Remains 27 /33 variables (removed 6) and now considering 17/22 (removed 5) transitions.
Running 16 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14470158384277650145.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13771088457098308611.kers'
[2026-05-25 14:09:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14470158384277650145.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13771088457098308611.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 17 rows 23 cols 60 entries
Finished phase 1 with 9 SingleSign rule and 8 generalized
[2026-05-25 14:09:14] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13771088457098308611.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem TDEAD12 is UNSAT
At refinement iteration 5 (OVERLAPS) 17/44 variables, 27/37 constraints. Problems are: Problem set: 1 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/44 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 37 constraints, problems are : Problem set: 1 solved, 15 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/26 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 15 unsolved
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :640134 after 4.81326e+06
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 3/9 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 1/27 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 17/44 variables, 27/37 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 15/52 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 44/44 variables, and 52 constraints, problems are : Problem set: 1 solved, 15 unsolved in 20010 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 15/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20229ms problems are : Problem set: 1 solved, 15 unsolved
Search for dead transitions found 1 dead transitions in 20230ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 27/33 places, 16/22 transitions.
Graph (complete) has 67 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 26 /27 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 21436 ms. Remains : 26/33 places, 16/22 transitions.
RANDOM walk for 40195 steps (28 resets) in 156 ms. (256 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3841141 steps, run timeout after 3001 ms. (steps per millisecond=1279 ) properties seen :0 out of 1
Probabilistic random walk after 3841141 steps, saw 608800 distinct states, run finished after 3001 ms. (steps per millisecond=1279 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5051288352718761330.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7695046054372222930.kers'
[2026-05-25 14:09:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5051288352718761330.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7695046054372222930.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 16 rows 22 cols 56 entries
Finished phase 1 with 9 SingleSign rule and 7 generalized
[2026-05-25 14:09:37] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7695046054372222930.kers
Total runtime 0 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/18 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/25 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/26 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 16/42 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/42 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/42 variables, and 36 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/18 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/25 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 26/42 variables, and 10 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4728 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/26 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4781ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 16/16 transitions.
Applied a total of 0 rules in 4 ms. Remains 26 /26 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 26/26 places, 16/16 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 16/16 transitions.
Applied a total of 0 rules in 3 ms. Remains 26 /26 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2026-05-25 14:09:42] [INFO ] Invariant cache hit.
[2026-05-25 14:09:43] [INFO ] Implicit Places using invariants in 437 ms returned []
[2026-05-25 14:09:43] [INFO ] Invariant cache hit.
[2026-05-25 14:09:43] [INFO ] Implicit Places using invariants and state equation in 39 ms returned [1, 2]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 482 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 24/26 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 487 ms. Remains : 24/26 places, 16/16 transitions.
RANDOM walk for 40391 steps (28 resets) in 40 ms. (985 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3639421 steps, run timeout after 3001 ms. (steps per millisecond=1212 ) properties seen :0 out of 1
Probabilistic random walk after 3639421 steps, saw 577718 distinct states, run finished after 3002 ms. (steps per millisecond=1212 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15470264684448206598.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8170521823042553439.kers'
[2026-05-25 14:09:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15470264684448206598.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8170521823042553439.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 16 rows 21 cols 52 entries
Finished phase 1 with 11 SingleSign rule and 5 generalized
[2026-05-25 14:09:46] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8170521823042553439.kers
Total runtime 1 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/23 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/24 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 16/40 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/40 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 32 constraints, problems are : Problem set: 0 solved, 1 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/23 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 24/40 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 16412 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/24 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16487ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 16/16 transitions.
Applied a total of 0 rules in 6 ms. Remains 24 /24 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 24/24 places, 16/16 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2026-05-25 14:10:02] [INFO ] Invariant cache hit.
[2026-05-25 14:10:02] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-25 14:10:02] [INFO ] Invariant cache hit.
[2026-05-25 14:10:02] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2026-05-25 14:10:02] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2026-05-25 14:10:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/24 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 16/40 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/40 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 32 constraints, problems are : Problem set: 0 solved, 15 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 16/40 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 15/47 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 15 unsolved
SDD proceeding with computation,16 properties remain. new max is 16384
SDD size :4.81326e+06 after 3.58735e+07
At refinement iteration 8 (OVERLAPS) 0/40 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 47 constraints, problems are : Problem set: 0 solved, 15 unsolved in 20287 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20422ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 20423ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20498 ms. Remains : 24/24 places, 16/16 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 14:10:23] [INFO ] Flatten gal took : 4 ms
[2026-05-25 14:10:23] [INFO ] Applying decomposition
[2026-05-25 14:10:23] [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/graph14584233719646773312.txt' '-o' '/tmp/graph14584233719646773312.bin' '-w' '/tmp/graph14584233719646773312.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14584233719646773312.bin' '-l' '-1' '-v' '-w' '/tmp/graph14584233719646773312.weights' '-q' '0' '-e' '0.001'
[2026-05-25 14:10:23] [INFO ] Decomposing Gal with order
[2026-05-25 14:10:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 14:10:23] [INFO ] Removed a total of 3 redundant transitions.
[2026-05-25 14:10:23] [INFO ] Flatten gal took : 46 ms
[2026-05-25 14:10:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 14:10:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12889862100460754198.gal : 2 ms
[2026-05-25 14:10:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17738893415971771973.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12889862100460754198.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17738893415971771973.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality17738893415971771973.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 44
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :44 after 74
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :74 after 410
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :410 after 1490
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1490 after 4040
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4040 after 33206
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :33206 after 58938
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :58938 after 154278
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :154278 after 870651
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :870651 after 2.81936e+06
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.81936e+06 after 1.44987e+07
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.44987e+07 after 1.25054e+08
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.25054e+08 after 1.02371e+09
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.02371e+09 after 1.33877e+10
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :1.33877e+10 after 1.45592e+11
SDD proceeding with computation,1 properties remain. new max is 524288
SDD size :1.45592e+11 after 1.66007e+12
SDD proceeding with computation,1 properties remain. new max is 1048576
SDD size :1.66007e+12 after 1.62757e+13
Detected timeout of ITS tools.
[2026-05-25 14:40:38] [INFO ] Flatten gal took : 151 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9034078161661135315
[2026-05-25 14:40:38] [INFO ] Applying decomposition
[2026-05-25 14:40:38] [INFO ] Flatten gal took : 19 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/graph8058385355316829902.txt' '-o' '/tmp/graph8058385355316829902.bin' '-w' '/tmp/graph8058385355316829902.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8058385355316829902.bin' '-l' '-1' '-v' '-w' '/tmp/graph8058385355316829902.weights' '-q' '0' '-e' '0.001'
[2026-05-25 14:40:38] [INFO ] Computing symmetric may disable matrix : 16 transitions.
[2026-05-25 14:40:38] [INFO ] Decomposing Gal with order
[2026-05-25 14:40:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 14:40:38] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 14:40:38] [INFO ] Computing symmetric may enable matrix : 16 transitions.
[2026-05-25 14:40:38] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 14:40:38] [INFO ] Computing Do-Not-Accords matrix : 16 transitions.
[2026-05-25 14:40:38] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 14:40:38] [INFO ] Removed a total of 4 redundant transitions.
[2026-05-25 14:40:38] [INFO ] Flatten gal took : 37 ms
[2026-05-25 14:40:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2026-05-25 14:40:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13905069703518943197.gal : 39 ms
[2026-05-25 14:40:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11642013590846905080.prop : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13905069703518943197.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11642013590846905080.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality11642013590846905080.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 58
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :58 after 149
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :149 after 664
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :664 after 3798
[2026-05-25 14:40:39] [INFO ] Built C files in 419ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9034078161661135315
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3798 after 22182
Running compilation step : cd /tmp/ltsmin9034078161661135315;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :22182 after 155234
Compilation finished in 259 ms.
Running link step : cd /tmp/ltsmin9034078161661135315;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin9034078161661135315;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'GPPPPTC0100N0000001000ReachabilityCardinality202413==true'
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :155234 after 1.15908e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.15908e+06 after 6.81945e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6.81945e+06 after 7.4928e+07
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :7.4928e+07 after 1.69775e+08
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.69775e+08 after 3.56446e+08
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :3.56446e+08 after 4.13322e+08
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :4.13322e+08 after 1.03514e+09
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :1.03514e+09 after 1.92601e+09

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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="GPPP-PT-C0100N0000001000"
export BK_EXAMINATION="ReachabilityCardinality"
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 GPPP-PT-C0100N0000001000, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r146-tall-177961074100334"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0100N0000001000.tgz
mv GPPP-PT-C0100N0000001000 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;