Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r072-tall-174860067600525.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 DoubleLock-PT-p1s1, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860067600525
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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 10K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 93K 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 DoubleLock-PT-p1s1-UpperBounds-00
FORMULA_NAME DoubleLock-PT-p1s1-UpperBounds-01
FORMULA_NAME DoubleLock-PT-p1s1-UpperBounds-02
FORMULA_NAME DoubleLock-PT-p1s1-UpperBounds-03
FORMULA_NAME DoubleLock-PT-p1s1-UpperBounds-04
FORMULA_NAME DoubleLock-PT-p1s1-UpperBounds-05
FORMULA_NAME DoubleLock-PT-p1s1-UpperBounds-06
FORMULA_NAME DoubleLock-PT-p1s1-UpperBounds-07
FORMULA_NAME DoubleLock-PT-p1s1-UpperBounds-08
FORMULA_NAME DoubleLock-PT-p1s1-UpperBounds-09
FORMULA_NAME DoubleLock-PT-p1s1-UpperBounds-10
FORMULA_NAME DoubleLock-PT-p1s1-UpperBounds-11
FORMULA_NAME DoubleLock-PT-p1s1-UpperBounds-12
FORMULA_NAME DoubleLock-PT-p1s1-UpperBounds-13
FORMULA_NAME DoubleLock-PT-p1s1-UpperBounds-14
FORMULA_NAME DoubleLock-PT-p1s1-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748759606006

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p1s1
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-01 06:33:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 06:33:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 06:33:27] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2025-06-01 06:33:27] [INFO ] Transformed 64 places.
[2025-06-01 06:33:27] [INFO ] Transformed 204 transitions.
[2025-06-01 06:33:27] [INFO ] Parsed PT model containing 64 places and 204 transitions and 828 arcs in 159 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 8 transitions.
FORMULA DoubleLock-PT-p1s1-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p1s1-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 06:33:27] [INFO ] Flow matrix only has 148 transitions (discarded 48 similar events)
// Phase 1: matrix 148 rows 56 cols
[2025-06-01 06:33:27] [INFO ] Computed 4 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 10, 1, 1, +inf, 1, 10, +inf, 1, 1, +inf]
RANDOM walk for 10000 steps (71 resets) in 36 ms. (270 steps per ms)
FORMULA DoubleLock-PT-p1s1-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s1-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s1-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s1-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s1-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s1-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s1-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60005 steps (65 resets) in 68 ms. (869 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[26, 11, 9, 14, 18, 7] Max Struct:[+inf, +inf, 10, +inf, +inf, +inf]
[2025-06-01 06:33:27] [INFO ] Flow matrix only has 148 transitions (discarded 48 similar events)
[2025-06-01 06:33:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 06:33:27] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 06:33:27] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:33:27] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2025-06-01 06:33:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 06:33:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:33:27] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:33:27] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2025-06-01 06:33:27] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-06-01 06:33:27] [INFO ] [Nat]Added 23 Read/Feed constraints in 3 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:33:27] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 9 ms to minimize.
[2025-06-01 06:33:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2025-06-01 06:33:27] [INFO ] Computed and/alt/rep : 63/438/63 causal constraints (skipped 83 transitions) in 19 ms.
[2025-06-01 06:33:28] [INFO ] Added : 12 causal constraints over 4 iterations in 81 ms. Result :sat
Minimization took 30 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 06:33:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 06:33:28] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 06:33:28] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-01 06:33:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 06:33:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:33:28] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 06:33:28] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-01 06:33:28] [INFO ] [Nat]Added 23 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:33:28] [INFO ] Computed and/alt/rep : 63/438/63 causal constraints (skipped 83 transitions) in 14 ms.
[2025-06-01 06:33:28] [INFO ] Added : 14 causal constraints over 3 iterations in 68 ms. Result :sat
Minimization took 27 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 06:33:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 06:33:28] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:33:28] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2025-06-01 06:33:28] [INFO ] [Real]Added 23 Read/Feed constraints in 10 ms returned sat
[2025-06-01 06:33:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 06:33:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 06:33:28] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:33:28] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-01 06:33:28] [INFO ] [Nat]Added 23 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:33:28] [INFO ] Computed and/alt/rep : 63/438/63 causal constraints (skipped 83 transitions) in 12 ms.
[2025-06-01 06:33:28] [INFO ] Added : 5 causal constraints over 1 iterations in 35 ms. Result :sat
Minimization took 27 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 06:33:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 06:33:28] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 06:33:28] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-01 06:33:28] [INFO ] [Real]Added 23 Read/Feed constraints in 10 ms returned sat
[2025-06-01 06:33:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 06:33:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 06:33:28] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:33:28] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-01 06:33:28] [INFO ] [Nat]Added 23 Read/Feed constraints in 9 ms returned sat
[2025-06-01 06:33:28] [INFO ] Computed and/alt/rep : 63/438/63 causal constraints (skipped 83 transitions) in 13 ms.
[2025-06-01 06:33:28] [INFO ] Added : 16 causal constraints over 5 iterations in 70 ms. Result :sat
Minimization took 26 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 06:33:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 06:33:28] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 06:33:28] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-01 06:33:28] [INFO ] [Real]Added 23 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:33:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 06:33:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 06:33:28] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:33:28] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-01 06:33:28] [INFO ] [Nat]Added 23 Read/Feed constraints in 3 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:33:28] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:33:28] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 3 ms to minimize.
[2025-06-01 06:33:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 110 ms
[2025-06-01 06:33:28] [INFO ] Computed and/alt/rep : 63/438/63 causal constraints (skipped 83 transitions) in 12 ms.
[2025-06-01 06:33:29] [INFO ] Added : 48 causal constraints over 10 iterations in 130 ms. Result :sat
Minimization took 43 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 06:33:29] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 06:33:29] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 06:33:29] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2025-06-01 06:33:29] [INFO ] [Real]Added 23 Read/Feed constraints in 5 ms returned sat
[2025-06-01 06:33:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 06:33:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 06:33:29] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:33:29] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-01 06:33:29] [INFO ] [Nat]Added 23 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:33:29] [INFO ] Computed and/alt/rep : 63/438/63 causal constraints (skipped 83 transitions) in 23 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:33:29] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 5 ms to minimize.
[2025-06-01 06:33:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2025-06-01 06:33:29] [INFO ] Added : 15 causal constraints over 4 iterations in 172 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[26, 11, 9, 14, 18, 7] Max Struct:[+inf, +inf, 10, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[26, 11, 9, 14, 18, 7] Max Struct:[+inf, +inf, 10, +inf, +inf, +inf]
Support contains 6 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 196/196 transitions.
Graph (complete) has 357 edges and 56 vertex of which 53 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 53 transition count 194
Applied a total of 3 rules in 21 ms. Remains 53 /56 variables (removed 3) and now considering 194/196 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 53/56 places, 194/196 transitions.
[2025-06-01 06:33:29] [INFO ] Flow matrix only has 146 transitions (discarded 48 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {12=1, 25=1, 83=1, 84=1, 134=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {12=1, 25=1, 92=1, 93=1, 143=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 61 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :[9, 5, 7, 7, 2147483647, 5]
Current structural bounds on expressions (after cover walk) : Max Seen:[26, 11, 9, 14, +inf, 7] Max Struct:[+inf, +inf, 10, +inf, +inf, +inf]
[2025-06-01 06:33:29] [INFO ] Flow matrix only has 146 transitions (discarded 48 similar events)
// Phase 1: matrix 146 rows 53 cols
[2025-06-01 06:33:30] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[26, 11, 9, 14, +inf, 7] Max Struct:[+inf, +inf, 10, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (5106 resets) in 1410 ms. (708 steps per ms)
FORMULA DoubleLock-PT-p1s1-UpperBounds-11 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p1s1-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4000003 steps (2296 resets) in 1870 ms. (2137 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[82, 41, 14, 39] Max Struct:[+inf, +inf, +inf, +inf]
[2025-06-01 06:33:33] [INFO ] Flow matrix only has 146 transitions (discarded 48 similar events)
[2025-06-01 06:33:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 06:33:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 06:33:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:33:33] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-01 06:33:33] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-06-01 06:33:33] [INFO ] [Real]Added 23 Read/Feed constraints in 9 ms returned sat
[2025-06-01 06:33:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 06:33:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 06:33:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 06:33:33] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-01 06:33:33] [INFO ] [Nat]Added 23 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:33:33] [INFO ] Computed and/alt/rep : 62/434/62 causal constraints (skipped 82 transitions) in 12 ms.
[2025-06-01 06:33:33] [INFO ] Added : 8 causal constraints over 3 iterations in 44 ms. Result :sat
Minimization took 26 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 06:33:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 06:33:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 06:33:33] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-06-01 06:33:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 06:33:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 06:33:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:33:33] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-01 06:33:33] [INFO ] [Nat]Added 23 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:33:33] [INFO ] Computed and/alt/rep : 62/434/62 causal constraints (skipped 82 transitions) in 11 ms.
[2025-06-01 06:33:33] [INFO ] Added : 24 causal constraints over 6 iterations in 86 ms. Result :sat
Minimization took 31 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 06:33:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 06:33:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:33:33] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-01 06:33:33] [INFO ] [Real]Added 23 Read/Feed constraints in 5 ms returned sat
[2025-06-01 06:33:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 06:33:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 06:33:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:33:33] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-01 06:33:33] [INFO ] [Nat]Added 23 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:33:33] [INFO ] Computed and/alt/rep : 62/434/62 causal constraints (skipped 82 transitions) in 12 ms.
[2025-06-01 06:33:33] [INFO ] Added : 35 causal constraints over 8 iterations in 109 ms. Result :sat
Minimization took 38 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 06:33:34] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 06:33:34] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:33:34] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 06:33:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 06:33:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 06:33:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 06:33:34] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-01 06:33:34] [INFO ] [Nat]Added 23 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:33:34] [INFO ] Computed and/alt/rep : 62/434/62 causal constraints (skipped 82 transitions) in 13 ms.
[2025-06-01 06:33:34] [INFO ] Added : 18 causal constraints over 4 iterations in 68 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[82, 41, 14, 39] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6654, 41, 14, 39] Max Struct:[+inf, +inf, +inf, +inf]
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 194/194 transitions.
Graph (complete) has 342 edges and 53 vertex of which 52 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 51 transition count 190
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 51 transition count 190
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 50 transition count 186
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 50 transition count 186
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 49 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 49 transition count 182
Applied a total of 7 rules in 14 ms. Remains 49 /53 variables (removed 4) and now considering 182/194 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 49/53 places, 182/194 transitions.
[2025-06-01 06:33:34] [INFO ] Flow matrix only has 137 transitions (discarded 45 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {12=1, 24=1, 82=1, 83=1, 130=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {12=1, 24=1, 82=1, 83=1, 129=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 66 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :[7, 5, 8, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[6654, 41, 14, 39] Max Struct:[+inf, +inf, +inf, +inf]
[2025-06-01 06:33:34] [INFO ] Flow matrix only has 137 transitions (discarded 45 similar events)
// Phase 1: matrix 137 rows 49 cols
[2025-06-01 06:33:34] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6654, 41, 14, 39] Max Struct:[+inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (5166 resets) in 1227 ms. (814 steps per ms)
BEST_FIRST walk for 4000003 steps (2264 resets) in 1735 ms. (2304 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6654, 41, 14, 45] Max Struct:[+inf, +inf, +inf, +inf]
[2025-06-01 06:33:37] [INFO ] Flow matrix only has 137 transitions (discarded 45 similar events)
[2025-06-01 06:33:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 06:33:37] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 06:33:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:33:37] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 06:33:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 06:33:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 06:33:37] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:33:37] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-01 06:33:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-01 06:33:37] [INFO ] [Nat]Added 22 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:33:37] [INFO ] Computed and/alt/rep : 56/356/56 causal constraints (skipped 79 transitions) in 9 ms.
[2025-06-01 06:33:37] [INFO ] Added : 11 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 28 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 06:33:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 06:33:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:33:37] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2025-06-01 06:33:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 06:33:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 06:33:37] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:33:37] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-01 06:33:37] [INFO ] [Nat]Added 22 Read/Feed constraints in 7 ms returned sat
[2025-06-01 06:33:37] [INFO ] Computed and/alt/rep : 56/356/56 causal constraints (skipped 79 transitions) in 11 ms.
[2025-06-01 06:33:37] [INFO ] Added : 14 causal constraints over 4 iterations in 57 ms. Result :sat
Minimization took 38 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 06:33:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 06:33:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 06:33:37] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-01 06:33:37] [INFO ] [Real]Added 22 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:33:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 06:33:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 06:33:37] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 06:33:37] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-01 06:33:37] [INFO ] [Nat]Added 22 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:33:38] [INFO ] Computed and/alt/rep : 56/356/56 causal constraints (skipped 79 transitions) in 10 ms.
[2025-06-01 06:33:38] [INFO ] Added : 20 causal constraints over 4 iterations in 64 ms. Result :sat
Minimization took 32 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 06:33:38] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 06:33:38] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:33:38] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-01 06:33:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 06:33:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 06:33:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:33:38] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-01 06:33:38] [INFO ] [Nat]Added 22 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:33:38] [INFO ] Computed and/alt/rep : 56/356/56 causal constraints (skipped 79 transitions) in 10 ms.
[2025-06-01 06:33:38] [INFO ] Added : 16 causal constraints over 4 iterations in 50 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6654, 41, 14, 45] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[661275, 41, 14, 45] Max Struct:[+inf, +inf, +inf, +inf]
Support contains 4 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 182/182 transitions.
Applied a total of 0 rules in 9 ms. Remains 49 /49 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 49/49 places, 182/182 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 182/182 transitions.
Applied a total of 0 rules in 5 ms. Remains 49 /49 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2025-06-01 06:33:41] [INFO ] Flow matrix only has 137 transitions (discarded 45 similar events)
[2025-06-01 06:33:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:33:41] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-01 06:33:41] [INFO ] Flow matrix only has 137 transitions (discarded 45 similar events)
[2025-06-01 06:33:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:33:41] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-01 06:33:41] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 06:33:42] [INFO ] Redundant transitions in 7 ms returned []
Running 180 sub problems to find dead transitions.
[2025-06-01 06:33:42] [INFO ] Flow matrix only has 137 transitions (discarded 45 similar events)
[2025-06-01 06:33:42] [INFO ] Invariant cache hit.
[2025-06-01 06:33:42] [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/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (OVERLAPS) 137/186 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 22/73 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 180 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/186 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 73 constraints, problems are : Problem set: 0 solved, 180 unsolved in 3020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (OVERLAPS) 137/186 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 22/73 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 180/253 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (OVERLAPS) 0/186 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 253 constraints, problems are : Problem set: 0 solved, 180 unsolved in 17561 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20695ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 20703ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20899 ms. Remains : 49/49 places, 182/182 transitions.
[2025-06-01 06:34:02] [INFO ] Flow matrix only has 137 transitions (discarded 45 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {12=1, 24=1, 82=1, 83=1, 130=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {12=1, 24=1, 82=1, 83=1, 129=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 64 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :[18, 5, 2147483647, 4]
Current structural bounds on expressions (after cover walk) : Max Seen:[661275, 41, +inf, 45] Max Struct:[+inf, +inf, +inf, +inf]
[2025-06-01 06:34:02] [INFO ] Flow matrix only has 137 transitions (discarded 45 similar events)
[2025-06-01 06:34:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[661275, 41, +inf, 45] Max Struct:[+inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (5036 resets) in 1216 ms. (821 steps per ms)
FORMULA DoubleLock-PT-p1s1-UpperBounds-08 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 3000002 steps (2308 resets) in 1268 ms. (2364 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[661275, 42, 45] Max Struct:[+inf, +inf, +inf]
[2025-06-01 06:34:05] [INFO ] Flow matrix only has 137 transitions (discarded 45 similar events)
[2025-06-01 06:34:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 06:34:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 06:34:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 06:34:05] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 06:34:05] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-01 06:34:05] [INFO ] [Real]Added 22 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:34:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 06:34:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 06:34:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 06:34:05] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-01 06:34:05] [INFO ] [Nat]Added 22 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:34:05] [INFO ] Computed and/alt/rep : 56/356/56 causal constraints (skipped 79 transitions) in 7 ms.
[2025-06-01 06:34:05] [INFO ] Added : 6 causal constraints over 2 iterations in 27 ms. Result :sat
Minimization took 27 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 06:34:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 06:34:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:34:05] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 06:34:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 06:34:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 06:34:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 06:34:05] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-01 06:34:05] [INFO ] [Nat]Added 22 Read/Feed constraints in 5 ms returned sat
[2025-06-01 06:34:05] [INFO ] Computed and/alt/rep : 56/356/56 causal constraints (skipped 79 transitions) in 10 ms.
[2025-06-01 06:34:05] [INFO ] Added : 14 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 28 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 06:34:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 06:34:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:34:05] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 06:34:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 06:34:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 06:34:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:34:05] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-01 06:34:05] [INFO ] [Nat]Added 22 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:34:05] [INFO ] Computed and/alt/rep : 56/356/56 causal constraints (skipped 79 transitions) in 9 ms.
[2025-06-01 06:34:05] [INFO ] Added : 16 causal constraints over 4 iterations in 49 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[661275, 42, 45] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5998972, 42, 45] Max Struct:[+inf, +inf, +inf]
Support contains 3 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 182/182 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 49 transition count 180
Applied a total of 2 rules in 7 ms. Remains 49 /49 variables (removed 0) and now considering 180/182 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 49/49 places, 180/182 transitions.
[2025-06-01 06:34:35] [INFO ] Flow matrix only has 135 transitions (discarded 45 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {5=2, 6=2, 11=1, 23=1, 43=2, 80=1, 81=1, 88=2, 89=2, 126=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {11=1, 23=1, 83=1, 84=1, 129=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :[2147483647, 2147483647, 2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf, +inf, +inf] Max Struct:[+inf, +inf, +inf]
[2025-06-01 06:34:36] [INFO ] Flow matrix only has 135 transitions (discarded 45 similar events)
// Phase 1: matrix 135 rows 49 cols
[2025-06-01 06:34:36] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[+inf, +inf, +inf] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1472 ms. (678 steps per ms)
FORMULA DoubleLock-PT-p1s1-UpperBounds-15 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p1s1-UpperBounds-14 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p1s1-UpperBounds-03 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p1s1-UpperBounds-01 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-01 06:34:37] [INFO ] Flatten gal took : 48 ms
[2025-06-01 06:34:37] [INFO ] Flatten gal took : 34 ms
[2025-06-01 06:34:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2382905925470106083.gal : 8 ms
[2025-06-01 06:34:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4750230664288681521.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/ReachabilityCardinality2382905925470106083.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4750230664288681521.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

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

BK_STOP 1748759677898

--------------------
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="DoubleLock-PT-p1s1"
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 DoubleLock-PT-p1s1, 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 r072-tall-174860067600525"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleLock-PT-p1s1.tgz
mv DoubleLock-PT-p1s1 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;