About the Execution of 2024-gold for CANInsertWithFailure-PT-005
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15695.140 | 61320.00 | 90363.00 | 354.90 | 1 1 1 1 1 1 4 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r041-smll-174853822500032.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 gold2024
Input is CANInsertWithFailure-PT-005, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-smll-174853822500032
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 193K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 125K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 202K 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 CANInsertWithFailure-PT-005-UpperBounds-00
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-01
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-02
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-03
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-04
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-05
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-06
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-07
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-08
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-09
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-10
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-11
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-12
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-13
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-14
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748547868017
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-005
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 19:44:30] [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 19:44:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 19:44:30] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2025-05-29 19:44:30] [INFO ] Transformed 114 places.
[2025-05-29 19:44:30] [INFO ] Transformed 180 transitions.
[2025-05-29 19:44:30] [INFO ] Parsed PT model containing 114 places and 180 transitions and 500 arcs in 301 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 180 rows 114 cols
[2025-05-29 19:44:30] [INFO ] Computed 8 invariants in 27 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 5, 1, 275, 5, 5, 5, 5, 5, 5, 5, 1, 5, 5, 5]
RANDOM walk for 10000 steps (107 resets) in 50 ms. (196 steps per ms)
FORMULA CANInsertWithFailure-PT-005-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANInsertWithFailure-PT-005-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANInsertWithFailure-PT-005-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANInsertWithFailure-PT-005-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120008 steps (267 resets) in 159 ms. (750 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[5, 275, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5]
[2025-05-29 19:44:31] [INFO ] Invariant cache hit.
[2025-05-29 19:44:31] [INFO ] [Real]Absence check using 6 positive place invariants in 11 ms returned sat
[2025-05-29 19:44:31] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-29 19:44:31] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2025-05-29 19:44:31] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-29 19:44:31] [INFO ] [Real]Added 45 Read/Feed constraints in 19 ms returned sat
[2025-05-29 19:44:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:44:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-05-29 19:44:31] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-29 19:44:31] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2025-05-29 19:44:31] [INFO ] [Nat]Added 45 Read/Feed constraints in 24 ms returned sat
[2025-05-29 19:44:31] [INFO ] Computed and/alt/rep : 165/270/165 causal constraints (skipped 10 transitions) in 62 ms.
[2025-05-29 19:44:32] [INFO ] Added : 40 causal constraints over 8 iterations in 302 ms. Result :sat
Minimization took 194 ms.
[2025-05-29 19:44:32] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-05-29 19:44:32] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 3 ms returned unsat
[2025-05-29 19:44:32] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2025-05-29 19:44:32] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 19:44:32] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2025-05-29 19:44:32] [INFO ] [Real]Added 45 Read/Feed constraints in 10 ms returned sat
[2025-05-29 19:44:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:44:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-05-29 19:44:32] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-29 19:44:32] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2025-05-29 19:44:32] [INFO ] [Nat]Added 45 Read/Feed constraints in 22 ms returned sat
[2025-05-29 19:44:32] [INFO ] Computed and/alt/rep : 165/270/165 causal constraints (skipped 10 transitions) in 21 ms.
[2025-05-29 19:44:33] [INFO ] Added : 48 causal constraints over 10 iterations in 207 ms. Result :sat
Minimization took 145 ms.
[2025-05-29 19:44:33] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-05-29 19:44:33] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-29 19:44:33] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2025-05-29 19:44:33] [INFO ] [Real]Added 45 Read/Feed constraints in 6 ms returned unsat
[2025-05-29 19:44:33] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-05-29 19:44:33] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-29 19:44:33] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2025-05-29 19:44:33] [INFO ] [Real]Added 45 Read/Feed constraints in 9 ms returned sat
[2025-05-29 19:44:33] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:44:33] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-05-29 19:44:33] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-29 19:44:33] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2025-05-29 19:44:33] [INFO ] [Nat]Added 45 Read/Feed constraints in 25 ms returned sat
[2025-05-29 19:44:33] [INFO ] Computed and/alt/rep : 165/270/165 causal constraints (skipped 10 transitions) in 22 ms.
[2025-05-29 19:44:33] [INFO ] Added : 51 causal constraints over 11 iterations in 214 ms. Result :sat
Minimization took 102 ms.
[2025-05-29 19:44:34] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-05-29 19:44:34] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 4 ms returned unsat
[2025-05-29 19:44:34] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-05-29 19:44:34] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 19:44:34] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2025-05-29 19:44:34] [INFO ] [Real]Added 45 Read/Feed constraints in 8 ms returned sat
[2025-05-29 19:44:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:44:34] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-05-29 19:44:34] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-29 19:44:34] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2025-05-29 19:44:34] [INFO ] [Nat]Added 45 Read/Feed constraints in 17 ms returned sat
[2025-05-29 19:44:34] [INFO ] Computed and/alt/rep : 165/270/165 causal constraints (skipped 10 transitions) in 23 ms.
[2025-05-29 19:44:34] [INFO ] Added : 38 causal constraints over 8 iterations in 166 ms. Result :sat
Minimization took 87 ms.
[2025-05-29 19:44:34] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-05-29 19:44:34] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 19:44:34] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2025-05-29 19:44:34] [INFO ] [Real]Added 45 Read/Feed constraints in 9 ms returned sat
[2025-05-29 19:44:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:44:34] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-05-29 19:44:34] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-29 19:44:34] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2025-05-29 19:44:35] [INFO ] [Nat]Added 45 Read/Feed constraints in 33 ms returned sat
[2025-05-29 19:44:35] [INFO ] Computed and/alt/rep : 165/270/165 causal constraints (skipped 10 transitions) in 29 ms.
[2025-05-29 19:44:35] [INFO ] Added : 38 causal constraints over 8 iterations in 230 ms. Result :sat
Minimization took 150 ms.
[2025-05-29 19:44:35] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-05-29 19:44:35] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-29 19:44:35] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2025-05-29 19:44:35] [INFO ] [Real]Added 45 Read/Feed constraints in 8 ms returned sat
[2025-05-29 19:44:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:44:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-05-29 19:44:35] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-29 19:44:35] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2025-05-29 19:44:35] [INFO ] [Nat]Added 45 Read/Feed constraints in 17 ms returned sat
[2025-05-29 19:44:35] [INFO ] Computed and/alt/rep : 165/270/165 causal constraints (skipped 10 transitions) in 24 ms.
[2025-05-29 19:44:35] [INFO ] Added : 49 causal constraints over 10 iterations in 178 ms. Result :sat
Minimization took 107 ms.
[2025-05-29 19:44:36] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-05-29 19:44:36] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 19:44:36] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2025-05-29 19:44:36] [INFO ] [Real]Added 45 Read/Feed constraints in 8 ms returned sat
[2025-05-29 19:44:36] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:44:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-05-29 19:44:36] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-29 19:44:36] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2025-05-29 19:44:36] [INFO ] [Nat]Added 45 Read/Feed constraints in 16 ms returned sat
[2025-05-29 19:44:36] [INFO ] Computed and/alt/rep : 165/270/165 causal constraints (skipped 10 transitions) in 18 ms.
[2025-05-29 19:44:36] [INFO ] Added : 38 causal constraints over 8 iterations in 174 ms. Result :sat
Minimization took 140 ms.
[2025-05-29 19:44:36] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-05-29 19:44:36] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-29 19:44:36] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2025-05-29 19:44:36] [INFO ] [Real]Added 45 Read/Feed constraints in 9 ms returned sat
[2025-05-29 19:44:36] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:44:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-05-29 19:44:36] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 19:44:36] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2025-05-29 19:44:36] [INFO ] [Nat]Added 45 Read/Feed constraints in 21 ms returned sat
[2025-05-29 19:44:37] [INFO ] Computed and/alt/rep : 165/270/165 causal constraints (skipped 10 transitions) in 20 ms.
[2025-05-29 19:44:37] [INFO ] Added : 38 causal constraints over 8 iterations in 173 ms. Result :sat
Minimization took 174 ms.
[2025-05-29 19:44:37] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-05-29 19:44:37] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 1 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[5, 1, 5, 4, 5, 1, 5, 5, 5, 5, 5, 1]
FORMULA CANInsertWithFailure-PT-005-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CANInsertWithFailure-PT-005-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CANInsertWithFailure-PT-005-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CANInsertWithFailure-PT-005-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[5, 5, 5, 5, 5, 5, 5, 5]
Support contains 8 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 180/180 transitions.
Graph (complete) has 276 edges and 114 vertex of which 113 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 113 transition count 146
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 79 transition count 146
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 69 place count 79 transition count 145
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 78 transition count 145
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 105 place count 61 transition count 128
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 2 with 11 rules applied. Total rules applied 116 place count 61 transition count 117
Partial Free-agglomeration rule applied 29 times.
Drop transitions (Partial Free agglomeration) removed 29 transitions
Iterating global reduction 2 with 29 rules applied. Total rules applied 145 place count 61 transition count 117
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 149 place count 61 transition count 117
Applied a total of 149 rules in 82 ms. Remains 61 /114 variables (removed 53) and now considering 117/180 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 61/114 places, 117/180 transitions.
// Phase 1: matrix 117 rows 61 cols
[2025-05-29 19:44:37] [INFO ] Computed 7 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[5, 5, 5, 5, 5, 5, 5, 5]
RANDOM walk for 1000000 steps (34672 resets) in 1597 ms. (625 steps per ms)
BEST_FIRST walk for 8000005 steps (54863 resets) in 3790 ms. (2110 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[5, 5, 5, 5, 5, 5, 5, 5]
[2025-05-29 19:44:43] [INFO ] Invariant cache hit.
[2025-05-29 19:44:43] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-05-29 19:44:43] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-29 19:44:43] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2025-05-29 19:44:43] [INFO ] State equation strengthened by 89 read => feed constraints.
[2025-05-29 19:44:43] [INFO ] [Real]Added 89 Read/Feed constraints in 11 ms returned sat
[2025-05-29 19:44:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:44:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-05-29 19:44:43] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-29 19:44:43] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2025-05-29 19:44:43] [INFO ] [Nat]Added 89 Read/Feed constraints in 21 ms returned sat
[2025-05-29 19:44:43] [INFO ] Computed and/alt/rep : 98/352/98 causal constraints (skipped 14 transitions) in 18 ms.
[2025-05-29 19:44:43] [INFO ] Added : 16 causal constraints over 4 iterations in 94 ms. Result :sat
Minimization took 96 ms.
[2025-05-29 19:44:43] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-05-29 19:44:43] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 19:44:43] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2025-05-29 19:44:43] [INFO ] [Real]Added 89 Read/Feed constraints in 20 ms returned sat
[2025-05-29 19:44:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:44:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-29 19:44:43] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 19:44:43] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2025-05-29 19:44:43] [INFO ] [Nat]Added 89 Read/Feed constraints in 20 ms returned sat
[2025-05-29 19:44:43] [INFO ] Computed and/alt/rep : 98/352/98 causal constraints (skipped 14 transitions) in 18 ms.
[2025-05-29 19:44:44] [INFO ] Added : 19 causal constraints over 4 iterations in 101 ms. Result :sat
Minimization took 101 ms.
[2025-05-29 19:44:44] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-29 19:44:44] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 9 ms returned sat
[2025-05-29 19:44:44] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2025-05-29 19:44:44] [INFO ] [Real]Added 89 Read/Feed constraints in 17 ms returned sat
[2025-05-29 19:44:44] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:44:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-29 19:44:44] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 19:44:44] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2025-05-29 19:44:44] [INFO ] [Nat]Added 89 Read/Feed constraints in 19 ms returned sat
[2025-05-29 19:44:44] [INFO ] Computed and/alt/rep : 98/352/98 causal constraints (skipped 14 transitions) in 18 ms.
[2025-05-29 19:44:44] [INFO ] Added : 21 causal constraints over 5 iterations in 123 ms. Result :sat
Minimization took 103 ms.
[2025-05-29 19:44:44] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-29 19:44:44] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 19:44:44] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2025-05-29 19:44:44] [INFO ] [Real]Added 89 Read/Feed constraints in 17 ms returned sat
[2025-05-29 19:44:44] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:44:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-29 19:44:44] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-29 19:44:44] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2025-05-29 19:44:44] [INFO ] [Nat]Added 89 Read/Feed constraints in 22 ms returned sat
[2025-05-29 19:44:44] [INFO ] Computed and/alt/rep : 98/352/98 causal constraints (skipped 14 transitions) in 17 ms.
[2025-05-29 19:44:45] [INFO ] Added : 20 causal constraints over 4 iterations in 101 ms. Result :sat
Minimization took 99 ms.
[2025-05-29 19:44:45] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-29 19:44:45] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-29 19:44:45] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2025-05-29 19:44:45] [INFO ] [Real]Added 89 Read/Feed constraints in 16 ms returned sat
[2025-05-29 19:44:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:44:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-29 19:44:45] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 19:44:45] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2025-05-29 19:44:45] [INFO ] [Nat]Added 89 Read/Feed constraints in 24 ms returned sat
[2025-05-29 19:44:45] [INFO ] Computed and/alt/rep : 98/352/98 causal constraints (skipped 14 transitions) in 15 ms.
[2025-05-29 19:44:45] [INFO ] Added : 19 causal constraints over 4 iterations in 94 ms. Result :sat
Minimization took 98 ms.
[2025-05-29 19:44:45] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-29 19:44:45] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 19:44:45] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2025-05-29 19:44:45] [INFO ] [Real]Added 89 Read/Feed constraints in 17 ms returned sat
[2025-05-29 19:44:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:44:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-29 19:44:45] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 19:44:45] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2025-05-29 19:44:45] [INFO ] [Nat]Added 89 Read/Feed constraints in 23 ms returned sat
[2025-05-29 19:44:45] [INFO ] Computed and/alt/rep : 98/352/98 causal constraints (skipped 14 transitions) in 17 ms.
[2025-05-29 19:44:46] [INFO ] Added : 19 causal constraints over 4 iterations in 169 ms. Result :sat
Minimization took 96 ms.
[2025-05-29 19:44:46] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-05-29 19:44:46] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 19:44:46] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2025-05-29 19:44:46] [INFO ] [Real]Added 89 Read/Feed constraints in 17 ms returned sat
[2025-05-29 19:44:46] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:44:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-29 19:44:46] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-29 19:44:46] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2025-05-29 19:44:46] [INFO ] [Nat]Added 89 Read/Feed constraints in 23 ms returned sat
[2025-05-29 19:44:46] [INFO ] Computed and/alt/rep : 98/352/98 causal constraints (skipped 14 transitions) in 17 ms.
[2025-05-29 19:44:46] [INFO ] Added : 17 causal constraints over 4 iterations in 95 ms. Result :sat
Minimization took 101 ms.
[2025-05-29 19:44:46] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-29 19:44:46] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 19:44:46] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2025-05-29 19:44:46] [INFO ] [Real]Added 89 Read/Feed constraints in 18 ms returned sat
[2025-05-29 19:44:46] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:44:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-29 19:44:46] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 19:44:46] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2025-05-29 19:44:46] [INFO ] [Nat]Added 89 Read/Feed constraints in 21 ms returned sat
[2025-05-29 19:44:46] [INFO ] Computed and/alt/rep : 98/352/98 causal constraints (skipped 14 transitions) in 17 ms.
[2025-05-29 19:44:47] [INFO ] Added : 22 causal constraints over 6 iterations in 121 ms. Result :sat
Minimization took 92 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[5, 5, 5, 5, 5, 5, 5, 5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[5, 5, 5, 5, 5, 5, 5, 5]
Support contains 8 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 117/117 transitions.
Applied a total of 0 rules in 7 ms. Remains 61 /61 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 61/61 places, 117/117 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 117/117 transitions.
Applied a total of 0 rules in 7 ms. Remains 61 /61 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2025-05-29 19:44:47] [INFO ] Invariant cache hit.
[2025-05-29 19:44:47] [INFO ] Implicit Places using invariants in 164 ms returned []
[2025-05-29 19:44:47] [INFO ] Invariant cache hit.
[2025-05-29 19:44:47] [INFO ] State equation strengthened by 89 read => feed constraints.
[2025-05-29 19:44:47] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2025-05-29 19:44:47] [INFO ] Redundant transitions in 5 ms returned []
Running 112 sub problems to find dead transitions.
[2025-05-29 19:44:47] [INFO ] Invariant cache hit.
[2025-05-29 19:44:47] [INFO ] State equation strengthened by 89 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2025-05-29 19:44:48] [INFO ] Deduced a trap composed of 2 places in 116 ms of which 15 ms to minimize.
[2025-05-29 19:44:48] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 2 ms to minimize.
[2025-05-29 19:44:48] [INFO ] Deduced a trap composed of 2 places in 58 ms of which 2 ms to minimize.
[2025-05-29 19:44:48] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
[2025-05-29 19:44:48] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 2 ms to minimize.
[2025-05-29 19:44:48] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 2 ms to minimize.
[2025-05-29 19:44:48] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 2 ms to minimize.
[2025-05-29 19:44:49] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2025-05-29 19:44:49] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2025-05-29 19:44:49] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2025-05-29 19:44:49] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 2 ms to minimize.
[2025-05-29 19:44:49] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2025-05-29 19:44:49] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 2 ms to minimize.
[2025-05-29 19:44:49] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2025-05-29 19:44:49] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 2 ms to minimize.
[2025-05-29 19:44:49] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2025-05-29 19:44:49] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2025-05-29 19:44:49] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2025-05-29 19:44:49] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2025-05-29 19:44:49] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2025-05-29 19:44:49] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2025-05-29 19:44:50] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 2 ms to minimize.
[2025-05-29 19:44:50] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 2 ms to minimize.
[2025-05-29 19:44:50] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2025-05-29 19:44:50] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2025-05-29 19:44:51] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2025-05-29 19:44:51] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (OVERLAPS) 117/177 variables, 60/94 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Problem TDEAD97 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD116 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 89/183 constraints. Problems are: Problem set: 4 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/183 constraints. Problems are: Problem set: 4 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 1/178 variables, 1/184 constraints. Problems are: Problem set: 4 solved, 108 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 0/184 constraints. Problems are: Problem set: 4 solved, 108 unsolved
At refinement iteration 12 (OVERLAPS) 0/178 variables, 0/184 constraints. Problems are: Problem set: 4 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 184 constraints, problems are : Problem set: 4 solved, 108 unsolved in 9576 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 4 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 4 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 2/7 constraints. Problems are: Problem set: 4 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 27/34 constraints. Problems are: Problem set: 4 solved, 108 unsolved
[2025-05-29 19:44:57] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 1/35 constraints. Problems are: Problem set: 4 solved, 108 unsolved
[2025-05-29 19:44:58] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/36 constraints. Problems are: Problem set: 4 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 4 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 117/177 variables, 60/96 constraints. Problems are: Problem set: 4 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 89/185 constraints. Problems are: Problem set: 4 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 108/293 constraints. Problems are: Problem set: 4 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/293 constraints. Problems are: Problem set: 4 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 1/178 variables, 1/294 constraints. Problems are: Problem set: 4 solved, 108 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 0/294 constraints. Problems are: Problem set: 4 solved, 108 unsolved
At refinement iteration 12 (OVERLAPS) 0/178 variables, 0/294 constraints. Problems are: Problem set: 4 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 294 constraints, problems are : Problem set: 4 solved, 108 unsolved in 7640 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 108/112 constraints, Known Traps: 29/29 constraints]
After SMT, in 17354ms problems are : Problem set: 4 solved, 108 unsolved
Search for dead transitions found 4 dead transitions in 17375ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 61/61 places, 113/117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 59 transition count 109
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 59 transition count 109
Applied a total of 4 rules in 10 ms. Remains 59 /61 variables (removed 2) and now considering 109/113 (removed 4) transitions.
// Phase 1: matrix 109 rows 59 cols
[2025-05-29 19:45:05] [INFO ] Computed 7 invariants in 2 ms
[2025-05-29 19:45:05] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-05-29 19:45:05] [INFO ] Invariant cache hit.
[2025-05-29 19:45:05] [INFO ] State equation strengthened by 83 read => feed constraints.
[2025-05-29 19:45:05] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 59/61 places, 109/117 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 18203 ms. Remains : 59/61 places, 109/117 transitions.
[2025-05-29 19:45:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[5, 5, 5, 5, 5, 5, 5, 5]
RANDOM walk for 1000000 steps (34630 resets) in 1552 ms. (643 steps per ms)
BEST_FIRST walk for 8000006 steps (54810 resets) in 3585 ms. (2230 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[5, 5, 5, 5, 5, 5, 5, 5]
[2025-05-29 19:45:10] [INFO ] Invariant cache hit.
[2025-05-29 19:45:10] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-05-29 19:45:10] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-29 19:45:10] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2025-05-29 19:45:10] [INFO ] State equation strengthened by 83 read => feed constraints.
[2025-05-29 19:45:10] [INFO ] [Real]Added 83 Read/Feed constraints in 10 ms returned sat
[2025-05-29 19:45:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:45:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-05-29 19:45:10] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-29 19:45:10] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2025-05-29 19:45:10] [INFO ] [Nat]Added 83 Read/Feed constraints in 16 ms returned sat
[2025-05-29 19:45:10] [INFO ] Computed and/alt/rep : 98/379/98 causal constraints (skipped 6 transitions) in 11 ms.
[2025-05-29 19:45:10] [INFO ] Added : 23 causal constraints over 6 iterations in 102 ms. Result :sat
Minimization took 95 ms.
[2025-05-29 19:45:10] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-05-29 19:45:10] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-29 19:45:10] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2025-05-29 19:45:11] [INFO ] [Real]Added 83 Read/Feed constraints in 15 ms returned sat
[2025-05-29 19:45:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:45:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-05-29 19:45:11] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-29 19:45:11] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2025-05-29 19:45:11] [INFO ] [Nat]Added 83 Read/Feed constraints in 21 ms returned sat
[2025-05-29 19:45:11] [INFO ] Computed and/alt/rep : 98/379/98 causal constraints (skipped 6 transitions) in 13 ms.
[2025-05-29 19:45:11] [INFO ] Added : 40 causal constraints over 10 iterations in 175 ms. Result :sat
Minimization took 88 ms.
[2025-05-29 19:45:11] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-05-29 19:45:11] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 19:45:11] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2025-05-29 19:45:11] [INFO ] [Real]Added 83 Read/Feed constraints in 13 ms returned sat
[2025-05-29 19:45:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:45:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-05-29 19:45:11] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 19:45:11] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2025-05-29 19:45:11] [INFO ] [Nat]Added 83 Read/Feed constraints in 14 ms returned sat
[2025-05-29 19:45:11] [INFO ] Computed and/alt/rep : 98/379/98 causal constraints (skipped 6 transitions) in 12 ms.
[2025-05-29 19:45:11] [INFO ] Added : 16 causal constraints over 4 iterations in 71 ms. Result :sat
Minimization took 53 ms.
[2025-05-29 19:45:11] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-29 19:45:11] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-29 19:45:11] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2025-05-29 19:45:11] [INFO ] [Real]Added 83 Read/Feed constraints in 14 ms returned sat
[2025-05-29 19:45:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:45:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-05-29 19:45:11] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 19:45:11] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2025-05-29 19:45:11] [INFO ] [Nat]Added 83 Read/Feed constraints in 16 ms returned sat
[2025-05-29 19:45:11] [INFO ] Computed and/alt/rep : 98/379/98 causal constraints (skipped 6 transitions) in 17 ms.
[2025-05-29 19:45:12] [INFO ] Added : 21 causal constraints over 5 iterations in 102 ms. Result :sat
Minimization took 92 ms.
[2025-05-29 19:45:12] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-05-29 19:45:12] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 19:45:12] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2025-05-29 19:45:12] [INFO ] [Real]Added 83 Read/Feed constraints in 17 ms returned sat
[2025-05-29 19:45:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:45:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-05-29 19:45:12] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 19:45:12] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2025-05-29 19:45:12] [INFO ] [Nat]Added 83 Read/Feed constraints in 17 ms returned sat
[2025-05-29 19:45:12] [INFO ] Computed and/alt/rep : 98/379/98 causal constraints (skipped 6 transitions) in 15 ms.
[2025-05-29 19:45:12] [INFO ] Added : 36 causal constraints over 8 iterations in 184 ms. Result :sat
Minimization took 104 ms.
[2025-05-29 19:45:12] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-05-29 19:45:12] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-29 19:45:12] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2025-05-29 19:45:12] [INFO ] [Real]Added 83 Read/Feed constraints in 16 ms returned sat
[2025-05-29 19:45:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:45:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-05-29 19:45:12] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-29 19:45:12] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2025-05-29 19:45:12] [INFO ] [Nat]Added 83 Read/Feed constraints in 21 ms returned sat
[2025-05-29 19:45:12] [INFO ] Computed and/alt/rep : 98/379/98 causal constraints (skipped 6 transitions) in 16 ms.
[2025-05-29 19:45:13] [INFO ] Added : 22 causal constraints over 5 iterations in 112 ms. Result :sat
Minimization took 89 ms.
[2025-05-29 19:45:13] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-05-29 19:45:13] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-29 19:45:13] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2025-05-29 19:45:13] [INFO ] [Real]Added 83 Read/Feed constraints in 25 ms returned sat
[2025-05-29 19:45:13] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:45:13] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-05-29 19:45:13] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-29 19:45:13] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2025-05-29 19:45:13] [INFO ] [Nat]Added 83 Read/Feed constraints in 20 ms returned sat
[2025-05-29 19:45:13] [INFO ] Computed and/alt/rep : 98/379/98 causal constraints (skipped 6 transitions) in 15 ms.
[2025-05-29 19:45:13] [INFO ] Added : 21 causal constraints over 5 iterations in 104 ms. Result :sat
Minimization took 70 ms.
[2025-05-29 19:45:13] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-05-29 19:45:13] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 19:45:13] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2025-05-29 19:45:13] [INFO ] [Real]Added 83 Read/Feed constraints in 15 ms returned sat
[2025-05-29 19:45:13] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:45:13] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-05-29 19:45:13] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 19:45:13] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2025-05-29 19:45:13] [INFO ] [Nat]Added 83 Read/Feed constraints in 24 ms returned sat
[2025-05-29 19:45:13] [INFO ] Computed and/alt/rep : 98/379/98 causal constraints (skipped 6 transitions) in 15 ms.
[2025-05-29 19:45:13] [INFO ] Added : 11 causal constraints over 3 iterations in 71 ms. Result :sat
Minimization took 81 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[5, 5, 5, 5, 5, 5, 5, 5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[5, 5, 5, 5, 5, 5, 5, 5]
Support contains 8 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 109/109 transitions.
Applied a total of 0 rules in 8 ms. Remains 59 /59 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 59/59 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 109/109 transitions.
Applied a total of 0 rules in 6 ms. Remains 59 /59 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2025-05-29 19:45:14] [INFO ] Invariant cache hit.
[2025-05-29 19:45:14] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-05-29 19:45:14] [INFO ] Invariant cache hit.
[2025-05-29 19:45:14] [INFO ] State equation strengthened by 83 read => feed constraints.
[2025-05-29 19:45:14] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2025-05-29 19:45:14] [INFO ] Redundant transitions in 4 ms returned []
Running 104 sub problems to find dead transitions.
[2025-05-29 19:45:14] [INFO ] Invariant cache hit.
[2025-05-29 19:45:14] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2025-05-29 19:45:14] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 2 ms to minimize.
[2025-05-29 19:45:15] [INFO ] Deduced a trap composed of 2 places in 61 ms of which 2 ms to minimize.
[2025-05-29 19:45:15] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 2 ms to minimize.
[2025-05-29 19:45:15] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 2 ms to minimize.
[2025-05-29 19:45:15] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 2 ms to minimize.
[2025-05-29 19:45:15] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 3 ms to minimize.
[2025-05-29 19:45:15] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2025-05-29 19:45:15] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2025-05-29 19:45:15] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 2 ms to minimize.
[2025-05-29 19:45:15] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 2 ms to minimize.
[2025-05-29 19:45:15] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:45:15] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 2 ms to minimize.
[2025-05-29 19:45:15] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2025-05-29 19:45:15] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 2 ms to minimize.
[2025-05-29 19:45:15] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2025-05-29 19:45:15] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2025-05-29 19:45:15] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2025-05-29 19:45:16] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:45:16] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2025-05-29 19:45:16] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2025-05-29 19:45:16] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 2 ms to minimize.
[2025-05-29 19:45:16] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 109/167 variables, 58/87 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 83/170 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (OVERLAPS) 1/168 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (OVERLAPS) 0/168 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 171 constraints, problems are : Problem set: 0 solved, 104 unsolved in 6640 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2025-05-29 19:45:21] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2025-05-29 19:45:21] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2025-05-29 19:45:21] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 109/167 variables, 58/90 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 83/173 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 104/277 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (OVERLAPS) 1/168 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/168 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 12 (OVERLAPS) 0/168 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 278 constraints, problems are : Problem set: 0 solved, 104 unsolved in 5373 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 25/25 constraints]
After SMT, in 12066ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 12070ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12435 ms. Remains : 59/59 places, 109/109 transitions.
[2025-05-29 19:45:27] [INFO ] Flatten gal took : 131 ms
RANDOM walk for 40000 steps (1355 resets) in 2575 ms. (15 steps per ms) remains 16/16 properties
[2025-05-29 19:45:27] [INFO ] Flatten gal took : 72 ms
BEST_FIRST walk for 4002 steps (26 resets) in 104 ms. (38 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (25 resets) in 81 ms. (48 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (26 resets) in 58 ms. (67 steps per ms) remains 16/16 properties
[2025-05-29 19:45:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15219292671513254353.gal : 25 ms
BEST_FIRST walk for 4003 steps (25 resets) in 63 ms. (62 steps per ms) remains 16/16 properties
[2025-05-29 19:45:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15017096775532541243.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15219292671513254353.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15017096775532541243.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4003 steps (24 resets) in 54 ms. (72 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (26 resets) in 59 ms. (66 steps per ms) remains 16/16 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 4004 steps (28 resets) in 62 ms. (63 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (25 resets) in 72 ms. (54 steps per ms) remains 16/16 properties
Loading property file /tmp/ReachabilityCardinality15017096775532541243.prop.
BEST_FIRST walk for 4002 steps (23 resets) in 58 ms. (67 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :7 after 11
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :11 after 12
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :12 after 56
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :56 after 70
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :70 after 111
BEST_FIRST walk for 4003 steps (26 resets) in 56 ms. (70 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :111 after 480
BEST_FIRST walk for 4004 steps (24 resets) in 56 ms. (70 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :480 after 1249
BEST_FIRST walk for 4004 steps (25 resets) in 59 ms. (66 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (26 resets) in 49 ms. (80 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (22 resets) in 42 ms. (93 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (24 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (24 resets) in 44 ms. (88 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :1249 after 12807
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,17711,0.339774,11976,2,4034,14,25120,22,0,345,27466,0
Total reachable state count : 17711
Verifying 16 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.341153,11976,1,0,14,25120,22,0,346,27466,0
Invariant property MIN0 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
MIN0,0,0.341677,12236,1,0,14,25120,22,0,346,27466,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.342104,12236,1,0,14,25120,22,0,346,27466,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.342349,12236,1,0,14,25120,22,0,346,27466,0
Reachability property MAX2 does not hold.
No reachable states exhibit your property : MAX2
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,0,0.343472,12236,1,0,14,25120,22,0,346,27466,0
Invariant property MIN2 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
MIN2,0,0.344457,12236,1,0,14,25120,22,0,346,27466,0
Reachability property MAX3 does not hold.
No reachable states exhibit your property : MAX3
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX3,0,0.345283,12236,1,0,14,25120,22,0,346,27466,0
Invariant property MIN3 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
MIN3,0,0.346046,12236,1,0,14,25120,22,0,346,27466,0
Reachability property MAX4 does not hold.
No reachable states exhibit your property : MAX4
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX4,0,0.347705,12236,1,0,14,25120,22,0,346,27466,0
Invariant property MIN4 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
MIN4,0,0.349512,12236,1,0,14,25120,22,0,346,27466,0
Reachability property MAX5 does not hold.
No reachable states exhibit your property : MAX5
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX5,0,0.35024,12236,1,0,14,25120,22,0,346,27466,0
Invariant property MIN5 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
MIN5,0,0.350832,12236,1,0,14,25120,22,0,346,27466,0
Reachability property MAX6 does not hold.
No reachable states exhibit your property : MAX6
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX6,0,0.352888,12236,1,0,14,25120,22,0,346,27466,0
Invariant property MIN6 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
MIN6,0,0.354654,12236,1,0,14,25120,22,0,346,27466,0
Reachability property MAX7 does not hold.
No reachable states exhibit your property : MAX7
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX7,0,0.356082,12236,1,0,14,25120,22,0,346,27466,0
Invariant property MIN7 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
MIN7,0,0.357456,12236,1,0,14,25120,22,0,346,27466,0
ITS tools runner thread asked to quit. Dying gracefully.
Probably explored full state space saw : 17711 states, properties seen :0
Probabilistic random walk after 96609 steps, saw 17711 distinct states, run finished after 888 ms. (steps per millisecond=108 ) properties seen :0
Explored full state space saw : 17711 states, properties seen :0
Exhaustive walk after 96609 steps, saw 17711 distinct states, run finished after 514 ms. (steps per millisecond=187 ) properties seen :0
FORMULA CANInsertWithFailure-PT-005-UpperBounds-14 1 TECHNIQUES REACHABILITY_MIN
FORMULA CANInsertWithFailure-PT-005-UpperBounds-13 1 TECHNIQUES REACHABILITY_MIN
FORMULA CANInsertWithFailure-PT-005-UpperBounds-11 1 TECHNIQUES REACHABILITY_MIN
FORMULA CANInsertWithFailure-PT-005-UpperBounds-10 1 TECHNIQUES REACHABILITY_MIN
FORMULA CANInsertWithFailure-PT-005-UpperBounds-09 1 TECHNIQUES REACHABILITY_MIN
FORMULA CANInsertWithFailure-PT-005-UpperBounds-07 1 TECHNIQUES REACHABILITY_MIN
FORMULA CANInsertWithFailure-PT-005-UpperBounds-05 1 TECHNIQUES REACHABILITY_MIN
FORMULA CANInsertWithFailure-PT-005-UpperBounds-02 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 8 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 58980 ms.
BK_STOP 1748547929337
--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="CANInsertWithFailure-PT-005"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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 gold2024"
echo " Input is CANInsertWithFailure-PT-005, 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 r041-smll-174853822500032"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-005.tgz
mv CANInsertWithFailure-PT-005 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 ;