Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r135-tall-171631131400597.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 greatspnxred
Input is DoubleLock-PT-p1s2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131400597
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 13:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Apr 12 13:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K 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-p1s2-UpperBounds-00
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-01
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-02
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-03
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-04
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-05
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-06
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-07
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-08
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-09
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-10
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-11
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-12
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-13
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-14
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716392621184

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p1s2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 15:43:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-22 15:43:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 15:43:42] [INFO ] Load time of PNML (sax parser for PT used): 304 ms
[2024-05-22 15:43:42] [INFO ] Transformed 570 places.
[2024-05-22 15:43:42] [INFO ] Transformed 7600 transitions.
[2024-05-22 15:43:42] [INFO ] Parsed PT model containing 570 places and 7600 transitions and 30784 arcs in 440 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 132 places in 35 ms
Reduce places removed 132 places and 256 transitions.
FORMULA DoubleLock-PT-p1s2-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p1s2-UpperBounds-15 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-05-22 15:43:42] [INFO ] Flow matrix only has 5003 transitions (discarded 2341 similar events)
// Phase 1: matrix 5003 rows 438 cols
[2024-05-22 15:43:42] [INFO ] Computed 4 invariants in 92 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, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 1]
RANDOM walk for 10000 steps (84 resets) in 95 ms. (104 steps per ms)
FORMULA DoubleLock-PT-p1s2-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s2-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s2-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s2-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s2-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s2-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s2-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s2-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s2-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s2-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s2-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (51 resets) in 130 ms. (305 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 2] Max Struct:[1, 1, +inf]
[2024-05-22 15:43:43] [INFO ] Flow matrix only has 5003 transitions (discarded 2341 similar events)
[2024-05-22 15:43:43] [INFO ] Invariant cache hit.
[2024-05-22 15:43:43] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2024-05-22 15:43:43] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 15:43:44] [INFO ] [Real]Absence check using state equation in 804 ms returned sat
[2024-05-22 15:43:44] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-22 15:43:44] [INFO ] [Real]Added 400 Read/Feed constraints in 411 ms returned sat
[2024-05-22 15:43:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:43:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-22 15:43:45] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 15:43:45] [INFO ] [Nat]Absence check using state equation in 662 ms returned sat
[2024-05-22 15:43:46] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 15:43:47] [INFO ] [Nat]Added 400 Read/Feed constraints in 1529 ms returned unknown
[2024-05-22 15:43:47] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-22 15:43:47] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 15:43:48] [INFO ] [Real]Absence check using state equation in 795 ms returned sat
[2024-05-22 15:43:48] [INFO ] [Real]Added 400 Read/Feed constraints in 316 ms returned sat
[2024-05-22 15:43:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:43:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-22 15:43:48] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 15:43:49] [INFO ] [Nat]Absence check using state equation in 761 ms returned sat
[2024-05-22 15:43:49] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 15:43:50] [INFO ] [Nat]Added 400 Read/Feed constraints in 1052 ms returned unknown
[2024-05-22 15:43:50] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-22 15:43:50] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 15:43:51] [INFO ] [Real]Absence check using state equation in 699 ms returned sat
[2024-05-22 15:43:51] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 15:43:52] [INFO ] [Real]Added 400 Read/Feed constraints in 736 ms returned sat
[2024-05-22 15:43:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:43:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-22 15:43:52] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 15:43:52] [INFO ] [Nat]Absence check using state equation in 685 ms returned sat
[2024-05-22 15:43:53] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 15:43:54] [INFO ] [Nat]Added 400 Read/Feed constraints in 1070 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 2] Max Struct:[1, 1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 2] Max Struct:[1, 1, +inf]
Support contains 3 out of 438 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 438/438 places, 7344/7344 transitions.
Graph (complete) has 12357 edges and 438 vertex of which 434 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.34 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 434 transition count 7280
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 433 transition count 7152
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 433 transition count 7152
Applied a total of 67 rules in 649 ms. Remains 433 /438 variables (removed 5) and now considering 7152/7344 (removed 192) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 671 ms. Remains : 433/438 places, 7152/7344 transitions.
[2024-05-22 15:43:54] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)
Found an invariant !
This invariant on transitions {16=2, 23=1, 40=1, 2890=1, 2891=1, 4565=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 11 ms.
This minimized invariant on transitions {23=1, 40=1, 2903=1, 3121=1, 4579=1, 4798=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 121 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 3) seen :[0, 0, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 2] Max Struct:[1, 1, +inf]
[2024-05-22 15:44:03] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)
// Phase 1: matrix 4811 rows 433 cols
[2024-05-22 15:44:03] [INFO ] Computed 2 invariants in 55 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 2] Max Struct:[1, 1, +inf]
RANDOM walk for 1000002 steps (8651 resets) in 3496 ms. (285 steps per ms)
FORMULA DoubleLock-PT-p1s2-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s2-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (1408 resets) in 1073 ms. (931 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-22 15:44:08] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)
[2024-05-22 15:44:08] [INFO ] Invariant cache hit.
[2024-05-22 15:44:08] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-22 15:44:08] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 15:44:09] [INFO ] [Real]Absence check using state equation in 926 ms returned sat
[2024-05-22 15:44:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:44:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-22 15:44:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 15:44:10] [INFO ] [Nat]Absence check using state equation in 845 ms returned sat
[2024-05-22 15:44:10] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-22 15:44:14] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 15:44:19] [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, 7152/7152 transitions.
Applied a total of 0 rules in 228 ms. Remains 433 /433 variables (removed 0) and now considering 7152/7152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 228 ms. Remains : 433/433 places, 7152/7152 transitions.
[2024-05-22 15:44:19] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)
Found an invariant !
This invariant on transitions {16=2, 23=1, 40=1, 2890=1, 2891=1, 4565=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {23=1, 40=1, 2903=1, 3121=1, 4579=1, 4798=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 120 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-22 15:44:28] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)
[2024-05-22 15:44:28] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000006 steps (8703 resets) in 3432 ms. (291 steps per ms)
BEST_FIRST walk for 1000001 steps (1379 resets) in 937 ms. (1066 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2024-05-22 15:44:32] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)
[2024-05-22 15:44:32] [INFO ] Invariant cache hit.
[2024-05-22 15:44:32] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-22 15:44:32] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-22 15:44:33] [INFO ] [Real]Absence check using state equation in 965 ms returned sat
[2024-05-22 15:44:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:44:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-22 15:44:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 15:44:35] [INFO ] [Nat]Absence check using state equation in 945 ms returned sat
[2024-05-22 15:44:35] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-22 15:44:39] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 15:44:44] [INFO ] [Nat]Added 400 Read/Feed constraints in 9068 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7152/7152 transitions.
Applied a total of 0 rules in 175 ms. Remains 433 /433 variables (removed 0) and now considering 7152/7152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 433/433 places, 7152/7152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7152/7152 transitions.
Applied a total of 0 rules in 155 ms. Remains 433 /433 variables (removed 0) and now considering 7152/7152 (removed 0) transitions.
[2024-05-22 15:44:44] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)
[2024-05-22 15:44:44] [INFO ] Invariant cache hit.
[2024-05-22 15:44:44] [INFO ] Implicit Places using invariants in 462 ms returned []
[2024-05-22 15:44:44] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)
[2024-05-22 15:44:44] [INFO ] Invariant cache hit.
[2024-05-22 15:44:45] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-22 15:45:21] [INFO ] Performed 28/433 implicitness test of which 0 returned IMPLICIT in 35 seconds.
[2024-05-22 15:45:51] [INFO ] Performed 418/433 implicitness test of which 0 returned IMPLICIT in 65 seconds.
[2024-05-22 15:45:58] [INFO ] Implicit Places using invariants and state equation in 73136 ms returned []
Implicit Place search using SMT with State Equation took 73600 ms to find 0 implicit places.
[2024-05-22 15:45:58] [INFO ] Redundant transitions in 865 ms returned []
Running 7150 sub problems to find dead transitions.
[2024-05-22 15:45:59] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)
[2024-05-22 15:45:59] [INFO ] Invariant cache hit.
[2024-05-22 15:45:59] [INFO ] State equation strengthened by 400 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7150 unsolved
SMT process timed out in 61189ms, After SMT, problems are : Problem set: 0 solved, 7150 unsolved
Search for dead transitions found 0 dead transitions in 61289ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135965 ms. Remains : 433/433 places, 7152/7152 transitions.
[2024-05-22 15:47:00] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)
Found an invariant !
This invariant on transitions {16=2, 23=1, 40=1, 2890=1, 2891=1, 4565=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 4 ms.
This minimized invariant on transitions {23=1, 40=1, 2903=1, 3121=1, 4579=1, 4798=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 121 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
[2024-05-22 15:47:09] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)
[2024-05-22 15:47:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 1000006 steps (8699 resets) in 3344 ms. (298 steps per ms)
BEST_FIRST walk for 1000001 steps (1371 resets) in 931 ms. (1072 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2024-05-22 15:47:13] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)
[2024-05-22 15:47:13] [INFO ] Invariant cache hit.
[2024-05-22 15:47:13] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-22 15:47:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 15:47:14] [INFO ] [Real]Absence check using state equation in 944 ms returned sat
[2024-05-22 15:47:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:47:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-22 15:47:14] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 15:47:15] [INFO ] [Nat]Absence check using state equation in 939 ms returned sat
[2024-05-22 15:47:15] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-22 15:47:20] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 15:47:24] [INFO ] [Nat]Added 400 Read/Feed constraints in 9075 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7152/7152 transitions.
Applied a total of 0 rules in 167 ms. Remains 433 /433 variables (removed 0) and now considering 7152/7152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 433/433 places, 7152/7152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7152/7152 transitions.
Applied a total of 0 rules in 174 ms. Remains 433 /433 variables (removed 0) and now considering 7152/7152 (removed 0) transitions.
[2024-05-22 15:47:25] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)
[2024-05-22 15:47:25] [INFO ] Invariant cache hit.
[2024-05-22 15:47:25] [INFO ] Implicit Places using invariants in 474 ms returned []
[2024-05-22 15:47:25] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)
[2024-05-22 15:47:25] [INFO ] Invariant cache hit.
[2024-05-22 15:47:26] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-22 15:48:02] [INFO ] Performed 28/433 implicitness test of which 0 returned IMPLICIT in 35 seconds.
[2024-05-22 15:48:33] [INFO ] Performed 418/433 implicitness test of which 0 returned IMPLICIT in 66 seconds.
[2024-05-22 15:48:39] [INFO ] Implicit Places using invariants and state equation in 73583 ms returned []
Implicit Place search using SMT with State Equation took 74059 ms to find 0 implicit places.
[2024-05-22 15:48:39] [INFO ] Redundant transitions in 517 ms returned []
Running 7150 sub problems to find dead transitions.
[2024-05-22 15:48:39] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)
[2024-05-22 15:48:39] [INFO ] Invariant cache hit.
[2024-05-22 15:48:39] [INFO ] State equation strengthened by 400 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7150 unsolved
SMT process timed out in 59452ms, After SMT, problems are : Problem set: 0 solved, 7150 unsolved
Search for dead transitions found 0 dead transitions in 59519ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134295 ms. Remains : 433/433 places, 7152/7152 transitions.
[2024-05-22 15:49:39] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)
Found an invariant !
This invariant on transitions {16=2, 23=1, 40=1, 2890=1, 2891=1, 4565=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {23=1, 40=1, 2903=1, 3121=1, 4579=1, 4798=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 122 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 40004 steps (336 resets) in 505 ms. (79 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (56 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 175449 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 1
Probabilistic random walk after 175449 steps, saw 135029 distinct states, run finished after 3004 ms. (steps per millisecond=58 ) properties seen :0
[2024-05-22 15:49:51] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)
[2024-05-22 15:49:51] [INFO ] Invariant cache hit.
[2024-05-22 15:49:51] [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) 193/194 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4847/5041 variables, 258/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5041 variables, 130/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5041 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 18/5059 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5059 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5059 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 185/5244 variables, 173/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5244 variables, 1/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5244 variables, 270/835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5244 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/5244 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5244/5244 variables, and 835 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1568 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 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) 193/194 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4847/5041 variables, 258/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5041 variables, 130/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5041 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5041 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 18/5059 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5059 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5059 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5244/5244 variables, and 565 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 433/433 constraints, ReadFeed: 130/400 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 6672ms 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, 7152/7152 transitions.
Applied a total of 0 rules in 161 ms. Remains 433 /433 variables (removed 0) and now considering 7152/7152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 433/433 places, 7152/7152 transitions.
RANDOM walk for 40012 steps (347 resets) in 211 ms. (188 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (53 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 187488 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 1
Probabilistic random walk after 187488 steps, saw 143988 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
[2024-05-22 15:50:01] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)
[2024-05-22 15:50:01] [INFO ] Invariant cache hit.
[2024-05-22 15:50: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) 193/194 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4847/5041 variables, 258/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5041 variables, 130/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5041 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 18/5059 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5059 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5059 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 185/5244 variables, 173/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5244 variables, 1/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5244 variables, 270/835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5244 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/5244 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5244/5244 variables, and 835 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1520 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 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) 193/194 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4847/5041 variables, 258/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5041 variables, 130/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5041 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5041 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 18/5059 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5059 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5059 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5244/5244 variables, and 565 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 433/433 constraints, ReadFeed: 130/400 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 46620ms 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, 7152/7152 transitions.
Applied a total of 0 rules in 165 ms. Remains 433 /433 variables (removed 0) and now considering 7152/7152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 433/433 places, 7152/7152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7152/7152 transitions.
Applied a total of 0 rules in 147 ms. Remains 433 /433 variables (removed 0) and now considering 7152/7152 (removed 0) transitions.
[2024-05-22 15:50:48] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)
[2024-05-22 15:50:48] [INFO ] Invariant cache hit.
[2024-05-22 15:50:49] [INFO ] Implicit Places using invariants in 510 ms returned []
[2024-05-22 15:50:49] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)
[2024-05-22 15:50:49] [INFO ] Invariant cache hit.
[2024-05-22 15:50:50] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-22 15:51:24] [INFO ] Performed 28/433 implicitness test of which 0 returned IMPLICIT in 34 seconds.
[2024-05-22 15:51:55] [INFO ] Performed 420/433 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-22 15:52:00] [INFO ] Implicit Places using invariants and state equation in 71550 ms returned []
Implicit Place search using SMT with State Equation took 72064 ms to find 0 implicit places.
[2024-05-22 15:52:01] [INFO ] Redundant transitions in 717 ms returned []
Running 7150 sub problems to find dead transitions.
[2024-05-22 15:52:01] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)
[2024-05-22 15:52:01] [INFO ] Invariant cache hit.
[2024-05-22 15:52:01] [INFO ] State equation strengthened by 400 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DoubleLock-PT-p1s2

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 570
TRANSITIONS: 7600
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.165s, Sys 0.003s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.023s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 673
MODEL NAME: /home/mcc/execution/model
570 places, 7600 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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
MEDDLY ERROR: Insufficient memory

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-p1s2"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is DoubleLock-PT-p1s2, 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 r135-tall-171631131400597"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleLock-PT-p1s2.tgz
mv DoubleLock-PT-p1s2 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;