About the Execution of ITS-LoLa for BART-PT-060
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15744.330 | 3600000.00 | 55102.00 | 66.30 | TTFTFFTTFTTTFTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2020-input.r182-oct2-158987913400127.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is BART-PT-060, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913400127
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 28M
-rw-r--r-- 1 mcc users 3.7K Apr 15 13:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 15 13:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Apr 15 13:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 15 13:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 1.9M Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 4.9M Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8M Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 4.6M Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Apr 15 13:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 15 13:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 15 13:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Apr 15 13:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 15 13:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 15 13:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 15M 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 BART-PT-060-ReachabilityFireability-00
FORMULA_NAME BART-PT-060-ReachabilityFireability-01
FORMULA_NAME BART-PT-060-ReachabilityFireability-02
FORMULA_NAME BART-PT-060-ReachabilityFireability-03
FORMULA_NAME BART-PT-060-ReachabilityFireability-04
FORMULA_NAME BART-PT-060-ReachabilityFireability-05
FORMULA_NAME BART-PT-060-ReachabilityFireability-06
FORMULA_NAME BART-PT-060-ReachabilityFireability-07
FORMULA_NAME BART-PT-060-ReachabilityFireability-08
FORMULA_NAME BART-PT-060-ReachabilityFireability-09
FORMULA_NAME BART-PT-060-ReachabilityFireability-10
FORMULA_NAME BART-PT-060-ReachabilityFireability-11
FORMULA_NAME BART-PT-060-ReachabilityFireability-12
FORMULA_NAME BART-PT-060-ReachabilityFireability-13
FORMULA_NAME BART-PT-060-ReachabilityFireability-14
FORMULA_NAME BART-PT-060-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1591128121584
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 20:02:03] [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-02 20:02:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 20:02:03] [INFO ] Load time of PNML (sax parser for PT used): 452 ms
[2020-06-02 20:02:03] [INFO ] Transformed 8130 places.
[2020-06-02 20:02:03] [INFO ] Transformed 12120 transitions.
[2020-06-02 20:02:03] [INFO ] Found NUPN structural information;
[2020-06-02 20:02:03] [INFO ] Parsed PT model containing 8130 places and 12120 transitions in 556 ms.
Reduce places removed 210 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 174 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 185 ms. (steps per millisecond=54 ) properties seen :[1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1]
FORMULA BART-PT-060-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 12120 rows 7920 cols
[2020-06-02 20:02:04] [INFO ] Computed 60 place invariants in 228 ms
[2020-06-02 20:02:05] [INFO ] [Real]Absence check using 60 positive place invariants in 512 ms returned sat
[2020-06-02 20:02:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:02:09] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:02:09] [INFO ] [Real]Absence check using state equation in 3715 ms returned (error "Failed to check-sat")
[2020-06-02 20:02:11] [INFO ] [Real]Absence check using 60 positive place invariants in 479 ms returned sat
[2020-06-02 20:02:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:02:14] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:02:14] [INFO ] [Real]Absence check using state equation in 3354 ms returned (error "Failed to check-sat")
[2020-06-02 20:02:15] [INFO ] [Real]Absence check using 60 positive place invariants in 461 ms returned sat
[2020-06-02 20:02:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:02:19] [INFO ] [Real]Absence check using state equation in 3957 ms returned (error "Failed to check-sat")
[2020-06-02 20:02:20] [INFO ] [Real]Absence check using 60 positive place invariants in 607 ms returned sat
[2020-06-02 20:02:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:02:24] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:02:24] [INFO ] [Real]Absence check using state equation in 3833 ms returned (error "Failed to check-sat")
[2020-06-02 20:02:26] [INFO ] [Real]Absence check using 60 positive place invariants in 632 ms returned sat
[2020-06-02 20:02:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:02:29] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:02:29] [INFO ] [Real]Absence check using state equation in 3055 ms returned (error "Failed to check-sat")
[2020-06-02 20:02:30] [INFO ] [Real]Absence check using 60 positive place invariants in 470 ms returned sat
[2020-06-02 20:02:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:02:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:02:34] [INFO ] [Real]Absence check using state equation in 3952 ms returned (error "Failed to check-sat")
[2020-06-02 20:02:35] [INFO ] [Real]Absence check using 60 positive place invariants in 475 ms returned sat
[2020-06-02 20:02:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:02:39] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:02:39] [INFO ] [Real]Absence check using state equation in 3928 ms returned (error "Failed to check-sat")
[2020-06-02 20:02:40] [INFO ] [Real]Absence check using 60 positive place invariants in 477 ms returned sat
[2020-06-02 20:02:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:02:44] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:02:44] [INFO ] [Real]Absence check using state equation in 3974 ms returned (error "Failed to check-sat")
Support contains 21 out of 7920 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 7920/7920 places, 12120/12120 transitions.
Graph (trivial) has 11964 edges and 7920 vertex of which 7455 / 7920 are part of one of the 57 SCC in 65 ms
Free SCC test removed 7398 places
Discarding 40 places :
Also discarding 8080 output transitions
Drop transitions removed 8080 transitions
Graph (complete) has 704 edges and 522 vertex of which 482 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.24 ms
Drop transitions removed 3332 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 3336 transitions.
Performed 227 Post agglomeration using F-continuation condition.Transition count delta: 227
Iterating post reduction 0 with 3563 rules applied. Total rules applied 3565 place count 482 transition count 477
Reduce places removed 227 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 234 rules applied. Total rules applied 3799 place count 255 transition count 470
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 3804 place count 253 transition count 467
Reduce places removed 1 places and 0 transitions.
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 3 with 3 rules applied. Total rules applied 3807 place count 252 transition count 465
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3809 place count 251 transition count 464
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 3809 place count 251 transition count 444
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 3849 place count 231 transition count 444
Symmetric choice reduction at 5 with 21 rule applications. Total rules 3870 place count 231 transition count 444
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 21 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 3912 place count 210 transition count 423
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 3918 place count 210 transition count 417
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 3918 place count 210 transition count 414
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 3924 place count 207 transition count 414
Symmetric choice reduction at 6 with 12 rule applications. Total rules 3936 place count 207 transition count 414
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 12 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 3960 place count 195 transition count 402
Symmetric choice reduction at 6 with 9 rule applications. Total rules 3969 place count 195 transition count 402
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 3987 place count 186 transition count 393
Symmetric choice reduction at 6 with 9 rule applications. Total rules 3996 place count 186 transition count 393
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 4014 place count 177 transition count 384
Symmetric choice reduction at 6 with 6 rule applications. Total rules 4020 place count 177 transition count 384
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 4032 place count 171 transition count 378
Symmetric choice reduction at 6 with 6 rule applications. Total rules 4038 place count 171 transition count 378
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 4050 place count 165 transition count 372
Symmetric choice reduction at 6 with 3 rule applications. Total rules 4053 place count 165 transition count 372
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 4059 place count 162 transition count 369
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 4101 place count 141 transition count 348
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 4113 place count 141 transition count 336
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 4125 place count 135 transition count 330
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 4137 place count 135 transition count 318
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 4149 place count 129 transition count 312
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 4161 place count 129 transition count 300
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 9 with 12 rules applied. Total rules applied 4173 place count 123 transition count 294
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 4185 place count 123 transition count 282
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 10 with 12 rules applied. Total rules applied 4197 place count 117 transition count 276
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 10 with 12 rules applied. Total rules applied 4209 place count 117 transition count 264
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 11 with 12 rules applied. Total rules applied 4221 place count 111 transition count 258
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 4233 place count 111 transition count 246
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 12 with 12 rules applied. Total rules applied 4245 place count 105 transition count 240
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 12 with 12 rules applied. Total rules applied 4257 place count 105 transition count 228
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 13 with 12 rules applied. Total rules applied 4269 place count 99 transition count 222
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 13 with 12 rules applied. Total rules applied 4281 place count 99 transition count 210
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 14 with 12 rules applied. Total rules applied 4293 place count 93 transition count 204
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 14 with 12 rules applied. Total rules applied 4305 place count 93 transition count 192
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 15 with 12 rules applied. Total rules applied 4317 place count 87 transition count 186
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 15 with 12 rules applied. Total rules applied 4329 place count 87 transition count 174
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 16 with 12 rules applied. Total rules applied 4341 place count 81 transition count 168
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 16 with 12 rules applied. Total rules applied 4353 place count 81 transition count 156
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 17 with 12 rules applied. Total rules applied 4365 place count 75 transition count 150
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 17 with 12 rules applied. Total rules applied 4377 place count 75 transition count 138
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 18 with 12 rules applied. Total rules applied 4389 place count 69 transition count 132
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 18 with 12 rules applied. Total rules applied 4401 place count 69 transition count 120
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 19 with 12 rules applied. Total rules applied 4413 place count 63 transition count 114
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 19 with 12 rules applied. Total rules applied 4425 place count 63 transition count 102
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 20 with 12 rules applied. Total rules applied 4437 place count 57 transition count 96
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 20 with 12 rules applied. Total rules applied 4449 place count 57 transition count 84
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 21 with 12 rules applied. Total rules applied 4461 place count 51 transition count 78
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 21 with 12 rules applied. Total rules applied 4473 place count 51 transition count 66
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 22 with 12 rules applied. Total rules applied 4485 place count 45 transition count 60
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 22 with 13 rules applied. Total rules applied 4498 place count 45 transition count 47
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 4 rules applied. Total rules applied 4502 place count 43 transition count 45
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 24 with 2 rules applied. Total rules applied 4504 place count 42 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 4505 place count 42 transition count 43
Applied a total of 4505 rules in 259 ms. Remains 42 /7920 variables (removed 7878) and now considering 43/12120 (removed 12077) transitions.
Finished structural reductions, in 1 iterations. Remains : 42/7920 places, 43/12120 transitions.
Finished random walk after 222 steps, including 0 resets, run visited all 8 properties in 2 ms. (steps per millisecond=111 )
FORMULA BART-PT-060-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
--------------------
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="BART-PT-060"
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 BART-PT-060, 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 r182-oct2-158987913400127"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BART-PT-060.tgz
mv BART-PT-060 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 ;