fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r180-ebro-158987899900246
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for DES-PT-10a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15740.190 3600000.00 82215.00 195.60 TFFFTFFFFTFFFTFF 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.r180-ebro-158987899900246.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 DES-PT-10a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987899900246
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 2.8K Mar 30 01:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 30 01:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:17 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 3.0K Apr 8 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 27 08:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 27 08:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 26 08:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 26 08:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 43K 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 DES-PT-10a-ReachabilityCardinality-00
FORMULA_NAME DES-PT-10a-ReachabilityCardinality-01
FORMULA_NAME DES-PT-10a-ReachabilityCardinality-02
FORMULA_NAME DES-PT-10a-ReachabilityCardinality-03
FORMULA_NAME DES-PT-10a-ReachabilityCardinality-04
FORMULA_NAME DES-PT-10a-ReachabilityCardinality-05
FORMULA_NAME DES-PT-10a-ReachabilityCardinality-06
FORMULA_NAME DES-PT-10a-ReachabilityCardinality-07
FORMULA_NAME DES-PT-10a-ReachabilityCardinality-08
FORMULA_NAME DES-PT-10a-ReachabilityCardinality-09
FORMULA_NAME DES-PT-10a-ReachabilityCardinality-10
FORMULA_NAME DES-PT-10a-ReachabilityCardinality-11
FORMULA_NAME DES-PT-10a-ReachabilityCardinality-12
FORMULA_NAME DES-PT-10a-ReachabilityCardinality-13
FORMULA_NAME DES-PT-10a-ReachabilityCardinality-14
FORMULA_NAME DES-PT-10a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591179005820

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 10:10:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 10:10:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 10:10:09] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2020-06-03 10:10:09] [INFO ] Transformed 155 places.
[2020-06-03 10:10:09] [INFO ] Transformed 112 transitions.
[2020-06-03 10:10:09] [INFO ] Found NUPN structural information;
[2020-06-03 10:10:09] [INFO ] Parsed PT model containing 155 places and 112 transitions in 196 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 43 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-10a-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 221 resets, run finished after 107 ms. (steps per millisecond=93 ) properties seen :[1, 1, 1, 0, 0, 0]
FORMULA DES-PT-10a-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10a-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10a-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 51 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 1, 0]
FORMULA DES-PT-10a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0]
// Phase 1: matrix 98 rows 155 cols
[2020-06-03 10:10:10] [INFO ] Computed 59 place invariants in 24 ms
[2020-06-03 10:10:10] [INFO ] [Real]Absence check using 33 positive place invariants in 61 ms returned sat
[2020-06-03 10:10:10] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 41 ms returned sat
[2020-06-03 10:10:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:10:10] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2020-06-03 10:10:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:10:10] [INFO ] [Nat]Absence check using 33 positive place invariants in 36 ms returned sat
[2020-06-03 10:10:11] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 384 ms returned sat
[2020-06-03 10:10:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:10:11] [INFO ] [Nat]Absence check using state equation in 339 ms returned sat
[2020-06-03 10:10:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 10:10:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2020-06-03 10:10:11] [INFO ] Computed and/alt/rep : 97/364/97 causal constraints in 20 ms.
[2020-06-03 10:10:12] [INFO ] Added : 85 causal constraints over 18 iterations in 773 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2020-06-03 10:10:12] [INFO ] [Real]Absence check using 33 positive place invariants in 56 ms returned sat
[2020-06-03 10:10:12] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 18 ms returned sat
[2020-06-03 10:10:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:10:12] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2020-06-03 10:10:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:10:12] [INFO ] [Nat]Absence check using 33 positive place invariants in 22 ms returned sat
[2020-06-03 10:10:13] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 50 ms returned sat
[2020-06-03 10:10:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:10:13] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2020-06-03 10:10:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2020-06-03 10:10:13] [INFO ] Computed and/alt/rep : 97/364/97 causal constraints in 15 ms.
[2020-06-03 10:10:14] [INFO ] Added : 94 causal constraints over 19 iterations in 510 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 20 ms.
Incomplete Parikh walk after 59000 steps, including 1150 resets, run finished after 323 ms. (steps per millisecond=182 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 31700 steps, including 560 resets, run finished after 166 ms. (steps per millisecond=190 ) properties seen :[0, 0] could not realise parikh vector
Support contains 4 out of 155 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 155/155 places, 98/98 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 155 transition count 96
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 155 transition count 96
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 154 transition count 95
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 10 place count 154 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 153 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 152 transition count 94
Applied a total of 12 rules in 136 ms. Remains 152 /155 variables (removed 3) and now considering 94/98 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 152/155 places, 94/98 transitions.
Incomplete random walk after 1000000 steps, including 13639 resets, run finished after 3535 ms. (steps per millisecond=282 ) properties seen :[1, 0]
FORMULA DES-PT-10a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2272 resets, run finished after 1917 ms. (steps per millisecond=521 ) properties seen :[0]
// Phase 1: matrix 94 rows 152 cols
[2020-06-03 10:10:20] [INFO ] Computed 60 place invariants in 15 ms
[2020-06-03 10:10:20] [INFO ] [Real]Absence check using 35 positive place invariants in 24 ms returned sat
[2020-06-03 10:10:20] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 18 ms returned sat
[2020-06-03 10:10:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:10:20] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2020-06-03 10:10:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:10:20] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2020-06-03 10:10:20] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 56 ms returned sat
[2020-06-03 10:10:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:10:20] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2020-06-03 10:10:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-03 10:10:20] [INFO ] [Nat]Added 2 Read/Feed constraints in 80 ms returned sat
[2020-06-03 10:10:20] [INFO ] Computed and/alt/rep : 91/242/91 causal constraints in 13 ms.
[2020-06-03 10:10:21] [INFO ] Added : 86 causal constraints over 18 iterations in 530 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
Incomplete Parikh walk after 26800 steps, including 368 resets, run finished after 108 ms. (steps per millisecond=248 ) properties seen :[0] could not realise parikh vector
Support contains 2 out of 152 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 14 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 152/152 places, 94/94 transitions.
Incomplete random walk after 1000000 steps, including 13637 resets, run finished after 3195 ms. (steps per millisecond=312 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 2242 resets, run finished after 1689 ms. (steps per millisecond=592 ) properties seen :[0]
Interrupted probabilistic random walk after 10195924 steps, run timeout after 30001 ms. (steps per millisecond=339 ) properties seen :[0]
Probabilistic random walk after 10195924 steps, saw 1291140 distinct states, run finished after 30002 ms. (steps per millisecond=339 ) properties seen :[0]
// Phase 1: matrix 94 rows 152 cols
[2020-06-03 10:10:56] [INFO ] Computed 60 place invariants in 4 ms
[2020-06-03 10:10:56] [INFO ] [Real]Absence check using 35 positive place invariants in 29 ms returned sat
[2020-06-03 10:10:56] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 26 ms returned sat
[2020-06-03 10:10:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:10:56] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2020-06-03 10:10:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:10:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 24 ms returned sat
[2020-06-03 10:10:56] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 77 ms returned sat
[2020-06-03 10:10:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:10:57] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2020-06-03 10:10:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-03 10:10:57] [INFO ] [Nat]Added 2 Read/Feed constraints in 79 ms returned sat
[2020-06-03 10:10:57] [INFO ] Computed and/alt/rep : 91/242/91 causal constraints in 24 ms.
[2020-06-03 10:10:57] [INFO ] Added : 86 causal constraints over 18 iterations in 458 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
Incomplete Parikh walk after 26800 steps, including 357 resets, run finished after 97 ms. (steps per millisecond=276 ) properties seen :[0] could not realise parikh vector
Support contains 2 out of 152 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 12 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 152/152 places, 94/94 transitions.
Starting structural reductions, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 10 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
// Phase 1: matrix 94 rows 152 cols
[2020-06-03 10:10:57] [INFO ] Computed 60 place invariants in 4 ms
[2020-06-03 10:10:58] [INFO ] Implicit Places using invariants in 374 ms returned []
// Phase 1: matrix 94 rows 152 cols
[2020-06-03 10:10:58] [INFO ] Computed 60 place invariants in 6 ms
[2020-06-03 10:10:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-03 10:10:59] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1274 ms to find 0 implicit places.
[2020-06-03 10:10:59] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 94 rows 152 cols
[2020-06-03 10:10:59] [INFO ] Computed 60 place invariants in 6 ms
[2020-06-03 10:10:59] [INFO ] Dead Transitions using invariants and state equation in 300 ms returned []
Finished structural reductions, in 1 iterations. Remains : 152/152 places, 94/94 transitions.
Incomplete random walk after 100000 steps, including 1356 resets, run finished after 325 ms. (steps per millisecond=307 ) properties seen :[0]
// Phase 1: matrix 94 rows 152 cols
[2020-06-03 10:10:59] [INFO ] Computed 60 place invariants in 4 ms
[2020-06-03 10:10:59] [INFO ] [Real]Absence check using 35 positive place invariants in 20 ms returned sat
[2020-06-03 10:10:59] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2020-06-03 10:10:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:10:59] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2020-06-03 10:10:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:11:00] [INFO ] [Nat]Absence check using 35 positive place invariants in 29 ms returned sat
[2020-06-03 10:11:00] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 68 ms returned sat
[2020-06-03 10:11:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:11:00] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2020-06-03 10:11:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-03 10:11:00] [INFO ] [Nat]Added 2 Read/Feed constraints in 80 ms returned sat
[2020-06-03 10:11:00] [INFO ] Computed and/alt/rep : 91/242/91 causal constraints in 23 ms.
[2020-06-03 10:11:01] [INFO ] Added : 86 causal constraints over 18 iterations in 532 ms. Result :sat
Applied a total of 0 rules in 11 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
// Phase 1: matrix 94 rows 152 cols
[2020-06-03 10:11:01] [INFO ] Computed 60 place invariants in 3 ms
[2020-06-03 10:11:01] [INFO ] [Real]Absence check using 35 positive place invariants in 26 ms returned sat
[2020-06-03 10:11:01] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2020-06-03 10:11:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:11:01] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2020-06-03 10:11:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:11:01] [INFO ] [Nat]Absence check using 35 positive place invariants in 28 ms returned sat
[2020-06-03 10:11:01] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 68 ms returned sat
[2020-06-03 10:11:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:11:01] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2020-06-03 10:11:01] [INFO ] Computed and/alt/rep : 91/236/91 causal constraints in 17 ms.
[2020-06-03 10:11:02] [INFO ] Added : 86 causal constraints over 18 iterations in 575 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2020-06-03 10:11:02] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2020-06-03 10:11:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 13 ms.
[2020-06-03 10:11:02] [INFO ] Flatten gal took : 130 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ DES-PT-10a @ 3570 seconds

FORMULA DES-PT-10a-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for ReachabilityCardinality @ DES-PT-10a

{
"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",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 10:11:03 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 17552,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((((p21 <= 0)) OR ((1 <= p7)))))",
"processed_size": 38,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 463,
"conflict_clusters": 40,
"places": 152,
"places_significant": 92,
"singleton_clusters": 0,
"transitions": 94
},
"result":
{
"edges": 173,
"markings": 174,
"produced_by": "state space",
"value": false
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
lola: LoLA will run for 3570 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: 246/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 152
lola: finding significant places
lola: 152 places, 94 transitions, 92 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 ReachabilityCardinality.xml
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: A (G ((((p21 <= 0)) OR ((1 <= p7)))))
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p21 <= 0)) OR ((1 <= p7)))))
lola: processed formula length: 38
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.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: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p21)) AND ((p7 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
lola: local time limit reached - aborting
lola: RESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 174 markings, 173 edges
lola: memory consumption: 17552 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.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="DES-PT-10a"
export BK_EXAMINATION="ReachabilityCardinality"
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 DES-PT-10a, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-ebro-158987899900246"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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