About the Execution of LTSMin+red for DoubleLock-PT-p1s3
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 779130.00 | 0.00 | 0.00 | 1 1 1 1 10 1 1 1 1 1 0 1 ? 0 1 1 | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r488-tall-171631133000605.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is DoubleLock-PT-p1s3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631133000605
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 19 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 13:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 13:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.4M May 18 16:42 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
here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-00
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-01
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-02
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-03
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-04
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-05
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-06
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-07
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-08
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-09
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-10
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-11
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-12
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-13
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-14
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717201480270
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p1s3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:24:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 00:24:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:24:41] [INFO ] Load time of PNML (sax parser for PT used): 312 ms
[2024-06-01 00:24:41] [INFO ] Transformed 570 places.
[2024-06-01 00:24:41] [INFO ] Transformed 7568 transitions.
[2024-06-01 00:24:41] [INFO ] Parsed PT model containing 570 places and 7568 transitions and 30656 arcs in 450 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 132 places in 39 ms
Reduce places removed 132 places and 256 transitions.
FORMULA DoubleLock-PT-p1s3-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p1s3-UpperBounds-13 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, 0] Max Struct:[+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, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 00:24:41] [INFO ] Flow matrix only has 4971 transitions (discarded 2341 similar events)
// Phase 1: matrix 4971 rows 438 cols
[2024-06-01 00:24:42] [INFO ] Computed 4 invariants in 94 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 10, 1, 1, 1, 1, 1, 1, +inf, 1, 1]
RANDOM walk for 10000 steps (93 resets) in 96 ms. (103 steps per ms)
FORMULA DoubleLock-PT-p1s3-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s3-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s3-UpperBounds-04 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s3-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s3-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s3-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s3-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s3-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60006 steps (84 resets) in 195 ms. (306 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 2, 0] Max Struct:[1, 1, 1, 1, +inf, 1]
[2024-06-01 00:24:42] [INFO ] Flow matrix only has 4971 transitions (discarded 2341 similar events)
[2024-06-01 00:24:42] [INFO ] Invariant cache hit.
[2024-06-01 00:24:42] [INFO ] [Real]Absence check using 3 positive place invariants in 17 ms returned sat
[2024-06-01 00:24:42] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 00:24:43] [INFO ] [Real]Absence check using state equation in 865 ms returned sat
[2024-06-01 00:24:43] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-06-01 00:24:44] [INFO ] [Real]Added 400 Read/Feed constraints in 356 ms returned sat
[2024-06-01 00:24:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:24:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-06-01 00:24:44] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 00:24:45] [INFO ] [Nat]Absence check using state equation in 836 ms returned sat
[2024-06-01 00:24:45] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 00:24:46] [INFO ] [Nat]Added 400 Read/Feed constraints in 1068 ms returned unknown
[2024-06-01 00:24:46] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-06-01 00:24:46] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 00:24:47] [INFO ] [Real]Absence check using state equation in 852 ms returned sat
[2024-06-01 00:24:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:24:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-06-01 00:24:47] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 00:24:48] [INFO ] [Nat]Absence check using state equation in 859 ms returned sat
[2024-06-01 00:24:48] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 00:24:49] [INFO ] [Nat]Added 400 Read/Feed constraints in 1059 ms returned unknown
[2024-06-01 00:24:49] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-06-01 00:24:49] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 00:24:50] [INFO ] [Real]Absence check using state equation in 807 ms returned sat
[2024-06-01 00:24:50] [INFO ] [Real]Added 400 Read/Feed constraints in 362 ms returned sat
[2024-06-01 00:24:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:24:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-06-01 00:24:50] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 00:24:51] [INFO ] [Nat]Absence check using state equation in 781 ms returned sat
[2024-06-01 00:24:52] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 00:24:52] [INFO ] [Nat]Added 400 Read/Feed constraints in 1070 ms returned unknown
[2024-06-01 00:24:52] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-06-01 00:24:52] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 00:24:53] [INFO ] [Real]Absence check using state equation in 984 ms returned sat
[2024-06-01 00:24:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:24:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2024-06-01 00:24:53] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 00:24:54] [INFO ] [Nat]Absence check using state equation in 854 ms returned sat
[2024-06-01 00:24:55] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 00:24:55] [INFO ] [Nat]Added 400 Read/Feed constraints in 1061 ms returned unknown
[2024-06-01 00:24:55] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-06-01 00:24:55] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 00:24:56] [INFO ] [Real]Absence check using state equation in 722 ms returned sat
[2024-06-01 00:24:57] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 00:24:57] [INFO ] [Real]Added 400 Read/Feed constraints in 623 ms returned sat
[2024-06-01 00:24:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:24:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-06-01 00:24:57] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 00:24:58] [INFO ] [Nat]Absence check using state equation in 813 ms returned sat
[2024-06-01 00:24:58] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 00:24:59] [INFO ] [Nat]Added 400 Read/Feed constraints in 1061 ms returned unknown
[2024-06-01 00:24:59] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-06-01 00:24:59] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 00:25:00] [INFO ] [Real]Absence check using state equation in 845 ms returned sat
[2024-06-01 00:25:00] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 00:25:00] [INFO ] [Real]Added 400 Read/Feed constraints in 583 ms returned sat
[2024-06-01 00:25:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:25:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-06-01 00:25:01] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 00:25:01] [INFO ] [Nat]Absence check using state equation in 766 ms returned sat
[2024-06-01 00:25:02] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 00:25:02] [INFO ] [Nat]Added 400 Read/Feed constraints in 1055 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 2, 0] Max Struct:[1, 1, 1, 1, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 2, 0] Max Struct:[1, 1, 1, 1, +inf, 1]
Support contains 6 out of 438 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 438/438 places, 7312/7312 transitions.
Graph (complete) has 12297 edges and 438 vertex of which 434 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.19 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 434 transition count 7184
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 433 transition count 7056
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 433 transition count 7056
Applied a total of 131 rules in 451 ms. Remains 433 /438 variables (removed 5) and now considering 7056/7312 (removed 256) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 463 ms. Remains : 433/438 places, 7056/7312 transitions.
[2024-06-01 00:25:03] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
Found an invariant !
This invariant on transitions {22=1, 39=1, 3010=1, 3011=1, 4686=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {22=1, 39=1, 3022=1, 3023=1, 4697=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 125 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 6) seen :[1, 1, 0, 1, 2, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 1, 0, 1, 2, 0] Max Struct:[1, 1, 1, 1, +inf, 1]
[2024-06-01 00:25:17] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
// Phase 1: matrix 4715 rows 433 cols
[2024-06-01 00:25:17] [INFO ] Computed 3 invariants in 49 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 0, 1, 2, 0] Max Struct:[1, 1, 1, 1, +inf, 1]
FORMULA DoubleLock-PT-p1s3-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p1s3-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p1s3-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (9357 resets) in 3458 ms. (289 steps per ms)
FORMULA DoubleLock-PT-p1s3-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s3-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (1434 resets) in 1056 ms. (946 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-06-01 00:25:22] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-06-01 00:25:22] [INFO ] Invariant cache hit.
[2024-06-01 00:25:22] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-06-01 00:25:23] [INFO ] [Real]Absence check using state equation in 922 ms returned sat
[2024-06-01 00:25:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:25:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-06-01 00:25:24] [INFO ] [Nat]Absence check using state equation in 885 ms returned sat
[2024-06-01 00:25:24] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-06-01 00:25:28] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 00:25:33] [INFO ] [Nat]Added 400 Read/Feed constraints in 9076 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7056/7056 transitions.
Applied a total of 0 rules in 191 ms. Remains 433 /433 variables (removed 0) and now considering 7056/7056 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 433/433 places, 7056/7056 transitions.
[2024-06-01 00:25:33] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
Found an invariant !
This invariant on transitions {22=1, 39=1, 3010=1, 3011=1, 4686=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {22=1, 39=1, 3022=1, 3023=1, 4697=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 118 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-06-01 00:25:46] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-06-01 00:25:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (9314 resets) in 3222 ms. (310 steps per ms)
BEST_FIRST walk for 1000001 steps (1392 resets) in 971 ms. (1028 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[+inf]
[2024-06-01 00:25:50] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-06-01 00:25:50] [INFO ] Invariant cache hit.
[2024-06-01 00:25:50] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-06-01 00:25:51] [INFO ] [Real]Absence check using state equation in 929 ms returned sat
[2024-06-01 00:25:51] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-06-01 00:25:54] [INFO ] [Real]Added 400 Read/Feed constraints in 2193 ms returned sat
[2024-06-01 00:25:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:25:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-06-01 00:25:55] [INFO ] [Nat]Absence check using state equation in 935 ms returned sat
[2024-06-01 00:25:59] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 00:26:04] [INFO ] [Nat]Added 400 Read/Feed constraints in 9075 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[+inf]
Support contains 1 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7056/7056 transitions.
Applied a total of 0 rules in 251 ms. Remains 433 /433 variables (removed 0) and now considering 7056/7056 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 251 ms. Remains : 433/433 places, 7056/7056 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7056/7056 transitions.
Applied a total of 0 rules in 183 ms. Remains 433 /433 variables (removed 0) and now considering 7056/7056 (removed 0) transitions.
[2024-06-01 00:26:04] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-06-01 00:26:04] [INFO ] Invariant cache hit.
[2024-06-01 00:26:05] [INFO ] Implicit Places using invariants in 866 ms returned []
[2024-06-01 00:26:05] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-06-01 00:26:05] [INFO ] Invariant cache hit.
[2024-06-01 00:26:06] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-06-01 00:26:37] [INFO ] Performed 116/433 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 00:27:03] [INFO ] Implicit Places using invariants and state equation in 57807 ms returned []
Implicit Place search using SMT with State Equation took 58681 ms to find 0 implicit places.
[2024-06-01 00:27:04] [INFO ] Redundant transitions in 743 ms returned []
Running 7054 sub problems to find dead transitions.
[2024-06-01 00:27:04] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-06-01 00:27:04] [INFO ] Invariant cache hit.
[2024-06-01 00:27:04] [INFO ] State equation strengthened by 400 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7054 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 433/5148 variables, and 3 constraints, problems are : Problem set: 0 solved, 7054 unsolved in 30137 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/433 constraints, ReadFeed: 0/400 constraints, PredecessorRefiner: 7054/7054 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7054 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7054 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 433/5148 variables, and 3 constraints, problems are : Problem set: 0 solved, 7054 unsolved in 30080 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/433 constraints, ReadFeed: 0/400 constraints, PredecessorRefiner: 0/7054 constraints, Known Traps: 0/0 constraints]
After SMT, in 91060ms problems are : Problem set: 0 solved, 7054 unsolved
Search for dead transitions found 0 dead transitions in 91168ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150829 ms. Remains : 433/433 places, 7056/7056 transitions.
[2024-06-01 00:28:35] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
Found an invariant !
This invariant on transitions {22=1, 39=1, 3010=1, 3011=1, 4686=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {22=1, 39=1, 3022=1, 3023=1, 4697=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 121 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[5] Max Struct:[+inf]
[2024-06-01 00:28:48] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-06-01 00:28:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[+inf]
RANDOM walk for 1000006 steps (9351 resets) in 3198 ms. (312 steps per ms)
BEST_FIRST walk for 1000001 steps (1368 resets) in 1026 ms. (973 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[+inf]
[2024-06-01 00:28:52] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-06-01 00:28:52] [INFO ] Invariant cache hit.
[2024-06-01 00:28:52] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-06-01 00:28:53] [INFO ] [Real]Absence check using state equation in 875 ms returned sat
[2024-06-01 00:28:53] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-06-01 00:28:55] [INFO ] [Real]Added 400 Read/Feed constraints in 2002 ms returned sat
[2024-06-01 00:28:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:28:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-06-01 00:28:56] [INFO ] [Nat]Absence check using state equation in 891 ms returned sat
[2024-06-01 00:29:00] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 00:29:05] [INFO ] [Nat]Added 400 Read/Feed constraints in 9063 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[+inf]
Support contains 1 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7056/7056 transitions.
Applied a total of 0 rules in 170 ms. Remains 433 /433 variables (removed 0) and now considering 7056/7056 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 433/433 places, 7056/7056 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7056/7056 transitions.
Applied a total of 0 rules in 162 ms. Remains 433 /433 variables (removed 0) and now considering 7056/7056 (removed 0) transitions.
[2024-06-01 00:29:05] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-06-01 00:29:05] [INFO ] Invariant cache hit.
[2024-06-01 00:29:06] [INFO ] Implicit Places using invariants in 832 ms returned []
[2024-06-01 00:29:06] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-06-01 00:29:06] [INFO ] Invariant cache hit.
[2024-06-01 00:29:07] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-06-01 00:29:39] [INFO ] Performed 116/433 implicitness test of which 0 returned IMPLICIT in 31 seconds.
[2024-06-01 00:30:06] [INFO ] Implicit Places using invariants and state equation in 59890 ms returned []
Implicit Place search using SMT with State Equation took 60726 ms to find 0 implicit places.
[2024-06-01 00:30:07] [INFO ] Redundant transitions in 536 ms returned []
Running 7054 sub problems to find dead transitions.
[2024-06-01 00:30:07] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-06-01 00:30:07] [INFO ] Invariant cache hit.
[2024-06-01 00:30:07] [INFO ] State equation strengthened by 400 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7054 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 433/5148 variables, and 3 constraints, problems are : Problem set: 0 solved, 7054 unsolved in 30089 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/433 constraints, ReadFeed: 0/400 constraints, PredecessorRefiner: 7054/7054 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7054 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7054 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 433/5148 variables, and 3 constraints, problems are : Problem set: 0 solved, 7054 unsolved in 30085 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/433 constraints, ReadFeed: 0/400 constraints, PredecessorRefiner: 0/7054 constraints, Known Traps: 0/0 constraints]
After SMT, in 90556ms problems are : Problem set: 0 solved, 7054 unsolved
Search for dead transitions found 0 dead transitions in 90615ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152063 ms. Remains : 433/433 places, 7056/7056 transitions.
[2024-06-01 00:31:37] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
Found an invariant !
This invariant on transitions {22=1, 39=1, 3010=1, 3011=1, 4686=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {22=1, 39=1, 3022=1, 3023=1, 4697=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 126 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[5] Max Struct:[+inf]
RANDOM walk for 40007 steps (368 resets) in 453 ms. (88 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (52 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 180045 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 1
Probabilistic random walk after 180045 steps, saw 138450 distinct states, run finished after 3004 ms. (steps per millisecond=59 ) properties seen :0
[2024-06-01 00:31:54] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-06-01 00:31:54] [INFO ] Invariant cache hit.
[2024-06-01 00:31:54] [INFO ] State equation strengthened by 400 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 266/267 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4166/4433 variables, 130/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4433 variables, 128/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4433 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 275/4708 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4708 variables, 128/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4708 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 440/5148 variables, 174/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5148 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5148/5148 variables, and 836 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2315 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 433/433 constraints, ReadFeed: 400/400 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 266/267 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4166/4433 variables, 130/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4433 variables, 128/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4433 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4433 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 275/4708 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4708 variables, 128/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4708 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 440/5148 variables, 174/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5148 variables, 1/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5148/5148 variables, and 837 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2025 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 433/433 constraints, ReadFeed: 400/400 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 4409ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7056/7056 transitions.
Applied a total of 0 rules in 162 ms. Remains 433 /433 variables (removed 0) and now considering 7056/7056 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 433/433 places, 7056/7056 transitions.
RANDOM walk for 40003 steps (365 resets) in 261 ms. (152 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (61 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 180376 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 1
Probabilistic random walk after 180376 steps, saw 138699 distinct states, run finished after 3003 ms. (steps per millisecond=60 ) properties seen :0
[2024-06-01 00:32:01] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-06-01 00:32:01] [INFO ] Invariant cache hit.
[2024-06-01 00:32:01] [INFO ] State equation strengthened by 400 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 266/267 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4166/4433 variables, 130/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4433 variables, 128/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4433 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 275/4708 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4708 variables, 128/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4708 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 440/5148 variables, 174/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5148 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5148 variables, 272/836 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5148 variables, 0/836 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/5148 variables, 0/836 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5148/5148 variables, and 836 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2077 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 433/433 constraints, ReadFeed: 400/400 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 266/267 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4166/4433 variables, 130/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4433 variables, 128/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4433 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4433 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 275/4708 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4708 variables, 128/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4708 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 440/5148 variables, 174/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5148 variables, 1/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5148 variables, 272/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5148 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/5148 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5148/5148 variables, and 837 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3462 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 433/433 constraints, ReadFeed: 400/400 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 5583ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 307 ms.
Support contains 1 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7056/7056 transitions.
Applied a total of 0 rules in 158 ms. Remains 433 /433 variables (removed 0) and now considering 7056/7056 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 433/433 places, 7056/7056 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7056/7056 transitions.
Applied a total of 0 rules in 158 ms. Remains 433 /433 variables (removed 0) and now considering 7056/7056 (removed 0) transitions.
[2024-06-01 00:32:07] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-06-01 00:32:07] [INFO ] Invariant cache hit.
[2024-06-01 00:32:08] [INFO ] Implicit Places using invariants in 807 ms returned []
[2024-06-01 00:32:08] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-06-01 00:32:08] [INFO ] Invariant cache hit.
[2024-06-01 00:32:09] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-06-01 00:32:41] [INFO ] Performed 116/433 implicitness test of which 0 returned IMPLICIT in 31 seconds.
[2024-06-01 00:33:06] [INFO ] Implicit Places using invariants and state equation in 58204 ms returned []
Implicit Place search using SMT with State Equation took 59014 ms to find 0 implicit places.
[2024-06-01 00:33:07] [INFO ] Redundant transitions in 713 ms returned []
Running 7054 sub problems to find dead transitions.
[2024-06-01 00:33:07] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-06-01 00:33:07] [INFO ] Invariant cache hit.
[2024-06-01 00:33:07] [INFO ] State equation strengthened by 400 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7054 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 433/5148 variables, and 3 constraints, problems are : Problem set: 0 solved, 7054 unsolved in 30089 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/433 constraints, ReadFeed: 0/400 constraints, PredecessorRefiner: 7054/7054 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7054 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7054 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 433/5148 variables, and 3 constraints, problems are : Problem set: 0 solved, 7054 unsolved in 30101 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/433 constraints, ReadFeed: 0/400 constraints, PredecessorRefiner: 0/7054 constraints, Known Traps: 0/0 constraints]
After SMT, in 90098ms problems are : Problem set: 0 solved, 7054 unsolved
Search for dead transitions found 0 dead transitions in 90159ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150084 ms. Remains : 433/433 places, 7056/7056 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5] Max Struct:[+inf]
Starting property specific reduction for DoubleLock-PT-p1s3-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-06-01 00:34:37] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-06-01 00:34:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (88 resets) in 33 ms. (294 steps per ms)
BEST_FIRST walk for 10001 steps (14 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-06-01 00:34:37] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-06-01 00:34:37] [INFO ] Invariant cache hit.
[2024-06-01 00:34:38] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-06-01 00:34:38] [INFO ] [Real]Absence check using state equation in 869 ms returned sat
[2024-06-01 00:34:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:34:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-06-01 00:34:39] [INFO ] [Nat]Absence check using state equation in 823 ms returned sat
[2024-06-01 00:34:39] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-06-01 00:34:40] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 00:34:40] [INFO ] [Nat]Added 400 Read/Feed constraints in 1070 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7056/7056 transitions.
Applied a total of 0 rules in 160 ms. Remains 433 /433 variables (removed 0) and now considering 7056/7056 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 433/433 places, 7056/7056 transitions.
[2024-06-01 00:34:41] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
Found an invariant !
This invariant on transitions {22=1, 39=1, 3010=1, 3011=1, 4686=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {22=1, 39=1, 3022=1, 3023=1, 4697=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 129 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-06-01 00:34:53] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-06-01 00:34:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (9314 resets) in 3133 ms. (319 steps per ms)
BEST_FIRST walk for 1000001 steps (1415 resets) in 1000 ms. (999 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-06-01 00:34:57] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-06-01 00:34:57] [INFO ] Invariant cache hit.
[2024-06-01 00:34:57] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-06-01 00:34:58] [INFO ] [Real]Absence check using state equation in 844 ms returned sat
[2024-06-01 00:34:58] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-06-01 00:34:59] [INFO ] [Real]Added 400 Read/Feed constraints in 667 ms returned sat
[2024-06-01 00:34:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:34:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-06-01 00:35:00] [INFO ] [Nat]Absence check using state equation in 859 ms returned sat
[2024-06-01 00:35:04] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 00:35:09] [INFO ] [Nat]Added 400 Read/Feed constraints in 9057 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7056/7056 transitions.
Applied a total of 0 rules in 164 ms. Remains 433 /433 variables (removed 0) and now considering 7056/7056 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 433/433 places, 7056/7056 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7056/7056 transitions.
Applied a total of 0 rules in 159 ms. Remains 433 /433 variables (removed 0) and now considering 7056/7056 (removed 0) transitions.
[2024-06-01 00:35:09] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-06-01 00:35:09] [INFO ] Invariant cache hit.
[2024-06-01 00:35:10] [INFO ] Implicit Places using invariants in 798 ms returned []
[2024-06-01 00:35:10] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-06-01 00:35:10] [INFO ] Invariant cache hit.
[2024-06-01 00:35:11] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-06-01 00:35:41] [INFO ] Performed 117/433 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 00:36:05] [INFO ] Implicit Places using invariants and state equation in 54694 ms returned []
Implicit Place search using SMT with State Equation took 55494 ms to find 0 implicit places.
[2024-06-01 00:36:05] [INFO ] Redundant transitions in 525 ms returned []
Running 7054 sub problems to find dead transitions.
[2024-06-01 00:36:05] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-06-01 00:36:05] [INFO ] Invariant cache hit.
[2024-06-01 00:36:05] [INFO ] State equation strengthened by 400 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7054 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 433/5148 variables, and 3 constraints, problems are : Problem set: 0 solved, 7054 unsolved in 30118 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/433 constraints, ReadFeed: 0/400 constraints, PredecessorRefiner: 7054/7054 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7054 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7054 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 433/5148 variables, and 3 constraints, problems are : Problem set: 0 solved, 7054 unsolved in 30168 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/433 constraints, ReadFeed: 0/400 constraints, PredecessorRefiner: 0/7054 constraints, Known Traps: 0/0 constraints]
After SMT, in 88971ms problems are : Problem set: 0 solved, 7054 unsolved
Search for dead transitions found 0 dead transitions in 89028ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145234 ms. Remains : 433/433 places, 7056/7056 transitions.
[2024-06-01 00:37:34] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : DoubleLock-PT-p1s3-UpperBounds-00
Could not compute solution for formula : DoubleLock-PT-p1s3-UpperBounds-01
Could not compute solution for formula : DoubleLock-PT-p1s3-UpperBounds-02
Could not compute solution for formula : DoubleLock-PT-p1s3-UpperBounds-03
Could not compute solution for formula : DoubleLock-PT-p1s3-UpperBounds-04
Could not compute solution for formula : DoubleLock-PT-p1s3-UpperBounds-05
Could not compute solution for formula : DoubleLock-PT-p1s3-UpperBounds-06
Could not compute solution for formula : DoubleLock-PT-p1s3-UpperBounds-07
Could not compute solution for formula : DoubleLock-PT-p1s3-UpperBounds-08
Could not compute solution for formula : DoubleLock-PT-p1s3-UpperBounds-09
Could not compute solution for formula : DoubleLock-PT-p1s3-UpperBounds-10
Could not compute solution for formula : DoubleLock-PT-p1s3-UpperBounds-11
Could not compute solution for formula : DoubleLock-PT-p1s3-UpperBounds-12
Could not compute solution for formula : DoubleLock-PT-p1s3-UpperBounds-13
Could not compute solution for formula : DoubleLock-PT-p1s3-UpperBounds-14
Could not compute solution for formula : DoubleLock-PT-p1s3-UpperBounds-15
BK_STOP 1717202259400
--------------------
content from stderr:
+ 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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name DoubleLock-PT-p1s3-UpperBounds-00
ub formula formula --maxsum=/tmp/713/ub_0_
ub formula name DoubleLock-PT-p1s3-UpperBounds-01
ub formula formula --maxsum=/tmp/713/ub_1_
ub formula name DoubleLock-PT-p1s3-UpperBounds-02
ub formula formula --maxsum=/tmp/713/ub_2_
ub formula name DoubleLock-PT-p1s3-UpperBounds-03
ub formula formula --maxsum=/tmp/713/ub_3_
ub formula name DoubleLock-PT-p1s3-UpperBounds-04
ub formula formula --maxsum=/tmp/713/ub_4_
ub formula name DoubleLock-PT-p1s3-UpperBounds-05
ub formula formula --maxsum=/tmp/713/ub_5_
ub formula name DoubleLock-PT-p1s3-UpperBounds-06
ub formula formula --maxsum=/tmp/713/ub_6_
ub formula name DoubleLock-PT-p1s3-UpperBounds-07
ub formula formula --maxsum=/tmp/713/ub_7_
ub formula name DoubleLock-PT-p1s3-UpperBounds-08
ub formula formula --maxsum=/tmp/713/ub_8_
ub formula name DoubleLock-PT-p1s3-UpperBounds-09
ub formula formula --maxsum=/tmp/713/ub_9_
ub formula name DoubleLock-PT-p1s3-UpperBounds-10
ub formula formula --maxsum=/tmp/713/ub_10_
ub formula name DoubleLock-PT-p1s3-UpperBounds-11
ub formula formula --maxsum=/tmp/713/ub_11_
ub formula name DoubleLock-PT-p1s3-UpperBounds-12
ub formula formula --maxsum=/tmp/713/ub_12_
ub formula name DoubleLock-PT-p1s3-UpperBounds-13
ub formula formula --maxsum=/tmp/713/ub_13_
ub formula name DoubleLock-PT-p1s3-UpperBounds-14
ub formula formula --maxsum=/tmp/713/ub_14_
ub formula name DoubleLock-PT-p1s3-UpperBounds-15
ub formula formula --maxsum=/tmp/713/ub_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
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-p1s3"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is DoubleLock-PT-p1s3, 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 r488-tall-171631133000605"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleLock-PT-p1s3.tgz
mv DoubleLock-PT-p1s3 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;