Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028500469.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is CO4-PT-12, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028500469
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 177K May 29 14:32 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 CO4-PT-12-UpperBounds-00
FORMULA_NAME CO4-PT-12-UpperBounds-01
FORMULA_NAME CO4-PT-12-UpperBounds-02
FORMULA_NAME CO4-PT-12-UpperBounds-03
FORMULA_NAME CO4-PT-12-UpperBounds-04
FORMULA_NAME CO4-PT-12-UpperBounds-05
FORMULA_NAME CO4-PT-12-UpperBounds-06
FORMULA_NAME CO4-PT-12-UpperBounds-07
FORMULA_NAME CO4-PT-12-UpperBounds-08
FORMULA_NAME CO4-PT-12-UpperBounds-09
FORMULA_NAME CO4-PT-12-UpperBounds-10
FORMULA_NAME CO4-PT-12-UpperBounds-11
FORMULA_NAME CO4-PT-12-UpperBounds-12
FORMULA_NAME CO4-PT-12-UpperBounds-13
FORMULA_NAME CO4-PT-12-UpperBounds-14
FORMULA_NAME CO4-PT-12-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748607112978

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-05-30 12:11:54] [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]
[2025-05-30 12:11:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 12:11:54] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2025-05-30 12:11:54] [INFO ] Transformed 649 places.
[2025-05-30 12:11:54] [INFO ] Transformed 782 transitions.
[2025-05-30 12:11:54] [INFO ] Found NUPN structural information;
[2025-05-30 12:11:54] [INFO ] Parsed PT model containing 649 places and 782 transitions and 1960 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 172 places in 9 ms
Reduce places removed 172 places and 219 transitions.
FORMULA CO4-PT-12-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 563 rows 477 cols
[2025-05-30 12:11:54] [INFO ] Computed 9 invariants in 20 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (46 resets) in 38 ms. (256 steps per ms)
FORMULA CO4-PT-12-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-12-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-12-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100003 steps (498 resets) in 143 ms. (694 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-30 12:11:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:11:54] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2025-05-30 12:11:54] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 12:11:55] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2025-05-30 12:11:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:11:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 23 ms returned sat
[2025-05-30 12:11:55] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 12:11:55] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2025-05-30 12:11:55] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 33 ms.
[2025-05-30 12:11:56] [INFO ] Added : 121 causal constraints over 25 iterations in 991 ms. Result :sat
Minimization took 378 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:11:56] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2025-05-30 12:11:56] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 12:11:57] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2025-05-30 12:11:57] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:11:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2025-05-30 12:11:57] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 12:11:57] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2025-05-30 12:11:57] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 30 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:11:58] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:11:58] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:11:58] [INFO ] Deduced a trap composed of 59 places in 147 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:11:58] [INFO ] Deduced a trap composed of 158 places in 128 ms of which 9 ms to minimize.
[2025-05-30 12:11:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 760 ms
[2025-05-30 12:11:58] [INFO ] Added : 105 causal constraints over 22 iterations in 1557 ms. Result :sat
Minimization took 356 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:11:59] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2025-05-30 12:11:59] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 12:11:59] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2025-05-30 12:11:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:11:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2025-05-30 12:11:59] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 12:11:59] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:11:59] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 4 ms to minimize.
[2025-05-30 12:11:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2025-05-30 12:11:59] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 31 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:12:00] [INFO ] Deduced a trap composed of 49 places in 103 ms of which 12 ms to minimize.
[2025-05-30 12:12:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2025-05-30 12:12:01] [INFO ] Added : 116 causal constraints over 24 iterations in 1165 ms. Result :sat
Minimization took 176 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:12:01] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2025-05-30 12:12:01] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-30 12:12:01] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2025-05-30 12:12:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:12:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2025-05-30 12:12:01] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 12:12:01] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2025-05-30 12:12:01] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 32 ms.
[2025-05-30 12:12:02] [INFO ] Added : 127 causal constraints over 26 iterations in 983 ms. Result :sat
Minimization took 301 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:12:03] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2025-05-30 12:12:03] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-30 12:12:03] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2025-05-30 12:12:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:12:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2025-05-30 12:12:03] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-30 12:12:03] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:12:03] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 16 ms to minimize.
[2025-05-30 12:12:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2025-05-30 12:12:03] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 31 ms.
[2025-05-30 12:12:04] [INFO ] Added : 130 causal constraints over 26 iterations in 930 ms. Result :sat
Minimization took 272 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:12:05] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2025-05-30 12:12:05] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 12:12:05] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:12:05] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 4 ms to minimize.
[2025-05-30 12:12:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:12:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2025-05-30 12:12:05] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-30 12:12:05] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:12:05] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 3 ms to minimize.
[2025-05-30 12:12:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2025-05-30 12:12:05] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 29 ms.
[2025-05-30 12:12:06] [INFO ] Added : 105 causal constraints over 22 iterations in 850 ms. Result :sat
Minimization took 401 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:12:07] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2025-05-30 12:12:07] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 12:12:07] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2025-05-30 12:12:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:12:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2025-05-30 12:12:07] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-30 12:12:07] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2025-05-30 12:12:07] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 27 ms.
[2025-05-30 12:12:08] [INFO ] Added : 93 causal constraints over 19 iterations in 646 ms. Result :sat
Minimization took 337 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:12:08] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2025-05-30 12:12:08] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 12:12:08] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2025-05-30 12:12:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:12:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2025-05-30 12:12:08] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 12:12:09] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:12:09] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 15 ms to minimize.
[2025-05-30 12:12:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2025-05-30 12:12:09] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 27 ms.
[2025-05-30 12:12:09] [INFO ] Added : 97 causal constraints over 20 iterations in 649 ms. Result :sat
Minimization took 262 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:12:10] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2025-05-30 12:12:10] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-30 12:12:10] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2025-05-30 12:12:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:12:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2025-05-30 12:12:10] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 12:12:10] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2025-05-30 12:12:10] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 29 ms.
[2025-05-30 12:12:11] [INFO ] Added : 116 causal constraints over 24 iterations in 874 ms. Result :sat
Minimization took 228 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:12:11] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2025-05-30 12:12:11] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-30 12:12:12] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2025-05-30 12:12:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 12:12:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2025-05-30 12:12:12] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 12:12:12] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2025-05-30 12:12:12] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 25 ms.
[2025-05-30 12:12:13] [INFO ] Added : 104 causal constraints over 21 iterations in 736 ms. Result :sat
Minimization took 256 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA CO4-PT-12-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-12-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-12-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-12-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-12-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-12-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 563/563 transitions.
Graph (trivial) has 475 edges and 477 vertex of which 3 / 477 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 770 edges and 475 vertex of which 436 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.1 ms
Discarding 39 places :
Also discarding 18 output transitions
Drop transitions (Output transitions of discarded places.) removed 18 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 269 transitions
Trivial Post-agglo rules discarded 269 transitions
Performed 269 trivial Post agglomeration. Transition count delta: 269
Iterating post reduction 0 with 293 rules applied. Total rules applied 295 place count 436 transition count 249
Reduce places removed 269 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 287 rules applied. Total rules applied 582 place count 167 transition count 231
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 20 rules applied. Total rules applied 602 place count 159 transition count 219
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 8 rules applied. Total rules applied 610 place count 155 transition count 215
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 6 rules applied. Total rules applied 616 place count 153 transition count 211
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 6 rules applied. Total rules applied 622 place count 151 transition count 207
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 624 place count 149 transition count 207
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 624 place count 149 transition count 206
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 626 place count 148 transition count 206
Discarding 26 places :
Symmetric choice reduction at 7 with 26 rule applications. Total rules 652 place count 122 transition count 180
Iterating global reduction 7 with 26 rules applied. Total rules applied 678 place count 122 transition count 180
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 7 Pre rules applied. Total rules applied 678 place count 122 transition count 173
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 692 place count 115 transition count 173
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 707 place count 100 transition count 140
Iterating global reduction 7 with 15 rules applied. Total rules applied 722 place count 100 transition count 140
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 724 place count 100 transition count 138
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 726 place count 98 transition count 136
Iterating global reduction 8 with 2 rules applied. Total rules applied 728 place count 98 transition count 136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 730 place count 98 transition count 134
Performed 34 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 9 with 68 rules applied. Total rules applied 798 place count 64 transition count 99
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 803 place count 64 transition count 94
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 806 place count 61 transition count 91
Iterating global reduction 10 with 3 rules applied. Total rules applied 809 place count 61 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 810 place count 61 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 814 place count 59 transition count 88
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 816 place count 59 transition count 86
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 818 place count 57 transition count 84
Iterating global reduction 12 with 2 rules applied. Total rules applied 820 place count 57 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 821 place count 57 transition count 83
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 13 with 24 rules applied. Total rules applied 845 place count 45 transition count 85
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 13 with 19 rules applied. Total rules applied 864 place count 45 transition count 66
Discarding 9 places :
Symmetric choice reduction at 14 with 9 rule applications. Total rules 873 place count 36 transition count 57
Iterating global reduction 14 with 9 rules applied. Total rules applied 882 place count 36 transition count 57
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 14 with 8 rules applied. Total rules applied 890 place count 36 transition count 49
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 891 place count 35 transition count 47
Iterating global reduction 15 with 1 rules applied. Total rules applied 892 place count 35 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 894 place count 34 transition count 54
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 15 with 3 rules applied. Total rules applied 897 place count 34 transition count 51
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 898 place count 33 transition count 50
Iterating global reduction 15 with 1 rules applied. Total rules applied 899 place count 33 transition count 50
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 901 place count 33 transition count 48
Free-agglomeration rule applied 7 times.
Iterating global reduction 16 with 7 rules applied. Total rules applied 908 place count 33 transition count 41
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 9 rules applied. Total rules applied 917 place count 26 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 918 place count 25 transition count 38
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 17 with 3 rules applied. Total rules applied 921 place count 23 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 922 place count 22 transition count 37
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 19 with 1 Pre rules applied. Total rules applied 922 place count 22 transition count 36
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 924 place count 21 transition count 36
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 19 with 6 rules applied. Total rules applied 930 place count 18 transition count 33
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 19 with 7 rules applied. Total rules applied 937 place count 18 transition count 26
Applied a total of 937 rules in 92 ms. Remains 18 /477 variables (removed 459) and now considering 26/563 (removed 537) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 18/477 places, 26/563 transitions.
// Phase 1: matrix 26 rows 18 cols
[2025-05-30 12:12:13] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (49887 resets) in 728 ms. (1371 steps per ms)
FORMULA CO4-PT-12-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-12-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-12-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-12-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (12877 resets) in 298 ms. (3344 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-05-30 12:12:14] [INFO ] Flatten gal took : 23 ms
[2025-05-30 12:12:14] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:12:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6649245889923791062.gal : 5 ms
[2025-05-30 12:12:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3604614445523328734.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6649245889923791062.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3604614445523328734.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 20750 ms.

BK_STOP 1748607134955

--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="CO4-PT-12"
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-5832"
echo " Executing tool itstools"
echo " Input is CO4-PT-12, 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 r044-tall-174854028500469"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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