Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.6K Mar 7 11:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Mar 7 11:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 7 11:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 11:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Mar 15 10:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 10:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 15 10:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 10:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 11:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Mar 7 11:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 7 11:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Mar 7 11:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1 Mar 3 18:30 large_marking
-rw-r--r-- 1 mcc users 21K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779711982315

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0010N0000000010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 12:26:23] [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-25 12:26:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 12:26:23] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2026-05-25 12:26:23] [INFO ] Transformed 33 places.
[2026-05-25 12:26:23] [INFO ] Transformed 22 transitions.
[2026-05-25 12:26:23] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 122 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 70, 0, 1, 0, 0, 10, 0, 0, 0, 0, 0, 20, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 70, 0, 1, 0, 0, 10, 0, 0, 0, 0, 0, 20, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +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-12992739361715961545.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16143059716677659474.kers'
[2026-05-25 12:26:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12992739361715961545.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16143059716677659474.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 22 rows 27 cols 71 entries
Finished phase 1 with 13 SingleSign rule and 8 generalized
[2026-05-25 12:26:23] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16143059716677659474.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 70, 0, 1, 0, 0, 10, 0, 0, 0, 0, 0, 20, 0, 0, 0] Max Struct:[130, 70, 20, 1, 277, 130, 10, 20, 30, 70, 20, 20, 20, 50, 65, 20]
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-12 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-01 70 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10007 steps (23 resets) in 18 ms. (526 steps per ms)
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-09 70 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-08 30 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-02 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90007 steps (30 resets) in 118 ms. (756 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[37, 40, 4, 10, 10, 10, 2, 4, 10] Max Struct:[130, 277, 130, 20, 20, 20, 50, 65, 20]
[2026-05-25 12:26:23] [INFO ] Invariant cache hit.
[2026-05-25 12:26:23] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-25 12:26:24] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 7 ms returned sat
[2026-05-25 12:26:24] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2026-05-25 12:26:24] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-25 12:26:24] [INFO ] Added : 5 causal constraints over 1 iterations in 40 ms. Result :sat
Minimization took 13 ms.
[2026-05-25 12:26:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 12:26:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-25 12:26:24] [INFO ] [Nat]Absence check using 8 positive and 4 generalized place invariants in 27 ms returned sat
[2026-05-25 12:26:24] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2026-05-25 12:26:24] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 12:26:24] [INFO ] Added : 5 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 37 ms.
[2026-05-25 12:26:24] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-25 12:26:24] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 1 ms returned unsat
[2026-05-25 12:26:24] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-25 12:26:24] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 3 ms returned sat
[2026-05-25 12:26:24] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
[2026-05-25 12:26:24] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-25 12:26:24] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 12:26:24] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2026-05-25 12:26:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 12:26:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-25 12:26:24] [INFO ] [Nat]Absence check using 8 positive and 4 generalized place invariants in 2 ms returned sat
[2026-05-25 12:26:24] [INFO ] [Nat]Absence check using state equation in 31 ms returned unsat
[2026-05-25 12:26:24] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-25 12:26:24] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 12:26:24] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2026-05-25 12:26:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 12:26:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2026-05-25 12:26:24] [INFO ] [Nat]Absence check using 8 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 12:26:24] [INFO ] [Nat]Absence check using state equation in 32 ms returned unsat
[2026-05-25 12:26:24] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-25 12:26:24] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 12:26:24] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2026-05-25 12:26:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 12:26:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-25 12:26:24] [INFO ] [Nat]Absence check using 8 positive and 4 generalized place invariants in 2 ms returned sat
[2026-05-25 12:26:24] [INFO ] [Nat]Absence check using state equation in 28 ms returned unsat
[2026-05-25 12:26:24] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2026-05-25 12:26:24] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 2 ms returned unsat
[2026-05-25 12:26:24] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-25 12:26:24] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 12:26:24] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
[2026-05-25 12:26:24] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-25 12:26:24] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 2 ms returned sat
[2026-05-25 12:26:24] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2026-05-25 12:26:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 12:26:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-25 12:26:25] [INFO ] [Nat]Absence check using 8 positive and 4 generalized place invariants in 3 ms returned sat
[2026-05-25 12:26:25] [INFO ] [Nat]Absence check using state equation in 39 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[37, 40, 4, 10, 10, 10, 2, 4, 10] Max Struct:[130, 40, 4, 10, 10, 10, 2, 4, 10]
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-14 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-04 40 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[37] Max Struct:[130]
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 24 transition count 14
Applied a total of 15 rules in 35 ms. Remains 24 /33 variables (removed 9) and now considering 14/22 (removed 8) transitions.
Running 13 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16592140669950908203.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11384647119312144195.kers'
[2026-05-25 12:26:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16592140669950908203.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11384647119312144195.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 14 rows 19 cols 49 entries
Finished phase 1 with 10 SingleSign rule and 4 generalized
[2026-05-25 12:26:25] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11384647119312144195.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem TDEAD13 is UNSAT
At refinement iteration 4 (OVERLAPS) 14/38 variables, 24/34 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 34 constraints, problems are : Problem set: 1 solved, 12 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 1/24 variables, 2/10 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 14/38 variables, 24/34 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 12/46 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/38 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 46 constraints, problems are : Problem set: 1 solved, 12 unsolved in 6552 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 12/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6775ms problems are : Problem set: 1 solved, 12 unsolved
Search for dead transitions found 1 dead transitions in 6787ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 24/33 places, 13/22 transitions.
Graph (complete) has 62 edges and 24 vertex of which 23 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 23 /24 variables (removed 1) and now considering 13/13 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6844 ms. Remains : 23/33 places, 13/22 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7562354694156404046.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17106903423034561592.kers'
[2026-05-25 12:26:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7562354694156404046.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17106903423034561592.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 13 rows 18 cols 44 entries
Finished phase 1 with 9 SingleSign rule and 4 generalized
[2026-05-25 12:26:31] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17106903423034561592.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[37] Max Struct:[110]
RANDOM walk for 1000015 steps (5487 resets) in 401 ms. (2487 steps per ms)
BEST_FIRST walk for 1000000 steps (1902 resets) in 431 ms. (2314 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[38] Max Struct:[110]
[2026-05-25 12:26:32] [INFO ] Invariant cache hit.
[2026-05-25 12:26:32] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 12:26:32] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-25 12:26:32] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[38] Max Struct:[38]
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-00 38 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 9382 ms.

BK_STOP 1779711992901

--------------------
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="GPPP-PT-C0010N0000000010"
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 GPPP-PT-C0010N0000000010, 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 r146-tall-177961074100293"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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