About the Execution of Marcie+red for DES-PT-40a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9984.327 | 3600000.00 | 3660805.00 | 9145.70 | 1 1 1 1 1 1 1 1 ? ? ? 1 ? 1 1 ? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r106-tall-167814482800461.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 DES-PT-40a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482800461
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.4K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 15:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 15:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 26 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 15:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 83K Mar 5 18:22 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 DES-PT-40a-UpperBounds-00
FORMULA_NAME DES-PT-40a-UpperBounds-01
FORMULA_NAME DES-PT-40a-UpperBounds-02
FORMULA_NAME DES-PT-40a-UpperBounds-03
FORMULA_NAME DES-PT-40a-UpperBounds-04
FORMULA_NAME DES-PT-40a-UpperBounds-05
FORMULA_NAME DES-PT-40a-UpperBounds-06
FORMULA_NAME DES-PT-40a-UpperBounds-07
FORMULA_NAME DES-PT-40a-UpperBounds-08
FORMULA_NAME DES-PT-40a-UpperBounds-09
FORMULA_NAME DES-PT-40a-UpperBounds-10
FORMULA_NAME DES-PT-40a-UpperBounds-11
FORMULA_NAME DES-PT-40a-UpperBounds-12
FORMULA_NAME DES-PT-40a-UpperBounds-13
FORMULA_NAME DES-PT-40a-UpperBounds-14
FORMULA_NAME DES-PT-40a-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678399200124
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=DES-PT-40a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 22:00:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 22:00:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 22:00:01] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2023-03-09 22:00:01] [INFO ] Transformed 274 places.
[2023-03-09 22:00:01] [INFO ] Transformed 231 transitions.
[2023-03-09 22:00:01] [INFO ] Found NUPN structural information;
[2023-03-09 22:00:01] [INFO ] Parsed PT model containing 274 places and 231 transitions and 1116 arcs in 116 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
// Phase 1: matrix 217 rows 274 cols
[2023-03-09 22:00:01] [INFO ] Computed 59 place invariants in 35 ms
Incomplete random walk after 10000 steps, including 223 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 16) seen :7
FORMULA DES-PT-40a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 44 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
[2023-03-09 22:00:02] [INFO ] Invariant cache hit.
[2023-03-09 22:00:02] [INFO ] [Real]Absence check using 34 positive place invariants in 13 ms returned sat
[2023-03-09 22:00:02] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-09 22:00:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:02] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2023-03-09 22:00:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 22:00:02] [INFO ] [Nat]Absence check using 34 positive place invariants in 10 ms returned sat
[2023-03-09 22:00:02] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 95 ms returned sat
[2023-03-09 22:00:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:02] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2023-03-09 22:00:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:00:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 113 ms returned sat
[2023-03-09 22:00:03] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 28 ms.
[2023-03-09 22:00:03] [INFO ] Added : 84 causal constraints over 17 iterations in 553 ms. Result :sat
Minimization took 342 ms.
[2023-03-09 22:00:04] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-09 22:00:04] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-09 22:00:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:04] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2023-03-09 22:00:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 22:00:04] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-09 22:00:04] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 77 ms returned sat
[2023-03-09 22:00:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:04] [INFO ] [Nat]Absence check using state equation in 694 ms returned sat
[2023-03-09 22:00:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 17 ms returned sat
[2023-03-09 22:00:05] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 9 ms to minimize.
[2023-03-09 22:00:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-03-09 22:00:05] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 21 ms.
[2023-03-09 22:00:05] [INFO ] Added : 97 causal constraints over 20 iterations in 738 ms. Result :sat
Minimization took 87 ms.
[2023-03-09 22:00:06] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-09 22:00:06] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-09 22:00:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:06] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2023-03-09 22:00:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 22:00:06] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-09 22:00:06] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 39 ms returned sat
[2023-03-09 22:00:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:06] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2023-03-09 22:00:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 342 ms returned sat
[2023-03-09 22:00:06] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2023-03-09 22:00:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 433 ms
[2023-03-09 22:00:07] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 23 ms.
[2023-03-09 22:00:07] [INFO ] Added : 69 causal constraints over 14 iterations in 600 ms. Result :sat
Minimization took 130 ms.
[2023-03-09 22:00:08] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-09 22:00:08] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 22:00:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:08] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2023-03-09 22:00:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 22:00:08] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-09 22:00:08] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-09 22:00:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:08] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2023-03-09 22:00:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 94 ms returned sat
[2023-03-09 22:00:08] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2023-03-09 22:00:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-09 22:00:08] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 15 ms.
[2023-03-09 22:00:09] [INFO ] Added : 171 causal constraints over 35 iterations in 866 ms. Result :sat
Minimization took 99 ms.
[2023-03-09 22:00:09] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-09 22:00:09] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 22:00:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:09] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2023-03-09 22:00:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 22:00:09] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-09 22:00:10] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 151 ms returned sat
[2023-03-09 22:00:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:10] [INFO ] [Nat]Absence check using state equation in 360 ms returned sat
[2023-03-09 22:00:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 106 ms returned sat
[2023-03-09 22:00:10] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 2 ms to minimize.
[2023-03-09 22:00:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-09 22:00:10] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 15 ms.
[2023-03-09 22:00:11] [INFO ] Added : 108 causal constraints over 22 iterations in 553 ms. Result :sat
Minimization took 105 ms.
[2023-03-09 22:00:11] [INFO ] [Real]Absence check using 34 positive place invariants in 6 ms returned sat
[2023-03-09 22:00:11] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 22:00:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:11] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2023-03-09 22:00:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 22:00:11] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-09 22:00:11] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 153 ms returned sat
[2023-03-09 22:00:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:13] [INFO ] [Nat]Absence check using state equation in 1363 ms returned sat
[2023-03-09 22:00:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2023-03-09 22:00:13] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 23 ms.
[2023-03-09 22:00:13] [INFO ] Added : 148 causal constraints over 30 iterations in 731 ms. Result :sat
Minimization took 130 ms.
[2023-03-09 22:00:14] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-09 22:00:14] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 22:00:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:14] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2023-03-09 22:00:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 22:00:14] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-09 22:00:14] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 76 ms returned sat
[2023-03-09 22:00:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:14] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2023-03-09 22:00:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 142 ms returned sat
[2023-03-09 22:00:14] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2023-03-09 22:00:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-09 22:00:14] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 14 ms.
[2023-03-09 22:00:15] [INFO ] Added : 68 causal constraints over 14 iterations in 405 ms. Result :sat
Minimization took 86 ms.
[2023-03-09 22:00:15] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-09 22:00:15] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 22:00:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:15] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2023-03-09 22:00:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 22:00:15] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-09 22:00:15] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 95 ms returned sat
[2023-03-09 22:00:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:17] [INFO ] [Nat]Absence check using state equation in 1313 ms returned sat
[2023-03-09 22:00:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 394 ms returned sat
[2023-03-09 22:00:17] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 18 ms.
[2023-03-09 22:00:18] [INFO ] Added : 149 causal constraints over 30 iterations in 831 ms. Result :sat
Minimization took 206 ms.
[2023-03-09 22:00:18] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-09 22:00:18] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 22:00:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:18] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2023-03-09 22:00:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 22:00:18] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-09 22:00:18] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 84 ms returned sat
[2023-03-09 22:00:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:19] [INFO ] [Nat]Absence check using state equation in 927 ms returned sat
[2023-03-09 22:00:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-09 22:00:19] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 13 ms.
[2023-03-09 22:00:20] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2023-03-09 22:00:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-03-09 22:00:20] [INFO ] Added : 153 causal constraints over 31 iterations in 947 ms. Result :sat
Minimization took 121 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA DES-PT-40a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 217/217 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 274 transition count 215
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 273 transition count 214
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 273 transition count 214
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 273 transition count 214
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 272 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 271 transition count 213
Applied a total of 12 rules in 102 ms. Remains 271 /274 variables (removed 3) and now considering 213/217 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 271/274 places, 213/217 transitions.
// Phase 1: matrix 213 rows 271 cols
[2023-03-09 22:00:22] [INFO ] Computed 60 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 13743 resets, run finished after 2030 ms. (steps per millisecond=492 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2251 resets, run finished after 938 ms. (steps per millisecond=1066 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2306 resets, run finished after 937 ms. (steps per millisecond=1067 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2300 resets, run finished after 925 ms. (steps per millisecond=1081 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2266 resets, run finished after 916 ms. (steps per millisecond=1091 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2235 resets, run finished after 907 ms. (steps per millisecond=1102 ) properties (out of 5) seen :0
[2023-03-09 22:00:29] [INFO ] Invariant cache hit.
[2023-03-09 22:00:29] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 22:00:29] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-09 22:00:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:29] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2023-03-09 22:00:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 22:00:29] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 22:00:29] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 22:00:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:29] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2023-03-09 22:00:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 22:00:29] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2023-03-09 22:00:29] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 13 ms.
[2023-03-09 22:00:30] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 0 ms to minimize.
[2023-03-09 22:00:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-09 22:00:30] [INFO ] Added : 196 causal constraints over 41 iterations in 709 ms. Result :sat
Minimization took 73 ms.
[2023-03-09 22:00:30] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 22:00:30] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 22:00:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:30] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2023-03-09 22:00:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 22:00:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 22:00:30] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 56 ms returned sat
[2023-03-09 22:00:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:31] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2023-03-09 22:00:31] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2023-03-09 22:00:31] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2023-03-09 22:00:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-09 22:00:31] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 11 ms.
[2023-03-09 22:00:31] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2023-03-09 22:00:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-03-09 22:00:31] [INFO ] Added : 85 causal constraints over 17 iterations in 375 ms. Result :sat
Minimization took 83 ms.
[2023-03-09 22:00:31] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 22:00:31] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-09 22:00:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:31] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2023-03-09 22:00:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 22:00:31] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 22:00:31] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 44 ms returned sat
[2023-03-09 22:00:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:32] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2023-03-09 22:00:32] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2023-03-09 22:00:32] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 13 ms.
[2023-03-09 22:00:32] [INFO ] Added : 155 causal constraints over 31 iterations in 528 ms. Result :sat
Minimization took 89 ms.
[2023-03-09 22:00:32] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 22:00:32] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 22:00:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:32] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2023-03-09 22:00:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 22:00:32] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 22:00:32] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 58 ms returned sat
[2023-03-09 22:00:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:33] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2023-03-09 22:00:33] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2023-03-09 22:00:33] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 0 ms to minimize.
[2023-03-09 22:00:33] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2023-03-09 22:00:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 141 ms
[2023-03-09 22:00:33] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 9 ms.
[2023-03-09 22:00:33] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 0 ms to minimize.
[2023-03-09 22:00:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-09 22:00:34] [INFO ] Added : 179 causal constraints over 37 iterations in 681 ms. Result :sat
Minimization took 71 ms.
[2023-03-09 22:00:34] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 22:00:34] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-09 22:00:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:34] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2023-03-09 22:00:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 22:00:34] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 22:00:34] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 97 ms returned sat
[2023-03-09 22:00:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:34] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2023-03-09 22:00:34] [INFO ] [Nat]Added 2 Read/Feed constraints in 16 ms returned sat
[2023-03-09 22:00:34] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 17 ms.
[2023-03-09 22:00:35] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2023-03-09 22:00:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-09 22:00:35] [INFO ] Added : 183 causal constraints over 37 iterations in 697 ms. Result :sat
Minimization took 77 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 13 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 15 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-09 22:00:37] [INFO ] Invariant cache hit.
[2023-03-09 22:00:37] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-09 22:00:37] [INFO ] Invariant cache hit.
[2023-03-09 22:00:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 22:00:37] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
[2023-03-09 22:00:37] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-09 22:00:37] [INFO ] Invariant cache hit.
[2023-03-09 22:00:37] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 740 ms. Remains : 271/271 places, 213/213 transitions.
Starting property specific reduction for DES-PT-40a-UpperBounds-08
[2023-03-09 22:00:37] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-09 22:00:38] [INFO ] Invariant cache hit.
[2023-03-09 22:00:38] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 22:00:38] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 22:00:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:38] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2023-03-09 22:00:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 22:00:38] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 22:00:38] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 22:00:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:38] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2023-03-09 22:00:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 22:00:38] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-09 22:00:38] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 13 ms.
[2023-03-09 22:00:38] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2023-03-09 22:00:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2023-03-09 22:00:39] [INFO ] Added : 196 causal constraints over 41 iterations in 720 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 9 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 271/271 places, 213/213 transitions.
[2023-03-09 22:00:39] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13674 resets, run finished after 1922 ms. (steps per millisecond=520 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2276 resets, run finished after 920 ms. (steps per millisecond=1086 ) properties (out of 1) seen :0
[2023-03-09 22:00:42] [INFO ] Invariant cache hit.
[2023-03-09 22:00:42] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 22:00:42] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-09 22:00:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:42] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2023-03-09 22:00:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 22:00:42] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 22:00:42] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 22:00:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:42] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2023-03-09 22:00:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 22:00:42] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2023-03-09 22:00:42] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 19 ms.
[2023-03-09 22:00:43] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 0 ms to minimize.
[2023-03-09 22:00:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-09 22:00:43] [INFO ] Added : 196 causal constraints over 41 iterations in 787 ms. Result :sat
Minimization took 76 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 10 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 12 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-09 22:00:43] [INFO ] Invariant cache hit.
[2023-03-09 22:00:44] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-09 22:00:44] [INFO ] Invariant cache hit.
[2023-03-09 22:00:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 22:00:44] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
[2023-03-09 22:00:44] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-09 22:00:44] [INFO ] Invariant cache hit.
[2023-03-09 22:00:44] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 727 ms. Remains : 271/271 places, 213/213 transitions.
Ending property specific reduction for DES-PT-40a-UpperBounds-08 in 6688 ms.
Starting property specific reduction for DES-PT-40a-UpperBounds-09
[2023-03-09 22:00:44] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 143 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
[2023-03-09 22:00:44] [INFO ] Invariant cache hit.
[2023-03-09 22:00:44] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 22:00:44] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-09 22:00:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:44] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2023-03-09 22:00:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 22:00:44] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 22:00:44] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 58 ms returned sat
[2023-03-09 22:00:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:45] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2023-03-09 22:00:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 22:00:45] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2023-03-09 22:00:45] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2023-03-09 22:00:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-03-09 22:00:45] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 11 ms.
[2023-03-09 22:00:45] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2023-03-09 22:00:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-03-09 22:00:45] [INFO ] Added : 85 causal constraints over 17 iterations in 376 ms. Result :sat
Minimization took 84 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 9 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 271/271 places, 213/213 transitions.
[2023-03-09 22:00:46] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13634 resets, run finished after 1912 ms. (steps per millisecond=523 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2316 resets, run finished after 938 ms. (steps per millisecond=1066 ) properties (out of 1) seen :0
[2023-03-09 22:00:48] [INFO ] Invariant cache hit.
[2023-03-09 22:00:48] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 22:00:48] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 22:00:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:49] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2023-03-09 22:00:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 22:00:49] [INFO ] [Nat]Absence check using 35 positive place invariants in 8 ms returned sat
[2023-03-09 22:00:49] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 57 ms returned sat
[2023-03-09 22:00:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:49] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2023-03-09 22:00:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 22:00:49] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2023-03-09 22:00:49] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2023-03-09 22:00:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-03-09 22:00:49] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 12 ms.
[2023-03-09 22:00:49] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2023-03-09 22:00:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-03-09 22:00:49] [INFO ] Added : 85 causal constraints over 17 iterations in 393 ms. Result :sat
Minimization took 84 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 8 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 8 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-09 22:00:50] [INFO ] Invariant cache hit.
[2023-03-09 22:00:50] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-09 22:00:50] [INFO ] Invariant cache hit.
[2023-03-09 22:00:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 22:00:50] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2023-03-09 22:00:50] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-09 22:00:50] [INFO ] Invariant cache hit.
[2023-03-09 22:00:50] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 681 ms. Remains : 271/271 places, 213/213 transitions.
Ending property specific reduction for DES-PT-40a-UpperBounds-09 in 6262 ms.
Starting property specific reduction for DES-PT-40a-UpperBounds-10
[2023-03-09 22:00:50] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 131 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
[2023-03-09 22:00:50] [INFO ] Invariant cache hit.
[2023-03-09 22:00:51] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 22:00:51] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 22:00:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:51] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2023-03-09 22:00:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 22:00:51] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 22:00:51] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 44 ms returned sat
[2023-03-09 22:00:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:51] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2023-03-09 22:00:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 22:00:51] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2023-03-09 22:00:51] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 12 ms.
[2023-03-09 22:00:51] [INFO ] Added : 155 causal constraints over 31 iterations in 513 ms. Result :sat
Minimization took 89 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 9 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 271/271 places, 213/213 transitions.
[2023-03-09 22:00:52] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13754 resets, run finished after 1857 ms. (steps per millisecond=538 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2227 resets, run finished after 911 ms. (steps per millisecond=1097 ) properties (out of 1) seen :0
[2023-03-09 22:00:55] [INFO ] Invariant cache hit.
[2023-03-09 22:00:55] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 22:00:55] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 22:00:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:55] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2023-03-09 22:00:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 22:00:55] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 22:00:55] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 44 ms returned sat
[2023-03-09 22:00:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:55] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2023-03-09 22:00:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 22:00:55] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2023-03-09 22:00:55] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 13 ms.
[2023-03-09 22:00:56] [INFO ] Added : 155 causal constraints over 31 iterations in 512 ms. Result :sat
Minimization took 93 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 7 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 7 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-09 22:00:56] [INFO ] Invariant cache hit.
[2023-03-09 22:00:56] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-09 22:00:56] [INFO ] Invariant cache hit.
[2023-03-09 22:00:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 22:00:56] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
[2023-03-09 22:00:57] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-09 22:00:57] [INFO ] Invariant cache hit.
[2023-03-09 22:00:57] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 710 ms. Remains : 271/271 places, 213/213 transitions.
Ending property specific reduction for DES-PT-40a-UpperBounds-10 in 6202 ms.
Starting property specific reduction for DES-PT-40a-UpperBounds-12
[2023-03-09 22:00:57] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 132 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-09 22:00:57] [INFO ] Invariant cache hit.
[2023-03-09 22:00:57] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 22:00:57] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 22:00:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:57] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2023-03-09 22:00:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 22:00:57] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 22:00:57] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 60 ms returned sat
[2023-03-09 22:00:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 22:00:57] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2023-03-09 22:00:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 22:00:57] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2023-03-09 22:00:57] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2023-03-09 22:00:57] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2023-03-09 22:00:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 147 ms
[2023-03-09 22:00:57] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 10 ms.
[2023-03-09 22:00:58] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 0 ms to minimize.
[2023-03-09 22:00:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-09 22:00:58] [INFO ] Added : 179 causal constraints over 37 iterations in 691 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 6 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 271/271 places, 213/213 transitions.
[2023-03-09 22:00:58] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13720 resets, run finished after 1868 ms. (steps per millisecond=535 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2283 resets, run finished after 905 ms. (steps per millisecond=1104 ) properties (out of 1) seen :0
[2023-03-09 22:01:01] [INFO ] Invariant cache hit.
[2023-03-09 22:01:01] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 22:01:01] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 22:01:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 22:01:01] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2023-03-09 22:01:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 22:01:01] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 22:01:01] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 58 ms returned sat
[2023-03-09 22:01:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 22:01:02] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2023-03-09 22:01:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 22:01:02] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2023-03-09 22:01:02] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2023-03-09 22:01:02] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 0 ms to minimize.
[2023-03-09 22:01:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 138 ms
[2023-03-09 22:01:02] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 11 ms.
[2023-03-09 22:01:02] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 0 ms to minimize.
[2023-03-09 22:01:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-03-09 22:01:03] [INFO ] Added : 179 causal constraints over 37 iterations in 657 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 6 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 18 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-09 22:01:03] [INFO ] Invariant cache hit.
[2023-03-09 22:01:03] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-09 22:01:03] [INFO ] Invariant cache hit.
[2023-03-09 22:01:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 22:01:03] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
[2023-03-09 22:01:03] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 22:01:03] [INFO ] Invariant cache hit.
[2023-03-09 22:01:04] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 680 ms. Remains : 271/271 places, 213/213 transitions.
Ending property specific reduction for DES-PT-40a-UpperBounds-12 in 6978 ms.
Starting property specific reduction for DES-PT-40a-UpperBounds-15
[2023-03-09 22:01:04] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 139 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
[2023-03-09 22:01:04] [INFO ] Invariant cache hit.
[2023-03-09 22:01:04] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 22:01:04] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 22:01:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 22:01:04] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2023-03-09 22:01:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 22:01:04] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 22:01:04] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 106 ms returned sat
[2023-03-09 22:01:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 22:01:04] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2023-03-09 22:01:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 22:01:04] [INFO ] [Nat]Added 2 Read/Feed constraints in 17 ms returned sat
[2023-03-09 22:01:04] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 13 ms.
[2023-03-09 22:01:05] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 0 ms to minimize.
[2023-03-09 22:01:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-09 22:01:05] [INFO ] Added : 183 causal constraints over 37 iterations in 722 ms. Result :sat
Minimization took 79 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 7 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 271/271 places, 213/213 transitions.
[2023-03-09 22:01:05] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13676 resets, run finished after 1904 ms. (steps per millisecond=525 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2254 resets, run finished after 919 ms. (steps per millisecond=1088 ) properties (out of 1) seen :0
[2023-03-09 22:01:08] [INFO ] Invariant cache hit.
[2023-03-09 22:01:08] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 22:01:08] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-09 22:01:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 22:01:08] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2023-03-09 22:01:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 22:01:08] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 22:01:09] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 93 ms returned sat
[2023-03-09 22:01:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 22:01:09] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2023-03-09 22:01:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 22:01:09] [INFO ] [Nat]Added 2 Read/Feed constraints in 16 ms returned sat
[2023-03-09 22:01:09] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 11 ms.
[2023-03-09 22:01:09] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 0 ms to minimize.
[2023-03-09 22:01:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-09 22:01:10] [INFO ] Added : 183 causal constraints over 37 iterations in 707 ms. Result :sat
Minimization took 77 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 6 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 6 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-09 22:01:10] [INFO ] Invariant cache hit.
[2023-03-09 22:01:10] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-09 22:01:10] [INFO ] Invariant cache hit.
[2023-03-09 22:01:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 22:01:11] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
[2023-03-09 22:01:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 22:01:11] [INFO ] Invariant cache hit.
[2023-03-09 22:01:11] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 686 ms. Remains : 271/271 places, 213/213 transitions.
Ending property specific reduction for DES-PT-40a-UpperBounds-15 in 7036 ms.
[2023-03-09 22:01:11] [INFO ] Flatten gal took : 53 ms
[2023-03-09 22:01:11] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-09 22:01:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 271 places, 213 transitions and 1029 arcs took 2 ms.
Total runtime 69855 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: DES_PT_40a
(NrP: 271 NrTr: 213 NrArc: 1029)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.006sec
net check time: 0m 0.000sec
init dd package: 0m 2.982sec
before gc: list nodes free: 571395
after gc: idd nodes used:1242017, unused:62757983; list nodes free:285838253
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6163740 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16098640 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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 0.000sec
876220 1304446 1136262 1138439
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="DES-PT-40a"
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 DES-PT-40a, 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 r106-tall-167814482800461"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-40a.tgz
mv DES-PT-40a 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 ;