fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r218-tajo-159033491200461
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for ShieldPPPt-PT-100B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.420 1800000.00 767430.00 135.30 T normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r218-tajo-159033491200461.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 ShieldPPPt-PT-100B, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r218-tajo-159033491200461
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 4.0K May 14 02:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 02:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 13 19:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 13 19:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 14 10:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 14 10:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.3K May 13 14:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 14:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 09:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 09:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 1.9M May 12 20:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1591347941936

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 09:05:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 1800, -rebuildPNML]
[2020-06-05 09:05:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 09:05:43] [INFO ] Load time of PNML (sax parser for PT used): 259 ms
[2020-06-05 09:05:44] [INFO ] Transformed 7803 places.
[2020-06-05 09:05:44] [INFO ] Transformed 7103 transitions.
[2020-06-05 09:05:44] [INFO ] Found NUPN structural information;
[2020-06-05 09:05:44] [INFO ] Parsed PT model containing 7803 places and 7103 transitions in 668 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 280 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 10 ms.56739KB memory used
Starting structural reductions, iteration 0 : 7803/7803 places, 7103/7103 transitions.
Performed 1903 Post agglomeration using F-continuation condition.Transition count delta: 1903
Iterating post reduction 0 with 1903 rules applied. Total rules applied 1903 place count 7803 transition count 5200
Reduce places removed 1903 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 1 with 1905 rules applied. Total rules applied 3808 place count 5900 transition count 5198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3809 place count 5899 transition count 5198
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 3809 place count 5899 transition count 4798
Deduced a syphon composed of 400 places in 30 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 4609 place count 5499 transition count 4798
Symmetric choice reduction at 3 with 700 rule applications. Total rules 5309 place count 5499 transition count 4798
Deduced a syphon composed of 700 places in 83 ms
Reduce places removed 700 places and 700 transitions.
Iterating global reduction 3 with 1400 rules applied. Total rules applied 6709 place count 4799 transition count 4098
Performed 300 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 300 Pre rules applied. Total rules applied 6709 place count 4799 transition count 3798
Deduced a syphon composed of 300 places in 23 ms
Reduce places removed 300 places and 0 transitions.
Iterating global reduction 3 with 600 rules applied. Total rules applied 7309 place count 4499 transition count 3798
Performed 1699 Post agglomeration using F-continuation condition.Transition count delta: 1699
Deduced a syphon composed of 1699 places in 10 ms
Reduce places removed 1699 places and 0 transitions.
Iterating global reduction 3 with 3398 rules applied. Total rules applied 10707 place count 2800 transition count 2099
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 10 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 10909 place count 2699 transition count 2099
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 9 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 11111 place count 2598 transition count 2099
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 11305 place count 2501 transition count 2099
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 11306 place count 2500 transition count 2098
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 11307 place count 2499 transition count 2098
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 11307 place count 2499 transition count 2096
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 11311 place count 2497 transition count 2096
Applied a total of 11311 rules in 3788 ms. Remains 2497 /7803 variables (removed 5306) and now considering 2096/7103 (removed 5007) transitions.
Finished structural reductions, in 1 iterations. Remains : 2497/7803 places, 2096/7103 transitions.
Random walk for 1250000 steps, including 0 resets, run took 15856 ms (no deadlock found). (steps per millisecond=78 )
Random directed walk for 1250000 steps, including 0 resets, run took 13392 ms (no deadlock found). (steps per millisecond=93 )
// Phase 1: matrix 2096 rows 2497 cols
[2020-06-05 09:06:17] [INFO ] Computed 1100 place invariants in 86 ms
[2020-06-05 09:06:23] [INFO ] [Real]Absence check using 1100 positive place invariants in 3520 ms returned sat
[2020-06-05 09:06:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 09:06:47] [INFO ] [Real]Absence check using state equation in 23855 ms returned sat
[2020-06-05 09:06:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 09:06:51] [INFO ] [Nat]Absence check using 1100 positive place invariants in 2304 ms returned sat
[2020-06-05 09:06:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 09:07:09] [INFO ] [Nat]Absence check using state equation in 18179 ms returned sat
[2020-06-05 09:07:10] [INFO ] Computed and/alt/rep : 2092/3289/2092 causal constraints in 317 ms.
[2020-06-05 09:07:30] [INFO ] Added : 470 causal constraints over 94 iterations in 20248 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 137 ms.
Parikh directed walk for 744700 steps, including 1000 resets, run took 9418 ms. (steps per millisecond=79 )
Random directed walk for 500001 steps, including 0 resets, run took 4777 ms (no deadlock found). (steps per millisecond=104 )
Random walk for 500000 steps, including 0 resets, run took 5696 ms (no deadlock found). (steps per millisecond=87 )
Random directed walk for 500002 steps, including 0 resets, run took 4932 ms (no deadlock found). (steps per millisecond=101 )
Random walk for 500000 steps, including 0 resets, run took 5839 ms (no deadlock found). (steps per millisecond=85 )
[2020-06-05 09:08:02] [INFO ] Flatten gal took : 717 ms
[2020-06-05 09:08:02] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 1 ms.
[2020-06-05 09:08:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 54 ms.
info: Time: 1800 - MCC
vrfy: Checking ReachabilityDeadlock @ ShieldPPPt-PT-100B @ 1770 seconds

FORMULA ReachabilityDeadlock TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1468
rslt: Output for ReachabilityDeadlock @ ShieldPPPt-PT-100B

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityDeadlock.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=combined",
"--siphontrap=par",
"--siphondepth=10",
"--findpath=par",
"--retrylimit=0",
"--depthlimit=1000000",
"--symmetry",
"--symmtimelimit=300",
"--threads=2",
"--symmetrydepth=1073741824",
"--timelimit=1770",
"--json=ReachabilityDeadlock.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Jun 5 09:08:02 2020
",
"timelimit": 1770
},
"child": null,
"exit":
{
"error": null,
"memory": 8677656,
"runtime": 302.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityDeadlock.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 1,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "E (F (DEADLOCK))",
"processed_size": 16,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 17806,
"conflict_clusters": 6403,
"places": 7803,
"places_significant": 6702,
"singleton_clusters": 0,
"transitions": 7103
},
"result":
{
"edges": 6530876,
"markings": 6154801,
"produced_by": "state space",
"value": true
},
"task":
{
"findpath":
{
"depthlimit": 1000000,
"retrylimit": null,
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 2
},
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"symmetry":
{
"card": 1.000000,
"composed": 0,
"dead_branches": 0,
"generators": 0,
"interrupted": false,
"real_computed": 0,
"timelimit": 300
},
"threads": 2,
"type": "dfs"
},
"type": "reachability",
"workflow": "findpath||search"
}
}
lola: LoLA will run for 1770 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 14906/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 249696
lola: finding significant places
lola: 7803 places, 7103 transitions, 6702 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityDeadlock.xml
lola: E (F (DEADLOCK))
lola: checking reachability
lola: Planning: workflow for reachability check: findpath||search (--findpath=par)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (DEADLOCK))
lola: processed formula length: 16
lola: 1 rewrites
lola: closed formula file ReachabilityDeadlock.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: SEARCH (findpath)
lola: findpath: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: computing symmetries (--symmetry)
lola: time limit for symmetry computation of 300 seconds given (--symmtimelimit)
lola: findpath: starting randomized, memory-less exploration (--findpath)
lola: findpath: searching for paths with maximal depth 1000000 (--depthlimit)
lola: findpath: no retry limit given (--retrylimit)
lola: findpath: transitions are chosen hash-driven
lola: computed 0 generators (0 in search tree, 0 by composition)
lola: representing 1 symmetries
lola: 0 dead branches visited in search tree
lola: 1 tries, 237594 fired transitions, 0 secs || 84932 markings, 89600 edges, 16986 markings/sec, 0 secs
lola: 1 tries, 490876 fired transitions, 5 secs || 185500 markings, 196119 edges, 20114 markings/sec, 5 secs
lola: 1 tries, 737245 fired transitions, 10 secs || 279552 markings, 295722 edges, 18810 markings/sec, 10 secs
lola: 1 tries, 984191 fired transitions, 15 secs || 374820 markings, 396741 edges, 19054 markings/sec, 15 secs
lola: 2 tries, 1234337 fired transitions, 20 secs || 470793 markings, 498434 edges, 19195 markings/sec, 20 secs
lola: 2 tries, 1484447 fired transitions, 25 secs || 568019 markings, 601362 edges, 19445 markings/sec, 25 secs
lola: 2 tries, 1734744 fired transitions, 30 secs || 663611 markings, 702552 edges, 19118 markings/sec, 30 secs
lola: 3 tries, 2057502 fired transitions, 35 secs || 765395 markings, 810485 edges, 20357 markings/sec, 35 secs
lola: 3 tries, 2384389 fired transitions, 40 secs || 868963 markings, 920214 edges, 20714 markings/sec, 40 secs
lola: 3 tries, 2725681 fired transitions, 45 secs || 978746 markings, 1036842 edges, 21957 markings/sec, 45 secs
lola: 4 tries, 3060709 fired transitions, 50 secs || 1081561 markings, 1145836 edges, 20563 markings/sec, 50 secs
lola: 4 tries, 3357957 fired transitions, 55 secs || 1186982 markings, 1257530 edges, 21084 markings/sec, 55 secs
lola: 4 tries, 3682234 fired transitions, 60 secs || 1288734 markings, 1365322 edges, 20350 markings/sec, 60 secs
lola: 5 tries, 4031757 fired transitions, 65 secs || 1400103 markings, 1483416 edges, 22274 markings/sec, 65 secs
lola: 5 tries, 4376353 fired transitions, 70 secs || 1510238 markings, 1600227 edges, 22027 markings/sec, 70 secs
lola: 5 tries, 4721509 fired transitions, 75 secs || 1619496 markings, 1716220 edges, 21852 markings/sec, 75 secs
lola: 6 tries, 5018130 fired transitions, 80 secs || 1719834 markings, 1822456 edges, 20068 markings/sec, 80 secs
lola: 6 tries, 5319340 fired transitions, 85 secs || 1825637 markings, 1934660 edges, 21161 markings/sec, 85 secs
lola: 6 tries, 5622888 fired transitions, 90 secs || 1931293 markings, 2046730 edges, 21131 markings/sec, 90 secs
lola: 6 tries, 5927323 fired transitions, 95 secs || 2036541 markings, 2158336 edges, 21050 markings/sec, 95 secs
lola: 7 tries, 6231733 fired transitions, 100 secs || 2141870 markings, 2270106 edges, 21066 markings/sec, 100 secs
lola: 7 tries, 6534408 fired transitions, 105 secs || 2246325 markings, 2380810 edges, 20891 markings/sec, 105 secs
lola: 7 tries, 6837172 fired transitions, 110 secs || 2351380 markings, 2492468 edges, 21011 markings/sec, 110 secs
lola: 8 tries, 7137326 fired transitions, 115 secs || 2457230 markings, 2605075 edges, 21170 markings/sec, 115 secs
lola: 8 tries, 7436287 fired transitions, 120 secs || 2562341 markings, 2716572 edges, 21022 markings/sec, 120 secs
lola: 8 tries, 7738841 fired transitions, 125 secs || 2667472 markings, 2828370 edges, 21026 markings/sec, 125 secs
lola: 9 tries, 8044128 fired transitions, 130 secs || 2772782 markings, 2940162 edges, 21062 markings/sec, 130 secs
lola: 9 tries, 8347583 fired transitions, 135 secs || 2877734 markings, 3051570 edges, 20990 markings/sec, 135 secs
lola: 9 tries, 8652473 fired transitions, 140 secs || 2981032 markings, 3161337 edges, 20660 markings/sec, 140 secs
lola: 9 tries, 8957675 fired transitions, 145 secs || 3083712 markings, 3270522 edges, 20536 markings/sec, 145 secs
lola: 10 tries, 9258692 fired transitions, 150 secs || 3188567 markings, 3381730 edges, 20971 markings/sec, 150 secs
lola: 10 tries, 9563239 fired transitions, 155 secs || 3292979 markings, 3492313 edges, 20882 markings/sec, 155 secs
lola: 10 tries, 9867692 fired transitions, 160 secs || 3396829 markings, 3602381 edges, 20770 markings/sec, 160 secs
lola: 11 tries, 10173479 fired transitions, 165 secs || 3501327 markings, 3713290 edges, 20900 markings/sec, 165 secs
lola: 11 tries, 10477286 fired transitions, 170 secs || 3606462 markings, 3824811 edges, 21027 markings/sec, 170 secs
lola: 11 tries, 10780351 fired transitions, 175 secs || 3711684 markings, 3936904 edges, 21044 markings/sec, 175 secs
lola: 12 tries, 11085218 fired transitions, 180 secs || 3817132 markings, 4049225 edges, 21090 markings/sec, 180 secs
lola: 12 tries, 11388839 fired transitions, 185 secs || 3922903 markings, 4161645 edges, 21154 markings/sec, 185 secs
lola: 12 tries, 11692277 fired transitions, 190 secs || 4028253 markings, 4273574 edges, 21070 markings/sec, 190 secs
lola: 12 tries, 11993734 fired transitions, 195 secs || 4133800 markings, 4385682 edges, 21109 markings/sec, 195 secs
lola: 13 tries, 12299166 fired transitions, 200 secs || 4239105 markings, 4497830 edges, 21061 markings/sec, 200 secs
lola: 13 tries, 12602425 fired transitions, 205 secs || 4344592 markings, 4610033 edges, 21097 markings/sec, 205 secs
lola: 13 tries, 12905842 fired transitions, 210 secs || 4449468 markings, 4721336 edges, 20975 markings/sec, 210 secs
lola: 14 tries, 13211064 fired transitions, 215 secs || 4554583 markings, 4832945 edges, 21023 markings/sec, 215 secs
lola: 14 tries, 13515121 fired transitions, 220 secs || 4659688 markings, 4944781 edges, 21021 markings/sec, 220 secs
lola: 14 tries, 13818011 fired transitions, 225 secs || 4765283 markings, 5056769 edges, 21119 markings/sec, 225 secs
lola: 15 tries, 14122696 fired transitions, 230 secs || 4870119 markings, 5167961 edges, 20967 markings/sec, 230 secs
lola: 15 tries, 14423155 fired transitions, 235 secs || 4975668 markings, 5280354 edges, 21110 markings/sec, 235 secs
lola: 15 tries, 14724883 fired transitions, 240 secs || 5081772 markings, 5392706 edges, 21221 markings/sec, 240 secs
lola: 16 tries, 15030777 fired transitions, 245 secs || 5186202 markings, 5503422 edges, 20886 markings/sec, 245 secs
lola: 16 tries, 15334115 fired transitions, 250 secs || 5291155 markings, 5615095 edges, 20991 markings/sec, 250 secs
lola: 16 tries, 15639072 fired transitions, 255 secs || 5394444 markings, 5724828 edges, 20658 markings/sec, 255 secs
lola: 16 tries, 15943001 fired transitions, 260 secs || 5498252 markings, 5834965 edges, 20762 markings/sec, 260 secs
lola: 17 tries, 16249214 fired transitions, 265 secs || 5602367 markings, 5945346 edges, 20823 markings/sec, 265 secs
lola: 17 tries, 16554708 fired transitions, 270 secs || 5705990 markings, 6055055 edges, 20725 markings/sec, 270 secs
lola: 17 tries, 16859325 fired transitions, 275 secs || 5810554 markings, 6165969 edges, 20913 markings/sec, 275 secs
lola: 18 tries, 17166530 fired transitions, 280 secs || 5913690 markings, 6275371 edges, 20627 markings/sec, 280 secs
lola: 18 tries, 17481320 fired transitions, 285 secs || 6018280 markings, 6386192 edges, 20918 markings/sec, 285 secs
lola: 18 tries, 17788779 fired transitions, 290 secs || 6122594 markings, 6496794 edges, 20863 markings/sec, 290 secs
lola: RESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6154801 markings, 6530876 edges
lola: memory consumption: 8677656 KB
lola: time consumption: 302 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityDeadlock.json
lola: closed JSON file ReachabilityDeadlock.json
rslt: finished

--------------------
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="ShieldPPPt-PT-100B"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 ShieldPPPt-PT-100B, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r218-tajo-159033491200461"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-100B.tgz
mv ShieldPPPt-PT-100B execution
cd execution
if [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "UpperBounds" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] || [ "ReachabilityDeadlock" = "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 [ "ReachabilityDeadlock" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityDeadlock" != "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 "ReachabilityDeadlock.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityDeadlock.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityDeadlock.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 '' ReachabilityDeadlock.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityDeadlock"
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 ;