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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1351.071 41685.00 86370.00 5927.20 TFTFFFFTFFTTFTFF 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-177961074100358.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-C1000N0000000010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074100358
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.5K Mar 7 11:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Mar 7 11:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 7 11:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Mar 7 11:24 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:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 10:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 15 10:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 10:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 11:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Mar 7 11:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Mar 7 11:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 7 11:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:33 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-C1000N0000000010-ReachabilityCardinality-2024-00
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-01
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-02
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-03
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-04
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-05
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-06
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-07
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-08
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-09
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-10
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-11
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-12
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-13
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-14
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779720388902

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-C1000N0000000010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-25 14:46:30] [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:46:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 14:46:30] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2026-05-25 14:46:30] [INFO ] Transformed 33 places.
[2026-05-25 14:46:30] [INFO ] Transformed 22 transitions.
[2026-05-25 14:46:30] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 123 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2026-05-25 14:46:30] [INFO ] Flatten gal took : 25 ms
[2026-05-25 14:46:30] [INFO ] Flatten gal took : 6 ms
RANDOM walk for 40001 steps (92 resets) in 869 ms. (45 steps per ms) remains 16/16 properties
[2026-05-25 14:46:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15025934674594945229.gal : 6 ms
[2026-05-25 14:46:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11292159139894361727.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15025934674594945229.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11292159139894361727.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4002 steps (8 resets) in 116 ms. (34 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 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 ...330
Loading property file /tmp/ReachabilityCardinality11292159139894361727.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
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
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 16/16 properties
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 4003 steps (8 resets) in 95 ms. (41 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 262 ms. (15 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 69 ms. (57 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 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 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 107 ms. (37 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 104 ms. (38 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :3084 after 129034
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :129034 after 144600
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :144600 after 182930
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :182930 after 257908
SDD proceeding with computation,16 properties remain. new max is 16384
SDD size :257908 after 529958
Interrupted probabilistic random walk after 578563 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :0 out of 16
Probabilistic random walk after 578563 steps, saw 99924 distinct states, run finished after 3006 ms. (steps per millisecond=192 ) properties seen :0
SDD proceeding with computation,16 properties remain. new max is 32768
SDD size :529958 after 1.19668e+06
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5631512780060110968.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3905750193461956922.kers'
[2026-05-25 14:46:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5631512780060110968.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3905750193461956922.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:46:40] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3905750193461956922.kers
Total runtime 1 ms.
Problem GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-00 is UNSAT
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-01 is UNSAT
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-06 is UNSAT
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-09 is UNSAT
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-10 is UNSAT
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-11 is UNSAT
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-13 is UNSAT
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 7/7 constraints. Problems are: Problem set: 7 solved, 9 unsolved
Problem GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-04 is UNSAT
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-05 is UNSAT
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-07 is UNSAT
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-15 is UNSAT
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 5/12 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 11 solved, 5 unsolved
Problem GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-02 is UNSAT
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-03 is UNSAT
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-08 is UNSAT
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 22/55 variables, 33/45 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/45 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/55 variables, 0/45 constraints. Problems are: Problem set: 14 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 45 constraints, problems are : Problem set: 14 solved, 2 unsolved in 431 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 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: 14 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 1/1 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 8/23 variables, 5/6 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/24 variables, 1/7 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 9/33 variables, 5/12 constraints. Problems are: Problem set: 14 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 33/55 variables, and 12 constraints, problems are : Problem set: 14 solved, 2 unsolved in 2126 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/33 constraints, PredecessorRefiner: 0/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2658ms problems are : Problem set: 14 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 3 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 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 19
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 5 place count 30 transition count 18
Applied a total of 5 rules in 42 ms. Remains 30 /33 variables (removed 3) and now considering 18/22 (removed 4) transitions.
Running 17 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-10295005756529878080.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1442957034183393144.kers'
[2026-05-25 14:46:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10295005756529878080.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1442957034183393144.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 18 rows 24 cols 62 entries
Finished phase 1 with 10 SingleSign rule and 8 generalized
[2026-05-25 14:46:43] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1442957034183393144.kers
Total runtime 1 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/30 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem TDEAD13 is UNSAT
At refinement iteration 5 (OVERLAPS) 18/48 variables, 30/42 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/48 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 42 constraints, problems are : Problem set: 1 solved, 16 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 3/10 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/12 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 16 unsolved
SDD proceeding with computation,16 properties remain. new max is 65536
SDD size :1.19668e+06 after 1.62368e+07
At refinement iteration 5 (OVERLAPS) 18/48 variables, 30/42 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 16/58 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 58 constraints, problems are : Problem set: 1 solved, 16 unsolved in 6118 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 16/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6412ms problems are : Problem set: 1 solved, 16 unsolved
Search for dead transitions found 1 dead transitions in 6413ms
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 : 30/33 places, 17/22 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6502 ms. Remains : 30/33 places, 17/22 transitions.
RANDOM walk for 40013 steps (97 resets) in 339 ms. (117 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (17 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (24 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1792495 steps, run timeout after 3001 ms. (steps per millisecond=597 ) properties seen :0 out of 2
Probabilistic random walk after 1792495 steps, saw 285568 distinct states, run finished after 3003 ms. (steps per millisecond=596 ) 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-14685627463950394426.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12610517851490650380.kers'
[2026-05-25 14:46:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14685627463950394426.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12610517851490650380.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 17 rows 24 cols 59 entries
Finished phase 1 with 10 SingleSign rule and 7 generalized
[2026-05-25 14:46:52] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12610517851490650380.kers
Total runtime 1 ms.
[2026-05-25 14:46:52] [WARNING] KERS value -104999993000 at col=5 row=21 overflows int; skipping row.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 8/23 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/24 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 6/30 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 17/47 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/47 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/47 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 47/47 variables, and 42 constraints, problems are : Problem set: 0 solved, 2 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 8/23 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/24 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 6/30 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-12 is UNSAT
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Solver is answering 'unknown', stopping.
Problem GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-14 is UNSAT
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 47/47 variables, and 42 constraints, problems are : Problem set: 1 solved, 1 unsolved in 17658 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17781ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 40516 ms.

BK_STOP 1779720430587

--------------------
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-C1000N0000000010"
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-C1000N0000000010, 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-177961074100358"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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