About the Execution of Marcie+red for ASLink-PT-08a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
6441.819 | 3600000.00 | 3697386.00 | 155.20 | 1 1 1 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.r010-oct2-167813598600125.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ASLink-PT-08a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813598600125
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.6K Feb 26 13:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 13:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 13:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 13:09 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:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 13:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 13:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 13:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 26 13:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:30 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 757K 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 ASLink-PT-08a-UpperBounds-00
FORMULA_NAME ASLink-PT-08a-UpperBounds-01
FORMULA_NAME ASLink-PT-08a-UpperBounds-02
FORMULA_NAME ASLink-PT-08a-UpperBounds-03
FORMULA_NAME ASLink-PT-08a-UpperBounds-04
FORMULA_NAME ASLink-PT-08a-UpperBounds-05
FORMULA_NAME ASLink-PT-08a-UpperBounds-06
FORMULA_NAME ASLink-PT-08a-UpperBounds-07
FORMULA_NAME ASLink-PT-08a-UpperBounds-08
FORMULA_NAME ASLink-PT-08a-UpperBounds-09
FORMULA_NAME ASLink-PT-08a-UpperBounds-10
FORMULA_NAME ASLink-PT-08a-UpperBounds-11
FORMULA_NAME ASLink-PT-08a-UpperBounds-12
FORMULA_NAME ASLink-PT-08a-UpperBounds-13
FORMULA_NAME ASLink-PT-08a-UpperBounds-14
FORMULA_NAME ASLink-PT-08a-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678669630204
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=ASLink-PT-08a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 01:07:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 01:07:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 01:07:12] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2023-03-13 01:07:12] [INFO ] Transformed 1796 places.
[2023-03-13 01:07:12] [INFO ] Transformed 2646 transitions.
[2023-03-13 01:07:12] [INFO ] Found NUPN structural information;
[2023-03-13 01:07:12] [INFO ] Parsed PT model containing 1796 places and 2646 transitions and 9934 arcs in 232 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
// Phase 1: matrix 2618 rows 1796 cols
[2023-03-13 01:07:13] [INFO ] Computed 346 place invariants in 142 ms
Incomplete random walk after 10000 steps, including 43 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 16) seen :8
FORMULA ASLink-PT-08a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :1
FORMULA ASLink-PT-08a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
[2023-03-13 01:07:13] [INFO ] Invariant cache hit.
[2023-03-13 01:07:14] [INFO ] [Real]Absence check using 85 positive place invariants in 45 ms returned sat
[2023-03-13 01:07:14] [INFO ] [Real]Absence check using 85 positive and 261 generalized place invariants in 119 ms returned sat
[2023-03-13 01:07:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 01:07:15] [INFO ] [Real]Absence check using state equation in 1298 ms returned sat
[2023-03-13 01:07:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 01:07:16] [INFO ] [Nat]Absence check using 85 positive place invariants in 39 ms returned sat
[2023-03-13 01:07:16] [INFO ] [Nat]Absence check using 85 positive and 261 generalized place invariants in 96 ms returned sat
[2023-03-13 01:07:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 01:07:20] [INFO ] [Nat]Absence check using state equation in 4529 ms returned unknown
[2023-03-13 01:07:21] [INFO ] [Real]Absence check using 85 positive place invariants in 60 ms returned sat
[2023-03-13 01:07:21] [INFO ] [Real]Absence check using 85 positive and 261 generalized place invariants in 69 ms returned sat
[2023-03-13 01:07:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 01:07:22] [INFO ] [Real]Absence check using state equation in 1403 ms returned sat
[2023-03-13 01:07:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 01:07:23] [INFO ] [Nat]Absence check using 85 positive place invariants in 33 ms returned sat
[2023-03-13 01:07:23] [INFO ] [Nat]Absence check using 85 positive and 261 generalized place invariants in 58 ms returned sat
[2023-03-13 01:07:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 01:07:27] [INFO ] [Nat]Absence check using state equation in 4624 ms returned unknown
[2023-03-13 01:07:28] [INFO ] [Real]Absence check using 85 positive place invariants in 33 ms returned sat
[2023-03-13 01:07:28] [INFO ] [Real]Absence check using 85 positive and 261 generalized place invariants in 82 ms returned sat
[2023-03-13 01:07:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 01:07:29] [INFO ] [Real]Absence check using state equation in 1752 ms returned sat
[2023-03-13 01:07:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 01:07:30] [INFO ] [Nat]Absence check using 85 positive place invariants in 91 ms returned sat
[2023-03-13 01:07:30] [INFO ] [Nat]Absence check using 85 positive and 261 generalized place invariants in 60 ms returned sat
[2023-03-13 01:07:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 01:07:35] [INFO ] [Nat]Absence check using state equation in 4567 ms returned unknown
[2023-03-13 01:07:35] [INFO ] [Real]Absence check using 85 positive place invariants in 60 ms returned sat
[2023-03-13 01:07:35] [INFO ] [Real]Absence check using 85 positive and 261 generalized place invariants in 91 ms returned sat
[2023-03-13 01:07:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 01:07:37] [INFO ] [Real]Absence check using state equation in 1587 ms returned sat
[2023-03-13 01:07:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 01:07:37] [INFO ] [Nat]Absence check using 85 positive place invariants in 77 ms returned sat
[2023-03-13 01:07:37] [INFO ] [Nat]Absence check using 85 positive and 261 generalized place invariants in 128 ms returned sat
[2023-03-13 01:07:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 01:07:42] [INFO ] [Nat]Absence check using state equation in 4523 ms returned unknown
[2023-03-13 01:07:42] [INFO ] [Real]Absence check using 85 positive place invariants in 42 ms returned sat
[2023-03-13 01:07:42] [INFO ] [Real]Absence check using 85 positive and 261 generalized place invariants in 115 ms returned sat
[2023-03-13 01:07:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 01:07:44] [INFO ] [Real]Absence check using state equation in 1704 ms returned sat
[2023-03-13 01:07:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 01:07:44] [INFO ] [Nat]Absence check using 85 positive place invariants in 54 ms returned sat
[2023-03-13 01:07:45] [INFO ] [Nat]Absence check using 85 positive and 261 generalized place invariants in 95 ms returned sat
[2023-03-13 01:07:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 01:07:49] [INFO ] [Nat]Absence check using state equation in 4534 ms returned unknown
[2023-03-13 01:07:49] [INFO ] [Real]Absence check using 85 positive place invariants in 34 ms returned sat
[2023-03-13 01:07:49] [INFO ] [Real]Absence check using 85 positive and 261 generalized place invariants in 74 ms returned sat
[2023-03-13 01:07:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 01:07:51] [INFO ] [Real]Absence check using state equation in 1378 ms returned sat
[2023-03-13 01:07:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 01:07:51] [INFO ] [Nat]Absence check using 85 positive place invariants in 48 ms returned sat
[2023-03-13 01:07:51] [INFO ] [Nat]Absence check using 85 positive and 261 generalized place invariants in 160 ms returned sat
[2023-03-13 01:07:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 01:07:56] [INFO ] [Nat]Absence check using state equation in 4542 ms returned unknown
[2023-03-13 01:07:56] [INFO ] [Real]Absence check using 85 positive place invariants in 32 ms returned sat
[2023-03-13 01:07:57] [INFO ] [Real]Absence check using 85 positive and 261 generalized place invariants in 135 ms returned sat
[2023-03-13 01:07:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 01:07:58] [INFO ] [Real]Absence check using state equation in 1357 ms returned sat
[2023-03-13 01:07:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 01:07:58] [INFO ] [Nat]Absence check using 85 positive place invariants in 55 ms returned sat
[2023-03-13 01:07:59] [INFO ] [Nat]Absence check using 85 positive and 261 generalized place invariants in 158 ms returned sat
[2023-03-13 01:07:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 01:08:03] [INFO ] [Nat]Absence check using state equation in 4512 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Support contains 7 out of 1796 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1796/1796 places, 2618/2618 transitions.
Ensure Unique test removed 32 places
Discarding 16 places :
Implicit places reduction removed 16 places
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 1748 transition count 2456
Reduce places removed 162 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 164 rules applied. Total rules applied 374 place count 1586 transition count 2454
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 376 place count 1584 transition count 2454
Performed 168 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 168 Pre rules applied. Total rules applied 376 place count 1584 transition count 2286
Deduced a syphon composed of 168 places in 8 ms
Ensure Unique test removed 66 places
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 778 place count 1350 transition count 2286
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 779 place count 1350 transition count 2285
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 780 place count 1349 transition count 2285
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 791 place count 1338 transition count 2226
Ensure Unique test removed 1 places
Iterating global reduction 5 with 12 rules applied. Total rules applied 803 place count 1337 transition count 2226
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 6 rules applied. Total rules applied 809 place count 1336 transition count 2221
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 812 place count 1333 transition count 2221
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 813 place count 1332 transition count 2213
Iterating global reduction 7 with 1 rules applied. Total rules applied 814 place count 1332 transition count 2213
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 815 place count 1331 transition count 2205
Iterating global reduction 7 with 1 rules applied. Total rules applied 816 place count 1331 transition count 2205
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 817 place count 1330 transition count 2197
Iterating global reduction 7 with 1 rules applied. Total rules applied 818 place count 1330 transition count 2197
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 819 place count 1329 transition count 2189
Iterating global reduction 7 with 1 rules applied. Total rules applied 820 place count 1329 transition count 2189
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 821 place count 1328 transition count 2181
Iterating global reduction 7 with 1 rules applied. Total rules applied 822 place count 1328 transition count 2181
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 823 place count 1327 transition count 2173
Iterating global reduction 7 with 1 rules applied. Total rules applied 824 place count 1327 transition count 2173
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 825 place count 1326 transition count 2165
Iterating global reduction 7 with 1 rules applied. Total rules applied 826 place count 1326 transition count 2165
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 827 place count 1325 transition count 2157
Iterating global reduction 7 with 1 rules applied. Total rules applied 828 place count 1325 transition count 2157
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 829 place count 1324 transition count 2149
Iterating global reduction 7 with 1 rules applied. Total rules applied 830 place count 1324 transition count 2149
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 831 place count 1323 transition count 2141
Iterating global reduction 7 with 1 rules applied. Total rules applied 832 place count 1323 transition count 2141
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 833 place count 1322 transition count 2133
Iterating global reduction 7 with 1 rules applied. Total rules applied 834 place count 1322 transition count 2133
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 835 place count 1321 transition count 2125
Iterating global reduction 7 with 1 rules applied. Total rules applied 836 place count 1321 transition count 2125
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 837 place count 1320 transition count 2117
Iterating global reduction 7 with 1 rules applied. Total rules applied 838 place count 1320 transition count 2117
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 839 place count 1319 transition count 2109
Iterating global reduction 7 with 1 rules applied. Total rules applied 840 place count 1319 transition count 2109
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 841 place count 1318 transition count 2101
Iterating global reduction 7 with 1 rules applied. Total rules applied 842 place count 1318 transition count 2101
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 843 place count 1317 transition count 2093
Iterating global reduction 7 with 1 rules applied. Total rules applied 844 place count 1317 transition count 2093
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 3 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 7 with 112 rules applied. Total rules applied 956 place count 1261 transition count 2037
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 964 place count 1261 transition count 2029
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 972 place count 1253 transition count 2029
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 980 place count 1253 transition count 2029
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 981 place count 1252 transition count 2028
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 997 place count 1236 transition count 2028
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 30 Pre rules applied. Total rules applied 997 place count 1236 transition count 1998
Deduced a syphon composed of 30 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 9 with 61 rules applied. Total rules applied 1058 place count 1205 transition count 1998
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 9 with 9 rules applied. Total rules applied 1067 place count 1196 transition count 1998
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 1067 place count 1196 transition count 1997
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1069 place count 1195 transition count 1997
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 10 with 18 rules applied. Total rules applied 1087 place count 1186 transition count 1988
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 1095 place count 1178 transition count 1980
Iterating global reduction 10 with 8 rules applied. Total rules applied 1103 place count 1178 transition count 1980
Free-agglomeration rule applied 8 times.
Iterating global reduction 10 with 8 rules applied. Total rules applied 1111 place count 1178 transition count 1972
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 1119 place count 1170 transition count 1972
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 11 with 8 rules applied. Total rules applied 1127 place count 1170 transition count 1972
Applied a total of 1127 rules in 2047 ms. Remains 1170 /1796 variables (removed 626) and now considering 1972/2618 (removed 646) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2048 ms. Remains : 1170/1796 places, 1972/2618 transitions.
// Phase 1: matrix 1972 rows 1170 cols
[2023-03-13 01:08:05] [INFO ] Computed 204 place invariants in 77 ms
Incomplete random walk after 1000000 steps, including 10382 resets, run finished after 4048 ms. (steps per millisecond=247 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1282 resets, run finished after 1583 ms. (steps per millisecond=631 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1277 resets, run finished after 1670 ms. (steps per millisecond=598 ) properties (out of 7) seen :1
FORMULA ASLink-PT-08a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 1283 resets, run finished after 1763 ms. (steps per millisecond=567 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1275 resets, run finished after 1491 ms. (steps per millisecond=670 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1283 resets, run finished after 1616 ms. (steps per millisecond=618 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1285 resets, run finished after 1530 ms. (steps per millisecond=653 ) properties (out of 6) seen :0
[2023-03-13 01:08:19] [INFO ] Invariant cache hit.
[2023-03-13 01:08:19] [INFO ] [Real]Absence check using 52 positive place invariants in 14 ms returned sat
[2023-03-13 01:08:19] [INFO ] [Real]Absence check using 52 positive and 152 generalized place invariants in 100 ms returned sat
[2023-03-13 01:08:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 01:08:20] [INFO ] [Real]Absence check using state equation in 694 ms returned sat
[2023-03-13 01:08:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 01:08:20] [INFO ] [Nat]Absence check using 52 positive place invariants in 21 ms returned sat
[2023-03-13 01:08:20] [INFO ] [Nat]Absence check using 52 positive and 152 generalized place invariants in 58 ms returned sat
[2023-03-13 01:08:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 01:08:21] [INFO ] [Nat]Absence check using state equation in 931 ms returned sat
[2023-03-13 01:08:22] [INFO ] Computed and/alt/rep : 784/2959/784 causal constraints (skipped 1147 transitions) in 142 ms.
[2023-03-13 01:08:41] [INFO ] Added : 604 causal constraints over 121 iterations in 19190 ms. Result :sat
Minimization took 819 ms.
[2023-03-13 01:08:42] [INFO ] [Real]Absence check using 52 positive place invariants in 19 ms returned sat
[2023-03-13 01:08:42] [INFO ] [Real]Absence check using 52 positive and 152 generalized place invariants in 84 ms returned sat
[2023-03-13 01:08:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 01:08:42] [INFO ] [Real]Absence check using state equation in 667 ms returned sat
[2023-03-13 01:08:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 01:08:43] [INFO ] [Nat]Absence check using 52 positive place invariants in 14 ms returned sat
[2023-03-13 01:08:43] [INFO ] [Nat]Absence check using 52 positive and 152 generalized place invariants in 89 ms returned sat
[2023-03-13 01:08:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 01:08:43] [INFO ] [Nat]Absence check using state equation in 668 ms returned sat
[2023-03-13 01:08:44] [INFO ] Computed and/alt/rep : 784/2959/784 causal constraints (skipped 1147 transitions) in 168 ms.
[2023-03-13 01:09:02] [INFO ] Added : 620 causal constraints over 124 iterations in 18967 ms. Result :sat
Minimization took 625 ms.
[2023-03-13 01:09:03] [INFO ] [Real]Absence check using 52 positive place invariants in 24 ms returned sat
[2023-03-13 01:09:03] [INFO ] [Real]Absence check using 52 positive and 152 generalized place invariants in 77 ms returned sat
[2023-03-13 01:09:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 01:09:04] [INFO ] [Real]Absence check using state equation in 799 ms returned sat
[2023-03-13 01:09:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 01:09:05] [INFO ] [Nat]Absence check using 52 positive place invariants in 15 ms returned sat
[2023-03-13 01:09:05] [INFO ] [Nat]Absence check using 52 positive and 152 generalized place invariants in 70 ms returned sat
[2023-03-13 01:09:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 01:09:06] [INFO ] [Nat]Absence check using state equation in 1046 ms returned sat
[2023-03-13 01:09:06] [INFO ] Computed and/alt/rep : 784/2959/784 causal constraints (skipped 1147 transitions) in 149 ms.
[2023-03-13 01:09:23] [INFO ] Added : 569 causal constraints over 114 iterations in 17496 ms. Result :sat
Minimization took 586 ms.
[2023-03-13 01:09:24] [INFO ] [Real]Absence check using 52 positive place invariants in 34 ms returned sat
[2023-03-13 01:09:24] [INFO ] [Real]Absence check using 52 positive and 152 generalized place invariants in 53 ms returned sat
[2023-03-13 01:09:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 01:09:25] [INFO ] [Real]Absence check using state equation in 682 ms returned sat
[2023-03-13 01:09:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 01:09:25] [INFO ] [Nat]Absence check using 52 positive place invariants in 40 ms returned sat
[2023-03-13 01:09:25] [INFO ] [Nat]Absence check using 52 positive and 152 generalized place invariants in 41 ms returned sat
[2023-03-13 01:09:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 01:09:27] [INFO ] [Nat]Absence check using state equation in 1469 ms returned sat
[2023-03-13 01:09:27] [INFO ] Deduced a trap composed of 182 places in 266 ms of which 4 ms to minimize.
[2023-03-13 01:09:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 396 ms
[2023-03-13 01:09:27] [INFO ] Computed and/alt/rep : 784/2959/784 causal constraints (skipped 1147 transitions) in 142 ms.
[2023-03-13 01:09:44] [INFO ] Added : 598 causal constraints over 120 iterations in 16730 ms. Result :sat
Minimization took 3002 ms.
[2023-03-13 01:09:47] [INFO ] [Real]Absence check using 52 positive place invariants in 59 ms returned sat
[2023-03-13 01:09:47] [INFO ] [Real]Absence check using 52 positive and 152 generalized place invariants in 40 ms returned sat
[2023-03-13 01:09:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 01:09:48] [INFO ] [Real]Absence check using state equation in 670 ms returned sat
[2023-03-13 01:09:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 01:09:48] [INFO ] [Nat]Absence check using 52 positive place invariants in 15 ms returned sat
[2023-03-13 01:09:48] [INFO ] [Nat]Absence check using 52 positive and 152 generalized place invariants in 65 ms returned sat
[2023-03-13 01:09:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 01:09:49] [INFO ] [Nat]Absence check using state equation in 725 ms returned sat
[2023-03-13 01:09:49] [INFO ] Computed and/alt/rep : 784/2959/784 causal constraints (skipped 1147 transitions) in 124 ms.
[2023-03-13 01:10:04] [INFO ] Added : 588 causal constraints over 118 iterations in 15041 ms. Result :sat
Minimization took 638 ms.
[2023-03-13 01:10:05] [INFO ] [Real]Absence check using 52 positive place invariants in 13 ms returned sat
[2023-03-13 01:10:05] [INFO ] [Real]Absence check using 52 positive and 152 generalized place invariants in 33 ms returned sat
[2023-03-13 01:10:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 01:10:06] [INFO ] [Real]Absence check using state equation in 705 ms returned sat
[2023-03-13 01:10:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 01:10:06] [INFO ] [Nat]Absence check using 52 positive place invariants in 17 ms returned sat
[2023-03-13 01:10:06] [INFO ] [Nat]Absence check using 52 positive and 152 generalized place invariants in 47 ms returned sat
[2023-03-13 01:10:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 01:10:07] [INFO ] [Nat]Absence check using state equation in 1079 ms returned sat
[2023-03-13 01:10:07] [INFO ] Computed and/alt/rep : 784/2959/784 causal constraints (skipped 1147 transitions) in 101 ms.
[2023-03-13 01:10:20] [INFO ] Added : 549 causal constraints over 110 iterations in 12769 ms. Result :sat
Minimization took 653 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Support contains 6 out of 1170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1170/1170 places, 1972/1972 transitions.
Applied a total of 0 rules in 37 ms. Remains 1170 /1170 variables (removed 0) and now considering 1972/1972 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 1170/1170 places, 1972/1972 transitions.
[2023-03-13 01:10:24] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 10393 resets, run finished after 3407 ms. (steps per millisecond=293 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1289 resets, run finished after 1442 ms. (steps per millisecond=693 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1277 resets, run finished after 1481 ms. (steps per millisecond=675 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1280 resets, run finished after 1487 ms. (steps per millisecond=672 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1272 resets, run finished after 1488 ms. (steps per millisecond=672 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1280 resets, run finished after 1488 ms. (steps per millisecond=672 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1267 resets, run finished after 1484 ms. (steps per millisecond=673 ) properties (out of 6) seen :0
[2023-03-13 01:10:37] [INFO ] Invariant cache hit.
[2023-03-13 01:10:37] [INFO ] [Real]Absence check using 52 positive place invariants in 14 ms returned sat
[2023-03-13 01:10:37] [INFO ] [Real]Absence check using 52 positive and 152 generalized place invariants in 44 ms returned sat
[2023-03-13 01:10:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 01:10:38] [INFO ] [Real]Absence check using state equation in 646 ms returned sat
[2023-03-13 01:10:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 01:10:38] [INFO ] [Nat]Absence check using 52 positive place invariants in 28 ms returned sat
[2023-03-13 01:10:38] [INFO ] [Nat]Absence check using 52 positive and 152 generalized place invariants in 64 ms returned sat
[2023-03-13 01:10:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 01:10:39] [INFO ] [Nat]Absence check using state equation in 917 ms returned sat
[2023-03-13 01:10:39] [INFO ] Computed and/alt/rep : 784/2959/784 causal constraints (skipped 1147 transitions) in 123 ms.
[2023-03-13 01:10:54] [INFO ] Added : 604 causal constraints over 121 iterations in 15552 ms. Result :sat
Minimization took 762 ms.
[2023-03-13 01:10:55] [INFO ] [Real]Absence check using 52 positive place invariants in 20 ms returned sat
[2023-03-13 01:10:55] [INFO ] [Real]Absence check using 52 positive and 152 generalized place invariants in 32 ms returned sat
[2023-03-13 01:10:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 01:10:56] [INFO ] [Real]Absence check using state equation in 742 ms returned sat
[2023-03-13 01:10:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 01:10:56] [INFO ] [Nat]Absence check using 52 positive place invariants in 20 ms returned sat
[2023-03-13 01:10:56] [INFO ] [Nat]Absence check using 52 positive and 152 generalized place invariants in 64 ms returned sat
[2023-03-13 01:10:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 01:10:57] [INFO ] [Nat]Absence check using state equation in 919 ms returned sat
[2023-03-13 01:10:58] [INFO ] Computed and/alt/rep : 784/2959/784 causal constraints (skipped 1147 transitions) in 89 ms.
[2023-03-13 01:11:14] [INFO ] Added : 620 causal constraints over 124 iterations in 16803 ms. Result :sat
Minimization took 583 ms.
[2023-03-13 01:11:15] [INFO ] [Real]Absence check using 52 positive place invariants in 14 ms returned sat
[2023-03-13 01:11:15] [INFO ] [Real]Absence check using 52 positive and 152 generalized place invariants in 36 ms returned sat
[2023-03-13 01:11:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 01:11:16] [INFO ] [Real]Absence check using state equation in 711 ms returned sat
[2023-03-13 01:11:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 01:11:16] [INFO ] [Nat]Absence check using 52 positive place invariants in 14 ms returned sat
[2023-03-13 01:11:16] [INFO ] [Nat]Absence check using 52 positive and 152 generalized place invariants in 34 ms returned sat
[2023-03-13 01:11:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 01:11:17] [INFO ] [Nat]Absence check using state equation in 1041 ms returned sat
[2023-03-13 01:11:17] [INFO ] Computed and/alt/rep : 784/2959/784 causal constraints (skipped 1147 transitions) in 118 ms.
[2023-03-13 01:11:32] [INFO ] Added : 569 causal constraints over 114 iterations in 15058 ms. Result :sat
Minimization took 561 ms.
[2023-03-13 01:11:33] [INFO ] [Real]Absence check using 52 positive place invariants in 28 ms returned sat
[2023-03-13 01:11:33] [INFO ] [Real]Absence check using 52 positive and 152 generalized place invariants in 39 ms returned sat
[2023-03-13 01:11:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 01:11:34] [INFO ] [Real]Absence check using state equation in 681 ms returned sat
[2023-03-13 01:11:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 01:11:34] [INFO ] [Nat]Absence check using 52 positive place invariants in 14 ms returned sat
[2023-03-13 01:11:34] [INFO ] [Nat]Absence check using 52 positive and 152 generalized place invariants in 55 ms returned sat
[2023-03-13 01:11:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 01:11:35] [INFO ] [Nat]Absence check using state equation in 1005 ms returned sat
[2023-03-13 01:11:36] [INFO ] Deduced a trap composed of 182 places in 307 ms of which 1 ms to minimize.
[2023-03-13 01:11:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 437 ms
[2023-03-13 01:11:36] [INFO ] Computed and/alt/rep : 784/2959/784 causal constraints (skipped 1147 transitions) in 102 ms.
[2023-03-13 01:11:53] [INFO ] Added : 598 causal constraints over 120 iterations in 17139 ms. Result :sat
Minimization took 3013 ms.
[2023-03-13 01:11:56] [INFO ] [Real]Absence check using 52 positive place invariants in 14 ms returned sat
[2023-03-13 01:11:56] [INFO ] [Real]Absence check using 52 positive and 152 generalized place invariants in 61 ms returned sat
[2023-03-13 01:11:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 01:11:57] [INFO ] [Real]Absence check using state equation in 807 ms returned sat
[2023-03-13 01:11:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 01:11:57] [INFO ] [Nat]Absence check using 52 positive place invariants in 14 ms returned sat
[2023-03-13 01:11:57] [INFO ] [Nat]Absence check using 52 positive and 152 generalized place invariants in 51 ms returned sat
[2023-03-13 01:11:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 01:11:58] [INFO ] [Nat]Absence check using state equation in 682 ms returned sat
[2023-03-13 01:11:58] [INFO ] Computed and/alt/rep : 784/2959/784 causal constraints (skipped 1147 transitions) in 105 ms.
[2023-03-13 01:12:13] [INFO ] Added : 588 causal constraints over 118 iterations in 15124 ms. Result :sat
Minimization took 627 ms.
[2023-03-13 01:12:14] [INFO ] [Real]Absence check using 52 positive place invariants in 15 ms returned sat
[2023-03-13 01:12:14] [INFO ] [Real]Absence check using 52 positive and 152 generalized place invariants in 38 ms returned sat
[2023-03-13 01:12:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 01:12:15] [INFO ] [Real]Absence check using state equation in 760 ms returned sat
[2023-03-13 01:12:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 01:12:15] [INFO ] [Nat]Absence check using 52 positive place invariants in 15 ms returned sat
[2023-03-13 01:12:15] [INFO ] [Nat]Absence check using 52 positive and 152 generalized place invariants in 52 ms returned sat
[2023-03-13 01:12:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 01:12:16] [INFO ] [Nat]Absence check using state equation in 1004 ms returned sat
[2023-03-13 01:12:16] [INFO ] Computed and/alt/rep : 784/2959/784 causal constraints (skipped 1147 transitions) in 116 ms.
[2023-03-13 01:12:30] [INFO ] Added : 549 causal constraints over 110 iterations in 13579 ms. Result :sat
Minimization took 645 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Support contains 6 out of 1170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1170/1170 places, 1972/1972 transitions.
Applied a total of 0 rules in 34 ms. Remains 1170 /1170 variables (removed 0) and now considering 1972/1972 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 1170/1170 places, 1972/1972 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1170/1170 places, 1972/1972 transitions.
Applied a total of 0 rules in 34 ms. Remains 1170 /1170 variables (removed 0) and now considering 1972/1972 (removed 0) transitions.
[2023-03-13 01:12:34] [INFO ] Invariant cache hit.
[2023-03-13 01:12:35] [INFO ] Implicit Places using invariants in 848 ms returned [0, 18, 19, 30, 48, 66, 103, 137, 141, 150, 151, 152, 170, 188, 262, 263, 274, 275, 276, 294, 312, 381, 385, 386, 397, 398, 399, 417, 435, 504, 508, 509, 520, 521, 522, 540, 558, 627, 631, 632, 643, 644, 645, 663, 681, 755, 756, 767, 768, 769, 787, 805, 874, 878, 879, 890, 891, 892, 910, 928, 997, 1001, 1002, 1005, 1016, 1017, 1018, 1036, 1038, 1041, 1059, 1060, 1061, 1062, 1074, 1080, 1086, 1092, 1098, 1104, 1110, 1116, 1122, 1128, 1134]
Discarding 85 places :
Implicit Place search using SMT only with invariants took 856 ms to find 85 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1085/1170 places, 1972/1972 transitions.
Drop transitions removed 146 transitions
Trivial Post-agglo rules discarded 146 transitions
Performed 146 trivial Post agglomeration. Transition count delta: 146
Iterating post reduction 0 with 146 rules applied. Total rules applied 146 place count 1085 transition count 1826
Reduce places removed 146 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 147 rules applied. Total rules applied 293 place count 939 transition count 1825
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 294 place count 938 transition count 1825
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 294 place count 938 transition count 1787
Deduced a syphon composed of 38 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 77 rules applied. Total rules applied 371 place count 899 transition count 1787
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 383 place count 895 transition count 1779
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 391 place count 887 transition count 1779
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 406 place count 872 transition count 1764
Iterating global reduction 5 with 15 rules applied. Total rules applied 421 place count 872 transition count 1764
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 424 place count 872 transition count 1761
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 424 place count 872 transition count 1760
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 426 place count 871 transition count 1760
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 429 place count 868 transition count 1757
Iterating global reduction 6 with 3 rules applied. Total rules applied 432 place count 868 transition count 1757
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 433 place count 867 transition count 1756
Iterating global reduction 6 with 1 rules applied. Total rules applied 434 place count 867 transition count 1756
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 435 place count 866 transition count 1755
Iterating global reduction 6 with 1 rules applied. Total rules applied 436 place count 866 transition count 1755
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 2 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 6 with 136 rules applied. Total rules applied 572 place count 798 transition count 1687
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 579 place count 798 transition count 1680
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 585 place count 792 transition count 1674
Iterating global reduction 7 with 6 rules applied. Total rules applied 591 place count 792 transition count 1674
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 597 place count 792 transition count 1668
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 598 place count 792 transition count 1667
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 8 with 18 rules applied. Total rules applied 616 place count 792 transition count 1649
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 635 place count 773 transition count 1649
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 9 with 25 rules applied. Total rules applied 660 place count 773 transition count 1649
Applied a total of 660 rules in 479 ms. Remains 773 /1085 variables (removed 312) and now considering 1649/1972 (removed 323) transitions.
// Phase 1: matrix 1649 rows 773 cols
[2023-03-13 01:12:36] [INFO ] Computed 113 place invariants in 46 ms
[2023-03-13 01:12:36] [INFO ] Implicit Places using invariants in 613 ms returned [72, 91, 97, 100, 102, 105, 106, 176, 182, 185, 187, 196, 197, 249, 266, 272, 275, 277, 282, 283, 335, 352, 358, 361, 363, 368, 369, 421, 438, 444, 447, 449, 454, 455, 524, 530, 533, 535, 538, 543, 544, 596, 613, 619, 622, 624, 629, 630, 682, 699, 705, 708, 710]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 629 ms to find 53 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 720/1170 places, 1649/1972 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 695 transition count 1624
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 695 transition count 1624
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 58 place count 687 transition count 1616
Iterating global reduction 0 with 8 rules applied. Total rules applied 66 place count 687 transition count 1616
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 94 place count 673 transition count 1602
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 95 place count 673 transition count 1601
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 119 place count 673 transition count 1577
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 143 place count 649 transition count 1577
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 149 place count 649 transition count 1571
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 155 place count 643 transition count 1571
Applied a total of 155 rules in 166 ms. Remains 643 /720 variables (removed 77) and now considering 1571/1649 (removed 78) transitions.
// Phase 1: matrix 1571 rows 643 cols
[2023-03-13 01:12:36] [INFO ] Computed 60 place invariants in 11 ms
[2023-03-13 01:12:37] [INFO ] Implicit Places using invariants in 359 ms returned []
[2023-03-13 01:12:37] [INFO ] Invariant cache hit.
[2023-03-13 01:12:38] [INFO ] Implicit Places using invariants and state equation in 1577 ms returned []
Implicit Place search using SMT with State Equation took 1953 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 643/1170 places, 1571/1972 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4120 ms. Remains : 643/1170 places, 1571/1972 transitions.
Successfully produced net in file /tmp/petri1000_12359183324736437354.dot
Successfully produced net in file /tmp/petri1001_16549445409443324697.dot
Successfully produced net in file /tmp/petri1002_1384458068644880215.dot
Successfully produced net in file /tmp/petri1003_7471744338870733279.dot
Successfully produced net in file /tmp/petri1004_8713431133576880239.dot
Successfully produced net in file /tmp/petri1005_2038634134455815560.dot
Successfully produced net in file /tmp/petri1006_6038066573929897551.dot
Successfully produced net in file /tmp/petri1007_421501810138602206.dot
Drop transitions removed 8 transitions
Dominated transitions for bounds rules discarded 8 transitions
// Phase 1: matrix 1563 rows 643 cols
[2023-03-13 01:12:39] [INFO ] Computed 60 place invariants in 26 ms
Incomplete random walk after 1000000 steps, including 16907 resets, run finished after 2323 ms. (steps per millisecond=430 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2939 resets, run finished after 801 ms. (steps per millisecond=1248 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2913 resets, run finished after 791 ms. (steps per millisecond=1264 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2955 resets, run finished after 839 ms. (steps per millisecond=1191 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2914 resets, run finished after 799 ms. (steps per millisecond=1251 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2945 resets, run finished after 755 ms. (steps per millisecond=1324 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2915 resets, run finished after 752 ms. (steps per millisecond=1329 ) properties (out of 6) seen :0
[2023-03-13 01:12:46] [INFO ] Invariant cache hit.
[2023-03-13 01:12:46] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-13 01:12:46] [INFO ] [Real]Absence check using 13 positive and 47 generalized place invariants in 17 ms returned sat
[2023-03-13 01:12:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 01:12:46] [INFO ] [Real]Absence check using state equation in 479 ms returned sat
[2023-03-13 01:12:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 01:12:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-13 01:12:47] [INFO ] [Nat]Absence check using 13 positive and 47 generalized place invariants in 26 ms returned sat
[2023-03-13 01:12:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 01:12:47] [INFO ] [Nat]Absence check using state equation in 833 ms returned sat
[2023-03-13 01:12:48] [INFO ] Computed and/alt/rep : 367/1604/367 causal constraints (skipped 1158 transitions) in 97 ms.
[2023-03-13 01:12:50] [INFO ] Added : 75 causal constraints over 15 iterations in 2704 ms. Result :sat
Minimization took 289 ms.
[2023-03-13 01:12:51] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-13 01:12:51] [INFO ] [Real]Absence check using 13 positive and 47 generalized place invariants in 94 ms returned sat
[2023-03-13 01:12:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 01:12:51] [INFO ] [Real]Absence check using state equation in 659 ms returned sat
[2023-03-13 01:12:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 01:12:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-13 01:12:52] [INFO ] [Nat]Absence check using 13 positive and 47 generalized place invariants in 24 ms returned sat
[2023-03-13 01:12:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 01:12:52] [INFO ] [Nat]Absence check using state equation in 677 ms returned sat
[2023-03-13 01:12:53] [INFO ] Computed and/alt/rep : 367/1604/367 causal constraints (skipped 1158 transitions) in 173 ms.
[2023-03-13 01:12:54] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 2 ms to minimize.
[2023-03-13 01:12:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2023-03-13 01:12:55] [INFO ] Added : 66 causal constraints over 14 iterations in 2179 ms. Result :sat
Minimization took 417 ms.
[2023-03-13 01:12:55] [INFO ] [Real]Absence check using 13 positive place invariants in 49 ms returned sat
[2023-03-13 01:12:55] [INFO ] [Real]Absence check using 13 positive and 47 generalized place invariants in 27 ms returned sat
[2023-03-13 01:12:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 01:12:56] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2023-03-13 01:12:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 01:12:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-13 01:12:56] [INFO ] [Nat]Absence check using 13 positive and 47 generalized place invariants in 49 ms returned sat
[2023-03-13 01:12:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 01:12:57] [INFO ] [Nat]Absence check using state equation in 784 ms returned sat
[2023-03-13 01:12:57] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 1 ms to minimize.
[2023-03-13 01:12:57] [INFO ] Deduced a trap composed of 65 places in 136 ms of which 13 ms to minimize.
[2023-03-13 01:12:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 404 ms
[2023-03-13 01:12:57] [INFO ] Computed and/alt/rep : 367/1604/367 causal constraints (skipped 1158 transitions) in 95 ms.
[2023-03-13 01:12:59] [INFO ] Added : 67 causal constraints over 14 iterations in 1972 ms. Result :sat
Minimization took 338 ms.
[2023-03-13 01:13:00] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-13 01:13:00] [INFO ] [Real]Absence check using 13 positive and 47 generalized place invariants in 32 ms returned sat
[2023-03-13 01:13:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 01:13:00] [INFO ] [Real]Absence check using state equation in 473 ms returned sat
[2023-03-13 01:13:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 01:13:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 31 ms returned sat
[2023-03-13 01:13:00] [INFO ] [Nat]Absence check using 13 positive and 47 generalized place invariants in 20 ms returned sat
[2023-03-13 01:13:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 01:13:01] [INFO ] [Nat]Absence check using state equation in 960 ms returned sat
[2023-03-13 01:13:02] [INFO ] Computed and/alt/rep : 367/1604/367 causal constraints (skipped 1158 transitions) in 83 ms.
[2023-03-13 01:13:02] [INFO ] Added : 23 causal constraints over 5 iterations in 772 ms. Result :sat
Minimization took 342 ms.
[2023-03-13 01:13:03] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-13 01:13:03] [INFO ] [Real]Absence check using 13 positive and 47 generalized place invariants in 46 ms returned sat
[2023-03-13 01:13:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 01:13:03] [INFO ] [Real]Absence check using state equation in 503 ms returned sat
[2023-03-13 01:13:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 01:13:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-13 01:13:04] [INFO ] [Nat]Absence check using 13 positive and 47 generalized place invariants in 29 ms returned sat
[2023-03-13 01:13:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 01:13:04] [INFO ] [Nat]Absence check using state equation in 510 ms returned sat
[2023-03-13 01:13:04] [INFO ] Computed and/alt/rep : 367/1604/367 causal constraints (skipped 1158 transitions) in 93 ms.
[2023-03-13 01:13:05] [INFO ] Added : 60 causal constraints over 12 iterations in 1377 ms. Result :sat
Minimization took 181 ms.
[2023-03-13 01:13:06] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-13 01:13:06] [INFO ] [Real]Absence check using 13 positive and 47 generalized place invariants in 23 ms returned sat
[2023-03-13 01:13:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 01:13:06] [INFO ] [Real]Absence check using state equation in 488 ms returned sat
[2023-03-13 01:13:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 01:13:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-13 01:13:07] [INFO ] [Nat]Absence check using 13 positive and 47 generalized place invariants in 16 ms returned sat
[2023-03-13 01:13:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 01:13:07] [INFO ] [Nat]Absence check using state equation in 766 ms returned sat
[2023-03-13 01:13:08] [INFO ] Computed and/alt/rep : 367/1604/367 causal constraints (skipped 1158 transitions) in 94 ms.
[2023-03-13 01:13:09] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 1 ms to minimize.
[2023-03-13 01:13:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 319 ms
[2023-03-13 01:13:10] [INFO ] Added : 72 causal constraints over 16 iterations in 2377 ms. Result :sat
Minimization took 386 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
FORMULA ASLink-PT-08a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-08a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-08a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-08a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 643 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 643/643 places, 1563/1563 transitions.
Graph (complete) has 3858 edges and 643 vertex of which 635 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 635 transition count 1561
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 633 transition count 1561
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 633 transition count 1560
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 631 transition count 1560
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 630 transition count 1559
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 630 transition count 1559
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 630 transition count 1558
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 19 place count 630 transition count 1558
Applied a total of 19 rules in 90 ms. Remains 630 /643 variables (removed 13) and now considering 1558/1563 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 630/643 places, 1558/1563 transitions.
// Phase 1: matrix 1558 rows 630 cols
[2023-03-13 01:13:12] [INFO ] Computed 59 place invariants in 25 ms
Incomplete random walk after 1000000 steps, including 16887 resets, run finished after 2104 ms. (steps per millisecond=475 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2947 resets, run finished after 779 ms. (steps per millisecond=1283 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2966 resets, run finished after 751 ms. (steps per millisecond=1331 ) properties (out of 2) seen :0
[2023-03-13 01:13:16] [INFO ] Invariant cache hit.
[2023-03-13 01:13:16] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-13 01:13:16] [INFO ] [Real]Absence check using 15 positive and 44 generalized place invariants in 10 ms returned sat
[2023-03-13 01:13:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 01:13:16] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2023-03-13 01:13:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 01:13:16] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-13 01:13:16] [INFO ] [Nat]Absence check using 15 positive and 44 generalized place invariants in 10 ms returned sat
[2023-03-13 01:13:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 01:13:17] [INFO ] [Nat]Absence check using state equation in 761 ms returned sat
[2023-03-13 01:13:17] [INFO ] Computed and/alt/rep : 369/1643/369 causal constraints (skipped 1151 transitions) in 87 ms.
[2023-03-13 01:13:19] [INFO ] Added : 86 causal constraints over 18 iterations in 2121 ms. Result :sat
Minimization took 483 ms.
[2023-03-13 01:13:20] [INFO ] [Real]Absence check using 15 positive place invariants in 35 ms returned sat
[2023-03-13 01:13:20] [INFO ] [Real]Absence check using 15 positive and 44 generalized place invariants in 11 ms returned sat
[2023-03-13 01:13:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 01:13:20] [INFO ] [Real]Absence check using state equation in 399 ms returned sat
[2023-03-13 01:13:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 01:13:20] [INFO ] [Nat]Absence check using 15 positive place invariants in 63 ms returned sat
[2023-03-13 01:13:21] [INFO ] [Nat]Absence check using 15 positive and 44 generalized place invariants in 58 ms returned sat
[2023-03-13 01:13:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 01:13:21] [INFO ] [Nat]Absence check using state equation in 724 ms returned sat
[2023-03-13 01:13:21] [INFO ] Computed and/alt/rep : 369/1643/369 causal constraints (skipped 1151 transitions) in 96 ms.
[2023-03-13 01:13:23] [INFO ] Deduced a trap composed of 60 places in 129 ms of which 3 ms to minimize.
[2023-03-13 01:13:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2023-03-13 01:13:23] [INFO ] Added : 83 causal constraints over 17 iterations in 2092 ms. Result :sat
Minimization took 329 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 1558/1558 transitions.
Applied a total of 0 rules in 25 ms. Remains 630 /630 variables (removed 0) and now considering 1558/1558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 630/630 places, 1558/1558 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 1558/1558 transitions.
Applied a total of 0 rules in 21 ms. Remains 630 /630 variables (removed 0) and now considering 1558/1558 (removed 0) transitions.
[2023-03-13 01:13:25] [INFO ] Invariant cache hit.
[2023-03-13 01:13:25] [INFO ] Implicit Places using invariants in 360 ms returned [140, 431]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 361 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 628/630 places, 1558/1558 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 626 transition count 1556
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 626 transition count 1554
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 624 transition count 1554
Applied a total of 8 rules in 48 ms. Remains 624 /628 variables (removed 4) and now considering 1554/1558 (removed 4) transitions.
// Phase 1: matrix 1554 rows 624 cols
[2023-03-13 01:13:25] [INFO ] Computed 57 place invariants in 11 ms
[2023-03-13 01:13:26] [INFO ] Implicit Places using invariants in 356 ms returned []
[2023-03-13 01:13:26] [INFO ] Invariant cache hit.
[2023-03-13 01:13:27] [INFO ] Implicit Places using invariants and state equation in 1559 ms returned []
Implicit Place search using SMT with State Equation took 1917 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 624/630 places, 1554/1558 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2347 ms. Remains : 624/630 places, 1554/1558 transitions.
[2023-03-13 01:13:27] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 16886 resets, run finished after 2146 ms. (steps per millisecond=465 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2955 resets, run finished after 776 ms. (steps per millisecond=1288 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2942 resets, run finished after 751 ms. (steps per millisecond=1331 ) properties (out of 2) seen :0
[2023-03-13 01:13:31] [INFO ] Invariant cache hit.
[2023-03-13 01:13:31] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-13 01:13:31] [INFO ] [Real]Absence check using 13 positive and 44 generalized place invariants in 93 ms returned sat
[2023-03-13 01:13:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 01:13:31] [INFO ] [Real]Absence check using state equation in 414 ms returned sat
[2023-03-13 01:13:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 01:13:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-13 01:13:32] [INFO ] [Nat]Absence check using 13 positive and 44 generalized place invariants in 23 ms returned sat
[2023-03-13 01:13:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 01:13:32] [INFO ] [Nat]Absence check using state equation in 598 ms returned sat
[2023-03-13 01:13:32] [INFO ] Computed and/alt/rep : 351/1497/351 causal constraints (skipped 1165 transitions) in 84 ms.
[2023-03-13 01:13:33] [INFO ] Added : 44 causal constraints over 9 iterations in 821 ms. Result :sat
Minimization took 339 ms.
[2023-03-13 01:13:34] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-13 01:13:34] [INFO ] [Real]Absence check using 13 positive and 44 generalized place invariants in 25 ms returned sat
[2023-03-13 01:13:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 01:13:34] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2023-03-13 01:13:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 01:13:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 36 ms returned sat
[2023-03-13 01:13:34] [INFO ] [Nat]Absence check using 13 positive and 44 generalized place invariants in 16 ms returned sat
[2023-03-13 01:13:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 01:13:35] [INFO ] [Nat]Absence check using state equation in 503 ms returned sat
[2023-03-13 01:13:35] [INFO ] Computed and/alt/rep : 351/1497/351 causal constraints (skipped 1165 transitions) in 74 ms.
[2023-03-13 01:13:36] [INFO ] Added : 37 causal constraints over 8 iterations in 716 ms. Result :sat
Minimization took 297 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 624 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 624/624 places, 1554/1554 transitions.
Applied a total of 0 rules in 19 ms. Remains 624 /624 variables (removed 0) and now considering 1554/1554 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 624/624 places, 1554/1554 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 624/624 places, 1554/1554 transitions.
Applied a total of 0 rules in 19 ms. Remains 624 /624 variables (removed 0) and now considering 1554/1554 (removed 0) transitions.
[2023-03-13 01:13:37] [INFO ] Invariant cache hit.
[2023-03-13 01:13:37] [INFO ] Implicit Places using invariants in 428 ms returned []
[2023-03-13 01:13:37] [INFO ] Invariant cache hit.
[2023-03-13 01:13:39] [INFO ] Implicit Places using invariants and state equation in 1457 ms returned []
Implicit Place search using SMT with State Equation took 1889 ms to find 0 implicit places.
[2023-03-13 01:13:39] [INFO ] Redundant transitions in 89 ms returned []
[2023-03-13 01:13:39] [INFO ] Invariant cache hit.
[2023-03-13 01:13:39] [INFO ] Dead Transitions using invariants and state equation in 535 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2554 ms. Remains : 624/624 places, 1554/1554 transitions.
Starting property specific reduction for ASLink-PT-08a-UpperBounds-04
[2023-03-13 01:13:39] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 178 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-13 01:13:39] [INFO ] Invariant cache hit.
[2023-03-13 01:13:39] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-13 01:13:39] [INFO ] [Real]Absence check using 13 positive and 44 generalized place invariants in 10 ms returned sat
[2023-03-13 01:13:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 01:13:40] [INFO ] [Real]Absence check using state equation in 418 ms returned sat
[2023-03-13 01:13:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 01:13:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-13 01:13:40] [INFO ] [Nat]Absence check using 13 positive and 44 generalized place invariants in 30 ms returned sat
[2023-03-13 01:13:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 01:13:41] [INFO ] [Nat]Absence check using state equation in 574 ms returned sat
[2023-03-13 01:13:41] [INFO ] Computed and/alt/rep : 351/1497/351 causal constraints (skipped 1165 transitions) in 72 ms.
[2023-03-13 01:13:41] [INFO ] Added : 44 causal constraints over 9 iterations in 789 ms. Result :sat
Minimization took 290 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 624 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 624/624 places, 1554/1554 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 624 transition count 1553
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 623 transition count 1553
Applied a total of 2 rules in 22 ms. Remains 623 /624 variables (removed 1) and now considering 1553/1554 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 623/624 places, 1553/1554 transitions.
// Phase 1: matrix 1553 rows 623 cols
[2023-03-13 01:13:42] [INFO ] Computed 57 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 17041 resets, run finished after 2179 ms. (steps per millisecond=458 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2947 resets, run finished after 748 ms. (steps per millisecond=1336 ) properties (out of 1) seen :0
[2023-03-13 01:13:45] [INFO ] Invariant cache hit.
[2023-03-13 01:13:45] [INFO ] [Real]Absence check using 15 positive place invariants in 43 ms returned sat
[2023-03-13 01:13:45] [INFO ] [Real]Absence check using 15 positive and 42 generalized place invariants in 31 ms returned sat
[2023-03-13 01:13:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 01:13:46] [INFO ] [Real]Absence check using state equation in 510 ms returned sat
[2023-03-13 01:13:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 01:13:46] [INFO ] [Nat]Absence check using 15 positive place invariants in 65 ms returned sat
[2023-03-13 01:13:46] [INFO ] [Nat]Absence check using 15 positive and 42 generalized place invariants in 89 ms returned sat
[2023-03-13 01:13:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 01:13:47] [INFO ] [Nat]Absence check using state equation in 864 ms returned sat
[2023-03-13 01:13:47] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 0 ms to minimize.
[2023-03-13 01:13:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2023-03-13 01:13:47] [INFO ] Computed and/alt/rep : 350/1496/350 causal constraints (skipped 1165 transitions) in 92 ms.
[2023-03-13 01:13:48] [INFO ] Added : 22 causal constraints over 5 iterations in 707 ms. Result :sat
Minimization took 426 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1553/1553 transitions.
Applied a total of 0 rules in 17 ms. Remains 623 /623 variables (removed 0) and now considering 1553/1553 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 623/623 places, 1553/1553 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1553/1553 transitions.
Applied a total of 0 rules in 18 ms. Remains 623 /623 variables (removed 0) and now considering 1553/1553 (removed 0) transitions.
[2023-03-13 01:13:49] [INFO ] Invariant cache hit.
[2023-03-13 01:13:49] [INFO ] Implicit Places using invariants in 477 ms returned []
[2023-03-13 01:13:49] [INFO ] Invariant cache hit.
[2023-03-13 01:13:51] [INFO ] Implicit Places using invariants and state equation in 1505 ms returned []
Implicit Place search using SMT with State Equation took 1982 ms to find 0 implicit places.
[2023-03-13 01:13:51] [INFO ] Redundant transitions in 109 ms returned []
[2023-03-13 01:13:51] [INFO ] Invariant cache hit.
[2023-03-13 01:13:51] [INFO ] Dead Transitions using invariants and state equation in 556 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2685 ms. Remains : 623/623 places, 1553/1553 transitions.
Ending property specific reduction for ASLink-PT-08a-UpperBounds-04 in 11887 ms.
Starting property specific reduction for ASLink-PT-08a-UpperBounds-11
// Phase 1: matrix 1554 rows 624 cols
[2023-03-13 01:13:51] [INFO ] Computed 57 place invariants in 11 ms
Incomplete random walk after 10000 steps, including 164 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-13 01:13:51] [INFO ] Invariant cache hit.
[2023-03-13 01:13:51] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-13 01:13:51] [INFO ] [Real]Absence check using 13 positive and 44 generalized place invariants in 21 ms returned sat
[2023-03-13 01:13:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 01:13:52] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2023-03-13 01:13:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 01:13:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-13 01:13:52] [INFO ] [Nat]Absence check using 13 positive and 44 generalized place invariants in 11 ms returned sat
[2023-03-13 01:13:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 01:13:52] [INFO ] [Nat]Absence check using state equation in 468 ms returned sat
[2023-03-13 01:13:53] [INFO ] Computed and/alt/rep : 351/1497/351 causal constraints (skipped 1165 transitions) in 70 ms.
[2023-03-13 01:13:53] [INFO ] Added : 37 causal constraints over 8 iterations in 658 ms. Result :sat
Minimization took 266 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 624 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 624/624 places, 1554/1554 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 624 transition count 1553
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 623 transition count 1553
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 623 transition count 1552
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 622 transition count 1552
Applied a total of 4 rules in 29 ms. Remains 622 /624 variables (removed 2) and now considering 1552/1554 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 622/624 places, 1552/1554 transitions.
// Phase 1: matrix 1552 rows 622 cols
[2023-03-13 01:13:54] [INFO ] Computed 57 place invariants in 21 ms
Incomplete random walk after 1000000 steps, including 16818 resets, run finished after 2087 ms. (steps per millisecond=479 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2929 resets, run finished after 756 ms. (steps per millisecond=1322 ) properties (out of 1) seen :0
[2023-03-13 01:13:57] [INFO ] Invariant cache hit.
[2023-03-13 01:13:57] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-13 01:13:57] [INFO ] [Real]Absence check using 13 positive and 44 generalized place invariants in 11 ms returned sat
[2023-03-13 01:13:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 01:13:57] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2023-03-13 01:13:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 01:13:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-13 01:13:58] [INFO ] [Nat]Absence check using 13 positive and 44 generalized place invariants in 25 ms returned sat
[2023-03-13 01:13:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 01:13:58] [INFO ] [Nat]Absence check using state equation in 642 ms returned sat
[2023-03-13 01:13:58] [INFO ] Computed and/alt/rep : 349/1495/349 causal constraints (skipped 1165 transitions) in 81 ms.
[2023-03-13 01:14:00] [INFO ] Deduced a trap composed of 59 places in 126 ms of which 0 ms to minimize.
[2023-03-13 01:14:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
[2023-03-13 01:14:00] [INFO ] Added : 53 causal constraints over 11 iterations in 1622 ms. Result :sat
Minimization took 259 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 1552/1552 transitions.
Applied a total of 0 rules in 31 ms. Remains 622 /622 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 622/622 places, 1552/1552 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 1552/1552 transitions.
Applied a total of 0 rules in 21 ms. Remains 622 /622 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
[2023-03-13 01:14:00] [INFO ] Invariant cache hit.
[2023-03-13 01:14:01] [INFO ] Implicit Places using invariants in 391 ms returned []
[2023-03-13 01:14:01] [INFO ] Invariant cache hit.
[2023-03-13 01:14:02] [INFO ] Implicit Places using invariants and state equation in 1274 ms returned []
Implicit Place search using SMT with State Equation took 1679 ms to find 0 implicit places.
[2023-03-13 01:14:02] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-13 01:14:02] [INFO ] Invariant cache hit.
[2023-03-13 01:14:03] [INFO ] Dead Transitions using invariants and state equation in 545 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2293 ms. Remains : 622/622 places, 1552/1552 transitions.
Ending property specific reduction for ASLink-PT-08a-UpperBounds-11 in 11529 ms.
[2023-03-13 01:14:03] [INFO ] Flatten gal took : 153 ms
[2023-03-13 01:14:03] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-13 01:14:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 624 places, 1554 transitions and 6349 arcs took 5 ms.
Total runtime 411037 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: ASLink_PT_08a
(NrP: 624 NrTr: 1554 NrArc: 6349)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.067sec
net check time: 0m 0.000sec
init dd package: 0m 2.825sec
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 9702464 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16095716 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.009sec
16950 24045 40554 45037 74513 61844 63555 91620 83814 104824 91190 122329 118312 135008 143537 127463 166424 163060 134235 161050
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="ASLink-PT-08a"
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 ASLink-PT-08a, 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 r010-oct2-167813598600125"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-08a.tgz
mv ASLink-PT-08a 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 ;