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.r098-tall-177955695800853.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 DoubleExponent-PT-001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695800853
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.6K Mar 6 16:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 6 16:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 6 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 6 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 09:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 09:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 09:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 6 16:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Mar 6 16:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Mar 6 16:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Mar 6 16:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 17K 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 DoubleExponent-PT-001-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779675658992

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-001
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 02:21:00] [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 02:21:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 02:21:00] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2026-05-25 02:21:00] [INFO ] Transformed 57 places.
[2026-05-25 02:21:00] [INFO ] Transformed 48 transitions.
[2026-05-25 02:21:00] [INFO ] Parsed PT model containing 57 places and 48 transitions and 135 arcs in 128 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, 0, 0, 0, 0, 0, 0, 0, 0, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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-14954253194874451795.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8453646551732361545.kers'
[2026-05-25 02:21:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14954253194874451795.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8453646551732361545.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 48 rows 57 cols 135 entries
Finished phase 1 with 41 SingleSign rule and 7 generalized
[2026-05-25 02:21:00] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8453646551732361545.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 2, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (320 resets) in 38 ms. (256 steps per ms)
FORMULA DoubleExponent-PT-001-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20000 steps (585 resets) in 43 ms. (454 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 2] Max Struct:[1, 4]
[2026-05-25 02:21:00] [INFO ] Invariant cache hit.
[2026-05-25 02:21:00] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2026-05-25 02:21:00] [INFO ] [Real]Absence check using 5 positive and 4 generalized place invariants in 5 ms returned sat
[2026-05-25 02:21:00] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2026-05-25 02:21:00] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:21:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-25 02:21:00] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:21:00] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2026-05-25 02:21:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2026-05-25 02:21:00] [INFO ] Computed and/alt/rep : 47/88/47 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-25 02:21:00] [INFO ] Added : 46 causal constraints over 10 iterations in 75 ms. Result :sat
Minimization took 23 ms.
[2026-05-25 02:21:01] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-25 02:21:01] [INFO ] [Real]Absence check using 5 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:21:01] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2026-05-25 02:21:01] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:21:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-25 02:21:01] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-25 02:21:01] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2026-05-25 02:21:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 148 ms
[2026-05-25 02:21:01] [INFO ] Computed and/alt/rep : 47/88/47 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 02:21:01] [INFO ] Added : 42 causal constraints over 9 iterations in 48 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 2] Max Struct:[1, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 2] Max Struct:[1, 4]
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 48/48 transitions.
Graph (complete) has 87 edges and 57 vertex of which 53 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 53 transition count 38
Reduce places removed 10 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 43 transition count 36
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 25 place count 41 transition count 36
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 25 place count 41 transition count 34
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 29 place count 39 transition count 34
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 51 place count 28 transition count 23
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 28 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 53 place count 27 transition count 22
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 56 place count 27 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 57 place count 26 transition count 21
Applied a total of 57 rules in 43 ms. Remains 26 /57 variables (removed 31) and now considering 21/48 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 26/57 places, 21/48 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6670847746436930860.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2483163630156222972.kers'
[2026-05-25 02:21:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6670847746436930860.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2483163630156222972.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 21 rows 24 cols 73 entries
Finished phase 1 with 15 SingleSign rule and 5 generalized
[2026-05-25 02:21:01] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2483163630156222972.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 2] Max Struct:[1, 4]
RANDOM walk for 1000000 steps (113988 resets) in 635 ms. (1572 steps per ms)
FORMULA DoubleExponent-PT-001-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (78483 resets) in 407 ms. (2450 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[4]
[2026-05-25 02:21:02] [INFO ] Invariant cache hit.
[2026-05-25 02:21:02] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 02:21:02] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-25 02:21:02] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2026-05-25 02:21:02] [INFO ] Computed and/alt/rep : 20/52/20 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 02:21:02] [INFO ] Added : 10 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[4]
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 21/21 transitions.
Graph (complete) has 67 edges and 26 vertex of which 24 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 24 transition count 19
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 24 transition count 19
Applied a total of 4 rules in 4 ms. Remains 24 /26 variables (removed 2) and now considering 19/21 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 24/26 places, 19/21 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11380500951871559495.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11108684968146935398.kers'
[2026-05-25 02:21:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11380500951871559495.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11108684968146935398.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 19 rows 22 cols 67 entries
Finished phase 1 with 18 SingleSign rule and 0 generalized
[2026-05-25 02:21:02] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11108684968146935398.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[3]
RANDOM walk for 1000000 steps (114864 resets) in 485 ms. (2057 steps per ms)
BEST_FIRST walk for 1000001 steps (78644 resets) in 377 ms. (2645 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[3]
[2026-05-25 02:21:03] [INFO ] Invariant cache hit.
[2026-05-25 02:21:03] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:21:03] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2026-05-25 02:21:03] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:21:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 02:21:03] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2026-05-25 02:21:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2026-05-25 02:21:03] [INFO ] Computed and/alt/rep : 18/49/18 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 02:21:03] [INFO ] Added : 10 causal constraints over 2 iterations in 43 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[3]
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 19/19 transitions.
Applied a total of 0 rules in 4 ms. Remains 24 /24 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 24/24 places, 19/19 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 19/19 transitions.
Applied a total of 0 rules in 3 ms. Remains 24 /24 variables (removed 0) and now considering 19/19 (removed 0) transitions.
[2026-05-25 02:21:03] [INFO ] Invariant cache hit.
[2026-05-25 02:21:03] [INFO ] Implicit Places using invariants in 53 ms returned [6, 13]
[2026-05-25 02:21:03] [INFO ] Actually due to overlaps returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 23/24 places, 19/19 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 18/19 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6638572351125650425.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5945395815660931599.kers'
[2026-05-25 02:21:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6638572351125650425.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5945395815660931599.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 18 rows 20 cols 60 entries
Finished phase 1 with 17 SingleSign rule and 0 generalized
[2026-05-25 02:21:03] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5945395815660931599.kers
Total runtime 0 ms.
[2026-05-25 02:21:03] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-25 02:21:03] [INFO ] Invariant cache hit.
[2026-05-25 02:21:03] [INFO ] Implicit Places using invariants and state equation in 38 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 73 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 21/24 places, 18/19 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 20 transition count 17
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 20 transition count 17
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 20 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 18 transition count 15
Applied a total of 6 rules in 4 ms. Remains 18 /21 variables (removed 3) and now considering 15/18 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1020212453102815250.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1060650022148488750.kers'
[2026-05-25 02:21:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1020212453102815250.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1060650022148488750.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 15 rows 16 cols 50 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-25 02:21:03] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1060650022148488750.kers
Total runtime 0 ms.
[2026-05-25 02:21:03] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-25 02:21:03] [INFO ] Invariant cache hit.
[2026-05-25 02:21:04] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 18/24 places, 15/19 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 202 ms. Remains : 18/24 places, 15/19 transitions.
[2026-05-25 02:21:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[3]
RANDOM walk for 1000000 steps (124029 resets) in 432 ms. (2309 steps per ms)
BEST_FIRST walk for 1000001 steps (82986 resets) in 334 ms. (2985 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[3]
[2026-05-25 02:21:04] [INFO ] Invariant cache hit.
[2026-05-25 02:21:04] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-25 02:21:04] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-25 02:21:04] [INFO ] Computed and/alt/rep : 14/33/14 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 02:21:04] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:21:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-25 02:21:04] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-25 02:21:04] [INFO ] Computed and/alt/rep : 14/33/14 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 02:21:04] [INFO ] Added : 11 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[3]
Support contains 1 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 18/18 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2026-05-25 02:21:04] [INFO ] Invariant cache hit.
[2026-05-25 02:21:04] [INFO ] Implicit Places using invariants in 25 ms returned []
[2026-05-25 02:21:04] [INFO ] Invariant cache hit.
[2026-05-25 02:21:04] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2026-05-25 02:21:04] [INFO ] Redundant transitions in 0 ms returned []
Running 14 sub problems to find dead transitions.
[2026-05-25 02:21:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/18 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 15/33 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 0/33 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 33/33 variables, and 22 constraints, problems are : Problem set: 0 solved, 14 unsolved in 233 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/18 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 15/33 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/33 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 33/33 variables, and 39 constraints, problems are : Problem set: 0 solved, 14 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 538ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 545ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5455 ms. Remains : 18/18 places, 15/15 transitions.
RANDOM walk for 40000 steps (4947 resets) in 577 ms. (69 steps per ms) remains 2/2 properties
[2026-05-25 02:21:10] [INFO ] Flatten gal took : 17 ms
[2026-05-25 02:21:10] [INFO ] Flatten gal took : 4 ms
[2026-05-25 02:21:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7758418989944153875.gal : 4 ms
[2026-05-25 02:21:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10347318381977776214.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/ReachabilityCardinality7758418989944153875.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10347318381977776214.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 ...329
Loading property file /tmp/ReachabilityCardinality10347318381977776214.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 9
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :20 after 22
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :43 after 44
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,50,0.014927,4256,2,105,11,489,8,0,93,388,0
Total reachable state count : 50

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.015203,4320,1,0,11,489,8,0,94,388,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.015309,4320,1,0,11,489,8,0,94,388,0
BEST_FIRST walk for 40002 steps (3338 resets) in 219 ms. (181 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3310 resets) in 164 ms. (242 steps per ms) remains 2/2 properties
Probably explored full state space saw : 50 states, properties seen :0
Probabilistic random walk after 99 steps, saw 50 distinct states, run finished after 11 ms. (steps per millisecond=9 ) properties seen :0
Explored full state space saw : 50 states, properties seen :0
Exhaustive walk after 99 steps, saw 50 distinct states, run finished after 3 ms. (steps per millisecond=33 ) properties seen :0
FORMULA DoubleExponent-PT-001-UpperBounds-06 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
[2026-05-25 02:21:10] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (123945 resets) in 407 ms. (2450 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 10904 ms.

BK_STOP 1779675671124

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ 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="DoubleExponent-PT-001"
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 DoubleExponent-PT-001, 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 r098-tall-177955695800853"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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