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-177961074100261.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-C0001N0000000100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074100261
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.9K Mar 7 11:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Mar 7 11:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Mar 7 11:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 7 11:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 15 10:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Mar 7 11:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Mar 7 11:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 7 11:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Mar 7 11:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:30 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-C0001N0000000100-UpperBounds-00
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-01
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-02
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-03
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-04
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-05
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-06
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-07
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-08
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-09
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-10
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-11
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-12
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-13
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-14
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779708813768

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-C0001N0000000100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 11:33:34] [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 11:33:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 11:33:35] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2026-05-25 11:33:35] [INFO ] Transformed 33 places.
[2026-05-25 11:33:35] [INFO ] Transformed 22 transitions.
[2026-05-25 11:33:35] [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, 0, 0, 0, 0, 100, 0, 0, 7, 0, 0, 0, 0, 0, 1, 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, 0, 0, 0, 0, 100, 0, 0, 7, 0, 0, 0, 0, 0, 1, 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-5188465496745435829.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8586911528831658217.kers'
[2026-05-25 11:33:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5188465496745435829.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8586911528831658217.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 7 generalized
[2026-05-25 11:33:35] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8586911528831658217.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 100, 0, 0, 7, 0, 0, 0, 0, 0, 1, 0] Max Struct:[4, 2, 3, 8, 7, 100, 4, 200, 7, 4, 4, 2, 200, 200, 1, 200]
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-08 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-05 100 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (2 resets) in 21 ms. (454 steps per ms)
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-04 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110009 steps (22 resets) in 125 ms. (873 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 1, 1, 7, 3, 7, 2, 1, 7, 7, 84] Max Struct:[4, 2, 3, 8, 4, 200, 4, 2, 200, 200, 200]
[2026-05-25 11:33:35] [INFO ] Invariant cache hit.
[2026-05-25 11:33:35] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2026-05-25 11:33:35] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 9 ms returned unsat
[2026-05-25 11:33:35] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-25 11:33:35] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned unsat
[2026-05-25 11:33:35] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 11:33:35] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 4 ms returned sat
[2026-05-25 11:33:35] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2026-05-25 11:33:35] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:33:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 11:33:35] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 7 ms returned sat
[2026-05-25 11:33:35] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2026-05-25 11:33:35] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-25 11:33:35] [INFO ] Added : 19 causal constraints over 4 iterations in 50 ms. Result :sat
Minimization took 14 ms.
[2026-05-25 11:33:35] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-25 11:33:35] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned unsat
[2026-05-25 11:33:35] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-25 11:33:35] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned unsat
[2026-05-25 11:33:35] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 11:33:35] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned unsat
[2026-05-25 11:33:35] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-25 11:33:35] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned unsat
[2026-05-25 11:33:35] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 11:33:35] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned unsat
[2026-05-25 11:33:35] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 11:33:35] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned unsat
[2026-05-25 11:33:35] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 11:33:35] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned unsat
[2026-05-25 11:33:35] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 11:33:35] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2026-05-25 11:33:35] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2026-05-25 11:33:35] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:33:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-25 11:33:35] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2026-05-25 11:33:36] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2026-05-25 11:33:36] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 11:33:36] [INFO ] Added : 20 causal constraints over 4 iterations in 23 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 1, 1, 7, 3, 7, 2, 1, 7, 7, 84] Max Struct:[3, 1, 3, 7, 3, 7, 2, 1, 7, 7, 200]
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-13 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-12 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-10 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-07 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-15 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[3]
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 34 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-1494474855051266069.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7652208311607547209.kers'
[2026-05-25 11:33:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1494474855051266069.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7652208311607547209.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 9 SingleSign rule and 4 generalized
[2026-05-25 11:33:36] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7652208311607547209.kers
Total runtime 1 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 14/38 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 35 constraints, problems are : Problem set: 0 solved, 13 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 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: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 14/38 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 13/48 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 48 constraints, problems are : Problem set: 0 solved, 13 unsolved in 692 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 937ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 946ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1000 ms. Remains : 24/33 places, 14/22 transitions.
[2026-05-25 11:33:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[3]
RANDOM walk for 1000006 steps (2 resets) in 415 ms. (2403 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 406 ms. (2457 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[3]
[2026-05-25 11:33:38] [INFO ] Invariant cache hit.
[2026-05-25 11:33:38] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 11:33:38] [INFO ] [Real]Absence check using 7 positive and 4 generalized place invariants in 2 ms returned sat
[2026-05-25 11:33:38] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-25 11:33:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:33:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 11:33:38] [INFO ] [Nat]Absence check using 7 positive and 4 generalized place invariants in 2 ms returned sat
[2026-05-25 11:33:38] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2026-05-25 11:33:38] [INFO ] Computed and/alt/rep : 13/26/13 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 11:33:38] [INFO ] Added : 13 causal constraints over 3 iterations in 16 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[3]
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 24/24 places, 14/14 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2026-05-25 11:33:38] [INFO ] Invariant cache hit.
[2026-05-25 11:33:38] [INFO ] Implicit Places using invariants in 48 ms returned [0, 1, 2, 3, 13]
[2026-05-25 11:33:38] [INFO ] Actually due to overlaps returned [1, 13, 0, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 50 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 20/24 places, 14/14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 18 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 18 transition count 11
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 6 place count 17 transition count 11
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 11 place count 14 transition count 9
Applied a total of 11 rules in 5 ms. Remains 14 /20 variables (removed 6) and now considering 9/14 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10349137794044132150.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15940031460151386396.kers'
[2026-05-25 11:33:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10349137794044132150.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15940031460151386396.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 9 rows 11 cols 28 entries
Finished phase 1 with 7 SingleSign rule and 1 generalized
[2026-05-25 11:33:38] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15940031460151386396.kers
Total runtime 0 ms.
[2026-05-25 11:33:38] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-25 11:33:38] [INFO ] Invariant cache hit.
[2026-05-25 11:33:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 11:33:38] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 14/24 places, 9/14 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 125 ms. Remains : 14/24 places, 9/14 transitions.
[2026-05-25 11:33:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[3]
RANDOM walk for 1000000 steps (2 resets) in 282 ms. (3533 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 266 ms. (3745 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[3]
[2026-05-25 11:33:39] [INFO ] Invariant cache hit.
[2026-05-25 11:33:39] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2026-05-25 11:33:39] [INFO ] [Real]Absence check using 5 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 11:33:39] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2026-05-25 11:33:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:33:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-25 11:33:39] [INFO ] [Nat]Absence check using 5 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 11:33:39] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2026-05-25 11:33:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 11:33:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 11:33:39] [INFO ] Computed and/alt/rep : 8/18/8 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 11:33:39] [INFO ] Added : 8 causal constraints over 3 iterations in 9 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[3]
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 14/14 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 14/14 places, 9/9 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 14/14 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2026-05-25 11:33:39] [INFO ] Invariant cache hit.
[2026-05-25 11:33:39] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-25 11:33:39] [INFO ] Invariant cache hit.
[2026-05-25 11:33:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 11:33:39] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2026-05-25 11:33:39] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2026-05-25 11:33:39] [INFO ] Invariant cache hit.
[2026-05-25 11:33:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1/14 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 9/23 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 21 constraints, problems are : Problem set: 0 solved, 8 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1/14 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 9/23 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/23 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 29 constraints, problems are : Problem set: 0 solved, 8 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 292ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 298ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 367 ms. Remains : 14/14 places, 9/9 transitions.
RANDOM walk for 40005 steps (8 resets) in 379 ms. (105 steps per ms) remains 2/2 properties
[2026-05-25 11:33:39] [INFO ] Flatten gal took : 20 ms
[2026-05-25 11:33:39] [INFO ] Flatten gal took : 3 ms
BEST_FIRST walk for 40000 steps (8 resets) in 201 ms. (198 steps per ms) remains 2/2 properties
[2026-05-25 11:33:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17304005224516831899.gal : 3 ms
[2026-05-25 11:33:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18176113333540715844.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/ReachabilityCardinality17304005224516831899.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18176113333540715844.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality18176113333540715844.prop.
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 11
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 34
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,37,0.013918,4172,2,102,9,320,8,0,74,177,0
Total reachable state count : 37

Verifying 2 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.0141,4216,1,0,9,320,8,0,75,177,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.014206,4216,1,0,9,320,8,0,75,177,0
BEST_FIRST walk for 40002 steps (8 resets) in 205 ms. (194 steps per ms) remains 2/2 properties
Probably explored full state space saw : 37 states, properties seen :0
Probabilistic random walk after 93 steps, saw 37 distinct states, run finished after 7 ms. (steps per millisecond=13 ) properties seen :0
Explored full state space saw : 37 states, properties seen :0
Exhaustive walk after 93 steps, saw 37 distinct states, run finished after 2 ms. (steps per millisecond=46 ) properties seen :0
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-02 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
[2026-05-25 11:33:39] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (2 resets) in 309 ms. (3225 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 5265 ms.

BK_STOP 1779708820245

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-C0001N0000000100"
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-C0001N0000000100, 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-177961074100261"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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