About the Execution of 2023-gold for RERS2020-PT-pb103
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7758.020 | 699553.00 | 763272.00 | 3001.10 | 0 1 1 1 1 0 0 1 1 1 1 1 1 1 1 0 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r329-tall-171662361800216.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r329-tall-171662361800216
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 18M May 18 16:43 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 1716841480999
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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS2020-PT-pb103
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-27 20:24:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 20:24:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 20:24:43] [INFO ] Load time of PNML (sax parser for PT used): 678 ms
[2024-05-27 20:24:43] [INFO ] Transformed 520 places.
[2024-05-27 20:24:43] [INFO ] Transformed 31658 transitions.
[2024-05-27 20:24:43] [INFO ] Found NUPN structural information;
[2024-05-27 20:24:43] [INFO ] Parsed PT model containing 520 places and 31658 transitions and 125892 arcs in 892 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Ensure Unique test removed 3229 transitions
Reduce redundant transitions removed 3229 transitions.
FORMULA RERS2020-PT-pb103-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 18674 out of 28429 initially.
// Phase 1: matrix 18674 rows 520 cols
[2024-05-27 20:24:44] [INFO ] Computed 15 invariants in 142 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 15) seen :8
FORMULA RERS2020-PT-pb103-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS2020-PT-pb103-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS2020-PT-pb103-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS2020-PT-pb103-UpperBounds-10 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-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS2020-PT-pb103-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :3
FORMULA RERS2020-PT-pb103-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RERS2020-PT-pb103-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA RERS2020-PT-pb103-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
[2024-05-27 20:24:45] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 520 cols
[2024-05-27 20:24:45] [INFO ] Computed 15 invariants in 81 ms
[2024-05-27 20:24:45] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-05-27 20:24:45] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-27 20:24:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:24:48] [INFO ] [Real]Absence check using state equation in 3114 ms returned sat
[2024-05-27 20:24:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:24:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2024-05-27 20:24:49] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 5 ms returned sat
[2024-05-27 20:24:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:24:52] [INFO ] [Nat]Absence check using state equation in 3025 ms returned sat
[2024-05-27 20:24:52] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2024-05-27 20:24:53] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 20:24:53] [INFO ] [Nat]Added 1379 Read/Feed constraints in 1459 ms returned unknown
[2024-05-27 20:24:54] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-05-27 20:24:54] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-27 20:24:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:24:57] [INFO ] [Real]Absence check using state equation in 3169 ms returned sat
[2024-05-27 20:24:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:24:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-05-27 20:24:57] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-27 20:24:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:25:01] [INFO ] [Nat]Absence check using state equation in 3313 ms returned sat
[2024-05-27 20:25:02] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 20:25:02] [INFO ] [Nat]Added 1379 Read/Feed constraints in 1617 ms returned unknown
[2024-05-27 20:25:02] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-05-27 20:25:02] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-27 20:25:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:25:05] [INFO ] [Real]Absence check using state equation in 2924 ms returned sat
[2024-05-27 20:25:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:25:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-05-27 20:25:06] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-27 20:25:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:25:09] [INFO ] [Nat]Absence check using state equation in 2996 ms returned sat
[2024-05-27 20:25:11] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 20:25:11] [INFO ] [Nat]Added 1379 Read/Feed constraints in 1922 ms returned unknown
[2024-05-27 20:25:11] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-05-27 20:25:11] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-27 20:25:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:25:14] [INFO ] [Real]Absence check using state equation in 2879 ms returned sat
[2024-05-27 20:25:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:25:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-05-27 20:25:14] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-27 20:25:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:25:17] [INFO ] [Nat]Absence check using state equation in 3066 ms returned sat
[2024-05-27 20:25:19] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 20:25:19] [INFO ] [Nat]Added 1379 Read/Feed constraints in 1846 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 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 12 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 28 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 966 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 972 ms. Remains : 497/520 places, 27456/28429 transitions.
Normalized transition count is 18727 out of 27456 initially.
// Phase 1: matrix 18727 rows 497 cols
[2024-05-27 20:25:20] [INFO ] Computed 8 invariants in 68 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 22487 ms. (steps per millisecond=44 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2651 ms. (steps per millisecond=377 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2419 ms. (steps per millisecond=413 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2398 ms. (steps per millisecond=417 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2314 ms. (steps per millisecond=432 ) properties (out of 4) seen :0
[2024-05-27 20:25:52] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2024-05-27 20:25:52] [INFO ] Computed 8 invariants in 55 ms
[2024-05-27 20:25:52] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-05-27 20:25:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:25:56] [INFO ] [Real]Absence check using state equation in 3219 ms returned sat
[2024-05-27 20:25:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:25:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-05-27 20:25:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:25:59] [INFO ] [Nat]Absence check using state equation in 2878 ms returned sat
[2024-05-27 20:25:59] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2024-05-27 20:26:03] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 20:26:04] [INFO ] [Nat]Added 1374 Read/Feed constraints in 4486 ms returned sat
[2024-05-27 20:26:06] [INFO ] Deduced a trap composed of 43 places in 1630 ms of which 7 ms to minimize.
[2024-05-27 20:26:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2443 ms
[2024-05-27 20:26:10] [INFO ] Computed and/alt/rep : 109/757/109 causal constraints (skipped 18615 transitions) in 3189 ms.
[2024-05-27 20:26:11] [INFO ] Added : 0 causal constraints over 0 iterations in 4231 ms. Result :sat
[2024-05-27 20:26:11] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-05-27 20:26:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:26:15] [INFO ] [Real]Absence check using state equation in 3324 ms returned sat
[2024-05-27 20:26:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:26:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-05-27 20:26:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:26:18] [INFO ] [Nat]Absence check using state equation in 3212 ms returned sat
[2024-05-27 20:26:21] [INFO ] [Nat]Added 1374 Read/Feed constraints in 2955 ms returned sat
[2024-05-27 20:26:24] [INFO ] Deduced a trap composed of 92 places in 2302 ms of which 2 ms to minimize.
[2024-05-27 20:26:28] [INFO ] Deduced a trap composed of 58 places in 2229 ms of which 2 ms to minimize.
[2024-05-27 20:26:30] [INFO ] Deduced a trap composed of 47 places in 2449 ms of which 3 ms to minimize.
[2024-05-27 20:26:33] [INFO ] Deduced a trap composed of 104 places in 2340 ms of which 0 ms to minimize.
[2024-05-27 20:26:35] [INFO ] Deduced a trap composed of 157 places in 1983 ms of which 1 ms to minimize.
[2024-05-27 20:26:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 14705 ms
[2024-05-27 20:26:38] [INFO ] Computed and/alt/rep : 109/757/109 causal constraints (skipped 18615 transitions) in 2308 ms.
[2024-05-27 20:26:39] [INFO ] Added : 0 causal constraints over 0 iterations in 3206 ms. Result :sat
[2024-05-27 20:26:40] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-05-27 20:26:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:26:43] [INFO ] [Real]Absence check using state equation in 3057 ms returned sat
[2024-05-27 20:26:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:26:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-05-27 20:26:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:26:46] [INFO ] [Nat]Absence check using state equation in 2907 ms returned sat
[2024-05-27 20:26:50] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 20:26:53] [INFO ] [Nat]Added 1374 Read/Feed constraints in 6543 ms returned sat
[2024-05-27 20:26:55] [INFO ] Deduced a trap composed of 19 places in 2218 ms of which 1 ms to minimize.
[2024-05-27 20:26:58] [INFO ] Deduced a trap composed of 60 places in 2281 ms of which 2 ms to minimize.
[2024-05-27 20:27:01] [INFO ] Deduced a trap composed of 157 places in 2492 ms of which 1 ms to minimize.
[2024-05-27 20:27:05] [INFO ] Deduced a trap composed of 49 places in 2311 ms of which 2 ms to minimize.
[2024-05-27 20:27:08] [INFO ] Deduced a trap composed of 129 places in 2457 ms of which 0 ms to minimize.
[2024-05-27 20:27:11] [INFO ] Deduced a trap composed of 147 places in 2439 ms of which 1 ms to minimize.
[2024-05-27 20:27:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 18597 ms
[2024-05-27 20:27:11] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-05-27 20:27:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:27:14] [INFO ] [Real]Absence check using state equation in 2937 ms returned sat
[2024-05-27 20:27:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:27:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-05-27 20:27:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:27:18] [INFO ] [Nat]Absence check using state equation in 2826 ms returned sat
[2024-05-27 20:27:21] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 20:27:24] [INFO ] [Nat]Added 1374 Read/Feed constraints in 6749 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 0, 1] Max seen :[0, 0, 0, 0]
FORMULA RERS2020-PT-pb103-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 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 121 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 121 ms. Remains : 497/497 places, 27456/27456 transitions.
Normalized transition count is 18727 out of 27456 initially.
// Phase 1: matrix 18727 rows 497 cols
[2024-05-27 20:27:25] [INFO ] Computed 8 invariants in 67 ms
Incomplete random walk after 1000000 steps, including 3 resets, run finished after 21937 ms. (steps per millisecond=45 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3250 ms. (steps per millisecond=307 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3141 ms. (steps per millisecond=318 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3218 ms. (steps per millisecond=310 ) properties (out of 3) seen :0
[2024-05-27 20:27:56] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2024-05-27 20:27:56] [INFO ] Computed 8 invariants in 57 ms
[2024-05-27 20:27:56] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-05-27 20:27:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:27:59] [INFO ] [Real]Absence check using state equation in 3077 ms returned sat
[2024-05-27 20:28:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:28:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-05-27 20:28:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:28:03] [INFO ] [Nat]Absence check using state equation in 3044 ms returned sat
[2024-05-27 20:28:03] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2024-05-27 20:28:07] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 20:28:08] [INFO ] [Nat]Added 1374 Read/Feed constraints in 4769 ms returned sat
[2024-05-27 20:28:10] [INFO ] Deduced a trap composed of 19 places in 1436 ms of which 1 ms to minimize.
[2024-05-27 20:28:12] [INFO ] Deduced a trap composed of 147 places in 1535 ms of which 1 ms to minimize.
[2024-05-27 20:28:14] [INFO ] Deduced a trap composed of 47 places in 1880 ms of which 0 ms to minimize.
[2024-05-27 20:28:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 7122 ms
[2024-05-27 20:28:18] [INFO ] Computed and/alt/rep : 109/757/109 causal constraints (skipped 18615 transitions) in 2474 ms.
[2024-05-27 20:28:19] [INFO ] Added : 0 causal constraints over 0 iterations in 3450 ms. Result :sat
[2024-05-27 20:28:19] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-05-27 20:28:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:28:22] [INFO ] [Real]Absence check using state equation in 3074 ms returned sat
[2024-05-27 20:28:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:28:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-05-27 20:28:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:28:26] [INFO ] [Nat]Absence check using state equation in 2893 ms returned sat
[2024-05-27 20:28:29] [INFO ] [Nat]Added 1374 Read/Feed constraints in 2989 ms returned sat
[2024-05-27 20:28:31] [INFO ] Deduced a trap composed of 92 places in 2321 ms of which 1 ms to minimize.
[2024-05-27 20:28:35] [INFO ] Deduced a trap composed of 58 places in 2185 ms of which 1 ms to minimize.
[2024-05-27 20:28:38] [INFO ] Deduced a trap composed of 47 places in 2072 ms of which 1 ms to minimize.
[2024-05-27 20:28:40] [INFO ] Deduced a trap composed of 104 places in 2293 ms of which 1 ms to minimize.
[2024-05-27 20:28:43] [INFO ] Deduced a trap composed of 157 places in 2229 ms of which 1 ms to minimize.
[2024-05-27 20:28:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 14794 ms
[2024-05-27 20:28:46] [INFO ] Computed and/alt/rep : 109/757/109 causal constraints (skipped 18615 transitions) in 2178 ms.
[2024-05-27 20:28:46] [INFO ] Added : 0 causal constraints over 0 iterations in 3043 ms. Result :sat
[2024-05-27 20:28:47] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-05-27 20:28:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:28:50] [INFO ] [Real]Absence check using state equation in 3042 ms returned sat
[2024-05-27 20:28:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:28:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-05-27 20:28:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:28:53] [INFO ] [Nat]Absence check using state equation in 2697 ms returned sat
[2024-05-27 20:28:57] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 20:29:00] [INFO ] [Nat]Added 1374 Read/Feed constraints in 6718 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 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 135 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 135 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 115 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2024-05-27 20:29:00] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2024-05-27 20:29:00] [INFO ] Invariant cache hit.
[2024-05-27 20:29:01] [INFO ] Implicit Places using invariants in 978 ms returned []
Implicit Place search using SMT only with invariants took 993 ms to find 0 implicit places.
[2024-05-27 20:29:01] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2024-05-27 20:29:01] [INFO ] Invariant cache hit.
[2024-05-27 20:29:10] [INFO ] Dead Transitions using invariants and state equation in 8382 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9496 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting property specific reduction for RERS2020-PT-pb103-UpperBounds-00
Normalized transition count is 18727 out of 27456 initially.
// Phase 1: matrix 18727 rows 497 cols
[2024-05-27 20:29:10] [INFO ] Computed 8 invariants in 51 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 199 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 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
[2024-05-27 20:29:10] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2024-05-27 20:29:10] [INFO ] Computed 8 invariants in 52 ms
[2024-05-27 20:29:10] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-05-27 20:29:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:29:13] [INFO ] [Real]Absence check using state equation in 2956 ms returned sat
[2024-05-27 20:29:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:29:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-05-27 20:29:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:29:16] [INFO ] [Nat]Absence check using state equation in 2920 ms returned sat
[2024-05-27 20:29:17] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2024-05-27 20:29:18] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 20:29:18] [INFO ] [Nat]Added 1374 Read/Feed constraints in 1898 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 207 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27249/27249 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 497 transition count 27403
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 496 transition count 27343
Applied a total of 62 rules in 224 ms. Remains 496 /497 variables (removed 1) and now considering 27343/27249 (removed -94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 226 ms. Remains : 496/497 places, 27343/27249 transitions.
Normalized transition count is 18640 out of 27343 initially.
// Phase 1: matrix 18640 rows 496 cols
[2024-05-27 20:29:19] [INFO ] Computed 8 invariants in 60 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 21960 ms. (steps per millisecond=45 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2860 ms. (steps per millisecond=349 ) properties (out of 1) seen :0
[2024-05-27 20:29:44] [INFO ] Flow matrix only has 18640 transitions (discarded 8703 similar events)
// Phase 1: matrix 18640 rows 496 cols
[2024-05-27 20:29:44] [INFO ] Computed 8 invariants in 57 ms
[2024-05-27 20:29:44] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2024-05-27 20:29:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:29:47] [INFO ] [Real]Absence check using state equation in 2934 ms returned sat
[2024-05-27 20:29:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:29:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-05-27 20:29:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:29:50] [INFO ] [Nat]Absence check using state equation in 2870 ms returned sat
[2024-05-27 20:29:50] [INFO ] State equation strengthened by 1372 read => feed constraints.
[2024-05-27 20:29:54] [INFO ] [Nat]Added 1372 Read/Feed constraints in 3589 ms returned sat
[2024-05-27 20:29:55] [INFO ] Deduced a trap composed of 19 places in 1326 ms of which 4 ms to minimize.
[2024-05-27 20:29:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2111 ms
[2024-05-27 20:29:58] [INFO ] Computed and/alt/rep : 109/757/109 causal constraints (skipped 18528 transitions) in 2172 ms.
[2024-05-27 20:29:59] [INFO ] Added : 0 causal constraints over 0 iterations in 3130 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, 27343/27343 transitions.
Applied a total of 0 rules in 133 ms. Remains 496 /496 variables (removed 0) and now considering 27343/27343 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 496/496 places, 27343/27343 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 496/496 places, 27343/27343 transitions.
Applied a total of 0 rules in 139 ms. Remains 496 /496 variables (removed 0) and now considering 27343/27343 (removed 0) transitions.
[2024-05-27 20:30:00] [INFO ] Flow matrix only has 18640 transitions (discarded 8703 similar events)
[2024-05-27 20:30:00] [INFO ] Invariant cache hit.
[2024-05-27 20:30:01] [INFO ] Implicit Places using invariants in 955 ms returned []
Implicit Place search using SMT only with invariants took 956 ms to find 0 implicit places.
[2024-05-27 20:30:01] [INFO ] Flow matrix only has 18640 transitions (discarded 8703 similar events)
[2024-05-27 20:30:01] [INFO ] Invariant cache hit.
[2024-05-27 20:30:09] [INFO ] Dead Transitions using invariants and state equation in 7966 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9070 ms. Remains : 496/496 places, 27343/27343 transitions.
Ending property specific reduction for RERS2020-PT-pb103-UpperBounds-00 in 59028 ms.
Starting property specific reduction for RERS2020-PT-pb103-UpperBounds-05
Normalized transition count is 18727 out of 27456 initially.
// Phase 1: matrix 18727 rows 497 cols
[2024-05-27 20:30:09] [INFO ] Computed 8 invariants in 55 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
[2024-05-27 20:30:09] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2024-05-27 20:30:09] [INFO ] Computed 8 invariants in 50 ms
[2024-05-27 20:30:09] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2024-05-27 20:30:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:30:12] [INFO ] [Real]Absence check using state equation in 2722 ms returned sat
[2024-05-27 20:30:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:30:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-05-27 20:30:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:30:16] [INFO ] [Nat]Absence check using state equation in 3474 ms returned sat
[2024-05-27 20:30:16] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2024-05-27 20:30:17] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 20:30:17] [INFO ] [Nat]Added 1374 Read/Feed constraints in 1351 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 136 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27320/27320 transitions.
Reduce places removed 1 places and 131 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 496 transition count 27189
Applied a total of 1 rules in 114 ms. Remains 496 /497 variables (removed 1) and now considering 27189/27320 (removed 131) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 496/497 places, 27189/27320 transitions.
Normalized transition count is 18708 out of 27189 initially.
// Phase 1: matrix 18708 rows 496 cols
[2024-05-27 20:30:17] [INFO ] Computed 8 invariants in 79 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 21108 ms. (steps per millisecond=47 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2738 ms. (steps per millisecond=365 ) properties (out of 1) seen :0
[2024-05-27 20:30:41] [INFO ] Flow matrix only has 18708 transitions (discarded 8481 similar events)
// Phase 1: matrix 18708 rows 496 cols
[2024-05-27 20:30:41] [INFO ] Computed 8 invariants in 57 ms
[2024-05-27 20:30:41] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2024-05-27 20:30:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:30:44] [INFO ] [Real]Absence check using state equation in 2705 ms returned sat
[2024-05-27 20:30:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:30:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-05-27 20:30:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:30:47] [INFO ] [Nat]Absence check using state equation in 2674 ms returned sat
[2024-05-27 20:30:47] [INFO ] State equation strengthened by 1371 read => feed constraints.
[2024-05-27 20:30:51] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 20:30:51] [INFO ] [Nat]Added 1371 Read/Feed constraints in 4047 ms returned sat
[2024-05-27 20:30:54] [INFO ] Deduced a trap composed of 47 places in 2067 ms of which 1 ms to minimize.
[2024-05-27 20:30:56] [INFO ] Deduced a trap composed of 92 places in 2075 ms of which 3 ms to minimize.
[2024-05-27 20:30:59] [INFO ] Deduced a trap composed of 58 places in 2027 ms of which 1 ms to minimize.
[2024-05-27 20:31:01] [INFO ] Deduced a trap composed of 49 places in 1953 ms of which 1 ms to minimize.
[2024-05-27 20:31:04] [INFO ] Deduced a trap composed of 87 places in 2026 ms of which 2 ms to minimize.
[2024-05-27 20:31:07] [INFO ] Deduced a trap composed of 55 places in 1939 ms of which 1 ms to minimize.
[2024-05-27 20:31:09] [INFO ] Deduced a trap composed of 93 places in 2053 ms of which 1 ms to minimize.
[2024-05-27 20:31:12] [INFO ] Deduced a trap composed of 111 places in 2103 ms of which 1 ms to minimize.
[2024-05-27 20:31:14] [INFO ] Deduced a trap composed of 60 places in 2047 ms of which 1 ms to minimize.
[2024-05-27 20:31:17] [INFO ] Deduced a trap composed of 157 places in 2081 ms of which 0 ms to minimize.
[2024-05-27 20:31:20] [INFO ] Deduced a trap composed of 72 places in 2317 ms of which 3 ms to minimize.
[2024-05-27 20:31:23] [INFO ] Trap strengthening (SAT) tested/added 11/11 trap constraints in 31662 ms
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, 27189/27189 transitions.
Applied a total of 0 rules in 155 ms. Remains 496 /496 variables (removed 0) and now considering 27189/27189 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 496/496 places, 27189/27189 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 496/496 places, 27189/27189 transitions.
Applied a total of 0 rules in 154 ms. Remains 496 /496 variables (removed 0) and now considering 27189/27189 (removed 0) transitions.
[2024-05-27 20:31:23] [INFO ] Flow matrix only has 18708 transitions (discarded 8481 similar events)
[2024-05-27 20:31:23] [INFO ] Invariant cache hit.
[2024-05-27 20:31:24] [INFO ] Implicit Places using invariants in 943 ms returned []
Implicit Place search using SMT only with invariants took 944 ms to find 0 implicit places.
[2024-05-27 20:31:24] [INFO ] Flow matrix only has 18708 transitions (discarded 8481 similar events)
[2024-05-27 20:31:24] [INFO ] Invariant cache hit.
[2024-05-27 20:31:32] [INFO ] Dead Transitions using invariants and state equation in 7905 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9010 ms. Remains : 496/496 places, 27189/27189 transitions.
Ending property specific reduction for RERS2020-PT-pb103-UpperBounds-05 in 83628 ms.
Starting property specific reduction for RERS2020-PT-pb103-UpperBounds-15
Normalized transition count is 18727 out of 27456 initially.
// Phase 1: matrix 18727 rows 497 cols
[2024-05-27 20:31:32] [INFO ] Computed 8 invariants in 56 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
[2024-05-27 20:31:33] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2024-05-27 20:31:33] [INFO ] Computed 8 invariants in 57 ms
[2024-05-27 20:31:33] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-05-27 20:31:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:31:36] [INFO ] [Real]Absence check using state equation in 3150 ms returned sat
[2024-05-27 20:31:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:31:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-05-27 20:31:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:31:39] [INFO ] [Nat]Absence check using state equation in 2680 ms returned sat
[2024-05-27 20:31:39] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2024-05-27 20:31:41] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 20:31:41] [INFO ] [Nat]Added 1374 Read/Feed constraints in 2165 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 83 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27373/27373 transitions.
Applied a total of 0 rules in 101 ms. Remains 497 /497 variables (removed 0) and now considering 27373/27373 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 497/497 places, 27373/27373 transitions.
Normalized transition count is 18664 out of 27373 initially.
// Phase 1: matrix 18664 rows 497 cols
[2024-05-27 20:31:42] [INFO ] Computed 8 invariants in 54 ms
Incomplete random walk after 1000000 steps, including 4 resets, run finished after 24361 ms. (steps per millisecond=41 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3073 ms. (steps per millisecond=325 ) properties (out of 1) seen :0
[2024-05-27 20:32:09] [INFO ] Flow matrix only has 18664 transitions (discarded 8709 similar events)
// Phase 1: matrix 18664 rows 497 cols
[2024-05-27 20:32:09] [INFO ] Computed 8 invariants in 55 ms
[2024-05-27 20:32:09] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-05-27 20:32:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:32:12] [INFO ] [Real]Absence check using state equation in 2879 ms returned sat
[2024-05-27 20:32:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:32:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-05-27 20:32:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:32:15] [INFO ] [Nat]Absence check using state equation in 2872 ms returned sat
[2024-05-27 20:32:15] [INFO ] State equation strengthened by 1372 read => feed constraints.
[2024-05-27 20:32:19] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 20:32:21] [INFO ] [Nat]Added 1372 Read/Feed constraints in 6047 ms returned sat
[2024-05-27 20:32:23] [INFO ] Deduced a trap composed of 60 places in 1155 ms of which 0 ms to minimize.
[2024-05-27 20:32:25] [INFO ] Deduced a trap composed of 92 places in 1416 ms of which 2 ms to minimize.
[2024-05-27 20:32:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3699 ms
[2024-05-27 20:32:27] [INFO ] Computed and/alt/rep : 109/757/109 causal constraints (skipped 18552 transitions) in 2202 ms.
[2024-05-27 20:32:29] [INFO ] Added : 1 causal constraints over 1 iterations in 4035 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, 27373/27373 transitions.
Applied a total of 0 rules in 96 ms. Remains 497 /497 variables (removed 0) and now considering 27373/27373 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 497/497 places, 27373/27373 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27373/27373 transitions.
Applied a total of 0 rules in 97 ms. Remains 497 /497 variables (removed 0) and now considering 27373/27373 (removed 0) transitions.
[2024-05-27 20:32:30] [INFO ] Flow matrix only has 18664 transitions (discarded 8709 similar events)
[2024-05-27 20:32:30] [INFO ] Invariant cache hit.
[2024-05-27 20:32:31] [INFO ] Implicit Places using invariants in 949 ms returned []
Implicit Place search using SMT only with invariants took 950 ms to find 0 implicit places.
[2024-05-27 20:32:31] [INFO ] Flow matrix only has 18664 transitions (discarded 8709 similar events)
[2024-05-27 20:32:31] [INFO ] Invariant cache hit.
[2024-05-27 20:32:39] [INFO ] Dead Transitions using invariants and state equation in 8047 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9099 ms. Remains : 497/497 places, 27373/27373 transitions.
Ending property specific reduction for RERS2020-PT-pb103-UpperBounds-15 in 66569 ms.
[2024-05-27 20:32:40] [INFO ] Flatten gal took : 1095 ms
[2024-05-27 20:32:41] [INFO ] Applying decomposition
[2024-05-27 20:32:42] [INFO ] Flatten gal took : 792 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16362404507251523332.txt' '-o' '/tmp/graph16362404507251523332.bin' '-w' '/tmp/graph16362404507251523332.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16362404507251523332.bin' '-l' '-1' '-v' '-w' '/tmp/graph16362404507251523332.weights' '-q' '0' '-e' '0.001'
[2024-05-27 20:32:44] [INFO ] Decomposing Gal with order
[2024-05-27 20:32:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 20:32:46] [INFO ] Removed a total of 62786 redundant transitions.
[2024-05-27 20:32:46] [INFO ] Flatten gal took : 1665 ms
[2024-05-27 20:32:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 1975 labels/synchronizations in 726 ms.
[2024-05-27 20:32:47] [INFO ] Time to serialize gal into /tmp/UpperBounds14527901776533490090.gal : 95 ms
[2024-05-27 20:32:47] [INFO ] Time to serialize properties into /tmp/UpperBounds17992025508037345424.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds14527901776533490090.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17992025508037345424.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...285
Loading property file /tmp/UpperBounds17992025508037345424.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,6.46398e+07,211.629,2508932,1197,946,1.97325e+06,2.6732e+06,14189,3.4353e+06,1879,1.14274e+07,0
Total reachable state count : 64639839
Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property RERS2020-PT-pb103-UpperBounds-00 :0 <= i0.u5.ps362 <= 0
FORMULA RERS2020-PT-pb103-UpperBounds-00 0 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
RERS2020-PT-pb103-UpperBounds-00,0,211.92,2508932,1,0,1.97325e+06,2.6732e+06,14722,3.4353e+06,1935,1.14274e+07,2594
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property RERS2020-PT-pb103-UpperBounds-05 :0 <= i4.i1.u93.ps495 <= 0
FORMULA RERS2020-PT-pb103-UpperBounds-05 0 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
RERS2020-PT-pb103-UpperBounds-05,0,211.922,2508932,1,0,1.97325e+06,2.6732e+06,14750,3.4353e+06,1944,1.14274e+07,2628
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property RERS2020-PT-pb103-UpperBounds-15 :0 <= i3.i0.u110.ps213 <= 0
FORMULA RERS2020-PT-pb103-UpperBounds-15 0 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
RERS2020-PT-pb103-UpperBounds-15,0,211.923,2508932,1,0,1.97325e+06,2.6732e+06,14777,3.4353e+06,1944,1.14274e+07,2655
Total runtime 696602 ms.
BK_STOP 1716842180552
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RERS2020-PT-pb103"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
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 r329-tall-171662361800216"
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 ;