Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r194-tall-177969914300669.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 Peterson-COL-4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914300669
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 8.2K Mar 8 07:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 8 07:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 8 07:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 8 07:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Mar 16 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 16 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 16 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 16 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 8 07:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Mar 8 07:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 8 07:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 8 07:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 16 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 16 08:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 44K 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 Peterson-COL-4-UpperBounds-00
FORMULA_NAME Peterson-COL-4-UpperBounds-01
FORMULA_NAME Peterson-COL-4-UpperBounds-02
FORMULA_NAME Peterson-COL-4-UpperBounds-03
FORMULA_NAME Peterson-COL-4-UpperBounds-04
FORMULA_NAME Peterson-COL-4-UpperBounds-05
FORMULA_NAME Peterson-COL-4-UpperBounds-06
FORMULA_NAME Peterson-COL-4-UpperBounds-07
FORMULA_NAME Peterson-COL-4-UpperBounds-08
FORMULA_NAME Peterson-COL-4-UpperBounds-09
FORMULA_NAME Peterson-COL-4-UpperBounds-10
FORMULA_NAME Peterson-COL-4-UpperBounds-11
FORMULA_NAME Peterson-COL-4-UpperBounds-12
FORMULA_NAME Peterson-COL-4-UpperBounds-13
FORMULA_NAME Peterson-COL-4-UpperBounds-14
FORMULA_NAME Peterson-COL-4-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779808351149

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-4
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202604301425
[2026-05-26 15:12:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 15:12:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 15:12:32] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2026-05-26 15:12:32] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-26 15:12:32] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 529 ms
[2026-05-26 15:12:32] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 500 PT places and 795.0 transition bindings in 21 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 8
[2026-05-26 15:12:32] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 4 ms.
[2026-05-26 15:12:32] [INFO ] Skeletonized 8 HLPN properties in 0 ms.
Reduce places removed 2 places and 0 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4485190668511189054.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11708200186969053358.kers'
[2026-05-26 15:12:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4485190668511189054.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11708200186969053358.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 14 rows 9 cols 28 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-26 15:12:33] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11708200186969053358.kers
Total runtime 1 ms.
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 4, 0, 0, 0, 5, 0] Max Struct:[5, 5, 4, 5, 5, 5, 5, 5]
FORMULA Peterson-COL-4-UpperBounds-09 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-4-UpperBounds-07 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-4-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-4-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2026-05-26 15:12:33] [INFO ] Invariant cache hit.
[2026-05-26 15:12:33] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2026-05-26 15:12:33] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2026-05-26 15:12:33] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-26 15:12:33] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 15:12:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 15:12:33] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2026-05-26 15:12:33] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-26 15:12:33] [INFO ] Added : 12 causal constraints over 4 iterations in 27 ms. Result :sat
Minimization took 6 ms.
[2026-05-26 15:12:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 15:12:33] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-26 15:12:33] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-26 15:12:33] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 15:12:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2026-05-26 15:12:33] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2026-05-26 15:12:33] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-26 15:12:33] [INFO ] Added : 11 causal constraints over 5 iterations in 34 ms. Result :sat
Minimization took 10 ms.
[2026-05-26 15:12:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 15:12:33] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2026-05-26 15:12:33] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-26 15:12:33] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 15:12:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2026-05-26 15:12:33] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2026-05-26 15:12:33] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-26 15:12:33] [INFO ] Added : 11 causal constraints over 4 iterations in 19 ms. Result :sat
Minimization took 5 ms.
[2026-05-26 15:12:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 15:12:33] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-26 15:12:33] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-26 15:12:33] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 15:12:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 15:12:33] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2026-05-26 15:12:33] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-26 15:12:33] [INFO ] Added : 11 causal constraints over 5 iterations in 15 ms. Result :sat
Minimization took 4 ms.
[2026-05-26 15:12:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 15:12:33] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2026-05-26 15:12:33] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-26 15:12:33] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 15:12:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-26 15:12:33] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2026-05-26 15:12:33] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-26 15:12:33] [INFO ] Added : 11 causal constraints over 3 iterations in 9 ms. Result :sat
Minimization took 3 ms.
[2026-05-26 15:12:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 15:12:33] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2026-05-26 15:12:33] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-26 15:12:33] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 15:12:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-26 15:12:33] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-26 15:12:33] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-26 15:12:33] [INFO ] Added : 11 causal constraints over 4 iterations in 10 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[5, 5, 5, 5, 5, 5]
Domain [Process(5), Tour(4), Process(5)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 4)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2026-05-26 15:12:33] [INFO ] Unfolded HLPN to a Petri net with 500 places and 730 transitions 2280 arcs in 34 ms.
[2026-05-26 15:12:33] [INFO ] Unfolded 6 HLPN properties in 0 ms.
Deduced a syphon composed of 20 places in 5 ms
Reduce places removed 20 places and 40 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[5, 5, 5, 5, 5, 5]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[5, 5, 5, 5, 5, 5]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11766389184137706896.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12778283232825098841.kers'
[2026-05-26 15:12:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11766389184137706896.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12778283232825098841.kers]
Normalized transition count is 630 out of 690 initially.
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 630 rows 470 cols 1420 entries
Finished phase 1 with 461 SingleSign rule and 0 generalized
[2026-05-26 15:12:33] [INFO ] Computed 19 invariants in 2 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12778283232825098841.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[5, 5, 5, 5, 5, 5]
RANDOM walk for 10000 steps (2 resets) in 59 ms. (166 steps per ms)
FORMULA Peterson-COL-4-UpperBounds-15 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-4-UpperBounds-08 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-4-UpperBounds-13 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-4-UpperBounds-06 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-4-UpperBounds-05 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-4-UpperBounds-04 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-4-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (4 resets) in 43 ms. (454 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 3] Max Struct:[5, 5]
[2026-05-26 15:12:33] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11754482047378515584.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10127081801788895075.kers'
[2026-05-26 15:12:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11754482047378515584.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10127081801788895075.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 630 rows 470 cols 1420 entries
Finished phase 1 with 461 SingleSign rule and 0 generalized
[2026-05-26 15:12:33] [INFO ] Computed 19 invariants in 2 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10127081801788895075.kers
Total runtime 3 ms.
[2026-05-26 15:12:34] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2026-05-26 15:12:34] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2026-05-26 15:12:34] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2026-05-26 15:12:34] [INFO ] State equation strengthened by 116 read => feed constraints.
[2026-05-26 15:12:34] [INFO ] [Real]Added 116 Read/Feed constraints in 21 ms returned sat
[2026-05-26 15:12:34] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 15:12:34] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2026-05-26 15:12:34] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2026-05-26 15:12:34] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2026-05-26 15:12:34] [INFO ] [Nat]Added 116 Read/Feed constraints in 74 ms returned sat
[2026-05-26 15:12:39] [INFO ] Trap strengthening (SAT) tested/added 20/20 trap constraints in 4674 ms
[2026-05-26 15:12:39] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2026-05-26 15:12:39] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-26 15:12:39] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2026-05-26 15:12:39] [INFO ] [Real]Added 116 Read/Feed constraints in 27 ms returned sat
[2026-05-26 15:12:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 15:12:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2026-05-26 15:12:39] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-26 15:12:39] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2026-05-26 15:12:39] [INFO ] [Nat]Added 116 Read/Feed constraints in 63 ms returned sat
[2026-05-26 15:12:41] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1870 ms
[2026-05-26 15:12:41] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 34 ms.
[2026-05-26 15:12:44] [INFO ] Added : 295 causal constraints over 59 iterations in 2845 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1, 3] Max Struct:[5, 5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 4] Max Struct:[5, 5]
Support contains 25 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 0 with 196 rules applied. Total rules applied 196 place count 480 transition count 494
Reduce places removed 196 places and 0 transitions.
Iterating post reduction 1 with 196 rules applied. Total rules applied 392 place count 284 transition count 494
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 392 place count 284 transition count 410
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 560 place count 200 transition count 410
Applied a total of 560 rules in 60 ms. Remains 200 /480 variables (removed 280) and now considering 410/690 (removed 280) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 200/480 places, 410/690 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9165205322554222294.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1555458061163688181.kers'
[2026-05-26 15:12:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9165205322554222294.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1555458061163688181.kers]
Normalized transition count is 350 out of 410 initially.
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 350 rows 190 cols 860 entries
Finished phase 1 with 181 SingleSign rule and 0 generalized
[2026-05-26 15:12:44] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1555458061163688181.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 4] Max Struct:[5, 5]
RANDOM walk for 1000000 steps (2 resets) in 1543 ms. (647 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 1130 ms. (1768 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 4] Max Struct:[5, 5]
[2026-05-26 15:12:47] [INFO ] Flow matrix only has 350 transitions (discarded 60 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10940472076932203464.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18419206710656859930.kers'
[2026-05-26 15:12:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10940472076932203464.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18419206710656859930.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 350 rows 190 cols 860 entries
Finished phase 1 with 181 SingleSign rule and 0 generalized
[2026-05-26 15:12:47] [INFO ] Computed 19 invariants in 4 ms
Computed 19 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-18419206710656859930.kers
Total runtime 5 ms.
[2026-05-26 15:12:47] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2026-05-26 15:12:47] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-26 15:12:47] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2026-05-26 15:12:47] [INFO ] State equation strengthened by 116 read => feed constraints.
[2026-05-26 15:12:47] [INFO ] [Real]Added 116 Read/Feed constraints in 15 ms returned sat
[2026-05-26 15:12:47] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 15:12:47] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2026-05-26 15:12:47] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-26 15:12:47] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2026-05-26 15:12:47] [INFO ] [Nat]Added 116 Read/Feed constraints in 24 ms returned sat
[2026-05-26 15:12:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 61 trap constraints in 8719 ms
[2026-05-26 15:12:56] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2026-05-26 15:12:56] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2026-05-26 15:12:56] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2026-05-26 15:12:56] [INFO ] [Real]Added 116 Read/Feed constraints in 15 ms returned sat
[2026-05-26 15:12:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 15:12:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2026-05-26 15:12:56] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-26 15:12:56] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2026-05-26 15:12:56] [INFO ] [Nat]Added 116 Read/Feed constraints in 19 ms returned sat
[2026-05-26 15:12:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 464 ms
Current structural bounds on expressions (after SMT) : Max Seen:[1, 4] Max Struct:[1, 4]
FORMULA Peterson-COL-4-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-COL-4-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-COL-4-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-COL-4-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-COL-4-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 25151 ms.

BK_STOP 1779808377635

--------------------
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="Peterson-COL-4"
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 Peterson-COL-4, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r194-tall-177969914300669"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-4.tgz
mv Peterson-COL-4 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 ;