About the Execution of ITS-LoLa for ASLink-PT-04b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15781.800 | 3600000.00 | 6027033.00 | 25244.70 | TTFFT??T?TTTTTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2020-input.r166-smll-158987787200071.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is ASLink-PT-04b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-158987787200071
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 844K
-rw-r--r-- 1 mcc users 3.7K Mar 25 09:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 25 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 09:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 09:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 09:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 25 09:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 25 09:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 25 09:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 669K Mar 24 05:37 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-00
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-01
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-02
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-03
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-04
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-05
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-06
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-07
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-08
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-09
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-10
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-11
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-12
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-13
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-14
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1591197785956
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 15:23:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 15:23:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 15:23:09] [INFO ] Load time of PNML (sax parser for PT used): 392 ms
[2020-06-03 15:23:09] [INFO ] Transformed 2034 places.
[2020-06-03 15:23:09] [INFO ] Transformed 2567 transitions.
[2020-06-03 15:23:09] [INFO ] Found NUPN structural information;
[2020-06-03 15:23:09] [INFO ] Parsed PT model containing 2034 places and 2567 transitions in 522 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 172 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 20 resets, run finished after 156 ms. (steps per millisecond=64 ) properties seen :[0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0]
FORMULA ASLink-PT-04b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 71 ms. (steps per millisecond=140 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 49 ms. (steps per millisecond=204 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2567 rows 2034 cols
[2020-06-03 15:23:10] [INFO ] Computed 199 place invariants in 553 ms
[2020-06-03 15:23:11] [INFO ] [Real]Absence check using 48 positive place invariants in 186 ms returned sat
[2020-06-03 15:23:12] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 405 ms returned sat
[2020-06-03 15:23:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:23:15] [INFO ] [Real]Absence check using state equation in 3665 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 15:23:16] [INFO ] [Real]Absence check using 48 positive place invariants in 230 ms returned sat
[2020-06-03 15:23:16] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 169 ms returned unsat
[2020-06-03 15:23:17] [INFO ] [Real]Absence check using 48 positive place invariants in 238 ms returned sat
[2020-06-03 15:23:18] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 557 ms returned sat
[2020-06-03 15:23:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:23:21] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 15:23:21] [INFO ] [Real]Absence check using state equation in 3648 ms returned (error "Failed to check-sat")
[2020-06-03 15:23:22] [INFO ] [Real]Absence check using 48 positive place invariants in 225 ms returned sat
[2020-06-03 15:23:23] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 408 ms returned sat
[2020-06-03 15:23:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:23:26] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 15:23:26] [INFO ] [Real]Absence check using state equation in 3773 ms returned (error "Failed to check-sat")
[2020-06-03 15:23:27] [INFO ] [Real]Absence check using 48 positive place invariants in 185 ms returned sat
[2020-06-03 15:23:27] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 421 ms returned sat
[2020-06-03 15:23:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:23:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 15:23:31] [INFO ] [Real]Absence check using state equation in 3942 ms returned (error "Failed to check-sat")
[2020-06-03 15:23:32] [INFO ] [Real]Absence check using 48 positive place invariants in 232 ms returned sat
[2020-06-03 15:23:33] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 499 ms returned sat
[2020-06-03 15:23:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:23:36] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 15:23:36] [INFO ] [Real]Absence check using state equation in 3670 ms returned (error "Failed to check-sat")
[2020-06-03 15:23:37] [INFO ] [Real]Absence check using 48 positive place invariants in 229 ms returned sat
[2020-06-03 15:23:38] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 389 ms returned sat
[2020-06-03 15:23:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:23:41] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 15:23:41] [INFO ] [Real]Absence check using state equation in 3800 ms returned (error "Failed to check-sat")
[2020-06-03 15:23:42] [INFO ] [Real]Absence check using 48 positive place invariants in 231 ms returned sat
[2020-06-03 15:23:43] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 503 ms returned sat
[2020-06-03 15:23:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:23:46] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 15:23:46] [INFO ] [Real]Absence check using state equation in 3812 ms returned (error "Failed to check-sat")
[2020-06-03 15:23:47] [INFO ] [Real]Absence check using 48 positive place invariants in 230 ms returned sat
[2020-06-03 15:23:48] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 520 ms returned sat
[2020-06-03 15:23:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:23:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (= s490 (- (+ t1698 t1714 t1730 t1746 t1762 t1778 t1794 t1810) (+ t2425 t2428 t2431 t2434 t2451 t2458)))") while checking expression at index 8
[2020-06-03 15:23:52] [INFO ] [Real]Absence check using 48 positive place invariants in 216 ms returned sat
[2020-06-03 15:23:53] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 420 ms returned sat
[2020-06-03 15:23:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:23:56] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 15:23:56] [INFO ] [Real]Absence check using state equation in 3854 ms returned (error "Failed to check-sat")
[2020-06-03 15:23:57] [INFO ] [Real]Absence check using 48 positive place invariants in 231 ms returned sat
[2020-06-03 15:23:57] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 132 ms returned unsat
FORMULA ASLink-PT-04b-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-04b-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 51 out of 2034 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2034/2034 places, 2567/2567 transitions.
Performed 443 Post agglomeration using F-continuation condition.Transition count delta: 443
Iterating post reduction 0 with 443 rules applied. Total rules applied 443 place count 2034 transition count 2124
Reduce places removed 443 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 465 rules applied. Total rules applied 908 place count 1591 transition count 2102
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 914 place count 1585 transition count 2102
Performed 455 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 455 Pre rules applied. Total rules applied 914 place count 1585 transition count 1647
Deduced a syphon composed of 455 places in 10 ms
Ensure Unique test removed 39 places
Reduce places removed 494 places and 0 transitions.
Iterating global reduction 3 with 949 rules applied. Total rules applied 1863 place count 1091 transition count 1647
Discarding 5 places :
Implicit places reduction removed 5 places
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Iterating post reduction 3 with 30 rules applied. Total rules applied 1893 place count 1086 transition count 1622
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 4 with 25 rules applied. Total rules applied 1918 place count 1061 transition count 1622
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 14 Pre rules applied. Total rules applied 1918 place count 1061 transition count 1608
Deduced a syphon composed of 14 places in 10 ms
Ensure Unique test removed 13 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 41 rules applied. Total rules applied 1959 place count 1034 transition count 1608
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 1959 place count 1034 transition count 1595
Deduced a syphon composed of 13 places in 16 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 1985 place count 1021 transition count 1595
Symmetric choice reduction at 5 with 64 rule applications. Total rules 2049 place count 1021 transition count 1595
Deduced a syphon composed of 64 places in 15 ms
Reduce places removed 64 places and 64 transitions.
Iterating global reduction 5 with 128 rules applied. Total rules applied 2177 place count 957 transition count 1531
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2178 place count 957 transition count 1530
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 22 Pre rules applied. Total rules applied 2178 place count 957 transition count 1508
Deduced a syphon composed of 22 places in 18 ms
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 45 rules applied. Total rules applied 2223 place count 934 transition count 1508
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2223 place count 934 transition count 1507
Deduced a syphon composed of 1 places in 14 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 2226 place count 932 transition count 1507
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2230 place count 932 transition count 1507
Deduced a syphon composed of 4 places in 15 ms
Reduce places removed 4 places and 27 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 2238 place count 928 transition count 1480
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 2238 place count 928 transition count 1477
Deduced a syphon composed of 3 places in 13 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 2244 place count 925 transition count 1477
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2245 place count 925 transition count 1477
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2247 place count 924 transition count 1469
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2248 place count 924 transition count 1469
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2250 place count 923 transition count 1461
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2251 place count 923 transition count 1461
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2253 place count 922 transition count 1453
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2254 place count 922 transition count 1453
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2256 place count 921 transition count 1445
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2257 place count 921 transition count 1445
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2259 place count 920 transition count 1437
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2260 place count 920 transition count 1437
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2262 place count 919 transition count 1429
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2263 place count 919 transition count 1429
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2265 place count 918 transition count 1421
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2266 place count 918 transition count 1421
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2268 place count 917 transition count 1413
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2269 place count 917 transition count 1413
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2271 place count 916 transition count 1405
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 6 with 224 rules applied. Total rules applied 2495 place count 803 transition count 1294
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2496 place count 803 transition count 1294
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2498 place count 802 transition count 1293
Ensure Unique test removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 2499 place count 801 transition count 1293
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2500 place count 801 transition count 1293
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2502 place count 800 transition count 1292
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2504 place count 800 transition count 1290
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2505 place count 799 transition count 1290
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2507 place count 798 transition count 1299
Free-agglomeration rule applied 4 times.
Iterating global reduction 9 with 4 rules applied. Total rules applied 2511 place count 798 transition count 1295
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 2515 place count 794 transition count 1295
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 10 with 5 rules applied. Total rules applied 2520 place count 794 transition count 1290
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 2525 place count 789 transition count 1290
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 2530 place count 789 transition count 1290
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2531 place count 788 transition count 1289
Reduce places removed 6 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 11 with 9 rules applied. Total rules applied 2540 place count 782 transition count 1286
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 2543 place count 779 transition count 1286
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 8 Pre rules applied. Total rules applied 2543 place count 779 transition count 1278
Deduced a syphon composed of 8 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 13 with 17 rules applied. Total rules applied 2560 place count 770 transition count 1278
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 13 with 4 rules applied. Total rules applied 2564 place count 766 transition count 1278
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 14 with 14 rules applied. Total rules applied 2578 place count 759 transition count 1271
Symmetric choice reduction at 14 with 3 rule applications. Total rules 2581 place count 759 transition count 1271
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 14 with 6 rules applied. Total rules applied 2587 place count 756 transition count 1268
Symmetric choice reduction at 14 with 1 rule applications. Total rules 2588 place count 756 transition count 1268
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 2590 place count 755 transition count 1267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 2591 place count 755 transition count 1266
Free-agglomeration rule applied 2 times.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2593 place count 755 transition count 1264
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 2595 place count 753 transition count 1264
Applied a total of 2595 rules in 2030 ms. Remains 753 /2034 variables (removed 1281) and now considering 1264/2567 (removed 1303) transitions.
Finished structural reductions, in 1 iterations. Remains : 753/2034 places, 1264/2567 transitions.
Incomplete random walk after 1000000 steps, including 10181 resets, run finished after 4972 ms. (steps per millisecond=201 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2713 resets, run finished after 2432 ms. (steps per millisecond=411 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2737 resets, run finished after 2060 ms. (steps per millisecond=485 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2745 resets, run finished after 1800 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2230 resets, run finished after 2122 ms. (steps per millisecond=471 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2645 resets, run finished after 2026 ms. (steps per millisecond=493 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2397 resets, run finished after 1832 ms. (steps per millisecond=545 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3003 resets, run finished after 2691 ms. (steps per millisecond=371 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0, 0]
FORMULA ASLink-PT-04b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 2649 resets, run finished after 2313 ms. (steps per millisecond=432 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2723 resets, run finished after 1779 ms. (steps per millisecond=562 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 1264 rows 753 cols
[2020-06-03 15:24:23] [INFO ] Computed 126 place invariants in 119 ms
[2020-06-03 15:24:24] [INFO ] [Real]Absence check using 31 positive place invariants in 54 ms returned sat
[2020-06-03 15:24:24] [INFO ] [Real]Absence check using 31 positive and 95 generalized place invariants in 68 ms returned sat
[2020-06-03 15:24:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:24:27] [INFO ] [Real]Absence check using state equation in 3523 ms returned sat
[2020-06-03 15:24:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:24:28] [INFO ] [Nat]Absence check using 31 positive place invariants in 90 ms returned sat
[2020-06-03 15:24:28] [INFO ] [Nat]Absence check using 31 positive and 95 generalized place invariants in 110 ms returned sat
[2020-06-03 15:24:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:24:30] [INFO ] [Nat]Absence check using state equation in 1756 ms returned unsat
[2020-06-03 15:24:30] [INFO ] [Real]Absence check using 31 positive place invariants in 74 ms returned sat
[2020-06-03 15:24:30] [INFO ] [Real]Absence check using 31 positive and 95 generalized place invariants in 123 ms returned sat
[2020-06-03 15:24:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:24:33] [INFO ] [Real]Absence check using state equation in 3070 ms returned sat
[2020-06-03 15:24:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:24:33] [INFO ] [Nat]Absence check using 31 positive place invariants in 48 ms returned sat
[2020-06-03 15:24:33] [INFO ] [Nat]Absence check using 31 positive and 95 generalized place invariants in 80 ms returned sat
[2020-06-03 15:24:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:24:36] [INFO ] [Nat]Absence check using state equation in 3055 ms returned sat
[2020-06-03 15:24:37] [INFO ] Computed and/alt/rep : 1248/13042/1248 causal constraints in 223 ms.
[2020-06-03 15:24:57] [INFO ] Added : 425 causal constraints over 85 iterations in 20240 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 132 ms.
[2020-06-03 15:24:57] [INFO ] [Real]Absence check using 31 positive place invariants in 87 ms returned sat
[2020-06-03 15:24:58] [INFO ] [Real]Absence check using 31 positive and 95 generalized place invariants in 134 ms returned sat
[2020-06-03 15:24:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:25:01] [INFO ] [Real]Absence check using state equation in 3824 ms returned sat
[2020-06-03 15:25:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:25:02] [INFO ] [Nat]Absence check using 31 positive place invariants in 89 ms returned sat
[2020-06-03 15:25:02] [INFO ] [Nat]Absence check using 31 positive and 95 generalized place invariants in 109 ms returned sat
[2020-06-03 15:25:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:25:05] [INFO ] [Nat]Absence check using state equation in 3148 ms returned sat
[2020-06-03 15:25:05] [INFO ] Computed and/alt/rep : 1248/13042/1248 causal constraints in 95 ms.
[2020-06-03 15:25:16] [INFO ] Added : 343 causal constraints over 69 iterations in 10823 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 73 ms.
[2020-06-03 15:25:16] [INFO ] [Real]Absence check using 31 positive place invariants in 79 ms returned sat
[2020-06-03 15:25:17] [INFO ] [Real]Absence check using 31 positive and 95 generalized place invariants in 127 ms returned sat
[2020-06-03 15:25:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:25:20] [INFO ] [Real]Absence check using state equation in 3266 ms returned sat
[2020-06-03 15:25:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:25:20] [INFO ] [Nat]Absence check using 31 positive place invariants in 56 ms returned sat
[2020-06-03 15:25:20] [INFO ] [Nat]Absence check using 31 positive and 95 generalized place invariants in 84 ms returned sat
[2020-06-03 15:25:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:25:23] [INFO ] [Nat]Absence check using state equation in 2884 ms returned sat
[2020-06-03 15:25:23] [INFO ] Computed and/alt/rep : 1248/13042/1248 causal constraints in 128 ms.
[2020-06-03 15:25:44] [INFO ] Added : 440 causal constraints over 88 iterations in 21364 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 84 ms.
[2020-06-03 15:25:45] [INFO ] [Real]Absence check using 31 positive place invariants in 82 ms returned sat
[2020-06-03 15:25:45] [INFO ] [Real]Absence check using 31 positive and 95 generalized place invariants in 112 ms returned sat
[2020-06-03 15:25:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:25:49] [INFO ] [Real]Absence check using state equation in 3651 ms returned sat
[2020-06-03 15:25:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:25:49] [INFO ] [Nat]Absence check using 31 positive place invariants in 66 ms returned sat
[2020-06-03 15:25:49] [INFO ] [Nat]Absence check using 31 positive and 95 generalized place invariants in 92 ms returned sat
[2020-06-03 15:25:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:25:53] [INFO ] [Nat]Absence check using state equation in 3933 ms returned sat
[2020-06-03 15:25:53] [INFO ] Computed and/alt/rep : 1248/13042/1248 causal constraints in 114 ms.
[2020-06-03 15:26:13] [INFO ] Added : 470 causal constraints over 94 iterations in 20320 ms.(timeout) Result :sat
[2020-06-03 15:26:14] [INFO ] Deduced a trap composed of 26 places in 283 ms
[2020-06-03 15:26:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 631 ms
Attempting to minimize the solution found.
Minimization took 147 ms.
[2020-06-03 15:26:15] [INFO ] [Real]Absence check using 31 positive place invariants in 76 ms returned sat
[2020-06-03 15:26:15] [INFO ] [Real]Absence check using 31 positive and 95 generalized place invariants in 130 ms returned sat
[2020-06-03 15:26:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:26:19] [INFO ] [Real]Absence check using state equation in 3715 ms returned sat
[2020-06-03 15:26:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:26:19] [INFO ] [Nat]Absence check using 31 positive place invariants in 77 ms returned sat
[2020-06-03 15:26:19] [INFO ] [Nat]Absence check using 31 positive and 95 generalized place invariants in 117 ms returned sat
[2020-06-03 15:26:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:26:20] [INFO ] [Nat]Absence check using state equation in 1050 ms returned unsat
[2020-06-03 15:26:20] [INFO ] [Real]Absence check using 31 positive place invariants in 77 ms returned sat
[2020-06-03 15:26:20] [INFO ] [Real]Absence check using 31 positive and 95 generalized place invariants in 129 ms returned sat
[2020-06-03 15:26:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:26:24] [INFO ] [Real]Absence check using state equation in 3670 ms returned sat
[2020-06-03 15:26:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:26:24] [INFO ] [Nat]Absence check using 31 positive place invariants in 65 ms returned sat
[2020-06-03 15:26:25] [INFO ] [Nat]Absence check using 31 positive and 95 generalized place invariants in 100 ms returned sat
[2020-06-03 15:26:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:26:26] [INFO ] [Nat]Absence check using state equation in 1025 ms returned unsat
[2020-06-03 15:26:26] [INFO ] [Real]Absence check using 31 positive place invariants in 74 ms returned sat
[2020-06-03 15:26:26] [INFO ] [Real]Absence check using 31 positive and 95 generalized place invariants in 108 ms returned sat
[2020-06-03 15:26:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:26:29] [INFO ] [Real]Absence check using state equation in 3490 ms returned sat
[2020-06-03 15:26:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:26:30] [INFO ] [Nat]Absence check using 31 positive place invariants in 77 ms returned sat
[2020-06-03 15:26:30] [INFO ] [Nat]Absence check using 31 positive and 95 generalized place invariants in 108 ms returned sat
[2020-06-03 15:26:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:26:34] [INFO ] [Nat]Absence check using state equation in 3714 ms returned sat
[2020-06-03 15:26:34] [INFO ] Computed and/alt/rep : 1248/13042/1248 causal constraints in 168 ms.
[2020-06-03 15:26:54] [INFO ] Added : 440 causal constraints over 88 iterations in 20358 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 89 ms.
FORMULA ASLink-PT-04b-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-04b-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-04b-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 507000 steps, including 1000 resets, run finished after 2780 ms. (steps per millisecond=182 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 476600 steps, including 1000 resets, run finished after 2229 ms. (steps per millisecond=213 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 489300 steps, including 1000 resets, run finished after 2138 ms. (steps per millisecond=228 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 318400 steps, including 1000 resets, run finished after 1309 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 485300 steps, including 1000 resets, run finished after 1947 ms. (steps per millisecond=249 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 24 out of 753 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 753/753 places, 1264/1264 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 753 transition count 1261
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 750 transition count 1261
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 6 place count 750 transition count 1240
Deduced a syphon composed of 21 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 43 rules applied. Total rules applied 49 place count 728 transition count 1240
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 728 transition count 1240
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 6 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 727 transition count 1234
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 726 transition count 1234
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 64 place count 720 transition count 1229
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 64 place count 720 transition count 1227
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 68 place count 718 transition count 1227
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 718 transition count 1227
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 71 place count 717 transition count 1226
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 716 transition count 1225
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 716 transition count 1224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 75 place count 715 transition count 1224
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 76 place count 715 transition count 1224
Symmetric choice reduction at 4 with 1 rule applications. Total rules 77 place count 715 transition count 1224
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 79 place count 714 transition count 1223
Applied a total of 79 rules in 203 ms. Remains 714 /753 variables (removed 39) and now considering 1223/1264 (removed 41) transitions.
Finished structural reductions, in 1 iterations. Remains : 714/753 places, 1223/1264 transitions.
Incomplete random walk after 1000000 steps, including 11736 resets, run finished after 4231 ms. (steps per millisecond=236 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2986 resets, run finished after 1675 ms. (steps per millisecond=597 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2137 resets, run finished after 1913 ms. (steps per millisecond=522 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2941 resets, run finished after 2260 ms. (steps per millisecond=442 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2713 resets, run finished after 1654 ms. (steps per millisecond=604 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2984 resets, run finished after 1672 ms. (steps per millisecond=598 ) properties seen :[0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 3338118 steps, run timeout after 30001 ms. (steps per millisecond=111 ) properties seen :[0, 0, 0, 0, 0]
Probabilistic random walk after 3338118 steps, saw 692674 distinct states, run finished after 30001 ms. (steps per millisecond=111 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 1223 rows 714 cols
[2020-06-03 15:27:48] [INFO ] Computed 123 place invariants in 23 ms
[2020-06-03 15:27:49] [INFO ] [Real]Absence check using 31 positive place invariants in 42 ms returned sat
[2020-06-03 15:27:49] [INFO ] [Real]Absence check using 31 positive and 92 generalized place invariants in 73 ms returned sat
[2020-06-03 15:27:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:27:52] [INFO ] [Real]Absence check using state equation in 3288 ms returned sat
[2020-06-03 15:27:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:27:52] [INFO ] [Nat]Absence check using 31 positive place invariants in 51 ms returned sat
[2020-06-03 15:27:52] [INFO ] [Nat]Absence check using 31 positive and 92 generalized place invariants in 95 ms returned sat
[2020-06-03 15:27:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:27:56] [INFO ] [Nat]Absence check using state equation in 3455 ms returned sat
[2020-06-03 15:27:56] [INFO ] Computed and/alt/rep : 1208/13567/1208 causal constraints in 96 ms.
[2020-06-03 15:28:16] [INFO ] Added : 495 causal constraints over 99 iterations in 20354 ms.(timeout) Result :sat
[2020-06-03 15:28:16] [INFO ] Deduced a trap composed of 29 places in 183 ms
[2020-06-03 15:28:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 435 ms
Attempting to minimize the solution found.
Minimization took 101 ms.
[2020-06-03 15:28:17] [INFO ] [Real]Absence check using 31 positive place invariants in 79 ms returned sat
[2020-06-03 15:28:17] [INFO ] [Real]Absence check using 31 positive and 92 generalized place invariants in 114 ms returned sat
[2020-06-03 15:28:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:28:20] [INFO ] [Real]Absence check using state equation in 3195 ms returned sat
[2020-06-03 15:28:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:28:20] [INFO ] [Nat]Absence check using 31 positive place invariants in 51 ms returned sat
[2020-06-03 15:28:21] [INFO ] [Nat]Absence check using 31 positive and 92 generalized place invariants in 84 ms returned sat
[2020-06-03 15:28:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:28:24] [INFO ] [Nat]Absence check using state equation in 3225 ms returned sat
[2020-06-03 15:28:24] [INFO ] Computed and/alt/rep : 1208/13567/1208 causal constraints in 67 ms.
[2020-06-03 15:28:44] [INFO ] Added : 530 causal constraints over 106 iterations in 20398 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 185 ms.
[2020-06-03 15:28:45] [INFO ] [Real]Absence check using 31 positive place invariants in 72 ms returned sat
[2020-06-03 15:28:45] [INFO ] [Real]Absence check using 31 positive and 92 generalized place invariants in 72 ms returned sat
[2020-06-03 15:28:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:28:48] [INFO ] [Real]Absence check using state equation in 2677 ms returned sat
[2020-06-03 15:28:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:28:48] [INFO ] [Nat]Absence check using 31 positive place invariants in 64 ms returned sat
[2020-06-03 15:28:48] [INFO ] [Nat]Absence check using 31 positive and 92 generalized place invariants in 102 ms returned sat
[2020-06-03 15:28:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:28:51] [INFO ] [Nat]Absence check using state equation in 3051 ms returned sat
[2020-06-03 15:28:51] [INFO ] Computed and/alt/rep : 1208/13567/1208 causal constraints in 107 ms.
[2020-06-03 15:29:11] [INFO ] Added : 515 causal constraints over 103 iterations in 20265 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 116 ms.
[2020-06-03 15:29:12] [INFO ] [Real]Absence check using 31 positive place invariants in 72 ms returned sat
[2020-06-03 15:29:12] [INFO ] [Real]Absence check using 31 positive and 92 generalized place invariants in 105 ms returned sat
[2020-06-03 15:29:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:29:15] [INFO ] [Real]Absence check using state equation in 3176 ms returned sat
[2020-06-03 15:29:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:29:15] [INFO ] [Nat]Absence check using 31 positive place invariants in 54 ms returned sat
[2020-06-03 15:29:15] [INFO ] [Nat]Absence check using 31 positive and 92 generalized place invariants in 83 ms returned sat
[2020-06-03 15:29:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:29:19] [INFO ] [Nat]Absence check using state equation in 3304 ms returned sat
[2020-06-03 15:29:19] [INFO ] Computed and/alt/rep : 1208/13567/1208 causal constraints in 141 ms.
[2020-06-03 15:29:39] [INFO ] Added : 500 causal constraints over 100 iterations in 20213 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 123 ms.
[2020-06-03 15:29:39] [INFO ] [Real]Absence check using 31 positive place invariants in 54 ms returned sat
[2020-06-03 15:29:40] [INFO ] [Real]Absence check using 31 positive and 92 generalized place invariants in 80 ms returned sat
[2020-06-03 15:29:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:29:43] [INFO ] [Real]Absence check using state equation in 3250 ms returned sat
[2020-06-03 15:29:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:29:43] [INFO ] [Nat]Absence check using 31 positive place invariants in 56 ms returned sat
[2020-06-03 15:29:43] [INFO ] [Nat]Absence check using 31 positive and 92 generalized place invariants in 87 ms returned sat
[2020-06-03 15:29:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:29:46] [INFO ] [Nat]Absence check using state equation in 2688 ms returned sat
[2020-06-03 15:29:46] [INFO ] Deduced a trap composed of 71 places in 188 ms
[2020-06-03 15:29:46] [INFO ] Deduced a trap composed of 46 places in 193 ms
[2020-06-03 15:29:46] [INFO ] Deduced a trap composed of 52 places in 95 ms
[2020-06-03 15:29:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 664 ms
[2020-06-03 15:29:47] [INFO ] Computed and/alt/rep : 1208/13567/1208 causal constraints in 110 ms.
[2020-06-03 15:30:07] [INFO ] Added : 465 causal constraints over 93 iterations in 20159 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 161 ms.
Incomplete Parikh walk after 632200 steps, including 9789 resets, run finished after 3392 ms. (steps per millisecond=186 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 413300 steps, including 6594 resets, run finished after 2645 ms. (steps per millisecond=156 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 461400 steps, including 7188 resets, run finished after 2689 ms. (steps per millisecond=171 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 402400 steps, including 6304 resets, run finished after 2259 ms. (steps per millisecond=178 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 410700 steps, including 6468 resets, run finished after 2464 ms. (steps per millisecond=166 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 24 out of 714 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 714/714 places, 1223/1223 transitions.
Applied a total of 0 rules in 44 ms. Remains 714 /714 variables (removed 0) and now considering 1223/1223 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 714/714 places, 1223/1223 transitions.
Starting structural reductions, iteration 0 : 714/714 places, 1223/1223 transitions.
Applied a total of 0 rules in 38 ms. Remains 714 /714 variables (removed 0) and now considering 1223/1223 (removed 0) transitions.
// Phase 1: matrix 1223 rows 714 cols
[2020-06-03 15:30:21] [INFO ] Computed 123 place invariants in 23 ms
[2020-06-03 15:30:23] [INFO ] Implicit Places using invariants in 2759 ms returned [19, 20, 52, 70, 124, 145, 160, 161, 163, 180, 198, 236, 272, 276, 277, 288, 289, 291, 308, 326, 404, 408, 409, 420, 421, 422, 424, 442, 460, 479, 498, 532, 533, 536, 547, 548, 549, 575, 577, 581, 599, 600, 601, 602, 618, 624, 630, 636, 642, 648, 654, 660, 666, 672, 678]
Discarding 55 places :
Implicit Place search using SMT only with invariants took 2764 ms to find 55 implicit places.
[2020-06-03 15:30:24] [INFO ] Redundant transitions in 144 ms returned []
// Phase 1: matrix 1223 rows 659 cols
[2020-06-03 15:30:24] [INFO ] Computed 68 place invariants in 23 ms
[2020-06-03 15:30:29] [INFO ] Dead Transitions using invariants and state equation in 5219 ms returned []
Starting structural reductions, iteration 1 : 659/714 places, 1223/1223 transitions.
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 659 transition count 1143
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 162 place count 579 transition count 1141
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 162 place count 579 transition count 1118
Deduced a syphon composed of 23 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 209 place count 555 transition count 1118
Discarding 4 places :
Implicit places reduction removed 4 places
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 221 place count 551 transition count 1110
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 229 place count 543 transition count 1110
Symmetric choice reduction at 4 with 17 rule applications. Total rules 246 place count 543 transition count 1110
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 17 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 280 place count 526 transition count 1093
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 283 place count 526 transition count 1090
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 283 place count 526 transition count 1089
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 285 place count 525 transition count 1089
Symmetric choice reduction at 5 with 4 rule applications. Total rules 289 place count 525 transition count 1089
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 297 place count 521 transition count 1085
Symmetric choice reduction at 5 with 4 rule applications. Total rules 301 place count 521 transition count 1085
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 7 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 309 place count 517 transition count 1078
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 310 place count 517 transition count 1077
Symmetric choice reduction at 6 with 1 rule applications. Total rules 311 place count 517 transition count 1077
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 313 place count 516 transition count 1076
Symmetric choice reduction at 6 with 1 rule applications. Total rules 314 place count 516 transition count 1076
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 316 place count 515 transition count 1074
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 2 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 6 with 62 rules applied. Total rules applied 378 place count 484 transition count 1043
Symmetric choice reduction at 6 with 2 rule applications. Total rules 380 place count 484 transition count 1043
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 384 place count 482 transition count 1041
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 386 place count 482 transition count 1039
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 390 place count 480 transition count 1040
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 7 with 14 rules applied. Total rules applied 404 place count 480 transition count 1026
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 419 place count 465 transition count 1026
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 8 with 11 rules applied. Total rules applied 430 place count 465 transition count 1026
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 431 place count 465 transition count 1025
Applied a total of 431 rules in 271 ms. Remains 465 /659 variables (removed 194) and now considering 1025/1223 (removed 198) transitions.
// Phase 1: matrix 1025 rows 465 cols
[2020-06-03 15:30:29] [INFO ] Computed 62 place invariants in 24 ms
[2020-06-03 15:30:30] [INFO ] Implicit Places using invariants in 1344 ms returned [83, 114, 117, 120, 126, 127, 179, 199, 205, 208, 210, 215, 216, 268, 286, 294, 297, 299, 309, 310, 379, 385, 388, 390]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 1347 ms to find 24 implicit places.
Starting structural reductions, iteration 2 : 441/714 places, 1025/1223 transitions.
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 441 transition count 1025
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 27 place count 432 transition count 1016
Symmetric choice reduction at 0 with 1 rule applications. Total rules 28 place count 432 transition count 1016
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 431 transition count 1015
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 42 place count 425 transition count 1009
Free-agglomeration rule applied 11 times.
Iterating global reduction 0 with 11 rules applied. Total rules applied 53 place count 425 transition count 998
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 64 place count 414 transition count 998
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 414 transition count 996
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 68 place count 412 transition count 996
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 412 transition count 996
Applied a total of 72 rules in 199 ms. Remains 412 /441 variables (removed 29) and now considering 996/1025 (removed 29) transitions.
// Phase 1: matrix 996 rows 412 cols
[2020-06-03 15:30:31] [INFO ] Computed 38 place invariants in 36 ms
[2020-06-03 15:30:32] [INFO ] Implicit Places using invariants in 1288 ms returned []
// Phase 1: matrix 996 rows 412 cols
[2020-06-03 15:30:32] [INFO ] Computed 38 place invariants in 52 ms
[2020-06-03 15:30:39] [INFO ] Implicit Places using invariants and state equation in 7143 ms returned []
Implicit Place search using SMT with State Equation took 8434 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 412/714 places, 996/1223 transitions.
Incomplete random walk after 1000000 steps, including 17742 resets, run finished after 3914 ms. (steps per millisecond=255 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5380 resets, run finished after 1632 ms. (steps per millisecond=612 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 3818 resets, run finished after 2050 ms. (steps per millisecond=487 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5079 resets, run finished after 1906 ms. (steps per millisecond=524 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 4498 resets, run finished after 1371 ms. (steps per millisecond=729 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5429 resets, run finished after 1446 ms. (steps per millisecond=691 ) properties seen :[0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 3479963 steps, run timeout after 30001 ms. (steps per millisecond=115 ) properties seen :[0, 0, 0, 0, 0]
Probabilistic random walk after 3479963 steps, saw 1106532 distinct states, run finished after 30001 ms. (steps per millisecond=115 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 996 rows 412 cols
[2020-06-03 15:31:21] [INFO ] Computed 38 place invariants in 11 ms
[2020-06-03 15:31:21] [INFO ] [Real]Absence check using 11 positive place invariants in 20 ms returned sat
[2020-06-03 15:31:21] [INFO ] [Real]Absence check using 11 positive and 27 generalized place invariants in 19 ms returned sat
[2020-06-03 15:31:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:31:23] [INFO ] [Real]Absence check using state equation in 1337 ms returned sat
[2020-06-03 15:31:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:31:23] [INFO ] [Nat]Absence check using 11 positive place invariants in 25 ms returned sat
[2020-06-03 15:31:23] [INFO ] [Nat]Absence check using 11 positive and 27 generalized place invariants in 20 ms returned sat
[2020-06-03 15:31:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:31:25] [INFO ] [Nat]Absence check using state equation in 1677 ms returned sat
[2020-06-03 15:31:25] [INFO ] Computed and/alt/rep : 981/13043/981 causal constraints in 122 ms.
[2020-06-03 15:31:44] [INFO ] Added : 450 causal constraints over 90 iterations in 19343 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 125 ms.
[2020-06-03 15:31:44] [INFO ] [Real]Absence check using 11 positive place invariants in 23 ms returned sat
[2020-06-03 15:31:44] [INFO ] [Real]Absence check using 11 positive and 27 generalized place invariants in 20 ms returned sat
[2020-06-03 15:31:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:31:46] [INFO ] [Real]Absence check using state equation in 1292 ms returned sat
[2020-06-03 15:31:46] [INFO ] Computed and/alt/rep : 981/13043/981 causal constraints in 125 ms.
[2020-06-03 15:31:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:31:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 40 ms returned sat
[2020-06-03 15:31:46] [INFO ] [Nat]Absence check using 11 positive and 27 generalized place invariants in 31 ms returned sat
[2020-06-03 15:31:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:31:48] [INFO ] [Nat]Absence check using state equation in 1559 ms returned sat
[2020-06-03 15:31:48] [INFO ] Computed and/alt/rep : 981/13043/981 causal constraints in 113 ms.
[2020-06-03 15:32:10] [INFO ] Added : 315 causal constraints over 63 iterations in 22265 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 109 ms.
[2020-06-03 15:32:10] [INFO ] [Real]Absence check using 11 positive place invariants in 35 ms returned sat
[2020-06-03 15:32:11] [INFO ] [Real]Absence check using 11 positive and 27 generalized place invariants in 37 ms returned sat
[2020-06-03 15:32:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:32:12] [INFO ] [Real]Absence check using state equation in 1810 ms returned sat
[2020-06-03 15:32:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:32:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 40 ms returned sat
[2020-06-03 15:32:13] [INFO ] [Nat]Absence check using 11 positive and 27 generalized place invariants in 33 ms returned sat
[2020-06-03 15:32:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:32:14] [INFO ] [Nat]Absence check using state equation in 1323 ms returned sat
[2020-06-03 15:32:14] [INFO ] Computed and/alt/rep : 981/13043/981 causal constraints in 84 ms.
[2020-06-03 15:32:35] [INFO ] Added : 490 causal constraints over 98 iterations in 20674 ms.(timeout) Result :sat
[2020-06-03 15:32:35] [INFO ] Deduced a trap composed of 38 places in 174 ms
[2020-06-03 15:32:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 531 ms
Attempting to minimize the solution found.
Minimization took 208 ms.
[2020-06-03 15:32:36] [INFO ] [Real]Absence check using 11 positive place invariants in 33 ms returned sat
[2020-06-03 15:32:36] [INFO ] [Real]Absence check using 11 positive and 27 generalized place invariants in 26 ms returned sat
[2020-06-03 15:32:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:32:37] [INFO ] [Real]Absence check using state equation in 1609 ms returned sat
[2020-06-03 15:32:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:32:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 26 ms returned sat
[2020-06-03 15:32:37] [INFO ] [Nat]Absence check using 11 positive and 27 generalized place invariants in 20 ms returned sat
[2020-06-03 15:32:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:32:39] [INFO ] [Nat]Absence check using state equation in 1462 ms returned sat
[2020-06-03 15:32:39] [INFO ] Computed and/alt/rep : 981/13043/981 causal constraints in 108 ms.
[2020-06-03 15:32:59] [INFO ] Added : 480 causal constraints over 96 iterations in 20592 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 168 ms.
[2020-06-03 15:33:00] [INFO ] [Real]Absence check using 11 positive place invariants in 30 ms returned sat
[2020-06-03 15:33:00] [INFO ] [Real]Absence check using 11 positive and 27 generalized place invariants in 25 ms returned sat
[2020-06-03 15:33:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:33:01] [INFO ] [Real]Absence check using state equation in 1488 ms returned sat
[2020-06-03 15:33:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:33:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 44 ms returned sat
[2020-06-03 15:33:02] [INFO ] [Nat]Absence check using 11 positive and 27 generalized place invariants in 25 ms returned sat
[2020-06-03 15:33:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:33:03] [INFO ] [Nat]Absence check using state equation in 1575 ms returned sat
[2020-06-03 15:33:03] [INFO ] Computed and/alt/rep : 981/13043/981 causal constraints in 131 ms.
[2020-06-03 15:33:24] [INFO ] Added : 490 causal constraints over 98 iterations in 20562 ms.(timeout) Result :sat
[2020-06-03 15:33:24] [INFO ] Deduced a trap composed of 29 places in 73 ms
[2020-06-03 15:33:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 358 ms
Attempting to minimize the solution found.
Minimization took 154 ms.
Incomplete Parikh walk after 268000 steps, including 7239 resets, run finished after 1649 ms. (steps per millisecond=162 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 215700 steps, including 5874 resets, run finished after 1074 ms. (steps per millisecond=200 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 420500 steps, including 11119 resets, run finished after 2010 ms. (steps per millisecond=209 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 121800 steps, including 3693 resets, run finished after 751 ms. (steps per millisecond=162 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 225200 steps, including 6160 resets, run finished after 1060 ms. (steps per millisecond=212 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 24 out of 412 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 412/412 places, 996/996 transitions.
Applied a total of 0 rules in 14 ms. Remains 412 /412 variables (removed 0) and now considering 996/996 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 412/412 places, 996/996 transitions.
Starting structural reductions, iteration 0 : 412/412 places, 996/996 transitions.
Applied a total of 0 rules in 15 ms. Remains 412 /412 variables (removed 0) and now considering 996/996 (removed 0) transitions.
// Phase 1: matrix 996 rows 412 cols
[2020-06-03 15:33:31] [INFO ] Computed 38 place invariants in 11 ms
[2020-06-03 15:33:32] [INFO ] Implicit Places using invariants in 1247 ms returned []
// Phase 1: matrix 996 rows 412 cols
[2020-06-03 15:33:32] [INFO ] Computed 38 place invariants in 18 ms
[2020-06-03 15:33:39] [INFO ] Implicit Places using invariants and state equation in 7021 ms returned []
Implicit Place search using SMT with State Equation took 8270 ms to find 0 implicit places.
[2020-06-03 15:33:39] [INFO ] Redundant transitions in 75 ms returned []
// Phase 1: matrix 996 rows 412 cols
[2020-06-03 15:33:39] [INFO ] Computed 38 place invariants in 18 ms
[2020-06-03 15:33:42] [INFO ] Dead Transitions using invariants and state equation in 3118 ms returned []
Finished structural reductions, in 1 iterations. Remains : 412/412 places, 996/996 transitions.
Incomplete random walk after 100000 steps, including 1778 resets, run finished after 589 ms. (steps per millisecond=169 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 996 rows 412 cols
[2020-06-03 15:33:43] [INFO ] Computed 38 place invariants in 17 ms
[2020-06-03 15:33:43] [INFO ] [Real]Absence check using 11 positive place invariants in 33 ms returned sat
[2020-06-03 15:33:43] [INFO ] [Real]Absence check using 11 positive and 27 generalized place invariants in 35 ms returned sat
[2020-06-03 15:33:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:33:45] [INFO ] [Real]Absence check using state equation in 1892 ms returned sat
[2020-06-03 15:33:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:33:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 37 ms returned sat
[2020-06-03 15:33:45] [INFO ] [Nat]Absence check using 11 positive and 27 generalized place invariants in 28 ms returned sat
[2020-06-03 15:33:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:33:47] [INFO ] [Nat]Absence check using state equation in 1716 ms returned sat
[2020-06-03 15:33:47] [INFO ] Computed and/alt/rep : 981/13043/981 causal constraints in 102 ms.
[2020-06-03 15:34:05] [INFO ] Added : 450 causal constraints over 90 iterations in 18072 ms. Result :unknown
[2020-06-03 15:34:05] [INFO ] [Real]Absence check using 11 positive place invariants in 32 ms returned sat
[2020-06-03 15:34:05] [INFO ] [Real]Absence check using 11 positive and 27 generalized place invariants in 30 ms returned sat
[2020-06-03 15:34:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:34:07] [INFO ] [Real]Absence check using state equation in 1448 ms returned sat
[2020-06-03 15:34:07] [INFO ] Computed and/alt/rep : 981/13043/981 causal constraints in 107 ms.
[2020-06-03 15:34:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:34:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 43 ms returned sat
[2020-06-03 15:34:07] [INFO ] [Nat]Absence check using 11 positive and 27 generalized place invariants in 30 ms returned sat
[2020-06-03 15:34:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:34:09] [INFO ] [Nat]Absence check using state equation in 1558 ms returned sat
[2020-06-03 15:34:09] [INFO ] Computed and/alt/rep : 981/13043/981 causal constraints in 107 ms.
[2020-06-03 15:34:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t644 0) (or (and (> t520 0) (< o520 o644)) (and (> t521 0) (< o521 o644)) (and (> t522 0) (< o522 o644)) (and (> t523 0) (< o523 o644)) (and (> t524 0) (< o524 o644)) (and (> t525 0) (< o525 o644)) (and (> t526 0) (< o526 o644)) (and (> t527 0) (< o527 o644))))") while checking expression at index 1
[2020-06-03 15:34:27] [INFO ] [Real]Absence check using 11 positive place invariants in 35 ms returned sat
[2020-06-03 15:34:27] [INFO ] [Real]Absence check using 11 positive and 27 generalized place invariants in 30 ms returned sat
[2020-06-03 15:34:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:34:29] [INFO ] [Real]Absence check using state equation in 1717 ms returned sat
[2020-06-03 15:34:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:34:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 34 ms returned sat
[2020-06-03 15:34:29] [INFO ] [Nat]Absence check using 11 positive and 27 generalized place invariants in 27 ms returned sat
[2020-06-03 15:34:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:34:31] [INFO ] [Nat]Absence check using state equation in 1607 ms returned sat
[2020-06-03 15:34:31] [INFO ] Computed and/alt/rep : 981/13043/981 causal constraints in 117 ms.
[2020-06-03 15:34:49] [INFO ] Added : 495 causal constraints over 99 iterations in 18194 ms. Result :unknown
[2020-06-03 15:34:49] [INFO ] [Real]Absence check using 11 positive place invariants in 29 ms returned sat
[2020-06-03 15:34:49] [INFO ] [Real]Absence check using 11 positive and 27 generalized place invariants in 26 ms returned sat
[2020-06-03 15:34:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:34:51] [INFO ] [Real]Absence check using state equation in 1556 ms returned sat
[2020-06-03 15:34:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:34:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 40 ms returned sat
[2020-06-03 15:34:51] [INFO ] [Nat]Absence check using 11 positive and 27 generalized place invariants in 25 ms returned sat
[2020-06-03 15:34:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:34:53] [INFO ] [Nat]Absence check using state equation in 1693 ms returned sat
[2020-06-03 15:34:53] [INFO ] Computed and/alt/rep : 981/13043/981 causal constraints in 111 ms.
[2020-06-03 15:35:11] [INFO ] Added : 445 causal constraints over 89 iterations in 18099 ms. Result :unknown
[2020-06-03 15:35:11] [INFO ] [Real]Absence check using 11 positive place invariants in 34 ms returned sat
[2020-06-03 15:35:11] [INFO ] [Real]Absence check using 11 positive and 27 generalized place invariants in 26 ms returned sat
[2020-06-03 15:35:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:35:13] [INFO ] [Real]Absence check using state equation in 1534 ms returned sat
[2020-06-03 15:35:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:35:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 37 ms returned sat
[2020-06-03 15:35:13] [INFO ] [Nat]Absence check using 11 positive and 27 generalized place invariants in 21 ms returned sat
[2020-06-03 15:35:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:35:14] [INFO ] [Nat]Absence check using state equation in 1542 ms returned sat
[2020-06-03 15:35:15] [INFO ] Computed and/alt/rep : 981/13043/981 causal constraints in 103 ms.
[2020-06-03 15:35:33] [INFO ] Added : 470 causal constraints over 94 iterations in 18259 ms. Result :unknown
Applied a total of 0 rules in 22 ms. Remains 412 /412 variables (removed 0) and now considering 996/996 (removed 0) transitions.
// Phase 1: matrix 996 rows 412 cols
[2020-06-03 15:35:33] [INFO ] Computed 38 place invariants in 17 ms
[2020-06-03 15:35:33] [INFO ] [Real]Absence check using 11 positive place invariants in 34 ms returned sat
[2020-06-03 15:35:33] [INFO ] [Real]Absence check using 11 positive and 27 generalized place invariants in 31 ms returned sat
[2020-06-03 15:35:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:35:35] [INFO ] [Real]Absence check using state equation in 1800 ms returned sat
[2020-06-03 15:35:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:35:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 33 ms returned sat
[2020-06-03 15:35:35] [INFO ] [Nat]Absence check using 11 positive and 27 generalized place invariants in 25 ms returned sat
[2020-06-03 15:35:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:35:37] [INFO ] [Nat]Absence check using state equation in 1737 ms returned sat
[2020-06-03 15:35:37] [INFO ] Computed and/alt/rep : 981/13043/981 causal constraints in 103 ms.
[2020-06-03 15:35:56] [INFO ] Added : 450 causal constraints over 90 iterations in 19116 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 121 ms.
[2020-06-03 15:35:56] [INFO ] [Real]Absence check using 11 positive place invariants in 20 ms returned sat
[2020-06-03 15:35:56] [INFO ] [Real]Absence check using 11 positive and 27 generalized place invariants in 19 ms returned sat
[2020-06-03 15:35:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:35:58] [INFO ] [Real]Absence check using state equation in 1460 ms returned sat
[2020-06-03 15:35:58] [INFO ] Computed and/alt/rep : 981/13043/981 causal constraints in 108 ms.
[2020-06-03 15:35:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:35:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 41 ms returned sat
[2020-06-03 15:35:58] [INFO ] [Nat]Absence check using 11 positive and 27 generalized place invariants in 32 ms returned sat
[2020-06-03 15:35:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:36:00] [INFO ] [Nat]Absence check using state equation in 1605 ms returned sat
[2020-06-03 15:36:00] [INFO ] Computed and/alt/rep : 981/13043/981 causal constraints in 124 ms.
[2020-06-03 15:36:21] [INFO ] Added : 315 causal constraints over 63 iterations in 20680 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 93 ms.
[2020-06-03 15:36:21] [INFO ] [Real]Absence check using 11 positive place invariants in 26 ms returned sat
[2020-06-03 15:36:21] [INFO ] [Real]Absence check using 11 positive and 27 generalized place invariants in 26 ms returned sat
[2020-06-03 15:36:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:36:22] [INFO ] [Real]Absence check using state equation in 1547 ms returned sat
[2020-06-03 15:36:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:36:23] [INFO ] [Nat]Absence check using 11 positive place invariants in 25 ms returned sat
[2020-06-03 15:36:23] [INFO ] [Nat]Absence check using 11 positive and 27 generalized place invariants in 21 ms returned sat
[2020-06-03 15:36:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:36:24] [INFO ] [Nat]Absence check using state equation in 1070 ms returned sat
[2020-06-03 15:36:24] [INFO ] Computed and/alt/rep : 981/13043/981 causal constraints in 76 ms.
[2020-06-03 15:36:47] [INFO ] Added : 495 causal constraints over 99 iterations in 22987 ms.(timeout) Result :sat
[2020-06-03 15:36:47] [INFO ] Deduced a trap composed of 33 places in 155 ms
[2020-06-03 15:36:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 476 ms
Attempting to minimize the solution found.
Minimization took 211 ms.
[2020-06-03 15:36:48] [INFO ] [Real]Absence check using 11 positive place invariants in 33 ms returned sat
[2020-06-03 15:36:48] [INFO ] [Real]Absence check using 11 positive and 27 generalized place invariants in 25 ms returned sat
[2020-06-03 15:36:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:36:49] [INFO ] [Real]Absence check using state equation in 1581 ms returned sat
[2020-06-03 15:36:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:36:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 38 ms returned sat
[2020-06-03 15:36:49] [INFO ] [Nat]Absence check using 11 positive and 27 generalized place invariants in 24 ms returned sat
[2020-06-03 15:36:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:36:51] [INFO ] [Nat]Absence check using state equation in 1674 ms returned sat
[2020-06-03 15:36:51] [INFO ] Computed and/alt/rep : 981/13043/981 causal constraints in 116 ms.
[2020-06-03 15:37:15] [INFO ] Added : 490 causal constraints over 98 iterations in 23725 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 143 ms.
[2020-06-03 15:37:15] [INFO ] [Real]Absence check using 11 positive place invariants in 21 ms returned sat
[2020-06-03 15:37:15] [INFO ] [Real]Absence check using 11 positive and 27 generalized place invariants in 17 ms returned sat
[2020-06-03 15:37:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:37:17] [INFO ] [Real]Absence check using state equation in 1507 ms returned sat
[2020-06-03 15:37:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:37:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 27 ms returned sat
[2020-06-03 15:37:17] [INFO ] [Nat]Absence check using 11 positive and 27 generalized place invariants in 19 ms returned sat
[2020-06-03 15:37:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:37:18] [INFO ] [Nat]Absence check using state equation in 1554 ms returned sat
[2020-06-03 15:37:19] [INFO ] Computed and/alt/rep : 981/13043/981 causal constraints in 100 ms.
[2020-06-03 15:37:41] [INFO ] Added : 510 causal constraints over 102 iterations in 22314 ms.(timeout) Result :sat
[2020-06-03 15:37:41] [INFO ] Deduced a trap composed of 26 places in 93 ms
[2020-06-03 15:37:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1205 ms
Attempting to minimize the solution found.
Minimization took 150 ms.
[2020-06-03 15:37:42] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2020-06-03 15:37:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 19 ms.
[2020-06-03 15:37:43] [INFO ] Flatten gal took : 276 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ASLink-PT-04b @ 3570 seconds
FORMULA ASLink-PT-04b-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ASLink-PT-04b-ReachabilityFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 10002532 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16306844 kB
--------------------
content from stderr:
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-04b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# 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-4028"
echo " Executing tool itslola"
echo " Input is ASLink-PT-04b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r166-smll-158987787200071"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-04b.tgz
mv ASLink-PT-04b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;