About the Execution of Marcie+red for RERS2020-PT-pb103
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6027.775 | 3600000.00 | 3714906.00 | 8890.50 | 0 1 ? ? 1 1 ? 1 1 1 ? ? ? ? 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r330-tall-167889203000237.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is RERS2020-PT-pb103, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203000237
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 7.2K Feb 26 08:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 08:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 08:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 08:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 08:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 26 08:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 08:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 08:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 18M Mar 5 18:23 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 RERS2020-PT-pb103-UpperBounds-00
FORMULA_NAME RERS2020-PT-pb103-UpperBounds-01
FORMULA_NAME RERS2020-PT-pb103-UpperBounds-02
FORMULA_NAME RERS2020-PT-pb103-UpperBounds-03
FORMULA_NAME RERS2020-PT-pb103-UpperBounds-04
FORMULA_NAME RERS2020-PT-pb103-UpperBounds-05
FORMULA_NAME RERS2020-PT-pb103-UpperBounds-06
FORMULA_NAME RERS2020-PT-pb103-UpperBounds-07
FORMULA_NAME RERS2020-PT-pb103-UpperBounds-08
FORMULA_NAME RERS2020-PT-pb103-UpperBounds-09
FORMULA_NAME RERS2020-PT-pb103-UpperBounds-10
FORMULA_NAME RERS2020-PT-pb103-UpperBounds-11
FORMULA_NAME RERS2020-PT-pb103-UpperBounds-12
FORMULA_NAME RERS2020-PT-pb103-UpperBounds-13
FORMULA_NAME RERS2020-PT-pb103-UpperBounds-14
FORMULA_NAME RERS2020-PT-pb103-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679116293173
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS2020-PT-pb103
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 05:11:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-18 05:11:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 05:11:35] [INFO ] Load time of PNML (sax parser for PT used): 772 ms
[2023-03-18 05:11:35] [INFO ] Transformed 520 places.
[2023-03-18 05:11:35] [INFO ] Transformed 31658 transitions.
[2023-03-18 05:11:35] [INFO ] Found NUPN structural information;
[2023-03-18 05:11:35] [INFO ] Parsed PT model containing 520 places and 31658 transitions and 125892 arcs in 1004 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 3229 transitions
Reduce redundant transitions removed 3229 transitions.
Normalized transition count is 18674 out of 28429 initially.
// Phase 1: matrix 18674 rows 520 cols
[2023-03-18 05:11:36] [INFO ] Computed 15 place invariants in 120 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 372 ms. (steps per millisecond=26 ) properties (out of 16) seen :7
FORMULA RERS2020-PT-pb103-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS2020-PT-pb103-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS2020-PT-pb103-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS2020-PT-pb103-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS2020-PT-pb103-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS2020-PT-pb103-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS2020-PT-pb103-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :1
FORMULA RERS2020-PT-pb103-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-18 05:11:36] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 520 cols
[2023-03-18 05:11:37] [INFO ] Computed 15 place invariants in 84 ms
[2023-03-18 05:11:37] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2023-03-18 05:11:37] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-18 05:11:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:11:40] [INFO ] [Real]Absence check using state equation in 3067 ms returned sat
[2023-03-18 05:11:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:11:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2023-03-18 05:11:40] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-18 05:11:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:11:44] [INFO ] [Nat]Absence check using state equation in 3097 ms returned sat
[2023-03-18 05:11:44] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2023-03-18 05:11:45] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 05:11:45] [INFO ] [Nat]Added 1379 Read/Feed constraints in 1528 ms returned unknown
[2023-03-18 05:11:45] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-18 05:11:45] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-18 05:11:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:11:48] [INFO ] [Real]Absence check using state equation in 2953 ms returned sat
[2023-03-18 05:11:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:11:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-18 05:11:49] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-18 05:11:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:11:52] [INFO ] [Nat]Absence check using state equation in 2909 ms returned sat
[2023-03-18 05:11:54] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 05:11:54] [INFO ] [Nat]Added 1379 Read/Feed constraints in 2016 ms returned unknown
[2023-03-18 05:11:54] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:11:54] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-18 05:11:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:11:57] [INFO ] [Real]Absence check using state equation in 3249 ms returned sat
[2023-03-18 05:11:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:11:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-18 05:11:58] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-18 05:11:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:12:01] [INFO ] [Nat]Absence check using state equation in 2952 ms returned sat
[2023-03-18 05:12:03] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 05:12:03] [INFO ] [Nat]Added 1379 Read/Feed constraints in 1965 ms returned unknown
[2023-03-18 05:12:03] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:12:03] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-18 05:12:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:12:05] [INFO ] [Real]Absence check using state equation in 2802 ms returned sat
[2023-03-18 05:12:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:12:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2023-03-18 05:12:06] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-18 05:12:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:12:09] [INFO ] [Nat]Absence check using state equation in 3147 ms returned sat
[2023-03-18 05:12:11] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 05:12:11] [INFO ] [Nat]Added 1379 Read/Feed constraints in 1765 ms returned unknown
[2023-03-18 05:12:11] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:12:11] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-18 05:12:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:12:14] [INFO ] [Real]Absence check using state equation in 2941 ms returned sat
[2023-03-18 05:12:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:12:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:12:14] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-18 05:12:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:12:17] [INFO ] [Nat]Absence check using state equation in 2928 ms returned sat
[2023-03-18 05:12:19] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 05:12:19] [INFO ] [Nat]Added 1379 Read/Feed constraints in 2000 ms returned unknown
[2023-03-18 05:12:19] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:12:19] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-18 05:12:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:12:22] [INFO ] [Real]Absence check using state equation in 2748 ms returned sat
[2023-03-18 05:12:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:12:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-18 05:12:23] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-18 05:12:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:12:25] [INFO ] [Nat]Absence check using state equation in 2900 ms returned sat
[2023-03-18 05:12:27] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 05:12:27] [INFO ] [Nat]Added 1379 Read/Feed constraints in 2011 ms returned unknown
[2023-03-18 05:12:28] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:12:28] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-18 05:12:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:12:31] [INFO ] [Real]Absence check using state equation in 3066 ms returned sat
[2023-03-18 05:12:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:12:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-18 05:12:31] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-18 05:12:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:12:34] [INFO ] [Nat]Absence check using state equation in 2918 ms returned sat
[2023-03-18 05:12:36] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 05:12:36] [INFO ] [Nat]Added 1379 Read/Feed constraints in 1993 ms returned unknown
[2023-03-18 05:12:36] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-18 05:12:36] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-18 05:12:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:12:39] [INFO ] [Real]Absence check using state equation in 3036 ms returned sat
[2023-03-18 05:12:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:12:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-18 05:12:40] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-18 05:12:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:12:43] [INFO ] [Nat]Absence check using state equation in 2922 ms returned sat
[2023-03-18 05:12:45] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 05:12:45] [INFO ] [Nat]Added 1379 Read/Feed constraints in 1988 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
Support contains 8 out of 520 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 520/520 places, 28429/28429 transitions.
Ensure Unique test removed 7 places
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1069 rules applied. Total rules applied 1069 place count 513 transition count 27367
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1071 place count 512 transition count 27366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 30 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1073 place count 511 transition count 27377
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1085 place count 511 transition count 27365
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1185 place count 499 transition count 27277
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1186 place count 499 transition count 27457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1187 place count 498 transition count 27457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1188 place count 497 transition count 27456
Applied a total of 1188 rules in 898 ms. Remains 497 /520 variables (removed 23) and now considering 27456/28429 (removed 973) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 903 ms. Remains : 497/520 places, 27456/28429 transitions.
Normalized transition count is 18727 out of 27456 initially.
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 05:12:46] [INFO ] Computed 8 place invariants in 66 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 19719 ms. (steps per millisecond=50 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2546 ms. (steps per millisecond=392 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2523 ms. (steps per millisecond=396 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2530 ms. (steps per millisecond=395 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2467 ms. (steps per millisecond=405 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2495 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2575 ms. (steps per millisecond=388 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2464 ms. (steps per millisecond=405 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2491 ms. (steps per millisecond=401 ) properties (out of 8) seen :0
[2023-03-18 05:13:25] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 05:13:25] [INFO ] Computed 8 place invariants in 56 ms
[2023-03-18 05:13:26] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:13:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:13:28] [INFO ] [Real]Absence check using state equation in 2751 ms returned sat
[2023-03-18 05:13:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:13:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:13:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:13:32] [INFO ] [Nat]Absence check using state equation in 3036 ms returned sat
[2023-03-18 05:13:32] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 05:13:36] [INFO ] [Nat]Added 1374 Read/Feed constraints in 3435 ms returned sat
[2023-03-18 05:13:38] [INFO ] Deduced a trap composed of 157 places in 2198 ms of which 8 ms to minimize.
[2023-03-18 05:13:41] [INFO ] Deduced a trap composed of 47 places in 2305 ms of which 1 ms to minimize.
[2023-03-18 05:13:45] [INFO ] Deduced a trap composed of 19 places in 2180 ms of which 2 ms to minimize.
[2023-03-18 05:13:49] [INFO ] Deduced a trap composed of 92 places in 1718 ms of which 3 ms to minimize.
[2023-03-18 05:13:51] [INFO ] Deduced a trap composed of 51 places in 1769 ms of which 1 ms to minimize.
[2023-03-18 05:13:55] [INFO ] Deduced a trap composed of 51 places in 1695 ms of which 1 ms to minimize.
[2023-03-18 05:13:56] [INFO ] Deduced a trap composed of 49 places in 1457 ms of which 1 ms to minimize.
[2023-03-18 05:13:59] [INFO ] Deduced a trap composed of 200 places in 1798 ms of which 1 ms to minimize.
[2023-03-18 05:14:01] [INFO ] Deduced a trap composed of 147 places in 1878 ms of which 1 ms to minimize.
[2023-03-18 05:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 25391 ms
[2023-03-18 05:14:01] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:14:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:14:04] [INFO ] [Real]Absence check using state equation in 2963 ms returned sat
[2023-03-18 05:14:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:14:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:14:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:14:08] [INFO ] [Nat]Absence check using state equation in 3005 ms returned sat
[2023-03-18 05:14:11] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 05:14:14] [INFO ] [Nat]Added 1374 Read/Feed constraints in 6731 ms returned unknown
[2023-03-18 05:14:14] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:14:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:14:17] [INFO ] [Real]Absence check using state equation in 2934 ms returned sat
[2023-03-18 05:14:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:14:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:14:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:14:21] [INFO ] [Nat]Absence check using state equation in 3052 ms returned sat
[2023-03-18 05:14:25] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 05:14:25] [INFO ] [Nat]Added 1374 Read/Feed constraints in 4090 ms returned sat
[2023-03-18 05:14:27] [INFO ] Deduced a trap composed of 147 places in 1397 ms of which 1 ms to minimize.
[2023-03-18 05:14:29] [INFO ] Deduced a trap composed of 19 places in 1540 ms of which 1 ms to minimize.
[2023-03-18 05:14:31] [INFO ] Deduced a trap composed of 104 places in 2263 ms of which 1 ms to minimize.
[2023-03-18 05:14:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 8017 ms
[2023-03-18 05:14:36] [INFO ] Computed and/alt/rep : 109/757/109 causal constraints (skipped 18615 transitions) in 2656 ms.
[2023-03-18 05:14:36] [INFO ] Added : 0 causal constraints over 0 iterations in 3602 ms. Result :sat
[2023-03-18 05:14:37] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:14:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:14:40] [INFO ] [Real]Absence check using state equation in 3043 ms returned sat
[2023-03-18 05:14:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:14:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-18 05:14:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:14:43] [INFO ] [Nat]Absence check using state equation in 2965 ms returned sat
[2023-03-18 05:14:47] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 05:14:50] [INFO ] [Nat]Added 1374 Read/Feed constraints in 6754 ms returned unknown
[2023-03-18 05:14:50] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:14:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:14:53] [INFO ] [Real]Absence check using state equation in 2985 ms returned sat
[2023-03-18 05:14:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:14:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-18 05:14:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:14:57] [INFO ] [Nat]Absence check using state equation in 3010 ms returned sat
[2023-03-18 05:15:00] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 05:15:01] [INFO ] [Nat]Added 1374 Read/Feed constraints in 4181 ms returned sat
[2023-03-18 05:15:03] [INFO ] Deduced a trap composed of 47 places in 1998 ms of which 1 ms to minimize.
[2023-03-18 05:15:06] [INFO ] Deduced a trap composed of 68 places in 2007 ms of which 1 ms to minimize.
[2023-03-18 05:15:08] [INFO ] Deduced a trap composed of 147 places in 1967 ms of which 1 ms to minimize.
[2023-03-18 05:15:10] [INFO ] Deduced a trap composed of 19 places in 1846 ms of which 1 ms to minimize.
[2023-03-18 05:15:13] [INFO ] Deduced a trap composed of 59 places in 2172 ms of which 0 ms to minimize.
[2023-03-18 05:15:16] [INFO ] Deduced a trap composed of 51 places in 1841 ms of which 2 ms to minimize.
[2023-03-18 05:15:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 15749 ms
[2023-03-18 05:15:19] [INFO ] Computed and/alt/rep : 109/757/109 causal constraints (skipped 18615 transitions) in 2361 ms.
[2023-03-18 05:15:20] [INFO ] Added : 0 causal constraints over 0 iterations in 3252 ms. Result :sat
[2023-03-18 05:15:20] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-18 05:15:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:15:23] [INFO ] [Real]Absence check using state equation in 3002 ms returned sat
[2023-03-18 05:15:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:15:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:15:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:15:27] [INFO ] [Nat]Absence check using state equation in 2867 ms returned sat
[2023-03-18 05:15:30] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 05:15:31] [INFO ] [Nat]Added 1374 Read/Feed constraints in 4251 ms returned sat
[2023-03-18 05:15:33] [INFO ] Deduced a trap composed of 19 places in 1850 ms of which 1 ms to minimize.
[2023-03-18 05:15:35] [INFO ] Deduced a trap composed of 159 places in 1831 ms of which 1 ms to minimize.
[2023-03-18 05:15:38] [INFO ] Deduced a trap composed of 51 places in 2041 ms of which 0 ms to minimize.
[2023-03-18 05:15:40] [INFO ] Deduced a trap composed of 94 places in 2004 ms of which 1 ms to minimize.
[2023-03-18 05:15:44] [INFO ] Deduced a trap composed of 60 places in 2064 ms of which 0 ms to minimize.
[2023-03-18 05:15:45] [INFO ] Deduced a trap composed of 101 places in 1289 ms of which 0 ms to minimize.
[2023-03-18 05:15:48] [INFO ] Trap strengthening (SAT) tested/added 6/6 trap constraints in 17370 ms
[2023-03-18 05:15:48] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:15:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:15:51] [INFO ] [Real]Absence check using state equation in 2824 ms returned sat
[2023-03-18 05:15:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:15:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-18 05:15:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:15:55] [INFO ] [Nat]Absence check using state equation in 3149 ms returned sat
[2023-03-18 05:15:59] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 05:16:02] [INFO ] [Nat]Added 1374 Read/Feed constraints in 6755 ms returned unknown
[2023-03-18 05:16:02] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:16:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:16:05] [INFO ] [Real]Absence check using state equation in 3153 ms returned sat
[2023-03-18 05:16:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:16:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:16:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:16:08] [INFO ] [Nat]Absence check using state equation in 3062 ms returned sat
[2023-03-18 05:16:12] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 05:16:15] [INFO ] [Nat]Added 1374 Read/Feed constraints in 6738 ms returned unknown
Current structural bounds on expressions (after SMT) : [0, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
FORMULA RERS2020-PT-pb103-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 7 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 125 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 497/497 places, 27456/27456 transitions.
Normalized transition count is 18727 out of 27456 initially.
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 05:16:15] [INFO ] Computed 8 place invariants in 47 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 21487 ms. (steps per millisecond=46 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2641 ms. (steps per millisecond=378 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2676 ms. (steps per millisecond=373 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2663 ms. (steps per millisecond=375 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2575 ms. (steps per millisecond=388 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2550 ms. (steps per millisecond=392 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2519 ms. (steps per millisecond=396 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2579 ms. (steps per millisecond=387 ) properties (out of 7) seen :0
[2023-03-18 05:16:55] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 05:16:55] [INFO ] Computed 8 place invariants in 51 ms
[2023-03-18 05:16:55] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:16:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:16:58] [INFO ] [Real]Absence check using state equation in 2818 ms returned sat
[2023-03-18 05:16:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:16:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:16:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:17:01] [INFO ] [Nat]Absence check using state equation in 2837 ms returned sat
[2023-03-18 05:17:02] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 05:17:06] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 05:17:09] [INFO ] [Nat]Added 1374 Read/Feed constraints in 6728 ms returned unknown
[2023-03-18 05:17:09] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-18 05:17:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:17:11] [INFO ] [Real]Absence check using state equation in 2819 ms returned sat
[2023-03-18 05:17:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:17:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:17:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:17:15] [INFO ] [Nat]Absence check using state equation in 2919 ms returned sat
[2023-03-18 05:17:18] [INFO ] [Nat]Added 1374 Read/Feed constraints in 3651 ms returned sat
[2023-03-18 05:17:20] [INFO ] Deduced a trap composed of 147 places in 1447 ms of which 0 ms to minimize.
[2023-03-18 05:17:22] [INFO ] Deduced a trap composed of 19 places in 1585 ms of which 1 ms to minimize.
[2023-03-18 05:17:25] [INFO ] Deduced a trap composed of 104 places in 2225 ms of which 1 ms to minimize.
[2023-03-18 05:17:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 8062 ms
[2023-03-18 05:17:29] [INFO ] Computed and/alt/rep : 109/757/109 causal constraints (skipped 18615 transitions) in 2151 ms.
[2023-03-18 05:17:30] [INFO ] Added : 0 causal constraints over 0 iterations in 3051 ms. Result :sat
[2023-03-18 05:17:30] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:17:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:17:33] [INFO ] [Real]Absence check using state equation in 2859 ms returned sat
[2023-03-18 05:17:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:17:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:17:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:17:36] [INFO ] [Nat]Absence check using state equation in 2839 ms returned sat
[2023-03-18 05:17:40] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 05:17:43] [INFO ] [Nat]Added 1374 Read/Feed constraints in 6773 ms returned unknown
[2023-03-18 05:17:43] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:17:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:17:46] [INFO ] [Real]Absence check using state equation in 2835 ms returned sat
[2023-03-18 05:17:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:17:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-18 05:17:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:17:50] [INFO ] [Nat]Absence check using state equation in 3092 ms returned sat
[2023-03-18 05:17:53] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 05:17:54] [INFO ] [Nat]Added 1374 Read/Feed constraints in 4205 ms returned sat
[2023-03-18 05:17:56] [INFO ] Deduced a trap composed of 49 places in 2104 ms of which 1 ms to minimize.
[2023-03-18 05:17:59] [INFO ] Deduced a trap composed of 47 places in 2156 ms of which 16 ms to minimize.
[2023-03-18 05:18:01] [INFO ] Deduced a trap composed of 68 places in 2105 ms of which 1 ms to minimize.
[2023-03-18 05:18:04] [INFO ] Deduced a trap composed of 51 places in 2278 ms of which 1 ms to minimize.
[2023-03-18 05:18:06] [INFO ] Deduced a trap composed of 147 places in 1987 ms of which 0 ms to minimize.
[2023-03-18 05:18:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 13063 ms
[2023-03-18 05:18:09] [INFO ] Computed and/alt/rep : 109/757/109 causal constraints (skipped 18615 transitions) in 2194 ms.
[2023-03-18 05:18:10] [INFO ] Added : 0 causal constraints over 0 iterations in 3071 ms. Result :sat
[2023-03-18 05:18:10] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:18:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:18:13] [INFO ] [Real]Absence check using state equation in 2970 ms returned sat
[2023-03-18 05:18:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:18:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-18 05:18:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:18:17] [INFO ] [Nat]Absence check using state equation in 2987 ms returned sat
[2023-03-18 05:18:21] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 05:18:22] [INFO ] [Nat]Added 1374 Read/Feed constraints in 4784 ms returned sat
[2023-03-18 05:18:24] [INFO ] Deduced a trap composed of 19 places in 1826 ms of which 1 ms to minimize.
[2023-03-18 05:18:26] [INFO ] Deduced a trap composed of 79 places in 1506 ms of which 2 ms to minimize.
[2023-03-18 05:18:27] [INFO ] Deduced a trap composed of 159 places in 1299 ms of which 3 ms to minimize.
[2023-03-18 05:18:30] [INFO ] Deduced a trap composed of 51 places in 1763 ms of which 1 ms to minimize.
[2023-03-18 05:18:32] [INFO ] Deduced a trap composed of 94 places in 2156 ms of which 1 ms to minimize.
[2023-03-18 05:18:36] [INFO ] Deduced a trap composed of 101 places in 1256 ms of which 1 ms to minimize.
[2023-03-18 05:18:39] [INFO ] Trap strengthening (SAT) tested/added 6/6 trap constraints in 17006 ms
[2023-03-18 05:18:39] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-18 05:18:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:18:42] [INFO ] [Real]Absence check using state equation in 2844 ms returned sat
[2023-03-18 05:18:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:18:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-18 05:18:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:18:45] [INFO ] [Nat]Absence check using state equation in 2840 ms returned sat
[2023-03-18 05:18:49] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 05:18:52] [INFO ] [Nat]Added 1374 Read/Feed constraints in 6805 ms returned unknown
[2023-03-18 05:18:52] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-18 05:18:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:18:55] [INFO ] [Real]Absence check using state equation in 2777 ms returned sat
[2023-03-18 05:18:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:18:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-18 05:18:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:18:58] [INFO ] [Nat]Absence check using state equation in 2788 ms returned sat
[2023-03-18 05:19:01] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 05:19:04] [INFO ] [Nat]Added 1374 Read/Feed constraints in 6728 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Support contains 7 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 103 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 92 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-18 05:19:05] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 05:19:05] [INFO ] Invariant cache hit.
[2023-03-18 05:19:06] [INFO ] Implicit Places using invariants in 1045 ms returned []
Implicit Place search using SMT only with invariants took 1046 ms to find 0 implicit places.
[2023-03-18 05:19:06] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 05:19:06] [INFO ] Invariant cache hit.
[2023-03-18 05:19:14] [INFO ] Dead Transitions using invariants and state equation in 8021 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9164 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting property specific reduction for RERS2020-PT-pb103-UpperBounds-02
Normalized transition count is 18727 out of 27456 initially.
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 05:19:14] [INFO ] Computed 8 place invariants in 55 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
[2023-03-18 05:19:14] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 05:19:14] [INFO ] Computed 8 place invariants in 50 ms
[2023-03-18 05:19:14] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:19:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:19:17] [INFO ] [Real]Absence check using state equation in 2878 ms returned sat
[2023-03-18 05:19:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:19:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-18 05:19:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:19:21] [INFO ] [Nat]Absence check using state equation in 3085 ms returned sat
[2023-03-18 05:19:21] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 05:19:23] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 05:19:23] [INFO ] [Nat]Added 1374 Read/Feed constraints in 1728 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 497 places. Attempting structural reductions.
Drop transitions removed 29 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27427/27427 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 497 transition count 27426
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 496 transition count 27423
Applied a total of 5 rules in 218 ms. Remains 496 /497 variables (removed 1) and now considering 27423/27427 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 496/497 places, 27423/27427 transitions.
Normalized transition count is 18688 out of 27423 initially.
// Phase 1: matrix 18688 rows 496 cols
[2023-03-18 05:19:23] [INFO ] Computed 8 place invariants in 55 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 24461 ms. (steps per millisecond=40 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3089 ms. (steps per millisecond=323 ) properties (out of 1) seen :0
[2023-03-18 05:19:50] [INFO ] Flow matrix only has 18688 transitions (discarded 8735 similar events)
// Phase 1: matrix 18688 rows 496 cols
[2023-03-18 05:19:50] [INFO ] Computed 8 place invariants in 48 ms
[2023-03-18 05:19:51] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:19:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:19:53] [INFO ] [Real]Absence check using state equation in 2910 ms returned sat
[2023-03-18 05:19:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:19:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:19:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:19:57] [INFO ] [Nat]Absence check using state equation in 2849 ms returned sat
[2023-03-18 05:19:57] [INFO ] State equation strengthened by 1369 read => feed constraints.
[2023-03-18 05:19:59] [INFO ] [Nat]Added 1369 Read/Feed constraints in 1783 ms returned sat
[2023-03-18 05:20:02] [INFO ] Computed and/alt/rep : 106/739/106 causal constraints (skipped 18579 transitions) in 2516 ms.
[2023-03-18 05:20:02] [INFO ] Added : 0 causal constraints over 0 iterations in 3393 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 496/496 places, 27423/27423 transitions.
Applied a total of 0 rules in 90 ms. Remains 496 /496 variables (removed 0) and now considering 27423/27423 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 496/496 places, 27423/27423 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 496/496 places, 27423/27423 transitions.
Applied a total of 0 rules in 87 ms. Remains 496 /496 variables (removed 0) and now considering 27423/27423 (removed 0) transitions.
[2023-03-18 05:20:03] [INFO ] Flow matrix only has 18688 transitions (discarded 8735 similar events)
[2023-03-18 05:20:03] [INFO ] Invariant cache hit.
[2023-03-18 05:20:04] [INFO ] Implicit Places using invariants in 951 ms returned []
Implicit Place search using SMT only with invariants took 952 ms to find 0 implicit places.
[2023-03-18 05:20:04] [INFO ] Flow matrix only has 18688 transitions (discarded 8735 similar events)
[2023-03-18 05:20:04] [INFO ] Invariant cache hit.
[2023-03-18 05:20:12] [INFO ] Dead Transitions using invariants and state equation in 8069 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9116 ms. Remains : 496/496 places, 27423/27423 transitions.
Ending property specific reduction for RERS2020-PT-pb103-UpperBounds-02 in 58280 ms.
Starting property specific reduction for RERS2020-PT-pb103-UpperBounds-03
Normalized transition count is 18727 out of 27456 initially.
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 05:20:12] [INFO ] Computed 8 place invariants in 56 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
[2023-03-18 05:20:12] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 05:20:12] [INFO ] Computed 8 place invariants in 53 ms
[2023-03-18 05:20:13] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:20:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:20:15] [INFO ] [Real]Absence check using state equation in 2817 ms returned sat
[2023-03-18 05:20:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:20:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-18 05:20:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:20:19] [INFO ] [Nat]Absence check using state equation in 2886 ms returned sat
[2023-03-18 05:20:19] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 05:20:21] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 05:20:21] [INFO ] [Nat]Added 1374 Read/Feed constraints in 1928 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 497 places. Attempting structural reductions.
Drop transitions removed 122 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27334/27334 transitions.
Applied a total of 0 rules in 97 ms. Remains 497 /497 variables (removed 0) and now considering 27334/27334 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 497/497 places, 27334/27334 transitions.
Normalized transition count is 18631 out of 27334 initially.
// Phase 1: matrix 18631 rows 497 cols
[2023-03-18 05:20:21] [INFO ] Computed 8 place invariants in 52 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 18857 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2771 ms. (steps per millisecond=360 ) properties (out of 1) seen :0
[2023-03-18 05:20:43] [INFO ] Flow matrix only has 18631 transitions (discarded 8703 similar events)
// Phase 1: matrix 18631 rows 497 cols
[2023-03-18 05:20:43] [INFO ] Computed 8 place invariants in 52 ms
[2023-03-18 05:20:43] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-18 05:20:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:20:46] [INFO ] [Real]Absence check using state equation in 2963 ms returned sat
[2023-03-18 05:20:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:20:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-18 05:20:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:20:49] [INFO ] [Nat]Absence check using state equation in 3013 ms returned sat
[2023-03-18 05:20:49] [INFO ] State equation strengthened by 1372 read => feed constraints.
[2023-03-18 05:20:53] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 05:20:53] [INFO ] [Nat]Added 1372 Read/Feed constraints in 3924 ms returned sat
[2023-03-18 05:20:55] [INFO ] Deduced a trap composed of 147 places in 1091 ms of which 0 ms to minimize.
[2023-03-18 05:20:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1837 ms
[2023-03-18 05:20:57] [INFO ] Computed and/alt/rep : 109/757/109 causal constraints (skipped 18519 transitions) in 2211 ms.
[2023-03-18 05:20:58] [INFO ] Added : 0 causal constraints over 0 iterations in 3110 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27334/27334 transitions.
Applied a total of 0 rules in 90 ms. Remains 497 /497 variables (removed 0) and now considering 27334/27334 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 497/497 places, 27334/27334 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27334/27334 transitions.
Applied a total of 0 rules in 92 ms. Remains 497 /497 variables (removed 0) and now considering 27334/27334 (removed 0) transitions.
[2023-03-18 05:20:59] [INFO ] Flow matrix only has 18631 transitions (discarded 8703 similar events)
[2023-03-18 05:20:59] [INFO ] Invariant cache hit.
[2023-03-18 05:21:00] [INFO ] Implicit Places using invariants in 910 ms returned []
Implicit Place search using SMT only with invariants took 910 ms to find 0 implicit places.
[2023-03-18 05:21:00] [INFO ] Flow matrix only has 18631 transitions (discarded 8703 similar events)
[2023-03-18 05:21:00] [INFO ] Invariant cache hit.
[2023-03-18 05:21:08] [INFO ] Dead Transitions using invariants and state equation in 8611 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9621 ms. Remains : 497/497 places, 27334/27334 transitions.
Ending property specific reduction for RERS2020-PT-pb103-UpperBounds-03 in 56267 ms.
Starting property specific reduction for RERS2020-PT-pb103-UpperBounds-06
Normalized transition count is 18727 out of 27456 initially.
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 05:21:08] [INFO ] Computed 8 place invariants in 53 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
[2023-03-18 05:21:09] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 05:21:09] [INFO ] Computed 8 place invariants in 54 ms
[2023-03-18 05:21:09] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:21:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:21:12] [INFO ] [Real]Absence check using state equation in 2968 ms returned sat
[2023-03-18 05:21:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:21:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-18 05:21:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:21:15] [INFO ] [Nat]Absence check using state equation in 2953 ms returned sat
[2023-03-18 05:21:15] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 05:21:17] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 05:21:17] [INFO ] [Nat]Added 1374 Read/Feed constraints in 1879 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 497 places. Attempting structural reductions.
Drop transitions removed 131 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27325/27325 transitions.
Applied a total of 0 rules in 87 ms. Remains 497 /497 variables (removed 0) and now considering 27325/27325 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 497/497 places, 27325/27325 transitions.
Normalized transition count is 18720 out of 27325 initially.
// Phase 1: matrix 18720 rows 497 cols
[2023-03-18 05:21:17] [INFO ] Computed 8 place invariants in 63 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 18754 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2401 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
[2023-03-18 05:21:39] [INFO ] Flow matrix only has 18720 transitions (discarded 8605 similar events)
// Phase 1: matrix 18720 rows 497 cols
[2023-03-18 05:21:39] [INFO ] Computed 8 place invariants in 49 ms
[2023-03-18 05:21:39] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-18 05:21:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:21:41] [INFO ] [Real]Absence check using state equation in 2680 ms returned sat
[2023-03-18 05:21:42] [INFO ] State equation strengthened by 1373 read => feed constraints.
[2023-03-18 05:21:43] [INFO ] [Real]Added 1373 Read/Feed constraints in 785 ms returned sat
[2023-03-18 05:21:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:21:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:21:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:21:46] [INFO ] [Nat]Absence check using state equation in 2691 ms returned sat
[2023-03-18 05:21:49] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 05:21:50] [INFO ] [Nat]Added 1373 Read/Feed constraints in 4057 ms returned sat
[2023-03-18 05:21:52] [INFO ] Deduced a trap composed of 227 places in 2205 ms of which 0 ms to minimize.
[2023-03-18 05:21:55] [INFO ] Deduced a trap composed of 19 places in 1974 ms of which 1 ms to minimize.
[2023-03-18 05:21:58] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 8714 ms
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27325/27325 transitions.
Applied a total of 0 rules in 88 ms. Remains 497 /497 variables (removed 0) and now considering 27325/27325 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 497/497 places, 27325/27325 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27325/27325 transitions.
Applied a total of 0 rules in 85 ms. Remains 497 /497 variables (removed 0) and now considering 27325/27325 (removed 0) transitions.
[2023-03-18 05:21:59] [INFO ] Flow matrix only has 18720 transitions (discarded 8605 similar events)
[2023-03-18 05:21:59] [INFO ] Invariant cache hit.
[2023-03-18 05:21:59] [INFO ] Implicit Places using invariants in 848 ms returned []
Implicit Place search using SMT only with invariants took 857 ms to find 0 implicit places.
[2023-03-18 05:21:59] [INFO ] Flow matrix only has 18720 transitions (discarded 8605 similar events)
[2023-03-18 05:21:59] [INFO ] Invariant cache hit.
[2023-03-18 05:22:08] [INFO ] Dead Transitions using invariants and state equation in 8091 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9038 ms. Remains : 497/497 places, 27325/27325 transitions.
Ending property specific reduction for RERS2020-PT-pb103-UpperBounds-06 in 59183 ms.
Starting property specific reduction for RERS2020-PT-pb103-UpperBounds-10
Normalized transition count is 18727 out of 27456 initially.
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 05:22:08] [INFO ] Computed 8 place invariants in 54 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
[2023-03-18 05:22:08] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 05:22:08] [INFO ] Computed 8 place invariants in 46 ms
[2023-03-18 05:22:08] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-18 05:22:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:22:11] [INFO ] [Real]Absence check using state equation in 2987 ms returned sat
[2023-03-18 05:22:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:22:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-18 05:22:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:22:15] [INFO ] [Nat]Absence check using state equation in 3014 ms returned sat
[2023-03-18 05:22:15] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 05:22:16] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 05:22:16] [INFO ] [Nat]Added 1374 Read/Feed constraints in 1795 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 497 places. Attempting structural reductions.
Drop transitions removed 190 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27266/27266 transitions.
Deduced a syphon composed of 4 places in 8 ms
Reduce places removed 4 places and 794 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 493 transition count 26472
Applied a total of 4 rules in 197 ms. Remains 493 /497 variables (removed 4) and now considering 26472/27266 (removed 794) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 493/497 places, 26472/27266 transitions.
Normalized transition count is 18544 out of 26472 initially.
// Phase 1: matrix 18544 rows 493 cols
[2023-03-18 05:22:17] [INFO ] Computed 8 place invariants in 54 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 17848 ms. (steps per millisecond=56 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2297 ms. (steps per millisecond=435 ) properties (out of 1) seen :0
[2023-03-18 05:22:37] [INFO ] Flow matrix only has 18544 transitions (discarded 7928 similar events)
// Phase 1: matrix 18544 rows 493 cols
[2023-03-18 05:22:37] [INFO ] Computed 8 place invariants in 51 ms
[2023-03-18 05:22:37] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-18 05:22:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:22:40] [INFO ] [Real]Absence check using state equation in 2620 ms returned sat
[2023-03-18 05:22:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:22:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:22:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:22:43] [INFO ] [Nat]Absence check using state equation in 2523 ms returned sat
[2023-03-18 05:22:43] [INFO ] State equation strengthened by 1365 read => feed constraints.
[2023-03-18 05:22:46] [INFO ] [Nat]Added 1365 Read/Feed constraints in 3074 ms returned sat
[2023-03-18 05:22:48] [INFO ] Deduced a trap composed of 51 places in 1962 ms of which 1 ms to minimize.
[2023-03-18 05:22:50] [INFO ] Deduced a trap composed of 72 places in 1560 ms of which 1 ms to minimize.
[2023-03-18 05:22:53] [INFO ] Deduced a trap composed of 147 places in 1568 ms of which 1 ms to minimize.
[2023-03-18 05:22:55] [INFO ] Deduced a trap composed of 19 places in 1639 ms of which 1 ms to minimize.
[2023-03-18 05:22:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 9828 ms
[2023-03-18 05:22:58] [INFO ] Computed and/alt/rep : 108/749/108 causal constraints (skipped 18433 transitions) in 2362 ms.
[2023-03-18 05:22:59] [INFO ] Added : 0 causal constraints over 0 iterations in 3195 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 493 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 493/493 places, 26472/26472 transitions.
Applied a total of 0 rules in 104 ms. Remains 493 /493 variables (removed 0) and now considering 26472/26472 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 493/493 places, 26472/26472 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 493/493 places, 26472/26472 transitions.
Applied a total of 0 rules in 85 ms. Remains 493 /493 variables (removed 0) and now considering 26472/26472 (removed 0) transitions.
[2023-03-18 05:22:59] [INFO ] Flow matrix only has 18544 transitions (discarded 7928 similar events)
[2023-03-18 05:22:59] [INFO ] Invariant cache hit.
[2023-03-18 05:23:00] [INFO ] Implicit Places using invariants in 811 ms returned []
Implicit Place search using SMT only with invariants took 822 ms to find 0 implicit places.
[2023-03-18 05:23:00] [INFO ] Flow matrix only has 18544 transitions (discarded 7928 similar events)
[2023-03-18 05:23:00] [INFO ] Invariant cache hit.
[2023-03-18 05:23:08] [INFO ] Dead Transitions using invariants and state equation in 7585 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8496 ms. Remains : 493/493 places, 26472/26472 transitions.
Ending property specific reduction for RERS2020-PT-pb103-UpperBounds-10 in 60288 ms.
Starting property specific reduction for RERS2020-PT-pb103-UpperBounds-11
Normalized transition count is 18727 out of 27456 initially.
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 05:23:08] [INFO ] Computed 8 place invariants in 52 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
[2023-03-18 05:23:08] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 05:23:08] [INFO ] Computed 8 place invariants in 51 ms
[2023-03-18 05:23:08] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-18 05:23:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:23:11] [INFO ] [Real]Absence check using state equation in 2626 ms returned sat
[2023-03-18 05:23:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:23:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:23:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:23:14] [INFO ] [Nat]Absence check using state equation in 3087 ms returned sat
[2023-03-18 05:23:15] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 05:23:16] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 05:23:16] [INFO ] [Nat]Added 1374 Read/Feed constraints in 1720 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 497 places. Attempting structural reductions.
Drop transitions removed 27 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27429/27429 transitions.
Applied a total of 0 rules in 108 ms. Remains 497 /497 variables (removed 0) and now considering 27429/27429 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 497/497 places, 27429/27429 transitions.
Normalized transition count is 18700 out of 27429 initially.
// Phase 1: matrix 18700 rows 497 cols
[2023-03-18 05:23:16] [INFO ] Computed 8 place invariants in 55 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 18305 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2305 ms. (steps per millisecond=433 ) properties (out of 1) seen :0
[2023-03-18 05:23:37] [INFO ] Flow matrix only has 18700 transitions (discarded 8729 similar events)
// Phase 1: matrix 18700 rows 497 cols
[2023-03-18 05:23:37] [INFO ] Computed 8 place invariants in 52 ms
[2023-03-18 05:23:37] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:23:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:23:40] [INFO ] [Real]Absence check using state equation in 2616 ms returned sat
[2023-03-18 05:23:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:23:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:23:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:23:43] [INFO ] [Nat]Absence check using state equation in 2615 ms returned sat
[2023-03-18 05:23:43] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 05:23:47] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 05:23:50] [INFO ] [Nat]Added 1370 Read/Feed constraints in 6694 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27429/27429 transitions.
Applied a total of 0 rules in 103 ms. Remains 497 /497 variables (removed 0) and now considering 27429/27429 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 497/497 places, 27429/27429 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27429/27429 transitions.
Applied a total of 0 rules in 94 ms. Remains 497 /497 variables (removed 0) and now considering 27429/27429 (removed 0) transitions.
[2023-03-18 05:23:50] [INFO ] Flow matrix only has 18700 transitions (discarded 8729 similar events)
[2023-03-18 05:23:50] [INFO ] Invariant cache hit.
[2023-03-18 05:23:51] [INFO ] Implicit Places using invariants in 841 ms returned []
Implicit Place search using SMT only with invariants took 869 ms to find 0 implicit places.
[2023-03-18 05:23:51] [INFO ] Flow matrix only has 18700 transitions (discarded 8729 similar events)
[2023-03-18 05:23:51] [INFO ] Invariant cache hit.
[2023-03-18 05:23:59] [INFO ] Dead Transitions using invariants and state equation in 8043 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9037 ms. Remains : 497/497 places, 27429/27429 transitions.
Ending property specific reduction for RERS2020-PT-pb103-UpperBounds-11 in 50967 ms.
Starting property specific reduction for RERS2020-PT-pb103-UpperBounds-12
Normalized transition count is 18727 out of 27456 initially.
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 05:23:59] [INFO ] Computed 8 place invariants in 47 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
[2023-03-18 05:23:59] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 05:23:59] [INFO ] Computed 8 place invariants in 75 ms
[2023-03-18 05:23:59] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-18 05:23:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:24:02] [INFO ] [Real]Absence check using state equation in 2667 ms returned sat
[2023-03-18 05:24:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:24:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:24:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:24:05] [INFO ] [Nat]Absence check using state equation in 2651 ms returned sat
[2023-03-18 05:24:05] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 05:24:07] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 05:24:07] [INFO ] [Nat]Added 1374 Read/Feed constraints in 2202 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 497 places. Attempting structural reductions.
Drop transitions removed 37 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27419/27419 transitions.
Applied a total of 0 rules in 94 ms. Remains 497 /497 variables (removed 0) and now considering 27419/27419 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 497/497 places, 27419/27419 transitions.
Normalized transition count is 18703 out of 27419 initially.
// Phase 1: matrix 18703 rows 497 cols
[2023-03-18 05:24:07] [INFO ] Computed 8 place invariants in 49 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 18536 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 2473 ms. (steps per millisecond=404 ) properties (out of 1) seen :0
[2023-03-18 05:24:28] [INFO ] Flow matrix only has 18703 transitions (discarded 8716 similar events)
// Phase 1: matrix 18703 rows 497 cols
[2023-03-18 05:24:29] [INFO ] Computed 8 place invariants in 46 ms
[2023-03-18 05:24:29] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-18 05:24:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:24:31] [INFO ] [Real]Absence check using state equation in 2664 ms returned sat
[2023-03-18 05:24:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:24:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-18 05:24:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:24:34] [INFO ] [Nat]Absence check using state equation in 2692 ms returned sat
[2023-03-18 05:24:34] [INFO ] State equation strengthened by 1372 read => feed constraints.
[2023-03-18 05:24:38] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 05:24:41] [INFO ] [Nat]Added 1372 Read/Feed constraints in 6330 ms returned sat
[2023-03-18 05:24:43] [INFO ] Deduced a trap composed of 19 places in 1503 ms of which 0 ms to minimize.
[2023-03-18 05:24:44] [INFO ] Deduced a trap composed of 43 places in 1520 ms of which 1 ms to minimize.
[2023-03-18 05:24:46] [INFO ] Deduced a trap composed of 51 places in 1535 ms of which 0 ms to minimize.
[2023-03-18 05:24:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 6006 ms
[2023-03-18 05:24:49] [INFO ] Computed and/alt/rep : 109/757/109 causal constraints (skipped 18591 transitions) in 2126 ms.
[2023-03-18 05:24:51] [INFO ] Added : 1 causal constraints over 1 iterations in 3935 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27419/27419 transitions.
Applied a total of 0 rules in 89 ms. Remains 497 /497 variables (removed 0) and now considering 27419/27419 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 497/497 places, 27419/27419 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27419/27419 transitions.
Applied a total of 0 rules in 86 ms. Remains 497 /497 variables (removed 0) and now considering 27419/27419 (removed 0) transitions.
[2023-03-18 05:24:51] [INFO ] Flow matrix only has 18703 transitions (discarded 8716 similar events)
[2023-03-18 05:24:51] [INFO ] Invariant cache hit.
[2023-03-18 05:24:52] [INFO ] Implicit Places using invariants in 868 ms returned []
Implicit Place search using SMT only with invariants took 888 ms to find 0 implicit places.
[2023-03-18 05:24:52] [INFO ] Flow matrix only has 18703 transitions (discarded 8716 similar events)
[2023-03-18 05:24:52] [INFO ] Invariant cache hit.
[2023-03-18 05:25:01] [INFO ] Dead Transitions using invariants and state equation in 8230 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9213 ms. Remains : 497/497 places, 27419/27419 transitions.
Ending property specific reduction for RERS2020-PT-pb103-UpperBounds-12 in 61692 ms.
Starting property specific reduction for RERS2020-PT-pb103-UpperBounds-13
Normalized transition count is 18727 out of 27456 initially.
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 05:25:01] [INFO ] Computed 8 place invariants in 48 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
[2023-03-18 05:25:01] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 05:25:01] [INFO ] Computed 8 place invariants in 42 ms
[2023-03-18 05:25:01] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-18 05:25:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:25:04] [INFO ] [Real]Absence check using state equation in 2719 ms returned sat
[2023-03-18 05:25:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:25:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-18 05:25:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:25:07] [INFO ] [Nat]Absence check using state equation in 2678 ms returned sat
[2023-03-18 05:25:07] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 05:25:09] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 05:25:09] [INFO ] [Nat]Added 1374 Read/Feed constraints in 2166 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 497 places. Attempting structural reductions.
Drop transitions removed 58 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27398/27398 transitions.
Applied a total of 0 rules in 91 ms. Remains 497 /497 variables (removed 0) and now considering 27398/27398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 497/497 places, 27398/27398 transitions.
Normalized transition count is 18725 out of 27398 initially.
// Phase 1: matrix 18725 rows 497 cols
[2023-03-18 05:25:09] [INFO ] Computed 8 place invariants in 58 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 18539 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4 resets, run finished after 2405 ms. (steps per millisecond=415 ) properties (out of 1) seen :0
[2023-03-18 05:25:30] [INFO ] Flow matrix only has 18725 transitions (discarded 8673 similar events)
// Phase 1: matrix 18725 rows 497 cols
[2023-03-18 05:25:30] [INFO ] Computed 8 place invariants in 48 ms
[2023-03-18 05:25:30] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-18 05:25:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 05:25:33] [INFO ] [Real]Absence check using state equation in 2763 ms returned sat
[2023-03-18 05:25:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 05:25:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:25:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 05:25:36] [INFO ] [Nat]Absence check using state equation in 2646 ms returned sat
[2023-03-18 05:25:36] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 05:25:40] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 05:25:42] [INFO ] [Nat]Added 1374 Read/Feed constraints in 5786 ms returned sat
[2023-03-18 05:25:44] [INFO ] Deduced a trap composed of 47 places in 1929 ms of which 0 ms to minimize.
[2023-03-18 05:25:46] [INFO ] Deduced a trap composed of 51 places in 1912 ms of which 0 ms to minimize.
[2023-03-18 05:25:49] [INFO ] Deduced a trap composed of 19 places in 1929 ms of which 1 ms to minimize.
[2023-03-18 05:25:51] [INFO ] Deduced a trap composed of 49 places in 1911 ms of which 1 ms to minimize.
[2023-03-18 05:25:53] [INFO ] Deduced a trap composed of 91 places in 1940 ms of which 0 ms to minimize.
[2023-03-18 05:25:56] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 14284 ms
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27398/27398 transitions.
Applied a total of 0 rules in 102 ms. Remains 497 /497 variables (removed 0) and now considering 27398/27398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 497/497 places, 27398/27398 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27398/27398 transitions.
Applied a total of 0 rules in 87 ms. Remains 497 /497 variables (removed 0) and now considering 27398/27398 (removed 0) transitions.
[2023-03-18 05:25:56] [INFO ] Flow matrix only has 18725 transitions (discarded 8673 similar events)
[2023-03-18 05:25:56] [INFO ] Invariant cache hit.
[2023-03-18 05:25:57] [INFO ] Implicit Places using invariants in 870 ms returned []
Implicit Place search using SMT only with invariants took 889 ms to find 0 implicit places.
[2023-03-18 05:25:57] [INFO ] Flow matrix only has 18725 transitions (discarded 8673 similar events)
[2023-03-18 05:25:57] [INFO ] Invariant cache hit.
[2023-03-18 05:26:06] [INFO ] Dead Transitions using invariants and state equation in 8193 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9187 ms. Remains : 497/497 places, 27398/27398 transitions.
Ending property specific reduction for RERS2020-PT-pb103-UpperBounds-13 in 65090 ms.
[2023-03-18 05:26:08] [INFO ] Flatten gal took : 1615 ms
[2023-03-18 05:26:08] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-18 05:26:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 497 places, 27456 transitions and 109288 arcs took 95 ms.
Total runtime 873766 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: RERS2020_PT_pb103
(NrP: 497 NrTr: 27456 NrArc: 109288)
parse formulas
formulas created successfully
place and transition orderings generation:0m 1.958sec
net check time: 0m 0.033sec
init dd package: 0m 2.729sec
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10083984 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16066000 kB
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 5.041sec
1208 1454 1942 2352 2093 2105 3474 3603 3702 4169 4852 5043 5788 6260 6307 6320 6640 6612 6555 6725 6615 6606 6956 6904 7063 7197 7184 6871 6666 5888 5615 5645 5852 6031 5918 5533 5873 5924 5922 5994 5948 6148 6221 5924 5896 6047 5996 5695 6168 5934 5813 5982 6092 6022 5627 6010 6090 6015 6049 6242 5951 6168 6403 6487 6752 6842 6743 6860 6794 6726 6946 7162 7064 7408 7389 7162 6928 6471 6058 5470 6046 6168 6276 6131 6246 6191 6181 6465 6377 6281 6202 5858 5986 6183 6194 6052 6249 6203 5839 6037 6622 6058 6012 6111 6304 6114 6298 6102 6016 6877 6839 7141 6784 6579 6534 5975 6438 6567 6783 7044 7163 7083 7152 7233 7064 7233 7450 7367 7652 7647 7410 7214 6884 6397 6167 6426 6518 6518 6459 6024 6624 6663 6856 6720 6904 6757 6058 6539 6721 6735 6688 6064 6759 6366 6594 6794 6776 6657 6784 7057 6787 6980 6935 6839 5981 6588 6643 6759 7151 7085 7056 7175 7088 6990 7321 7410 7369 7707 7649 7403 7213 6860 6586 6049 6337 6520 6548 6461 6676 6587 6734 6858 6857 6623 6742 6359 6634 6766 6856 6809 6850 6753 6411 6672 6731 6731 6518 6786 7021 6936 6840 6777 6078 6029 6702 6678 6855 7070 7087 7068 7239 7090 6798 7367 7508 7369 7738 7680 7381 7311 6724 6503 6158 6332 6522 6563 6424 6619 6812 6667 6718 6723 6811 6744 6384 6580 7291 6725 6650 6785 7019 6559 6650 6850 6831 6446 6935 6839 6778 6079 6762 5965 6096 6532 6728 6797 7132 7097 7032 7091 7139 7079 7445 7395 7572 7712 7636 7404 7299 6200 6502 6244 6328 6722 6694 6194 6621 6805 6639 6014 6696 6776 6969 6552 6759 6844 6888 6380 6787 6838 6478 6668 6976 6908 6378 6777 6071 6802 6794 6764 5297 5301 5768 4406 4010 4177 4227 4039 3992 4385 4764 5107 5019 5028 5654 6094 6112 6139 5790 4881 4715 5227 4838 5208 5538 5140 4588 5781 5256 5421 4978 5518 5076 5388 5581 4986 5435 5054 5270 5716 5418 4655 5269 4716 4271 4766 5027 5108 5030 5656 6144 6114 6141 5792 5070 4717 5229 4724 5094 5540 5142 5254 5654 5258 5423 4980 5431 5078 5269 5434 4989 5437 5086 5392 5586 5275 4729 5271 4647 4168 4771 5094 5181 5182 5662 6059 6204 6360 5998 5009 4723 5008 5239 5175 5546 5148 4664 5209 5384 5578 4935 5437 5054 5275 5589 4944 5413 4950 5394 5724 5281 5446 5282 4734 4441 4914 5179 5365 5625 5559 5582 5628 5710 5593 5758 5900 5859 6229 6167 5987 5708 5433
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="RERS2020-PT-pb103"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is RERS2020-PT-pb103, 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 r330-tall-167889203000237"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RERS2020-PT-pb103.tgz
mv RERS2020-PT-pb103 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 ;