About the Execution of ITS-Tools for DBSingleClientW-PT-d0m04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 56362.00 | 0.00 | 0.00 | 0 0 0 1 0 0 1 0 0 0 0 0 0 2 0 0 | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r058-smll-174854063300005.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 DBSingleClientW-PT-d0m04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854063300005
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K 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 44K 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 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 8.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 119K 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 DBSingleClientW-PT-d0m04-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748551309867
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-05-29 20:41:52] [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-29 20:41:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 20:41:53] [INFO ] Load time of PNML (sax parser for PT used): 272 ms
[2025-05-29 20:41:53] [INFO ] Transformed 553 places.
[2025-05-29 20:41:53] [INFO ] Transformed 150 transitions.
[2025-05-29 20:41:53] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 513 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
Deduced a syphon composed of 444 places in 3 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
// Phase 1: matrix 150 rows 109 cols
[2025-05-29 20:41:53] [INFO ] Computed 6 invariants in 46 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[4, 2, 4]
RANDOM walk for 10000 steps (2322 resets) in 107 ms. (92 steps per ms)
BEST_FIRST walk for 30000 steps (3049 resets) in 133 ms. (223 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 1] Max Struct:[4, 2, 4]
[2025-05-29 20:41:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-29 20:41:53] [INFO ] [Real]Absence check using 2 positive place invariants in 19 ms returned sat
[2025-05-29 20:41:54] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2025-05-29 20:41:54] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2025-05-29 20:41:54] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-05-29 20:41:54] [INFO ] [Real]Added 74 Read/Feed constraints in 40 ms returned sat
[2025-05-29 20:41:54] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-29 20:41:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2025-05-29 20:41:54] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2025-05-29 20:41:54] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2025-05-29 20:41:54] [INFO ] [Nat]Added 74 Read/Feed constraints in 60 ms returned sat
[2025-05-29 20:41:54] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 76 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:41:55] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:41:55] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 7 ms to minimize.
[2025-05-29 20:41:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 448 ms
[2025-05-29 20:41:55] [INFO ] Added : 13 causal constraints over 5 iterations in 757 ms. Result :sat
Minimization took 272 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-29 20:41:55] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-05-29 20:41:55] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2025-05-29 20:41:55] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2025-05-29 20:41:56] [INFO ] [Real]Added 74 Read/Feed constraints in 44 ms returned sat
[2025-05-29 20:41:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-29 20:41:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-05-29 20:41:56] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2025-05-29 20:41:56] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2025-05-29 20:41:56] [INFO ] [Nat]Added 74 Read/Feed constraints in 30 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:41:56] [INFO ] Deduced a trap composed of 16 places in 182 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:41:56] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:41:56] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:41:57] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:41:57] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:41:57] [INFO ] Deduced a trap composed of 16 places in 189 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:41:57] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:41:57] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:41:57] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:41:58] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:41:58] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:41:58] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:41:58] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:41:58] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:41:59] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:41:59] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:41:59] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 15 ms to minimize.
[2025-05-29 20:42:00] [INFO ] Trap strengthening (SAT) tested/added 17/17 trap constraints in 3849 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-29 20:42:00] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2025-05-29 20:42:00] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2025-05-29 20:42:00] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2025-05-29 20:42:00] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-29 20:42:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-05-29 20:42:00] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2025-05-29 20:42:00] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2025-05-29 20:42:00] [INFO ] [Nat]Added 74 Read/Feed constraints in 21 ms returned sat
[2025-05-29 20:42:00] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 34 ms.
[2025-05-29 20:42:00] [INFO ] Added : 1 causal constraints over 1 iterations in 76 ms. Result :sat
Minimization took 86 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 1] Max Struct:[4, 2, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 1] Max Struct:[4, 2, 4]
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 150/150 transitions.
Graph (complete) has 332 edges and 109 vertex of which 102 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 102 transition count 144
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 30 place count 79 transition count 97
Iterating global reduction 1 with 23 rules applied. Total rules applied 53 place count 79 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 79 transition count 96
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 65 place count 68 transition count 85
Iterating global reduction 2 with 11 rules applied. Total rules applied 76 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 78 place count 68 transition count 83
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 67 transition count 82
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 67 transition count 82
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 66 transition count 80
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 66 transition count 80
Applied a total of 82 rules in 95 ms. Remains 66 /109 variables (removed 43) and now considering 80/150 (removed 70) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 66/109 places, 80/150 transitions.
// Phase 1: matrix 80 rows 66 cols
[2025-05-29 20:42:00] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 1] Max Struct:[4, 2, 4]
RANDOM walk for 1000000 steps (229183 resets) in 1656 ms. (603 steps per ms)
BEST_FIRST walk for 3000000 steps (304999 resets) in 1732 ms. (1731 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 2] Max Struct:[4, 2, 4]
[2025-05-29 20:42:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-29 20:42:04] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 20:42:04] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2025-05-29 20:42:04] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-05-29 20:42:04] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2025-05-29 20:42:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-29 20:42:04] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 20:42:04] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2025-05-29 20:42:04] [INFO ] [Nat]Added 24 Read/Feed constraints in 6 ms returned sat
[2025-05-29 20:42:04] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 58 transitions) in 10 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:42:04] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:42:04] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 3 ms to minimize.
[2025-05-29 20:42:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 169 ms
[2025-05-29 20:42:04] [INFO ] Added : 12 causal constraints over 3 iterations in 228 ms. Result :sat
Minimization took 86 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-29 20:42:04] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-29 20:42:04] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2025-05-29 20:42:04] [INFO ] [Real]Added 24 Read/Feed constraints in 8 ms returned sat
[2025-05-29 20:42:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-29 20:42:05] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-29 20:42:05] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2025-05-29 20:42:05] [INFO ] [Nat]Added 24 Read/Feed constraints in 9 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:42:05] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:42:05] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 8 ms to minimize.
[2025-05-29 20:42:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 211 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-29 20:42:05] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-29 20:42:05] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2025-05-29 20:42:05] [INFO ] [Real]Added 24 Read/Feed constraints in 8 ms returned sat
[2025-05-29 20:42:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-29 20:42:05] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-29 20:42:05] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2025-05-29 20:42:05] [INFO ] [Nat]Added 24 Read/Feed constraints in 9 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:42:05] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 5 ms to minimize.
[2025-05-29 20:42:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2025-05-29 20:42:05] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 58 transitions) in 16 ms.
[2025-05-29 20:42:05] [INFO ] Added : 1 causal constraints over 1 iterations in 45 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 2] Max Struct:[4, 1, 4]
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 2] Max Struct:[4, 4]
Support contains 2 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 80/80 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 65 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 64 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 63 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 63 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 63 transition count 73
Applied a total of 8 rules in 28 ms. Remains 63 /66 variables (removed 3) and now considering 73/80 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 63/66 places, 73/80 transitions.
// Phase 1: matrix 73 rows 63 cols
[2025-05-29 20:42:05] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 2] Max Struct:[4, 4]
RANDOM walk for 1000000 steps (229093 resets) in 1181 ms. (846 steps per ms)
BEST_FIRST walk for 2000001 steps (203794 resets) in 980 ms. (2038 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 2] Max Struct:[4, 4]
[2025-05-29 20:42:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-29 20:42:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 20:42:08] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2025-05-29 20:42:08] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-05-29 20:42:08] [INFO ] [Real]Added 23 Read/Feed constraints in 6 ms returned sat
[2025-05-29 20:42:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-29 20:42:08] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 20:42:08] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2025-05-29 20:42:08] [INFO ] [Nat]Added 23 Read/Feed constraints in 5 ms returned sat
[2025-05-29 20:42:08] [INFO ] Computed and/alt/rep : 20/42/20 causal constraints (skipped 52 transitions) in 15 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:42:08] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 11 ms to minimize.
[2025-05-29 20:42:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2025-05-29 20:42:08] [INFO ] Added : 7 causal constraints over 3 iterations in 196 ms. Result :sat
Minimization took 67 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-29 20:42:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 20:42:08] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2025-05-29 20:42:08] [INFO ] [Real]Added 23 Read/Feed constraints in 11 ms returned sat
[2025-05-29 20:42:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-29 20:42:08] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-29 20:42:08] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2025-05-29 20:42:08] [INFO ] [Nat]Added 23 Read/Feed constraints in 8 ms returned sat
[2025-05-29 20:42:08] [INFO ] Computed and/alt/rep : 20/42/20 causal constraints (skipped 52 transitions) in 15 ms.
[2025-05-29 20:42:08] [INFO ] Added : 1 causal constraints over 1 iterations in 38 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 2] Max Struct:[4, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 2] Max Struct:[4, 4]
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 8 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 63/63 places, 73/73 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 8 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2025-05-29 20:42:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:42:08] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-05-29 20:42:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:42:08] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-05-29 20:42:09] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 20:42:09] [INFO ] Redundant transitions in 2 ms returned []
Running 72 sub problems to find dead transitions.
[2025-05-29 20:42:09] [INFO ] Invariant cache hit.
[2025-05-29 20:42:09] [INFO ] State equation strengthened by 23 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/135 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 23/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 1/136 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:42:13] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:42:13] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 6 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/136 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (OVERLAPS) 0/136 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 90 constraints, problems are : Problem set: 0 solved, 72 unsolved in 5649 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 73/135 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 23/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 68/157 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (OVERLAPS) 1/136 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 4/162 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/136 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 12 (OVERLAPS) 0/136 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 162 constraints, problems are : Problem set: 0 solved, 72 unsolved in 14774 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20613ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 20625ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21047 ms. Remains : 63/63 places, 73/73 transitions.
RANDOM walk for 40000 steps (9187 resets) in 1134 ms. (35 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4098 resets) in 516 ms. (77 steps per ms) remains 4/4 properties
[2025-05-29 20:42:30] [INFO ] Flatten gal took : 134 ms
BEST_FIRST walk for 40003 steps (3985 resets) in 156 ms. (254 steps per ms) remains 4/4 properties
[2025-05-29 20:42:30] [INFO ] Flatten gal took : 58 ms
BEST_FIRST walk for 40002 steps (4045 resets) in 121 ms. (327 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4146 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
[2025-05-29 20:42:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3376427770430543250.gal : 25 ms
[2025-05-29 20:42:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality981780602014369259.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3376427770430543250.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality981780602014369259.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality981780602014369259.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :7 after 22
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :22 after 48
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :48 after 89
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :89 after 134
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :134 after 362
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :362 after 959
Invariant property MIN0 does not hold.
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :2232 after 2829
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :2829 after 4456
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,5520,0.185625,6936,2,1556,16,11076,9,0,327,7714,0
Total reachable state count : 5520
Verifying 4 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,0,0.18729,6936,1,0,16,11076,9,0,328,7714,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,42,0.188367,7192,2,98,16,11076,10,0,330,7714,0
Reachability property MAX1 does not hold.
No reachable states exhibit your property : MAX1
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,0,0.188695,7192,1,0,16,11076,10,0,330,7714,0
Invariant property MIN1 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,0,0.18902,7192,1,0,16,11076,10,0,330,7714,0
ITS tools runner thread asked to quit. Dying gracefully.
Probably explored full state space saw : 5494 states, properties seen :1
Probabilistic random walk after 13376 steps, saw 5494 distinct states, run finished after 261 ms. (steps per millisecond=51 ) properties seen :1
Explored full state space saw : 5520 states, properties seen :0
Exhaustive walk after 13402 steps, saw 5520 distinct states, run finished after 122 ms. (steps per millisecond=109 ) properties seen :0
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-13 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[0] Max Struct:[4]
Starting property specific reduction for DBSingleClientW-PT-d0m04-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[4]
[2025-05-29 20:42:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 10000 steps (2307 resets) in 19 ms. (500 steps per ms)
BEST_FIRST walk for 10001 steps (1005 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2025-05-29 20:42:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-29 20:42:31] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 20:42:31] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2025-05-29 20:42:31] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-05-29 20:42:31] [INFO ] [Real]Added 23 Read/Feed constraints in 8 ms returned sat
[2025-05-29 20:42:31] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-29 20:42:31] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 20:42:31] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2025-05-29 20:42:31] [INFO ] [Nat]Added 23 Read/Feed constraints in 6 ms returned sat
[2025-05-29 20:42:31] [INFO ] Computed and/alt/rep : 20/42/20 causal constraints (skipped 52 transitions) in 13 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:42:31] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 4 ms to minimize.
[2025-05-29 20:42:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2025-05-29 20:42:31] [INFO ] Added : 7 causal constraints over 3 iterations in 153 ms. Result :sat
Minimization took 65 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 73/73 transitions.
Graph (complete) has 186 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 72
Applied a total of 2 rules in 12 ms. Remains 62 /63 variables (removed 1) and now considering 72/73 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 62/63 places, 72/73 transitions.
// Phase 1: matrix 72 rows 62 cols
[2025-05-29 20:42:31] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 1000000 steps (229438 resets) in 1277 ms. (782 steps per ms)
BEST_FIRST walk for 1000000 steps (101933 resets) in 488 ms. (2044 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2025-05-29 20:42:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-29 20:42:33] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-29 20:42:33] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2025-05-29 20:42:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-05-29 20:42:33] [INFO ] [Real]Added 22 Read/Feed constraints in 9 ms returned sat
[2025-05-29 20:42:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-29 20:42:33] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-29 20:42:33] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2025-05-29 20:42:33] [INFO ] [Nat]Added 22 Read/Feed constraints in 7 ms returned sat
[2025-05-29 20:42:33] [INFO ] Computed and/alt/rep : 20/42/20 causal constraints (skipped 51 transitions) in 15 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:42:33] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 9 ms to minimize.
[2025-05-29 20:42:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2025-05-29 20:42:33] [INFO ] Added : 9 causal constraints over 4 iterations in 300 ms. Result :sat
Minimization took 70 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 72/72 transitions.
Applied a total of 0 rules in 9 ms. Remains 62 /62 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 62/62 places, 72/72 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 72/72 transitions.
Applied a total of 0 rules in 9 ms. Remains 62 /62 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2025-05-29 20:42:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:42:34] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-05-29 20:42:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:42:34] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-05-29 20:42:34] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 20:42:34] [INFO ] Redundant transitions in 2 ms returned []
Running 71 sub problems to find dead transitions.
[2025-05-29 20:42:34] [INFO ] Invariant cache hit.
[2025-05-29 20:42:34] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/134 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 22/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 86 constraints, problems are : Problem set: 0 solved, 71 unsolved in 3010 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/134 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 22/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 71/157 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 157 constraints, problems are : Problem set: 0 solved, 71 unsolved in 8115 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11220ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 11222ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11583 ms. Remains : 62/62 places, 72/72 transitions.
[2025-05-29 20:42:45] [INFO ] Flatten gal took : 30 ms
[2025-05-29 20:42:45] [INFO ] Flatten gal took : 21 ms
[2025-05-29 20:42:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5726712021230163382.gal : 8 ms
[2025-05-29 20:42:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14517709533427254086.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/ReachabilityCardinality5726712021230163382.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14517709533427254086.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality14517709533427254086.prop.
RANDOM walk for 40000 steps (9179 resets) in 173 ms. (229 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 22
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :22 after 56
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :56 after 114
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :114 after 184
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :184 after 471
BEST_FIRST walk for 40003 steps (4124 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :471 after 1110
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1110 after 2079
BEST_FIRST walk for 40002 steps (3925 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4568 after 4742
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,4894,0.08834,6348,2,1356,16,8745,7,0,323,5969,0
Total reachable state count : 4894
Verifying 2 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,0,0.089284,6348,1,0,16,8745,7,0,324,5969,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,66,0.090028,6604,2,151,16,8745,8,0,326,5969,0
Probably explored full state space saw : 4890 states, properties seen :1
Probabilistic random walk after 11753 steps, saw 4890 distinct states, run finished after 78 ms. (steps per millisecond=150 ) properties seen :1
Explored full state space saw : 4894 states, properties seen :0
Exhaustive walk after 11757 steps, saw 4894 distinct states, run finished after 23 ms. (steps per millisecond=511 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[4]
Ending property specific reduction for DBSingleClientW-PT-d0m04-UpperBounds-03 in 14811 ms.
[2025-05-29 20:42:45] [INFO ] Flatten gal took : 18 ms
[2025-05-29 20:42:45] [INFO ] Applying decomposition
[2025-05-29 20:42:45] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1601153391770100476.txt' '-o' '/tmp/graph1601153391770100476.bin' '-w' '/tmp/graph1601153391770100476.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1601153391770100476.bin' '-l' '-1' '-v' '-w' '/tmp/graph1601153391770100476.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:42:45] [INFO ] Decomposing Gal with order
[2025-05-29 20:42:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:42:45] [INFO ] Removed a total of 65 redundant transitions.
[2025-05-29 20:42:46] [INFO ] Flatten gal took : 68 ms
[2025-05-29 20:42:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 13 ms.
[2025-05-29 20:42:46] [INFO ] Time to serialize gal into /tmp/UpperBounds4725761546788496694.gal : 6 ms
[2025-05-29 20:42:46] [INFO ] Time to serialize properties into /tmp/UpperBounds4710033371055067323.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4725761546788496694.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4710033371055067323.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds4710033371055067323.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,5520,0.05784,5756,320,202,2378,931,233,5500,82,3899,0
Total reachable state count : 5520
Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d0m04-UpperBounds-03 :0 <= i5.u6.l503 <= 1
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-03 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d0m04-UpperBounds-03,0,0.06237,5756,1,0,2378,931,310,5500,100,3899,347
Total runtime 53679 ms.
BK_STOP 1748551366229
--------------------
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="DBSingleClientW-PT-d0m04"
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 DBSingleClientW-PT-d0m04, 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 r058-smll-174854063300005"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d0m04.tgz
mv DBSingleClientW-PT-d0m04 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 ;