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.r194-tall-177969914300813.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 PGCD-PT-D02N006, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914300813
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 5.6K Mar 8 14:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Mar 8 14:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 8 14:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 8 14:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 16 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 16 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 16 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 16 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 8 14:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Mar 8 14:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Mar 8 14:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Mar 8 14:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 16 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 5.6K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779837546875

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PGCD-PT-D02N006
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-26 23:19:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 23:19:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 23:19:08] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2026-05-26 23:19:08] [INFO ] Transformed 9 places.
[2026-05-26 23:19:08] [INFO ] Transformed 9 transitions.
[2026-05-26 23:19:08] [INFO ] Parsed PT model containing 9 places and 9 transitions and 42 arcs in 119 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 8
Current structural bounds on expressions (Initially) : Max Seen:[1, 1, 6, 6, 1, 1, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[1, 1, 6, 6, 1, 1, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4020579298561191625.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12540007635399705126.kers'
[2026-05-26 23:19:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4020579298561191625.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12540007635399705126.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 9 rows 6 cols 24 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-26 23:19:08] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12540007635399705126.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 6, 6, 1, 1, 1, 1] Max Struct:[21, 21, 21, 21, 21, 21, 21, 21]
RANDOM walk for 10002 steps (2 resets) in 15 ms. (625 steps per ms)
BEST_FIRST walk for 80004 steps (16 resets) in 106 ms. (747 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15, 15, 13, 13, 15, 15, 15, 15] Max Struct:[21, 21, 21, 21, 21, 21, 21, 21]
[2026-05-26 23:19:08] [INFO ] Invariant cache hit.
[2026-05-26 23:19:08] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2026-05-26 23:19:08] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 23:19:08] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2026-05-26 23:19:08] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 23:19:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2026-05-26 23:19:08] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 23:19:08] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2026-05-26 23:19:08] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-26 23:19:08] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2026-05-26 23:19:08] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-26 23:19:08] [INFO ] Added : 0 causal constraints over 0 iterations in 32 ms. Result :sat
Minimization took 12 ms.
[2026-05-26 23:19:08] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 23:19:08] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 2 ms returned sat
[2026-05-26 23:19:08] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2026-05-26 23:19:08] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 23:19:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 23:19:08] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 3 ms returned sat
[2026-05-26 23:19:08] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-26 23:19:08] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2026-05-26 23:19:08] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-26 23:19:08] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 12 ms.
[2026-05-26 23:19:08] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-26 23:19:08] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 23:19:08] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2026-05-26 23:19:08] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 23:19:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 23:19:08] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 23:19:08] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-26 23:19:08] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2026-05-26 23:19:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2026-05-26 23:19:08] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-26 23:19:09] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 10 ms.
[2026-05-26 23:19:09] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 23:19:09] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 23:19:09] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-26 23:19:09] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 23:19:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 23:19:09] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 23:19:09] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2026-05-26 23:19:09] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2026-05-26 23:19:09] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-26 23:19:09] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 8 ms.
[2026-05-26 23:19:09] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 23:19:09] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 23:19:09] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-26 23:19:09] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 23:19:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 23:19:09] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 23:19:09] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-26 23:19:09] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2026-05-26 23:19:09] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-26 23:19:09] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 11 ms.
[2026-05-26 23:19:09] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 23:19:09] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 23:19:09] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-26 23:19:09] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 23:19:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-26 23:19:09] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 0 ms returned sat
[2026-05-26 23:19:09] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2026-05-26 23:19:09] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2026-05-26 23:19:09] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2026-05-26 23:19:09] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 7 ms.
[2026-05-26 23:19:09] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-26 23:19:09] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 23:19:09] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2026-05-26 23:19:09] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 23:19:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 23:19:09] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 2 ms returned sat
[2026-05-26 23:19:09] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2026-05-26 23:19:09] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2026-05-26 23:19:09] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-26 23:19:09] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 7 ms.
[2026-05-26 23:19:09] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 23:19:09] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 23:19:09] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-26 23:19:09] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 23:19:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 23:19:09] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 23:19:09] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-26 23:19:09] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2026-05-26 23:19:09] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-26 23:19:09] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[15, 15, 13, 13, 15, 15, 15, 15] Max Struct:[21, 21, 21, 21, 21, 21, 21, 21]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[19, 19, 17, 17, 19, 19, 19, 19] Max Struct:[21, 21, 21, 21, 21, 21, 21, 21]
Support contains 8 out of 9 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 15 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Running 3 sub problems to find dead transitions.
[2026-05-26 23:19:09] [INFO ] Invariant cache hit.
[2026-05-26 23:19:09] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 3/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 9/18 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 16 constraints, problems are : Problem set: 0 solved, 3 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 9/9 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 3/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 9/18 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/18 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 19 constraints, problems are : Problem set: 0 solved, 3 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 9/9 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 141ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 151ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 9/9 places, 9/9 transitions.
[2026-05-26 23:19:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[19, 19, 17, 17, 19, 19, 19, 19] Max Struct:[21, 21, 21, 21, 21, 21, 21, 21]
RANDOM walk for 1000002 steps (2 resets) in 284 ms. (3508 steps per ms)
BEST_FIRST walk for 8000006 steps (16 resets) in 2055 ms. (3891 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[19, 19, 17, 17, 19, 19, 19, 19] Max Struct:[21, 21, 21, 21, 21, 21, 21, 21]
[2026-05-26 23:19:12] [INFO ] Invariant cache hit.
[2026-05-26 23:19:12] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 23:19:12] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 0 ms returned sat
[2026-05-26 23:19:12] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2026-05-26 23:19:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 23:19:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 23:19:12] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 23:19:12] [INFO ] [Nat]Absence check using state equation in 10 ms returned unsat
[2026-05-26 23:19:12] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 23:19:12] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 0 ms returned sat
[2026-05-26 23:19:12] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2026-05-26 23:19:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 23:19:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 23:19:12] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 23:19:12] [INFO ] [Nat]Absence check using state equation in 5 ms returned unsat
[2026-05-26 23:19:12] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2026-05-26 23:19:12] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 23:19:12] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-26 23:19:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 23:19:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 23:19:12] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 23:19:12] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2026-05-26 23:19:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-26 23:19:12] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2026-05-26 23:19:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2026-05-26 23:19:12] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-26 23:19:12] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 6 ms.
[2026-05-26 23:19:12] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-26 23:19:12] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 23:19:12] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2026-05-26 23:19:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 23:19:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-26 23:19:12] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 23:19:12] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2026-05-26 23:19:12] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2026-05-26 23:19:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2026-05-26 23:19:12] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-26 23:19:12] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 8 ms.
[2026-05-26 23:19:12] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 23:19:12] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 14 ms returned sat
[2026-05-26 23:19:12] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2026-05-26 23:19:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 23:19:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 23:19:12] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 23:19:12] [INFO ] [Nat]Absence check using state equation in 7 ms returned unsat
[2026-05-26 23:19:12] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 23:19:12] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 23:19:12] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2026-05-26 23:19:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 23:19:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 23:19:12] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 23:19:12] [INFO ] [Nat]Absence check using state equation in 6 ms returned unsat
[2026-05-26 23:19:12] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-26 23:19:12] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 23:19:12] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-26 23:19:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 23:19:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-26 23:19:12] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 23:19:12] [INFO ] [Nat]Absence check using state equation in 5 ms returned unsat
[2026-05-26 23:19:12] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 23:19:12] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 23:19:12] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2026-05-26 23:19:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 23:19:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 23:19:12] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 23:19:12] [INFO ] [Nat]Absence check using state equation in 5 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[19, 19, 17, 17, 19, 19, 19, 19] Max Struct:[19, 19, 21, 21, 19, 19, 19, 19]
FORMULA PGCD-PT-D02N006-UpperBounds-11 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D02N006-UpperBounds-14 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D02N006-UpperBounds-15 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D02N006-UpperBounds-10 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D02N006-UpperBounds-12 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D02N006-UpperBounds-09 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D02N006-UpperBounds-07 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D02N006-UpperBounds-06 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D02N006-UpperBounds-08 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D02N006-UpperBounds-13 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D02N006-UpperBounds-02 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D02N006-UpperBounds-01 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D02N006-UpperBounds-00 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[17, 17] Max Struct:[21, 21]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 9/9 places, 9/9 transitions.
[2026-05-26 23:19:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[17, 17] Max Struct:[21, 21]
RANDOM walk for 1000005 steps (2 resets) in 198 ms. (5025 steps per ms)
BEST_FIRST walk for 2000001 steps (4 resets) in 432 ms. (4618 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[17, 17] Max Struct:[21, 21]
[2026-05-26 23:19:13] [INFO ] Invariant cache hit.
[2026-05-26 23:19:13] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2026-05-26 23:19:13] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 23:19:13] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2026-05-26 23:19:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 23:19:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 23:19:13] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 23:19:13] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2026-05-26 23:19:13] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-26 23:19:13] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2026-05-26 23:19:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2026-05-26 23:19:13] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-26 23:19:13] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 10 ms.
[2026-05-26 23:19:13] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-26 23:19:13] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 23:19:13] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2026-05-26 23:19:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 23:19:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-26 23:19:13] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 23:19:13] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-26 23:19:13] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2026-05-26 23:19:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2026-05-26 23:19:13] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-26 23:19:13] [INFO ] Added : 2 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[17, 17] Max Struct:[21, 21]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[17, 17] Max Struct:[21, 21]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 9/9 places, 9/9 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2026-05-26 23:19:13] [INFO ] Invariant cache hit.
[2026-05-26 23:19:13] [INFO ] Implicit Places using invariants in 29 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 31 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 6/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 33 ms. Remains : 6/9 places, 9/9 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7557564022228726629.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3394720963942605159.kers'
[2026-05-26 23:19:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7557564022228726629.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3394720963942605159.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 9 rows 6 cols 24 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-26 23:19:13] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3394720963942605159.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[17, 17] Max Struct:[21, 21]
RANDOM walk for 1000000 steps (2 resets) in 267 ms. (3731 steps per ms)
BEST_FIRST walk for 2000001 steps (4 resets) in 358 ms. (5571 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[17, 17] Max Struct:[21, 21]
[2026-05-26 23:19:14] [INFO ] Invariant cache hit.
[2026-05-26 23:19:14] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 23:19:14] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2026-05-26 23:19:14] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 23:19:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 23:19:14] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2026-05-26 23:19:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-26 23:19:14] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2026-05-26 23:19:14] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-26 23:19:14] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 6 ms.
[2026-05-26 23:19:14] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 23:19:14] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2026-05-26 23:19:14] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 23:19:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 23:19:14] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-26 23:19:14] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2026-05-26 23:19:14] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-26 23:19:14] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[17, 17] Max Struct:[21, 21]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[17, 17] Max Struct:[21, 21]
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 6/6 places, 9/9 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6/6 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2026-05-26 23:19:14] [INFO ] Invariant cache hit.
[2026-05-26 23:19:14] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-26 23:19:14] [INFO ] Invariant cache hit.
[2026-05-26 23:19:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-26 23:19:14] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2026-05-26 23:19:14] [INFO ] Redundant transitions in 1 ms returned []
Running 3 sub problems to find dead transitions.
[2026-05-26 23:19:14] [INFO ] Invariant cache hit.
[2026-05-26 23:19:14] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 13 constraints, problems are : Problem set: 0 solved, 3 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 101ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 101ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 6/6 places, 9/9 transitions.
RANDOM walk for 40015 steps (8 resets) in 283 ms. (140 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 151 ms. (263 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 98 ms. (404 steps per ms) remains 4/4 properties
[2026-05-26 23:19:14] [INFO ] Flatten gal took : 14 ms
[2026-05-26 23:19:14] [INFO ] Flatten gal took : 3 ms
[2026-05-26 23:19:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7236020666885390774.gal : 7 ms
[2026-05-26 23:19:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5256460481058675554.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7236020666885390774.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5256460481058675554.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/ReachabilityCardinality5256460481058675554.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 60
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :60 after 161
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :2712 after 2875
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :11132 after 11206
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,15670,0.036166,4688,2,144,12,4149,10,0,50,4000,0
Total reachable state count : 15670

Verifying 4 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,0,0.036583,4824,1,0,12,4149,10,0,51,4000,0
Invariant property MIN0 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
MIN0,0,0.03685,4952,1,0,12,4149,10,0,51,4000,0
Reachability property MAX1 does not hold.
No reachable states exhibit your property : MAX1

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,0,0.036944,4952,1,0,12,4149,10,0,51,4000,0
Invariant property MIN1 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
MIN1,0,0.037031,4952,1,0,12,4149,10,0,51,4000,0
Probably explored full state space saw : 15670 states, properties seen :0
Probabilistic random walk after 101911 steps, saw 15670 distinct states, run finished after 336 ms. (steps per millisecond=303 ) properties seen :0
Explored full state space saw : 15670 states, properties seen :0
Exhaustive walk after 101911 steps, saw 15670 distinct states, run finished after 211 ms. (steps per millisecond=482 ) properties seen :0
FORMULA PGCD-PT-D02N006-UpperBounds-04 17 TECHNIQUES REACHABILITY_MIN
FORMULA PGCD-PT-D02N006-UpperBounds-03 17 TECHNIQUES REACHABILITY_MIN
FORMULA PGCD-PT-D02N006-UpperBounds-05 17 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
[2026-05-26 23:19:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (2 resets) in 162 ms. (6134 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 7283 ms.

BK_STOP 1779837555442

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

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