About the Execution of ITS-Tools for ClientsAndServers-PT-N1000P0
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.r050-smll-177946901200413.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 ClientsAndServers-PT-N1000P0, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r050-smll-177946901200413
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 9.3K Mar 6 10:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Mar 6 10:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Mar 6 10:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K Mar 6 10:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 08:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 08:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 08:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Mar 6 10:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 6 10:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 6 10:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Mar 6 10:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 08:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 9.1K 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 ClientsAndServers-PT-N1000P0-UpperBounds-00
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-01
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-02
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-03
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-04
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-05
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-06
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-07
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-08
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-09
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-10
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-11
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-12
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-13
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-14
FORMULA_NAME ClientsAndServers-PT-N1000P0-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779702775875
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N1000P0
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 09:52:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 09:52:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:52:58] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2026-05-25 09:52:58] [INFO ] Transformed 25 places.
[2026-05-25 09:52:58] [INFO ] Transformed 18 transitions.
[2026-05-25 09:52:58] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 277 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Current structural bounds on expressions (Initially) : Max Seen:[8000, 0, 0, 0, 0, 0, 0, 0, 0, 3000, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[8000, 0, 0, 0, 0, 0, 0, 0, 0, 3000, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14795703033280172233.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4725175746685250100.kers'
[2026-05-25 09:52:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14795703033280172233.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4725175746685250100.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 25 cols 54 entries
Finished phase 1 with 14 SingleSign rule and 3 generalized
[2026-05-25 09:52:58] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4725175746685250100.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[8000, 0, 0, 0, 0, 0, 0, 0, 0, 3000, 0, 0, 0, 0, 0, 0] Max Struct:[8000, 2000, 2000, 2000, 4000, 8000, 2000, 2000, 2000, 3000, 8000, 2000, 2000, 2000, 2000, 24000]
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-09 3000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-00 8000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 16004 steps (2 resets) in 19 ms. (800 steps per ms)
BEST_FIRST walk for 140013 steps (28 resets) in 216 ms. (645 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[77, 21, 15, 47, 16, 57, 11, 116, 260, 260, 168, 13, 477, 21] Max Struct:[2000, 2000, 2000, 4000, 8000, 2000, 2000, 2000, 8000, 2000, 2000, 2000, 2000, 24000]
[2026-05-25 09:52:59] [INFO ] Invariant cache hit.
[2026-05-25 09:52:59] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2026-05-25 09:52:59] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2026-05-25 09:52:59] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2026-05-25 09:52:59] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-25 09:52:59] [INFO ] Added : 5 causal constraints over 1 iterations in 49 ms. Result :sat
Minimization took 19 ms.
[2026-05-25 09:52:59] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2026-05-25 09:52:59] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 3 ms returned sat
[2026-05-25 09:52:59] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2026-05-25 09:52:59] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-25 09:52:59] [INFO ] Added : 10 causal constraints over 2 iterations in 33 ms. Result :sat
Minimization took 11 ms.
[2026-05-25 09:52:59] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-25 09:52:59] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2026-05-25 09:52:59] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2026-05-25 09:52:59] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-25 09:52:59] [INFO ] Added : 14 causal constraints over 3 iterations in 54 ms. Result :sat
Minimization took 14 ms.
[2026-05-25 09:52:59] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2026-05-25 09:52:59] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 7 ms returned sat
[2026-05-25 09:52:59] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2026-05-25 09:52:59] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-25 09:52:59] [INFO ] Added : 7 causal constraints over 2 iterations in 29 ms. Result :sat
Minimization took 14 ms.
[2026-05-25 09:53:00] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2026-05-25 09:53:00] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2026-05-25 09:53:00] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2026-05-25 09:53:00] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 8 ms.
[2026-05-25 09:53:00] [INFO ] Added : 14 causal constraints over 3 iterations in 42 ms. Result :sat
Minimization took 14 ms.
[2026-05-25 09:53:00] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:53:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-25 09:53:00] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2026-05-25 09:53:00] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2026-05-25 09:53:00] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-25 09:53:00] [INFO ] Added : 14 causal constraints over 3 iterations in 54 ms. Result :sat
Minimization took 13 ms.
[2026-05-25 09:53:00] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-25 09:53:00] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2026-05-25 09:53:00] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2026-05-25 09:53:00] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-25 09:53:00] [INFO ] Added : 6 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 11 ms.
[2026-05-25 09:53:00] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-25 09:53:00] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2026-05-25 09:53:00] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2026-05-25 09:53:00] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-25 09:53:00] [INFO ] Added : 15 causal constraints over 3 iterations in 37 ms. Result :sat
Minimization took 13 ms.
[2026-05-25 09:53:00] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2026-05-25 09:53:00] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 3 ms returned sat
[2026-05-25 09:53:00] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2026-05-25 09:53:00] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-25 09:53:00] [INFO ] Added : 4 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 11 ms.
[2026-05-25 09:53:00] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-25 09:53:00] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2026-05-25 09:53:00] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2026-05-25 09:53:00] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-25 09:53:00] [INFO ] Added : 2 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 12 ms.
[2026-05-25 09:53:00] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-25 09:53:00] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2026-05-25 09:53:00] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2026-05-25 09:53:00] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-25 09:53:00] [INFO ] Added : 2 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 12 ms.
[2026-05-25 09:53:00] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-25 09:53:00] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 4 ms returned sat
[2026-05-25 09:53:00] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2026-05-25 09:53:00] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-25 09:53:00] [INFO ] Added : 3 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 11 ms.
[2026-05-25 09:53:00] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-25 09:53:00] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2026-05-25 09:53:01] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2026-05-25 09:53:01] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-25 09:53:01] [INFO ] Added : 13 causal constraints over 3 iterations in 30 ms. Result :sat
Minimization took 13 ms.
[2026-05-25 09:53:01] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2026-05-25 09:53:01] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 3 ms returned sat
[2026-05-25 09:53:01] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2026-05-25 09:53:01] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-25 09:53:01] [INFO ] Added : 1 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 10 ms.
[2026-05-25 09:53:01] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-25 09:53:01] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2026-05-25 09:53:01] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2026-05-25 09:53:01] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-25 09:53:01] [INFO ] Added : 9 causal constraints over 2 iterations in 23 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[77, 21, 15, 47, 16, 57, 11, 116, 260, 260, 168, 13, 477, 21] Max Struct:[2000, 2000, 2000, 4000, 8000, 2000, 2000, 2000, 8000, 2000, 2000, 2000, 2000, 24000]
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-14 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-12 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-11 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-08 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-06 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-04 4000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-02 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-01 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-13 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-07 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-03 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2000, 2000, 6484] Max Struct:[8000, 8000, 24000]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 24 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 22 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 20 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 9 place count 20 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 13 place count 18 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 17 transition count 11
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 18 place count 17 transition count 8
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 22 place count 13 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 22 place count 13 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 25 place count 11 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 28 place count 9 transition count 6
Applied a total of 28 rules in 51 ms. Remains 9 /25 variables (removed 16) and now considering 6/18 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 9/25 places, 6/18 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7782170679889339424.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15898064806426569001.kers'
[2026-05-25 09:53:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7782170679889339424.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15898064806426569001.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 6 rows 9 cols 20 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-25 09:53:40] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15898064806426569001.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[2000, 2000, 6484] Max Struct:[2000, 2000, 8000]
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-10 2000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-05 2000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000602 steps (36 resets) in 195 ms. (5105 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 261 ms. (3816 steps per ms)
FORMULA ClientsAndServers-PT-N1000P0-UpperBounds-15 8000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 42976 ms.
BK_STOP 1779702821378
--------------------
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="ClientsAndServers-PT-N1000P0"
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 ClientsAndServers-PT-N1000P0, 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 r050-smll-177946901200413"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N1000P0.tgz
mv ClientsAndServers-PT-N1000P0 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 '
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 ;