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.r082-smll-177946993600278.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 Dekker-PT-050, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993600278
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.1K Mar 4 18:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Mar 4 18:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 4 18:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 4 18:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 08:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 15 08:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 4 18:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Mar 4 18:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Mar 4 18:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Mar 4 18:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 08:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 08:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1.5M 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 Dekker-PT-050-ReachabilityCardinality-2024-00
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-2024-01
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-2024-02
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-2024-03
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-2024-04
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-2024-05
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-2024-06
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-2024-07
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-2024-08
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-2024-09
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-2024-10
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-2024-11
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-2024-12
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-2024-13
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-2024-14
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779638562974

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-24 16:02:45] [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-24 16:02:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 16:02:46] [INFO ] Load time of PNML (sax parser for PT used): 572 ms
[2026-05-24 16:02:46] [INFO ] Transformed 250 places.
[2026-05-24 16:02:46] [INFO ] Transformed 2600 transitions.
[2026-05-24 16:02:46] [INFO ] Found NUPN structural information;
[2026-05-24 16:02:46] [INFO ] Parsed PT model containing 250 places and 2600 transitions and 20100 arcs in 835 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
FORMULA Dekker-PT-050-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 3216 ms. (12 steps per ms) remains 2/6 properties
FORMULA Dekker-PT-050-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 571 ms. (69 steps per ms) remains 2/2 properties
[2026-05-24 16:02:47] [INFO ] Flatten gal took : 724 ms
BEST_FIRST walk for 40004 steps (8 resets) in 736 ms. (54 steps per ms) remains 2/2 properties
[2026-05-24 16:02:47] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2148360034396356836.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9721149858776849490.kers'
[2026-05-24 16:02:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2148360034396356836.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9721149858776849490.kers]
Culling duplicate invariants (modulo rational): removing 100 columns.
Culled 100 columns in 0 ms.
// Phase 1: matrix 200 rows 150 cols 400 entries
Finished phase 1 with 100 SingleSign rule and 0 generalized
[2026-05-24 16:02:47] [INFO ] Computed 150 invariants in 1 ms
Computed 150 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9721149858776849490.kers
Total runtime 5 ms.
[2026-05-24 16:02:47] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-24 16:02:47] [INFO ] Flatten gal took : 338 ms
[2026-05-24 16:02:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1509318440509717339.gal : 155 ms
[2026-05-24 16:02:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14164962720513182897.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1509318440509717339.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14164962720513182897.prop' '--nowitness' '--gen-order' 'FOLLOW'
All remaining problems are real, not stopping.

At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
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 ...329
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/51 variables, 19/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 28/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/62 variables, 9/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 11/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 14/76 variables, 14/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/76 variables, 14/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/76 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 9/85 variables, 6/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/85 variables, 9/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/85 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 68/153 variables, 85/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/153 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 66/219 variables, 50/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/219 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 198/417 variables, 132/403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/417 variables, 132/535 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/417 variables, 33/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/417 variables, 33/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/417 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 33/450 variables, 33/634 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/450 variables, 33/667 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/450 variables, 33/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/450 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Loading property file /tmp/ReachabilityCardinality14164962720513182897.prop.
At refinement iteration 29 (OVERLAPS) 0/450 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 700 constraints, problems are : Problem set: 0 solved, 2 unsolved in 937 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 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/23 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/51 variables, 19/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 28/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 16
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :16 after 128
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :128 after 8192
At refinement iteration 8 (OVERLAPS) 11/62 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :8192 after 1.67772e+07
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 11/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/62 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 14/76 variables, 14/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/76 variables, 14/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/76 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 9/85 variables, 6/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/85 variables, 9/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/85 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 68/153 variables, 85/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/153 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 66/219 variables, 50/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/219 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/219 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 198/417 variables, 132/407 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/417 variables, 132/539 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/417 variables, 33/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/417 variables, 33/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/417 variables, 2/607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/417 variables, 20/627 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 6169ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 274 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 291 ms. Remains : 250/250 places, 2600/2600 transitions.
RANDOM walk for 40000 steps (8 resets) in 1410 ms. (28 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 508 ms. (78 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 241485 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 2
Probabilistic random walk after 241485 steps, saw 199396 distinct states, run finished after 3009 ms. (steps per millisecond=80 ) properties seen :0
[2026-05-24 16:02:57] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2026-05-24 16:02:57] [INFO ] Invariant cache hit.
[2026-05-24 16:02:57] [INFO ] State equation strengthened by 50 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/51 variables, 19/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 28/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/62 variables, 9/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 11/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 14/76 variables, 14/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/76 variables, 14/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/76 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 9/85 variables, 6/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/85 variables, 9/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/85 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 68/153 variables, 85/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/153 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 66/219 variables, 50/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/219 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 198/417 variables, 132/403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/417 variables, 132/535 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/417 variables, 33/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/417 variables, 33/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/417 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 33/450 variables, 33/634 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/450 variables, 33/667 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/450 variables, 33/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/450 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/450 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 700 constraints, problems are : Problem set: 0 solved, 2 unsolved in 456 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 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/23 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/51 variables, 19/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 28/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 11/62 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 11/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/62 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 14/76 variables, 14/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/76 variables, 14/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/76 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 9/85 variables, 6/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/85 variables, 9/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/85 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 68/153 variables, 85/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/153 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 66/219 variables, 50/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/219 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/219 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 198/417 variables, 132/407 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/417 variables, 132/539 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/417 variables, 33/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/417 variables, 33/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/417 variables, 2/607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/417 variables, 20/627 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/417 variables, 20/647 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/417 variables, 17/664 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/417 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/417 variables, 1/666 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/417 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 33/450 variables, 33/699 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/450 variables, 33/732 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/450 variables, 33/765 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/450 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 0/450 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 450/450 variables, and 765 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6478 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 63/63 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6998ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 622 ms.
Support contains 23 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 183 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 250/250 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 233 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2026-05-24 16:03:05] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2026-05-24 16:03:05] [INFO ] Invariant cache hit.
[2026-05-24 16:03:07] [INFO ] Implicit Places using invariants in 1493 ms returned [100, 103, 106, 112, 115, 118, 121, 124, 127, 133, 136, 139, 142, 145, 148, 151, 154, 157, 160, 163, 166, 169, 172, 184, 187, 190, 193, 196, 199, 202, 205, 208, 211, 214, 217, 220, 223, 229, 232, 235, 238, 241, 244, 247]
Discarding 44 places :
Implicit Place search using SMT only with invariants took 1511 ms to find 44 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 206/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 92 ms. Remains 206 /206 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1837 ms. Remains : 206/250 places, 2600/2600 transitions.
RANDOM walk for 40000 steps (8 resets) in 1083 ms. (36 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 301 ms. (132 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 295137 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 2
Probabilistic random walk after 295137 steps, saw 243116 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
[2026-05-24 16:03:11] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7813894976040871494.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3215154384899773858.kers'
[2026-05-24 16:03:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7813894976040871494.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3215154384899773858.kers]
Culling duplicate invariants (modulo rational): removing 56 columns.
Culled 56 columns in 0 ms.
// Phase 1: matrix 200 rows 150 cols 400 entries
Finished phase 1 with 100 SingleSign rule and 0 generalized
[2026-05-24 16:03:11] [INFO ] Computed 106 invariants in 0 ms
Computed 106 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3215154384899773858.kers
Total runtime 1 ms.
[2026-05-24 16:03:11] [INFO ] State equation strengthened by 50 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/51 variables, 19/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 28/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/62 variables, 9/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 11/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/65 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/65 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/65 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 9/74 variables, 6/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/74 variables, 9/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/74 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 68/142 variables, 74/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/142 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 66/208 variables, 50/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/208 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 165/373 variables, 99/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/373 variables, 99/436 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/373 variables, 33/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/373 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 33/406 variables, 33/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/406 variables, 33/535 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/406 variables, 33/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/406 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/406 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 568 constraints, problems are : Problem set: 0 solved, 2 unsolved in 374 ms.
Refiners :[Domain max(s): 206/206 constraints, Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 206/206 constraints, ReadFeed: 50/50 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/23 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/51 variables, 19/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 28/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/51 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/51 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/51 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 11/62 variables, 9/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/62 variables, 11/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/62 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/65 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/65 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/65 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/65 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 9/74 variables, 6/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/74 variables, 9/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/74 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 68/142 variables, 74/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/142 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 66/208 variables, 50/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/208 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 165/373 variables, 99/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/373 variables, 99/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/373 variables, 33/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/373 variables, 2/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/373 variables, 20/499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/373 variables, 7/506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/373 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 33/406 variables, 33/539 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/406 variables, 33/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/406 variables, 33/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/406 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 0/406 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 605 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2827 ms.
Refiners :[Domain max(s): 206/206 constraints, Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 206/206 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3239ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 319 ms.
Support contains 23 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 2600/2600 transitions.
Applied a total of 0 rules in 71 ms. Remains 206 /206 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 206/206 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 2600/2600 transitions.
Applied a total of 0 rules in 69 ms. Remains 206 /206 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2026-05-24 16:03:14] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2026-05-24 16:03:14] [INFO ] Invariant cache hit.
[2026-05-24 16:03:15] [INFO ] Implicit Places using invariants in 655 ms returned []
[2026-05-24 16:03:15] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2026-05-24 16:03:15] [INFO ] Invariant cache hit.
[2026-05-24 16:03:15] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-24 16:03:16] [INFO ] Implicit Places using invariants and state equation in 805 ms returned []
Implicit Place search using SMT with State Equation took 1461 ms to find 0 implicit places.
[2026-05-24 16:03:16] [INFO ] Redundant transitions in 177 ms returned []
Running 2550 sub problems to find dead transitions.
[2026-05-24 16:03:16] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2026-05-24 16:03:16] [INFO ] Invariant cache hit.
[2026-05-24 16:03:16] [INFO ] State equation strengthened by 50 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 100/300 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 20/320 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 20/340 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 200/406 variables, and 340 constraints, problems are : Problem set: 0 solved, 2550 unsolved in 30123 ms.
Refiners :[Domain max(s): 200/206 constraints, Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/206 constraints, ReadFeed: 0/50 constraints, PredecessorRefiner: 2550/2500 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2550 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 100/300 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 40/340 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 20/360 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 20/400 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 200/406 variables, and 460 constraints, problems are : Problem set: 0 solved, 2550 unsolved in 30071 ms.
Refiners :[Domain max(s): 200/206 constraints, Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/206 constraints, ReadFeed: 0/50 constraints, PredecessorRefiner: 50/2500 constraints, Known Traps: 160/160 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61448ms problems are : Problem set: 0 solved, 2550 unsolved
Search for dead transitions found 0 dead transitions in 61475ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63240 ms. Remains : 206/206 places, 2600/2600 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 330 edges and 206 vertex of which 74 are kept as prefixes of interest. Removing 132 places using SCC suffix rule.1 ms
Discarding 132 places :
Also discarding 1716 output transitions
Drop transitions (Output transitions of discarded places.) removed 1716 transitions
Ensure Unique test removed 5 places
Ensure Unique test removed 816 transitions
Reduce isomorphic transitions removed 816 transitions.
Iterating post reduction 0 with 821 rules applied. Total rules applied 822 place count 69 transition count 68
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 15 rules applied. Total rules applied 837 place count 59 transition count 63
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 842 place count 59 transition count 58
Free-agglomeration rule applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 850 place count 59 transition count 50
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 874 place count 43 transition count 42
Applied a total of 874 rules in 102 ms. Remains 43 /206 variables (removed 163) and now considering 42/2600 (removed 2558) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2470667779123344259.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3614121688197031001.kers'
[2026-05-24 16:04:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2470667779123344259.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3614121688197031001.kers]
Culling duplicate invariants (modulo rational): removing 18 columns.
Culled 18 columns in 0 ms.
// Phase 1: matrix 42 rows 25 cols 58 entries
Finished phase 1 with 19 SingleSign rule and 2 generalized
[2026-05-24 16:04:18] [INFO ] Computed 22 invariants in 0 ms
Computed 22 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3614121688197031001.kers
Total runtime 3 ms.
[2026-05-24 16:04:18] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-24 16:04:18] [INFO ] [Nat]Absence check using 19 positive place invariants in 4 ms returned sat
[2026-05-24 16:04:18] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-24 16:04:18] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-24 16:04:18] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-24 16:04:18] [INFO ] After 118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-24 16:04:18] [INFO ] Flatten gal took : 4 ms
[2026-05-24 16:04:18] [INFO ] Flatten gal took : 2 ms
[2026-05-24 16:04:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8406020213648524796.gal : 2 ms
[2026-05-24 16:04:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1102715912094209535.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/ReachabilityCardinality8406020213648524796.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1102715912094209535.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 ...328
Loading property file /tmp/ReachabilityCardinality1102715912094209535.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :12 after 288
Reachability property Dekker-PT-050-ReachabilityCardinality-2024-05 is true.
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :288 after 110592
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,663552,0.034414,4436,2,70,9,525,7,0,243,182,0
Total reachable state count : 663552

Verifying 2 reachability properties.
Reachability property Dekker-PT-050-ReachabilityCardinality-2024-05 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-050-ReachabilityCardinality-2024-05,124416,0.035306,4440,2,162,9,525,8,0,258,182,0
Reachability property Dekker-PT-050-ReachabilityCardinality-2024-06 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-050-ReachabilityCardinality-2024-06,24456,0.037456,4464,2,248,9,789,8,0,286,307,0
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 360 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 16:04:18] [INFO ] Flatten gal took : 140 ms
[2026-05-24 16:04:18] [INFO ] Applying decomposition
[2026-05-24 16:04:18] [INFO ] Flatten gal took : 138 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/graph948342400546916170.txt' '-o' '/tmp/graph948342400546916170.bin' '-w' '/tmp/graph948342400546916170.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph948342400546916170.bin' '-l' '-1' '-v' '-w' '/tmp/graph948342400546916170.weights' '-q' '0' '-e' '0.001'
[2026-05-24 16:04:19] [INFO ] Decomposing Gal with order
[2026-05-24 16:04:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 16:04:19] [INFO ] Removed a total of 7984 redundant transitions.
[2026-05-24 16:04:19] [INFO ] Flatten gal took : 419 ms
[2026-05-24 16:04:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 102 ms.
[2026-05-24 16:04:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15486477488610136274.gal : 25 ms
[2026-05-24 16:04:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1272653970463092112.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/ReachabilityCardinality15486477488610136274.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1272653970463092112.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityCardinality1272653970463092112.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :16 after 1.1259e+15
Reachability property Dekker-PT-050-ReachabilityCardinality-2024-06 is true.
FORMULA Dekker-PT-050-ReachabilityCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property Dekker-PT-050-ReachabilityCardinality-2024-05 is true.
FORMULA Dekker-PT-050-ReachabilityCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 9 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.81475e+15,0.579193,12932,125,20,1152,1361,2845,713,41,1811,0
Total reachable state count : 2814749767124992

Verifying 2 reachability properties.
Reachability property Dekker-PT-050-ReachabilityCardinality-2024-05 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-050-ReachabilityCardinality-2024-05,7.03687e+13,0.581226,12932,65,16,1152,1361,2865,713,49,1811,0
Reachability property Dekker-PT-050-ReachabilityCardinality-2024-06 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-050-ReachabilityCardinality-2024-06,4.39805e+12,0.583468,12932,67,16,1152,1361,2926,713,61,1811,0
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 95278 ms.

BK_STOP 1779638660700

--------------------
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="Dekker-PT-050"
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 Dekker-PT-050, 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 r082-smll-177946993600278"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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