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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 7.0K Mar 6 15:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 6 15:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 6 15:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 6 15:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 09:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 09:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 6 15:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Mar 6 15:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 6 15:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 116K Mar 6 15:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 09:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 19 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 37K 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 DNAwalker-PT-03track12BlockBoth-UpperBounds-00
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-UpperBounds-01
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-UpperBounds-02
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-UpperBounds-03
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-UpperBounds-04
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-UpperBounds-05
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-UpperBounds-06
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-UpperBounds-07
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-UpperBounds-08
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-UpperBounds-09
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-UpperBounds-10
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-UpperBounds-11
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-UpperBounds-12
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-UpperBounds-13
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-UpperBounds-14
FORMULA_NAME DNAwalker-PT-03track12BlockBoth-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779664936204

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DNAwalker-PT-03track12BlockBoth
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-24 23:22:17] [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-24 23:22:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 23:22:17] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2026-05-24 23:22:17] [INFO ] Transformed 14 places.
[2026-05-24 23:22:17] [INFO ] Transformed 84 transitions.
[2026-05-24 23:22:17] [INFO ] Parsed PT model containing 14 places and 84 transitions and 244 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Reduction of identical properties reduced properties to check from 16 to 9
Current structural bounds on expressions (Initially) : Max Seen:[1, 2, 1, 1, 1, 1, 1, 1, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[1, 2, 1, 1, 1, 1, 1, 1, 0] Max Struct:[+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-15059273592523149303.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10737727689746012944.kers'
[2026-05-24 23:22:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15059273592523149303.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10737727689746012944.kers]
Normalized transition count is 82 out of 84 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 82 rows 14 cols 162 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-24 23:22:17] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10737727689746012944.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 2, 1, 1, 1, 1, 1, 1, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 10000 steps (1112 resets) in 36 ms. (270 steps per ms)
BEST_FIRST walk for 90009 steps (1728 resets) in 104 ms. (857 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2026-05-24 23:22:17] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15320388035968531858.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17431870354557070280.kers'
[2026-05-24 23:22:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15320388035968531858.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17431870354557070280.kers]
Normalized transition count is 82 out of 83 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 82 rows 14 cols 162 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-24 23:22:17] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17431870354557070280.kers
Total runtime 0 ms.
[2026-05-24 23:22:17] [INFO ] [Real]Absence check using state equation in 43 ms returned unsat
[2026-05-24 23:22:18] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2026-05-24 23:22:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:22:19] [INFO ] [Nat]Absence check using state equation in 1031 ms returned unknown
[2026-05-24 23:22:19] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2026-05-24 23:22:19] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:22:20] [INFO ] [Nat]Absence check using state equation in 1021 ms returned unknown
[2026-05-24 23:22:20] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2026-05-24 23:22:20] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:22:21] [INFO ] [Nat]Absence check using state equation in 1023 ms returned unknown
[2026-05-24 23:22:21] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2026-05-24 23:22:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:22:22] [INFO ] [Nat]Absence check using state equation in 1015 ms returned unknown
[2026-05-24 23:22:22] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2026-05-24 23:22:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:22:23] [INFO ] [Nat]Absence check using state equation in 1018 ms returned unknown
[2026-05-24 23:22:23] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2026-05-24 23:22:23] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:22:24] [INFO ] [Nat]Absence check using state equation in 1022 ms returned unknown
[2026-05-24 23:22:24] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2026-05-24 23:22:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:22:25] [INFO ] [Nat]Absence check using state equation in 1016 ms returned unknown
[2026-05-24 23:22:25] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2026-05-24 23:22:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:22:26] [INFO ] [Nat]Absence check using state equation in 1025 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1, 2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[1, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
FORMULA DNAwalker-PT-03track12BlockBoth-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-03track12BlockBoth-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-03track12BlockBoth-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 14 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 14/14 places, 84/84 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 14 transition count 80
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 13 transition count 79
Applied a total of 5 rules in 37 ms. Remains 13 /14 variables (removed 1) and now considering 79/84 (removed 5) transitions.
Running 74 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-12834087521164439549.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17306185125749565767.kers'
[2026-05-24 23:22:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12834087521164439549.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17306185125749565767.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 79 rows 13 cols 158 entries
Finished phase 1 with 13 SingleSign rule and 0 generalized
[2026-05-24 23:22:26] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17306185125749565767.kers
Total runtime 0 ms.
[2026-05-24 23:22:26] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 79/91 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 1/92 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 0/92 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 22 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1467 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 79/91 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 74/95 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 1/92 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/92 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 96 constraints, problems are : Problem set: 0 solved, 74 unsolved in 20016 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21599ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 21612ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21678 ms. Remains : 13/14 places, 79/84 transitions.
findPositiveTsemiflow completed in 10 ms - Net is bounded UNSAT
[2026-05-24 23:22:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (119052 resets) in 1363 ms. (733 steps per ms)
BEST_FIRST walk for 8000007 steps (178659 resets) in 2854 ms. (2802 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2026-05-24 23:22:52] [INFO ] Invariant cache hit.
[2026-05-24 23:22:52] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2026-05-24 23:22:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:23:01] [INFO ] [Nat]Absence check using state equation in 9017 ms returned unknown
[2026-05-24 23:23:01] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2026-05-24 23:23:01] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:23:08] [INFO ] [Nat]Absence check using state equation in 6850 ms returned unsat
[2026-05-24 23:23:08] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2026-05-24 23:23:08] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:23:17] [INFO ] [Nat]Absence check using state equation in 8931 ms returned unsat
[2026-05-24 23:23:17] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2026-05-24 23:23:17] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:23:26] [INFO ] [Nat]Absence check using state equation in 9019 ms returned unknown
[2026-05-24 23:23:26] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2026-05-24 23:23:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:23:35] [INFO ] [Nat]Absence check using state equation in 9011 ms returned unknown
[2026-05-24 23:23:35] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2026-05-24 23:23:35] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:23:42] [INFO ] [Nat]Absence check using state equation in 6029 ms returned unsat
[2026-05-24 23:23:42] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2026-05-24 23:23:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:23:48] [INFO ] [Nat]Absence check using state equation in 5953 ms returned unsat
[2026-05-24 23:23:48] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2026-05-24 23:23:48] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:23:57] [INFO ] [Nat]Absence check using state equation in 9015 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, 2, 2, +inf, +inf, 2, 2, +inf]
FORMULA DNAwalker-PT-03track12BlockBoth-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-03track12BlockBoth-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-03track12BlockBoth-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-03track12BlockBoth-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-03track12BlockBoth-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-03track12BlockBoth-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-03track12BlockBoth-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf]
Support contains 4 out of 13 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13/13 places, 79/79 transitions.
Applied a total of 0 rules in 7 ms. Remains 13 /13 variables (removed 0) and now considering 79/79 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 13/13 places, 79/79 transitions.
findPositiveTsemiflow completed in 5 ms - Net is bounded UNSAT
[2026-05-24 23:23:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (118903 resets) in 1233 ms. (810 steps per ms)
BEST_FIRST walk for 4000003 steps (96915 resets) in 1426 ms. (2803 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf]
[2026-05-24 23:23:59] [INFO ] Invariant cache hit.
[2026-05-24 23:23:59] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2026-05-24 23:23:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:24:08] [INFO ] [Nat]Absence check using state equation in 9016 ms returned unknown
[2026-05-24 23:24:08] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2026-05-24 23:24:08] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:24:17] [INFO ] [Nat]Absence check using state equation in 9020 ms returned unknown
[2026-05-24 23:24:17] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2026-05-24 23:24:17] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:24:27] [INFO ] [Nat]Absence check using state equation in 9015 ms returned unknown
[2026-05-24 23:24:27] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2026-05-24 23:24:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:24:36] [INFO ] [Nat]Absence check using state equation in 8968 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, 2]
FORMULA DNAwalker-PT-03track12BlockBoth-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 2] Max Struct:[+inf, +inf, +inf]
Support contains 3 out of 13 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13/13 places, 79/79 transitions.
Graph (complete) has 79 edges and 13 vertex of which 12 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 12 transition count 76
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 11 transition count 75
Applied a total of 5 rules in 17 ms. Remains 11 /13 variables (removed 2) and now considering 75/79 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 11/13 places, 75/79 transitions.
findPositiveTsemiflow completed in 14 ms - Net is bounded UNSAT
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3210984571926524801.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2223105385014745141.kers'
[2026-05-24 23:24:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3210984571926524801.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2223105385014745141.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 75 rows 11 cols 150 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-24 23:24:36] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2223105385014745141.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 2] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 1000000 steps (117299 resets) in 1251 ms. (798 steps per ms)
BEST_FIRST walk for 3000003 steps (82038 resets) in 1057 ms. (2835 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 2] Max Struct:[+inf, +inf, +inf]
[2026-05-24 23:24:38] [INFO ] Invariant cache hit.
[2026-05-24 23:24:38] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2026-05-24 23:24:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:24:42] [INFO ] [Nat]Absence check using state equation in 4514 ms returned unknown
[2026-05-24 23:24:43] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2026-05-24 23:24:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:24:47] [INFO ] [Nat]Absence check using state equation in 4510 ms returned unknown
[2026-05-24 23:24:47] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2026-05-24 23:24:47] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:24:52] [INFO ] [Nat]Absence check using state equation in 4516 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 2] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 2] Max Struct:[+inf, +inf, +inf]
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11/11 places, 75/75 transitions.
Applied a total of 0 rules in 5 ms. Remains 11 /11 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 11/11 places, 75/75 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11/11 places, 75/75 transitions.
Applied a total of 0 rules in 4 ms. Remains 11 /11 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2026-05-24 23:24:52] [INFO ] Invariant cache hit.
[2026-05-24 23:24:52] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-24 23:24:52] [INFO ] Invariant cache hit.
[2026-05-24 23:24:52] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2026-05-24 23:24:52] [INFO ] Redundant transitions in 1 ms returned []
Running 70 sub problems to find dead transitions.
[2026-05-24 23:24:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 75/86 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (OVERLAPS) 0/86 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 11 constraints, problems are : Problem set: 0 solved, 70 unsolved in 525 ms.
Refiners :[State Equation: 11/11 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 75/86 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 70/81 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 0/86 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 81 constraints, problems are : Problem set: 0 solved, 70 unsolved in 30011 ms.
Refiners :[State Equation: 11/11 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30561ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 30563ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30657 ms. Remains : 11/11 places, 75/75 transitions.
findPositiveTsemiflow completed in 7 ms - Net is bounded UNSAT
RANDOM walk for 40000 steps (4674 resets) in 667 ms. (59 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (927 resets) in 91 ms. (434 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (920 resets) in 117 ms. (339 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1416 resets) in 128 ms. (310 steps per ms) remains 3/3 properties
Probably explored full state space saw : 2328 states, properties seen :0
Probabilistic random walk after 9176 steps, saw 2328 distinct states, run finished after 63 ms. (steps per millisecond=145 ) properties seen :0
Explored full state space saw : 2328 states, properties seen :0
Exhaustive walk after 9176 steps, saw 2328 distinct states, run finished after 40 ms. (steps per millisecond=229 ) properties seen :0
[2026-05-24 23:25:23] [INFO ] Flatten gal took : 36 ms
[2026-05-24 23:25:23] [INFO ] Flatten gal took : 21 ms
[2026-05-24 23:25:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4554475568266182974.gal : 14 ms
[2026-05-24 23:25:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8041574372999868038.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4554475568266182974.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8041574372999868038.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA DNAwalker-PT-03track12BlockBoth-UpperBounds-14 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-03track12BlockBoth-UpperBounds-01 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-03track12BlockBoth-UpperBounds-04 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-03track12BlockBoth-UpperBounds-12 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-03track12BlockBoth-UpperBounds-05 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
[2026-05-24 23:25:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (117353 resets) in 1190 ms. (839 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 187252 ms.

BK_STOP 1779665124673

--------------------
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="DNAwalker-PT-03track12BlockBoth"
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 DNAwalker-PT-03track12BlockBoth, 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-177955695800781"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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