Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r100-smll-174867008200637.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 HealthRecord-PT-13, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867008200637
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 71K 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 HealthRecord-PT-13-UpperBounds-00
FORMULA_NAME HealthRecord-PT-13-UpperBounds-01
FORMULA_NAME HealthRecord-PT-13-UpperBounds-02
FORMULA_NAME HealthRecord-PT-13-UpperBounds-03
FORMULA_NAME HealthRecord-PT-13-UpperBounds-04
FORMULA_NAME HealthRecord-PT-13-UpperBounds-05
FORMULA_NAME HealthRecord-PT-13-UpperBounds-06
FORMULA_NAME HealthRecord-PT-13-UpperBounds-07
FORMULA_NAME HealthRecord-PT-13-UpperBounds-08
FORMULA_NAME HealthRecord-PT-13-UpperBounds-09
FORMULA_NAME HealthRecord-PT-13-UpperBounds-10
FORMULA_NAME HealthRecord-PT-13-UpperBounds-11
FORMULA_NAME HealthRecord-PT-13-UpperBounds-12
FORMULA_NAME HealthRecord-PT-13-UpperBounds-13
FORMULA_NAME HealthRecord-PT-13-UpperBounds-14
FORMULA_NAME HealthRecord-PT-13-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749004376194

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-04 02:32: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]
[2025-06-04 02:32:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 02:32:59] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2025-06-04 02:32:59] [INFO ] Transformed 161 places.
[2025-06-04 02:32:59] [INFO ] Transformed 341 transitions.
[2025-06-04 02:32:59] [INFO ] Found NUPN structural information;
[2025-06-04 02:32:59] [INFO ] Parsed PT model containing 161 places and 341 transitions and 899 arcs in 417 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
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, 0, 0, 0] Max Struct:[1, 1, 1, 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, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-04 02:32:59] [INFO ] Flow matrix only has 301 transitions (discarded 12 similar events)
// Phase 1: matrix 301 rows 161 cols
[2025-06-04 02:32:59] [INFO ] Computed 18 invariants in 31 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (786 resets) in 90 ms. (109 steps per ms)
FORMULA HealthRecord-PT-13-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120010 steps (1203 resets) in 325 ms. (368 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-04 02:32:59] [INFO ] Flow matrix only has 301 transitions (discarded 12 similar events)
[2025-06-04 02:32:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 02:33:00] [INFO ] [Real]Absence check using 10 positive place invariants in 23 ms returned sat
[2025-06-04 02:33:00] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 14 ms returned sat
[2025-06-04 02:33:00] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2025-06-04 02:33:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:33:00] [INFO ] [Real]Added 1 Read/Feed constraints in 8 ms returned sat
[2025-06-04 02:33:00] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 72 ms.
[2025-06-04 02:33:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 02:33:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 20 ms returned sat
[2025-06-04 02:33:01] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 12 ms returned sat
[2025-06-04 02:33:01] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2025-06-04 02:33:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:01] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 18 ms to minimize.
[2025-06-04 02:33:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2025-06-04 02:33:01] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 68 ms.
[2025-06-04 02:33:01] [INFO ] Added : 15 causal constraints over 4 iterations in 226 ms. Result :sat
Minimization took 195 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 02:33:02] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2025-06-04 02:33:02] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2025-06-04 02:33:02] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2025-06-04 02:33:02] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:02] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 5 ms to minimize.
[2025-06-04 02:33:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 02:33:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-06-04 02:33:02] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2025-06-04 02:33:02] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2025-06-04 02:33:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:03] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:03] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 6 ms to minimize.
[2025-06-04 02:33:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 228 ms
[2025-06-04 02:33:03] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 48 ms.
[2025-06-04 02:33:03] [INFO ] Added : 16 causal constraints over 4 iterations in 201 ms. Result :sat
Minimization took 214 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 02:33:03] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-06-04 02:33:03] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2025-06-04 02:33:03] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2025-06-04 02:33:03] [INFO ] [Real]Added 1 Read/Feed constraints in 6 ms returned sat
[2025-06-04 02:33:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 02:33:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2025-06-04 02:33:04] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2025-06-04 02:33:04] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2025-06-04 02:33:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2025-06-04 02:33:04] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 49 ms.
[2025-06-04 02:33:04] [INFO ] Added : 14 causal constraints over 3 iterations in 187 ms. Result :sat
Minimization took 219 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 02:33:04] [INFO ] [Real]Absence check using 10 positive place invariants in 17 ms returned sat
[2025-06-04 02:33:04] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2025-06-04 02:33:04] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2025-06-04 02:33:04] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2025-06-04 02:33:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 02:33:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-06-04 02:33:05] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2025-06-04 02:33:05] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2025-06-04 02:33:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2025-06-04 02:33:05] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 53 ms.
[2025-06-04 02:33:05] [INFO ] Added : 10 causal constraints over 2 iterations in 161 ms. Result :sat
Minimization took 190 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 02:33:05] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2025-06-04 02:33:05] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2025-06-04 02:33:05] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2025-06-04 02:33:05] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:05] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 7 ms to minimize.
[2025-06-04 02:33:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 02:33:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2025-06-04 02:33:06] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2025-06-04 02:33:06] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2025-06-04 02:33:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2025-06-04 02:33:06] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 40 ms.
[2025-06-04 02:33:06] [INFO ] Added : 18 causal constraints over 4 iterations in 195 ms. Result :sat
Minimization took 226 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 02:33:06] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-06-04 02:33:06] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2025-06-04 02:33:06] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2025-06-04 02:33:07] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-04 02:33:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 02:33:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2025-06-04 02:33:07] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 13 ms returned sat
[2025-06-04 02:33:07] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2025-06-04 02:33:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2025-06-04 02:33:07] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 39 ms.
[2025-06-04 02:33:07] [INFO ] Added : 17 causal constraints over 4 iterations in 219 ms. Result :sat
Minimization took 232 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 02:33:07] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2025-06-04 02:33:07] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2025-06-04 02:33:08] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2025-06-04 02:33:08] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:08] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 13 ms to minimize.
[2025-06-04 02:33:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 02:33:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-06-04 02:33:08] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2025-06-04 02:33:08] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2025-06-04 02:33:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:08] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 6 ms to minimize.
[2025-06-04 02:33:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2025-06-04 02:33:08] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 43 ms.
[2025-06-04 02:33:08] [INFO ] Added : 25 causal constraints over 5 iterations in 223 ms. Result :sat
Minimization took 222 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 02:33:09] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-06-04 02:33:09] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2025-06-04 02:33:09] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2025-06-04 02:33:09] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2025-06-04 02:33:09] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 44 ms.
[2025-06-04 02:33:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 02:33:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2025-06-04 02:33:09] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2025-06-04 02:33:09] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2025-06-04 02:33:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:10] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:10] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 6 ms to minimize.
[2025-06-04 02:33:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 244 ms
[2025-06-04 02:33:10] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 39 ms.
[2025-06-04 02:33:10] [INFO ] Added : 24 causal constraints over 6 iterations in 237 ms. Result :sat
Minimization took 217 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 02:33:10] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2025-06-04 02:33:10] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2025-06-04 02:33:10] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2025-06-04 02:33:10] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-04 02:33:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 02:33:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-06-04 02:33:11] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2025-06-04 02:33:11] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2025-06-04 02:33:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2025-06-04 02:33:11] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 37 ms.
[2025-06-04 02:33:11] [INFO ] Added : 18 causal constraints over 4 iterations in 198 ms. Result :sat
Minimization took 213 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 02:33:11] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-06-04 02:33:11] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 12 ms returned sat
[2025-06-04 02:33:11] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2025-06-04 02:33:11] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2025-06-04 02:33:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 02:33:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-06-04 02:33:12] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2025-06-04 02:33:12] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2025-06-04 02:33:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2025-06-04 02:33:12] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 34 ms.
[2025-06-04 02:33:12] [INFO ] Added : 11 causal constraints over 3 iterations in 154 ms. Result :sat
Minimization took 211 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 02:33:12] [INFO ] [Real]Absence check using 10 positive place invariants in 17 ms returned sat
[2025-06-04 02:33:12] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 12 ms returned sat
[2025-06-04 02:33:12] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2025-06-04 02:33:12] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:13] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 12 ms to minimize.
[2025-06-04 02:33:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 02:33:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 20 ms returned sat
[2025-06-04 02:33:13] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 12 ms returned sat
[2025-06-04 02:33:13] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2025-06-04 02:33:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:13] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:33:13] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 7 ms to minimize.
[2025-06-04 02:33:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 205 ms
[2025-06-04 02:33:13] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 35 ms.
[2025-06-04 02:33:13] [INFO ] Added : 15 causal constraints over 3 iterations in 131 ms. Result :sat
Minimization took 140 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-13-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-13-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-13-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-13-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-13-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-13-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 313/313 transitions.
Graph (trivial) has 236 edges and 161 vertex of which 8 / 161 are part of one of the 4 SCC in 5 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 681 edges and 157 vertex of which 129 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Discarding 28 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Reduce isomorphic transitions removed 114 transitions.
Iterating post reduction 0 with 114 rules applied. Total rules applied 116 place count 129 transition count 166
Discarding 79 places :
Symmetric choice reduction at 1 with 79 rule applications. Total rules 195 place count 50 transition count 87
Iterating global reduction 1 with 79 rules applied. Total rules applied 274 place count 50 transition count 87
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 274 place count 50 transition count 82
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 284 place count 45 transition count 82
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 297 place count 32 transition count 63
Iterating global reduction 1 with 13 rules applied. Total rules applied 310 place count 32 transition count 63
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 319 place count 32 transition count 54
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 322 place count 29 transition count 49
Iterating global reduction 2 with 3 rules applied. Total rules applied 325 place count 29 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 326 place count 29 transition count 48
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 328 place count 27 transition count 46
Iterating global reduction 3 with 2 rules applied. Total rules applied 330 place count 27 transition count 46
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 336 place count 27 transition count 40
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 344 place count 23 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 345 place count 22 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 346 place count 21 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 350 place count 21 transition count 31
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 5 with 2 rules applied. Total rules applied 352 place count 20 transition count 30
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 353 place count 19 transition count 29
Iterating global reduction 5 with 1 rules applied. Total rules applied 354 place count 19 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 357 place count 19 transition count 26
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 358 place count 19 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 359 place count 18 transition count 25
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 360 place count 18 transition count 25
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 361 place count 18 transition count 24
Applied a total of 361 rules in 122 ms. Remains 18 /161 variables (removed 143) and now considering 24/313 (removed 289) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 18/161 places, 24/313 transitions.
[2025-06-04 02:33:14] [INFO ] Flow matrix only has 22 transitions (discarded 2 similar events)
// Phase 1: matrix 22 rows 18 cols
[2025-06-04 02:33:14] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (113182 resets) in 900 ms. (1109 steps per ms)
FORMULA HealthRecord-PT-13-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (38870 resets) in 406 ms. (2457 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 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-06-04 02:33:15] [INFO ] Flatten gal took : 29 ms
[2025-06-04 02:33:15] [INFO ] Flatten gal took : 6 ms
[2025-06-04 02:33:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8594236274851567522.gal : 5 ms
[2025-06-04 02:33:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1904726681578013027.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/ReachabilityCardinality8594236274851567522.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1904726681578013027.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 17175 ms.

BK_STOP 1749004396083

--------------------
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="HealthRecord-PT-13"
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 HealthRecord-PT-13, 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 r100-smll-174867008200637"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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