About the Execution of LoLa+red for DLCround-PT-09b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1328.104 | 35068.00 | 64420.00 | 513.60 | FTTFTFTFTTTTFTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r103-tall-167814478700727.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is DLCround-PT-09b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478700727
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 5.4K Feb 25 18:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Feb 25 18:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 18:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 18:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Feb 25 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 18:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 18:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.3M Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-00
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-01
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-02
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-03
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-04
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-05
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-06
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-07
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-08
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-09
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-10
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-11
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-12
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-13
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-14
FORMULA_NAME DLCround-PT-09b-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1678277370684
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-09b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 12:09:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 12:09:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 12:09:32] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2023-03-08 12:09:32] [INFO ] Transformed 3495 places.
[2023-03-08 12:09:32] [INFO ] Transformed 5439 transitions.
[2023-03-08 12:09:32] [INFO ] Found NUPN structural information;
[2023-03-08 12:09:32] [INFO ] Parsed PT model containing 3495 places and 5439 transitions and 15081 arcs in 331 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 452 ms. (steps per millisecond=22 ) properties (out of 16) seen :7
FORMULA DLCround-PT-09b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 5439 rows 3495 cols
[2023-03-08 12:09:33] [INFO ] Computed 184 place invariants in 39 ms
[2023-03-08 12:09:35] [INFO ] After 1234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-08 12:09:36] [INFO ] [Nat]Absence check using 184 positive place invariants in 136 ms returned sat
[2023-03-08 12:09:41] [INFO ] After 3860ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-08 12:09:41] [INFO ] Deduced a trap composed of 134 places in 589 ms of which 12 ms to minimize.
[2023-03-08 12:09:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 951 ms
[2023-03-08 12:09:43] [INFO ] Deduced a trap composed of 198 places in 672 ms of which 2 ms to minimize.
[2023-03-08 12:09:44] [INFO ] Deduced a trap composed of 206 places in 562 ms of which 3 ms to minimize.
[2023-03-08 12:09:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1752 ms
[2023-03-08 12:09:46] [INFO ] Deduced a trap composed of 137 places in 772 ms of which 10 ms to minimize.
[2023-03-08 12:09:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1080 ms
[2023-03-08 12:09:47] [INFO ] After 10122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1682 ms.
[2023-03-08 12:09:49] [INFO ] After 13920ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
FORMULA DLCround-PT-09b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-09b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 6 properties in 517 ms.
Support contains 85 out of 3495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3495/3495 places, 5439/5439 transitions.
Graph (trivial) has 3101 edges and 3495 vertex of which 536 / 3495 are part of one of the 41 SCC in 13 ms
Free SCC test removed 495 places
Drop transitions removed 555 transitions
Reduce isomorphic transitions removed 555 transitions.
Drop transitions removed 1234 transitions
Trivial Post-agglo rules discarded 1234 transitions
Performed 1234 trivial Post agglomeration. Transition count delta: 1234
Iterating post reduction 0 with 1234 rules applied. Total rules applied 1235 place count 3000 transition count 3650
Reduce places removed 1234 places and 0 transitions.
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 1295 rules applied. Total rules applied 2530 place count 1766 transition count 3589
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 34 rules applied. Total rules applied 2564 place count 1738 transition count 3583
Reduce places removed 2 places and 0 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 3 with 34 rules applied. Total rules applied 2598 place count 1736 transition count 3551
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 36 rules applied. Total rules applied 2634 place count 1704 transition count 3547
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2635 place count 1703 transition count 3547
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 19 Pre rules applied. Total rules applied 2635 place count 1703 transition count 3528
Deduced a syphon composed of 19 places in 17 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 2673 place count 1684 transition count 3528
Discarding 435 places :
Symmetric choice reduction at 6 with 435 rule applications. Total rules 3108 place count 1249 transition count 3093
Iterating global reduction 6 with 435 rules applied. Total rules applied 3543 place count 1249 transition count 3093
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 3545 place count 1249 transition count 3091
Performed 181 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 181 Pre rules applied. Total rules applied 3545 place count 1249 transition count 2910
Deduced a syphon composed of 181 places in 63 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 7 with 362 rules applied. Total rules applied 3907 place count 1068 transition count 2910
Discarding 47 places :
Symmetric choice reduction at 7 with 47 rule applications. Total rules 3954 place count 1021 transition count 2320
Iterating global reduction 7 with 47 rules applied. Total rules applied 4001 place count 1021 transition count 2320
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 4014 place count 1021 transition count 2307
Performed 254 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 254 places in 1 ms
Reduce places removed 254 places and 0 transitions.
Iterating global reduction 8 with 508 rules applied. Total rules applied 4522 place count 767 transition count 2046
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 4529 place count 767 transition count 2039
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 4532 place count 764 transition count 2000
Iterating global reduction 9 with 3 rules applied. Total rules applied 4535 place count 764 transition count 2000
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -576
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 9 with 114 rules applied. Total rules applied 4649 place count 707 transition count 2576
Drop transitions removed 57 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 9 with 60 rules applied. Total rules applied 4709 place count 707 transition count 2516
Discarding 10 places :
Symmetric choice reduction at 10 with 10 rule applications. Total rules 4719 place count 697 transition count 2251
Iterating global reduction 10 with 10 rules applied. Total rules applied 4729 place count 697 transition count 2251
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 4737 place count 697 transition count 2243
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 4741 place count 695 transition count 2268
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 4743 place count 695 transition count 2266
Drop transitions removed 150 transitions
Redundant transition composition rules discarded 150 transitions
Iterating global reduction 12 with 150 rules applied. Total rules applied 4893 place count 695 transition count 2116
Discarding 8 places :
Symmetric choice reduction at 12 with 8 rule applications. Total rules 4901 place count 687 transition count 2002
Iterating global reduction 12 with 8 rules applied. Total rules applied 4909 place count 687 transition count 2002
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 4915 place count 687 transition count 1996
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 4921 place count 684 transition count 2033
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 4926 place count 684 transition count 2028
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 14 with 19 rules applied. Total rules applied 4945 place count 684 transition count 2009
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 4949 place count 682 transition count 2034
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 4952 place count 682 transition count 2031
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 15 with 10 rules applied. Total rules applied 4962 place count 682 transition count 2021
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 4964 place count 681 transition count 2033
Free-agglomeration rule applied 313 times with reduction of 145 identical transitions.
Iterating global reduction 15 with 313 rules applied. Total rules applied 5277 place count 681 transition count 1575
Reduce places removed 313 places and 0 transitions.
Drop transitions removed 353 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 366 transitions.
Graph (complete) has 1334 edges and 368 vertex of which 363 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 0 output transitions
Iterating post reduction 15 with 680 rules applied. Total rules applied 5957 place count 363 transition count 1209
Discarding 27 places :
Symmetric choice reduction at 16 with 27 rule applications. Total rules 5984 place count 336 transition count 1127
Iterating global reduction 16 with 27 rules applied. Total rules applied 6011 place count 336 transition count 1127
Drop transitions removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 16 with 64 rules applied. Total rules applied 6075 place count 336 transition count 1063
Discarding 10 places :
Symmetric choice reduction at 16 with 10 rule applications. Total rules 6085 place count 326 transition count 1029
Iterating global reduction 16 with 10 rules applied. Total rules applied 6095 place count 326 transition count 1029
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 6096 place count 326 transition count 1028
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 16 with 10 rules applied. Total rules applied 6106 place count 325 transition count 1019
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 17 with 5 rules applied. Total rules applied 6111 place count 325 transition count 1014
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 6112 place count 325 transition count 1051
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 17 with 10 rules applied. Total rules applied 6122 place count 324 transition count 1042
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 18 with 24 rules applied. Total rules applied 6146 place count 324 transition count 1018
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 18 with 10 rules applied. Total rules applied 6156 place count 324 transition count 1018
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 18 with 3 rules applied. Total rules applied 6159 place count 324 transition count 1015
Applied a total of 6159 rules in 1845 ms. Remains 324 /3495 variables (removed 3171) and now considering 1015/5439 (removed 4424) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1846 ms. Remains : 324/3495 places, 1015/5439 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 3) seen :1
FORMULA DLCround-PT-09b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 12:09:51] [INFO ] Flow matrix only has 539 transitions (discarded 476 similar events)
// Phase 1: matrix 539 rows 324 cols
[2023-03-08 12:09:51] [INFO ] Computed 142 place invariants in 4 ms
[2023-03-08 12:09:51] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 12:09:52] [INFO ] [Nat]Absence check using 142 positive place invariants in 31 ms returned sat
[2023-03-08 12:09:52] [INFO ] After 351ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 12:09:52] [INFO ] State equation strengthened by 129 read => feed constraints.
[2023-03-08 12:09:52] [INFO ] After 148ms SMT Verify possible using 129 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 12:09:52] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 1 ms to minimize.
[2023-03-08 12:09:52] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 2 ms to minimize.
[2023-03-08 12:09:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 227 ms
[2023-03-08 12:09:52] [INFO ] After 517ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 126 ms.
[2023-03-08 12:09:53] [INFO ] After 1140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 47 ms.
Support contains 80 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 1015/1015 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 324 transition count 1014
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 323 transition count 1014
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 322 transition count 1009
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 322 transition count 1009
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 321 transition count 1017
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 15 place count 321 transition count 1008
Free-agglomeration rule applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 321 transition count 1005
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 31 place count 318 transition count 995
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 35 place count 318 transition count 991
Applied a total of 35 rules in 79 ms. Remains 318 /324 variables (removed 6) and now considering 991/1015 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 318/324 places, 991/1015 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 326776 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 326776 steps, saw 276222 distinct states, run finished after 3002 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-08 12:09:56] [INFO ] Flow matrix only has 519 transitions (discarded 472 similar events)
// Phase 1: matrix 519 rows 318 cols
[2023-03-08 12:09:56] [INFO ] Computed 141 place invariants in 4 ms
[2023-03-08 12:09:56] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 12:09:56] [INFO ] [Nat]Absence check using 141 positive place invariants in 18 ms returned sat
[2023-03-08 12:09:56] [INFO ] After 233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 12:09:56] [INFO ] State equation strengthened by 134 read => feed constraints.
[2023-03-08 12:09:56] [INFO ] After 163ms SMT Verify possible using 134 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 12:09:57] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2023-03-08 12:09:57] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2023-03-08 12:09:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 152 ms
[2023-03-08 12:09:57] [INFO ] After 452ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 145 ms.
[2023-03-08 12:09:57] [INFO ] After 927ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 80 out of 318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 991/991 transitions.
Applied a total of 0 rules in 12 ms. Remains 318 /318 variables (removed 0) and now considering 991/991 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 318/318 places, 991/991 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 991/991 transitions.
Applied a total of 0 rules in 12 ms. Remains 318 /318 variables (removed 0) and now considering 991/991 (removed 0) transitions.
[2023-03-08 12:09:57] [INFO ] Flow matrix only has 519 transitions (discarded 472 similar events)
[2023-03-08 12:09:57] [INFO ] Invariant cache hit.
[2023-03-08 12:09:57] [INFO ] Implicit Places using invariants in 228 ms returned [219, 244, 249, 250, 251, 256, 263, 266, 267, 275, 276, 277, 278, 279, 280, 285, 288, 289, 290, 291, 292, 293, 294, 295, 298, 304, 305, 306, 311, 312, 315]
Discarding 31 places :
Ensure Unique test removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Implicit Place search using SMT only with invariants took 230 ms to find 31 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 287/318 places, 900/991 transitions.
Graph (trivial) has 32 edges and 287 vertex of which 10 / 287 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 37 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 38 transitions.
Drop transitions removed 243 transitions
Redundant transition composition rules discarded 243 transitions
Iterating global reduction 0 with 243 rules applied. Total rules applied 244 place count 282 transition count 619
Reduce places removed 3 places and 0 transitions.
Graph (complete) has 835 edges and 279 vertex of which 273 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 4 rules applied. Total rules applied 248 place count 273 transition count 619
Drop transitions removed 6 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 259 place count 273 transition count 608
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 292 place count 240 transition count 516
Iterating global reduction 2 with 33 rules applied. Total rules applied 325 place count 240 transition count 516
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 327 place count 240 transition count 514
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 330 place count 240 transition count 511
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 333 place count 237 transition count 511
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 342 place count 237 transition count 511
Applied a total of 342 rules in 45 ms. Remains 237 /287 variables (removed 50) and now considering 511/900 (removed 389) transitions.
[2023-03-08 12:09:57] [INFO ] Flow matrix only has 438 transitions (discarded 73 similar events)
// Phase 1: matrix 438 rows 237 cols
[2023-03-08 12:09:57] [INFO ] Computed 72 place invariants in 2 ms
[2023-03-08 12:09:57] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-03-08 12:09:57] [INFO ] Flow matrix only has 438 transitions (discarded 73 similar events)
[2023-03-08 12:09:57] [INFO ] Invariant cache hit.
[2023-03-08 12:09:58] [INFO ] State equation strengthened by 88 read => feed constraints.
[2023-03-08 12:09:58] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 237/318 places, 511/991 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 797 ms. Remains : 237/318 places, 511/991 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 463049 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :{}
Probabilistic random walk after 463049 steps, saw 393796 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-08 12:10:01] [INFO ] Flow matrix only has 438 transitions (discarded 73 similar events)
[2023-03-08 12:10:01] [INFO ] Invariant cache hit.
[2023-03-08 12:10:01] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 12:10:01] [INFO ] [Nat]Absence check using 72 positive place invariants in 8 ms returned sat
[2023-03-08 12:10:01] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 12:10:01] [INFO ] State equation strengthened by 88 read => feed constraints.
[2023-03-08 12:10:01] [INFO ] After 108ms SMT Verify possible using 88 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 12:10:01] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2023-03-08 12:10:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-03-08 12:10:01] [INFO ] After 281ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 95 ms.
[2023-03-08 12:10:02] [INFO ] After 629ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 80 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 511/511 transitions.
Applied a total of 0 rules in 16 ms. Remains 237 /237 variables (removed 0) and now considering 511/511 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 237/237 places, 511/511 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 511/511 transitions.
Applied a total of 0 rules in 43 ms. Remains 237 /237 variables (removed 0) and now considering 511/511 (removed 0) transitions.
[2023-03-08 12:10:02] [INFO ] Flow matrix only has 438 transitions (discarded 73 similar events)
[2023-03-08 12:10:02] [INFO ] Invariant cache hit.
[2023-03-08 12:10:02] [INFO ] Implicit Places using invariants in 285 ms returned []
[2023-03-08 12:10:02] [INFO ] Flow matrix only has 438 transitions (discarded 73 similar events)
[2023-03-08 12:10:02] [INFO ] Invariant cache hit.
[2023-03-08 12:10:02] [INFO ] State equation strengthened by 88 read => feed constraints.
[2023-03-08 12:10:02] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
[2023-03-08 12:10:02] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-08 12:10:02] [INFO ] Flow matrix only has 438 transitions (discarded 73 similar events)
[2023-03-08 12:10:02] [INFO ] Invariant cache hit.
[2023-03-08 12:10:02] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 822 ms. Remains : 237/237 places, 511/511 transitions.
Graph (trivial) has 130 edges and 237 vertex of which 39 / 237 are part of one of the 19 SCC in 0 ms
Free SCC test removed 20 places
Drop transitions removed 80 transitions
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 156 transitions.
Graph (complete) has 513 edges and 217 vertex of which 204 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 204 transition count 354
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 203 transition count 354
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 203 transition count 349
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 198 transition count 349
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 21 place count 191 transition count 342
Iterating global reduction 2 with 7 rules applied. Total rules applied 28 place count 191 transition count 342
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 2 with 12 rules applied. Total rules applied 40 place count 185 transition count 336
Drop transitions removed 1 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 49 place count 185 transition count 327
Renaming transitions due to excessive name length > 1024 char.
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 51 place count 183 transition count 321
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 183 transition count 321
Drop transitions removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 3 with 35 rules applied. Total rules applied 88 place count 183 transition count 286
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 10 rules applied. Total rules applied 98 place count 174 transition count 285
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 100 place count 173 transition count 284
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 101 place count 172 transition count 284
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 101 place count 172 transition count 283
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 103 place count 171 transition count 283
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 104 place count 171 transition count 282
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 106 place count 171 transition count 280
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 108 place count 169 transition count 280
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 7 with 11 rules applied. Total rules applied 119 place count 169 transition count 280
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 120 place count 169 transition count 279
Applied a total of 120 rules in 67 ms. Remains 169 /237 variables (removed 68) and now considering 279/511 (removed 232) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 279 rows 169 cols
[2023-03-08 12:10:03] [INFO ] Computed 43 place invariants in 1 ms
[2023-03-08 12:10:03] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 12:10:03] [INFO ] [Nat]Absence check using 43 positive place invariants in 5 ms returned sat
[2023-03-08 12:10:03] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 12:10:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 12:10:03] [INFO ] After 62ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 12:10:03] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 153 ms.
[2023-03-08 12:10:03] [INFO ] After 510ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-08 12:10:03] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-08 12:10:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 237 places, 511 transitions and 2416 arcs took 15 ms.
[2023-03-08 12:10:04] [INFO ] Flatten gal took : 166 ms
Total runtime 32022 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DLCround-PT-09b
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
ReachabilityFireability
FORMULA DLCround-PT-09b-ReachabilityFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCround-PT-09b-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678277405752
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/ReachabilityFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 11 (type EXCL) for 0 DLCround-PT-09b-ReachabilityFireability-05
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 7 (type FNDP) for 0 DLCround-PT-09b-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 8 (type EQUN) for 0 DLCround-PT-09b-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 10 (type SRCH) for 0 DLCround-PT-09b-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 7 (type FNDP) for DLCround-PT-09b-ReachabilityFireability-05
lola: result : true
lola: fired transitions : 19
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 8 (type EQUN) for DLCround-PT-09b-ReachabilityFireability-05 (obsolete)
lola: CANCELED task # 10 (type SRCH) for DLCround-PT-09b-ReachabilityFireability-05 (obsolete)
lola: CANCELED task # 11 (type EXCL) for DLCround-PT-09b-ReachabilityFireability-05 (obsolete)
lola: LAUNCH task # 17 (type EXCL) for 3 DLCround-PT-09b-ReachabilityFireability-15
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 13 (type FNDP) for 3 DLCround-PT-09b-ReachabilityFireability-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 14 (type EQUN) for 3 DLCround-PT-09b-ReachabilityFireability-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 16 (type SRCH) for 3 DLCround-PT-09b-ReachabilityFireability-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 16 (type SRCH) for DLCround-PT-09b-ReachabilityFireability-15
lola: result : true
lola: markings : 11
lola: fired transitions : 10
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 13 (type FNDP) for DLCround-PT-09b-ReachabilityFireability-15 (obsolete)
lola: CANCELED task # 14 (type EQUN) for DLCround-PT-09b-ReachabilityFireability-15 (obsolete)
lola: CANCELED task # 17 (type EXCL) for DLCround-PT-09b-ReachabilityFireability-15 (obsolete)
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DLCround-PT-09b-ReachabilityFireability-05: AG false findpath
DLCround-PT-09b-ReachabilityFireability-15: EF true tandem / insertion
Time elapsed: 0 secs. Pages in use: 3
lola: rewrite Frontend/Parser/formula_rewrite.k:711
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="DLCround-PT-09b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is DLCround-PT-09b, 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 r103-tall-167814478700727"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-09b.tgz
mv DLCround-PT-09b 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 ;