fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r247-tall-171654353500485
Last Updated
July 7, 2024

About the Execution of LoLA for NeoElection-COL-7

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
770.684 1410.00 1458.00 10.30 0 49 0 7 0 0 42 0 7 0 0 0 7 7 7 42 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r247-tall-171654353500485.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool lola
Input is NeoElection-COL-7, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r247-tall-171654353500485
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 11K Apr 11 19:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 11 19:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 11 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 11 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 21:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 11 21:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 20:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 20:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 108K May 18 16:43 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME NeoElection-COL-7-UpperBounds-00
FORMULA_NAME NeoElection-COL-7-UpperBounds-01
FORMULA_NAME NeoElection-COL-7-UpperBounds-02
FORMULA_NAME NeoElection-COL-7-UpperBounds-03
FORMULA_NAME NeoElection-COL-7-UpperBounds-04
FORMULA_NAME NeoElection-COL-7-UpperBounds-05
FORMULA_NAME NeoElection-COL-7-UpperBounds-06
FORMULA_NAME NeoElection-COL-7-UpperBounds-07
FORMULA_NAME NeoElection-COL-7-UpperBounds-08
FORMULA_NAME NeoElection-COL-7-UpperBounds-09
FORMULA_NAME NeoElection-COL-7-UpperBounds-10
FORMULA_NAME NeoElection-COL-7-UpperBounds-11
FORMULA_NAME NeoElection-COL-7-UpperBounds-12
FORMULA_NAME NeoElection-COL-7-UpperBounds-13
FORMULA_NAME NeoElection-COL-7-UpperBounds-14
FORMULA_NAME NeoElection-COL-7-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717076407782

FORMULA NeoElection-COL-7-UpperBounds-10 0 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeoElection-COL-7-UpperBounds-04 0 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeoElection-COL-7-UpperBounds-00 0 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeoElection-COL-7-UpperBounds-02 0 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeoElection-COL-7-UpperBounds-09 0 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeoElection-COL-7-UpperBounds-07 0 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeoElection-COL-7-UpperBounds-05 0 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeoElection-COL-7-UpperBounds-13 7 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeoElection-COL-7-UpperBounds-06 42 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeoElection-COL-7-UpperBounds-11 0 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeoElection-COL-7-UpperBounds-03 7 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeoElection-COL-7-UpperBounds-15 42 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeoElection-COL-7-UpperBounds-12 7 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeoElection-COL-7-UpperBounds-14 7 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeoElection-COL-7-UpperBounds-08 7 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeoElection-COL-7-UpperBounds-01 49 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
[lola] FINAL RESULTS
[lola]  FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
[lola] NeoElection-COL-7-UpperBounds-00: BOUND 0 state space
[lola] NeoElection-COL-7-UpperBounds-01: BOUND 49 state space
[lola] NeoElection-COL-7-UpperBounds-02: BOUND 0 state space
[lola] NeoElection-COL-7-UpperBounds-03: BOUND 7 state space
[lola] NeoElection-COL-7-UpperBounds-04: BOUND 0 state space
[lola] NeoElection-COL-7-UpperBounds-05: BOUND 0 state space
[lola] NeoElection-COL-7-UpperBounds-06: BOUND 42 state space
[lola] NeoElection-COL-7-UpperBounds-07: BOUND 0 state space
[lola] NeoElection-COL-7-UpperBounds-08: BOUND 7 state space
[lola] NeoElection-COL-7-UpperBounds-09: BOUND 0 state space
[lola] NeoElection-COL-7-UpperBounds-10: BOUND 0 state space
[lola] NeoElection-COL-7-UpperBounds-11: BOUND 0 state space
[lola] NeoElection-COL-7-UpperBounds-12: BOUND 7 findpath
[lola] NeoElection-COL-7-UpperBounds-13: BOUND 7 state space
[lola] NeoElection-COL-7-UpperBounds-14: BOUND 7 state space
[lola] NeoElection-COL-7-UpperBounds-15: BOUND 42 findpath
[lola]
[lola] Time elapsed: 2 secs. Pages in use: 1

BK_STOP 1717076409192

--------------------
content from stderr:

[lola][I] LoLA will run for 3600 seconds at most (--timelimit)
[lola][W] unknown unit in memory specification: using default
[lola][I] MEM LIMIT 5
[lola][I] NET
[lola][I] reading net from model.pnml
[lola][I] input: PNML file (--pnmlnet)
[lola][I] reading pnml
[lola][I] PNML file contains High-Level net
[lola][I] closed net file model.pnml
[lola][I] finished parsing
[lola][I] Reading HL formula in XML format (--xmlformula)
[lola][I] reading formula from UpperBounds.xml
[lola][I] Places: 7128, Transitions: 13428
[lola][I] Rule S: 12818 transitions removed,6688 places removed
[lola][I] Structural Bound for (0 <= 0)MT is 0
[lola][I] LAUNCH task # 50 (type EXCL) for 30 NeoElection-COL-7-UpperBounds-10
[lola][I] time limit : 224 sec
[lola][I] memory limit: 2000 pages
[lola][I] LAUNCH task # 48 (type FNDP) for 30 NeoElection-COL-7-UpperBounds-10
[lola][I] time limit : 32000000 sec
[lola][I] memory limit: 5 pages
[lola][I] LAUNCH task # 49 (type EQUN) for 30 NeoElection-COL-7-UpperBounds-10
[lola][I] time limit : 32000000 sec
[lola][I] memory limit: 5 pages
[lola][I] Structural Bound for (0 <= 0)MT is 0
[lola][I] Structural Bound for (0 <= 0)MT is 0
[lola][I] Structural Bound for (0 <= 0)MT is 0
[lola][I] FINISHED task # 50 (type EXCL) for NeoElection-COL-7-UpperBounds-10
[lola][I] time used : 0
[lola][I] memory pages used : 1
[lola][W] CANCELED task # 48 (type FNDP) for NeoElection-COL-7-UpperBounds-10 (obsolete)
[lola][W] CANCELED task # 49 (type EQUN) for NeoElection-COL-7-UpperBounds-10 (obsolete)
[lola][I] LAUNCH task # 53 (type EXCL) for 12 NeoElection-COL-7-UpperBounds-04
[lola][I] time limit : 257 sec
[lola][I] memory limit: 2000 pages
[lola][I] LAUNCH task # 51 (type FNDP) for 12 NeoElection-COL-7-UpperBounds-04
[lola][I] time limit : 32000000 sec
[lola][I] memory limit: 5 pages
[lola][I] LAUNCH task # 52 (type EQUN) for 12 NeoElection-COL-7-UpperBounds-04
[lola][I] time limit : 32000000 sec
[lola][I] memory limit: 5 pages
[lola][I] LAUNCH task # 54 (type FNDP) for 6 NeoElection-COL-7-UpperBounds-02
[lola][I] time limit : 32000000 sec
[lola][I] memory limit: 5 pages
[lola][I] FINISHED task # 53 (type EXCL) for NeoElection-COL-7-UpperBounds-04
[lola][I] time used : 0
[lola][I] memory pages used : 1
[lola][W] CANCELED task # 51 (type FNDP) for NeoElection-COL-7-UpperBounds-04 (obsolete)
[lola][W] CANCELED task # 52 (type EQUN) for NeoElection-COL-7-UpperBounds-04 (obsolete)
[lola][I] LAUNCH task # 59 (type EXCL) for 0 NeoElection-COL-7-UpperBounds-00
[lola][I] time limit : 257 sec
[lola][I] memory limit: 2000 pages
[lola][I] LAUNCH task # 55 (type FNDP) for 0 NeoElection-COL-7-UpperBounds-00
[lola][I] time limit : 32000000 sec
[lola][I] memory limit: 5 pages
[lola][I] LAUNCH task # 58 (type EQUN) for 0 NeoElection-COL-7-UpperBounds-00
[lola][I] time limit : 32000000 sec
[lola][I] memory limit: 5 pages
[lola][I] FINISHED task # 59 (type EXCL) for NeoElection-COL-7-UpperBounds-00
[lola][I] time used : 0
[lola][I] memory pages used : 1
[lola][W] CANCELED task # 55 (type FNDP) for NeoElection-COL-7-UpperBounds-00 (obsolete)
[lola][W] CANCELED task # 58 (type EQUN) for NeoElection-COL-7-UpperBounds-00 (obsolete)
[lola][I] LAUNCH task # 57 (type EXCL) for 6 NeoElection-COL-7-UpperBounds-02
[lola][I] time limit : 276 sec
[lola][I] memory limit: 2000 pages
[lola][I] LAUNCH task # 56 (type EQUN) for 6 NeoElection-COL-7-UpperBounds-02
[lola][I] time limit : 32000000 sec
[lola][I] memory limit: 5 pages
[lola][I] FINISHED task # 57 (type EXCL) for NeoElection-COL-7-UpperBounds-02
[lola][I] time used : 0
[lola][I] memory pages used : 1
[lola][W] CANCELED task # 54 (type FNDP) for NeoElection-COL-7-UpperBounds-02 (obsolete)
[lola][W] CANCELED task # 56 (type EQUN) for NeoElection-COL-7-UpperBounds-02 (obsolete)
[lola][I] Structural Bound for (0 <= 0)MT is 0
[lola][I] LAUNCH task # 62 (type EXCL) for 27 NeoElection-COL-7-UpperBounds-09
[lola][I] time limit : 299 sec
[lola][I] memory limit: 2000 pages
[lola][I] LAUNCH task # 60 (type FNDP) for 27 NeoElection-COL-7-UpperBounds-09
[lola][I] time limit : 32000000 sec
[lola][I] memory limit: 5 pages
[lola][I] LAUNCH task # 61 (type EQUN) for 27 NeoElection-COL-7-UpperBounds-09
[lola][I] time limit : 32000000 sec
[lola][I] memory limit: 5 pages
[lola][I] FINISHED task # 62 (type EXCL) for NeoElection-COL-7-UpperBounds-09
[lola][I] time used : 0
[lola][I] memory pages used : 1
[lola][W] CANCELED task # 60 (type FNDP) for NeoElection-COL-7-UpperBounds-09 (obsolete)
[lola][W] CANCELED task # 61 (type EQUN) for NeoElection-COL-7-UpperBounds-09 (obsolete)
[lola][I] FINISHED task # 56 (type EQUN) for NeoElection-COL-7-UpperBounds-02
[lola][I] result : unknown
[lola][I] time used : 0
[lola][I] memory pages used : 0
[lola][I] FINISHED task # 52 (type EQUN) for NeoElection-COL-7-UpperBounds-04
[lola][I] result : unknown
[lola][I] time used : 0
[lola][I] memory pages used : 0
[lola][I] FINISHED task # 58 (type EQUN) for NeoElection-COL-7-UpperBounds-00
[lola][I] result : unknown
[lola][I] time used : 0
[lola][I] memory pages used : 0
[lola][I] Structural Bound for (0 <= 0)MT is 0
[lola][I] LAUNCH task # 65 (type EXCL) for 21 NeoElection-COL-7-UpperBounds-07
[lola][I] time limit : 327 sec
[lola][I] memory limit: 2000 pages
[lola][I] Structural Bound for (0 <= 0)MT is 0
[lola][I] LAUNCH task # 63 (type FNDP) for 21 NeoElection-COL-7-UpperBounds-07
[lola][I] time limit : 32000000 sec
[lola][I] memory limit: 5 pages
[lola][I] LAUNCH task # 64 (type EQUN) for 21 NeoElection-COL-7-UpperBounds-07
[lola][I] time limit : 32000000 sec
[lola][I] memory limit: 5 pages
[lola][I] FINISHED task # 65 (type EXCL) for NeoElection-COL-7-UpperBounds-07
[lola][I] time used : 0
[lola][I] memory pages used : 1
[lola][W] CANCELED task # 63 (type FNDP) for NeoElection-COL-7-UpperBounds-07 (obsolete)
[lola][W] CANCELED task # 64 (type EQUN) for NeoElection-COL-7-UpperBounds-07 (obsolete)
[lola][I] LAUNCH task # 68 (type EXCL) for 15 NeoElection-COL-7-UpperBounds-05
[lola][I] time limit : 359 sec
[lola][I] memory limit: 2000 pages
[lola][I] LAUNCH task # 66 (type FNDP) for 15 NeoElection-COL-7-UpperBounds-05
[lola][I] time limit : 32000000 sec
[lola][I] memory limit: 5 pages
[lola][I] LAUNCH task # 67 (type EQUN) for 15 NeoElection-COL-7-UpperBounds-05
[lola][I] time limit : 32000000 sec
[lola][I] memory limit: 5 pages
[lola][I] FINISHED task # 68 (type EXCL) for NeoElection-COL-7-UpperBounds-05
[lola][I] time used : 0
[lola][I] memory pages used : 1
[lola][W] CANCELED task # 66 (type FNDP) for NeoElection-COL-7-UpperBounds-05 (obsolete)
[lola][W] CANCELED task # 67 (type EQUN) for NeoElection-COL-7-UpperBounds-05 (obsolete)
[lola][I] FINISHED task # 64 (type EQUN) for NeoElection-COL-7-UpperBounds-07
[lola][I] result : unknown
[lola][I] time used : 0
[lola][I] memory pages used : 0
[lola][I] Structural@Findpath: 0 (upper 0 threshold 0
[lola][I] FINISHED task # 66 (type FNDP) for NeoElection-COL-7-UpperBounds-05
[lola][I] tried executions : 1
[lola][I] time used : 0
[lola][I] FINISHED task # 61 (type EQUN) for NeoElection-COL-7-UpperBounds-09
[lola][I] result : unknown
[lola][I] time used : 0
[lola][I] memory pages used : 0
[lola][I] FINISHED task # 49 (type EQUN) for NeoElection-COL-7-UpperBounds-10
[lola][I] result : unknown
[lola][I] time used : 0
[lola][I] memory pages used : 0
[lola][I] Structural Bound for (p283 + p286 + p289 + p292 + p295 + p298 + p301 <= 0) is 7
[lola][I] LAUNCH task # 71 (type EXCL) for 39 NeoElection-COL-7-UpperBounds-13
[lola][I] time limit : 399 sec
[lola][I] memory limit: 2000 pages
[lola][I] LAUNCH task # 69 (type FNDP) for 39 NeoElection-COL-7-UpperBounds-13
[lola][I] time limit : 32000000 sec
[lola][I] memory limit: 5 pages
[lola][I] LAUNCH task # 70 (type EQUN) for 39 NeoElection-COL-7-UpperBounds-13
[lola][I] time limit : 32000000 sec
[lola][I] memory limit: 5 pages
[lola][I] FINISHED task # 71 (type EXCL) for NeoElection-COL-7-UpperBounds-13
[lola][I] time used : 0
[lola][I] memory pages used : 1
[lola][W] CANCELED task # 69 (type FNDP) for NeoElection-COL-7-UpperBounds-13 (obsolete)
[lola][W] CANCELED task # 70 (type EQUN) for NeoElection-COL-7-UpperBounds-13 (obsolete)
[lola][I] FINISHED task # 67 (type EQUN) for NeoElection-COL-7-UpperBounds-05
[lola][I] result : unknown
[lola][I] time used : 0
[lola][I] memory pages used : 0
[lola][I] Structural@Findpath: 0 (upper 0 threshold 0
[lola][I] FINISHED task # 55 (type FNDP) for NeoElection-COL-7-UpperBounds-00
[lola][I] tried executions : 1
[lola][I] time used : 0
[lola][I] Structural@Findpath: 0 (upper 0 threshold 0
[lola][I] FINISHED task # 51 (type FNDP) for NeoElection-COL-7-UpperBounds-04
[lola][I] tried executions : 1
[lola][I] time used : 0
[lola][I] Structural@Findpath: 0 (upper 0 threshold 0
[lola][I] FINISHED task # 63 (type FNDP) for NeoElection-COL-7-UpperBounds-07
[lola][I] tried executions : 1
[lola][I] time used : 0
[lola][I] Structural Bound for (p3642 + p3651 + p3660 + p3669 + p3678 + p3687 + p3697 + p3707 + p3716 + p3725 + p3734 + p3743 + p3753 + p3762 + p3772 + p3781 + p3790 + p3799 + p3809 + p3818 + p3827 + p3837 + p3846 + p3855 + p3865 + p3874 + p3883 + p3892 + p3902 + p3911 + p3921 + p3930 + p3939 + p3948 + p3957 + p3967 + p3977 + p3986 + p3995 + p4004 + p4013 + p4022 <= 0) is 42
[lola][I] LAUNCH task # 74 (type EXCL) for 18 NeoElection-COL-7-UpperBounds-06
[lola][I] time limit : 449 sec
[lola][I] memory limit: 2000 pages
[lola][I] LAUNCH task # 72 (type FNDP) for 18 NeoElection-COL-7-UpperBounds-06
[lola][I] time limit : 32000000 sec
[lola][I] memory limit: 5 pages
[lola][I] Structural Bound for (0 <= 0)MT is 0
[lola][I] LAUNCH task # 73 (type EQUN) for 18 NeoElection-COL-7-UpperBounds-06
[lola][I] time limit : 32000000 sec
[lola][I] memory limit: 5 pages
[lola][I] FINISHED task # 74 (type EXCL) for NeoElection-COL-7-UpperBounds-06
[lola][I] time used : 0
[lola][I] memory pages used : 1
[lola][W] CANCELED task # 72 (type FNDP) for NeoElection-COL-7-UpperBounds-06 (obsolete)
[lola][W] CANCELED task # 73 (type EQUN) for NeoElection-COL-7-UpperBounds-06 (obsolete)
[lola][I] LAUNCH task # 77 (type EXCL) for 33 NeoElection-COL-7-UpperBounds-11
[lola][I] time limit : 514 sec
[lola][I] memory limit: 2000 pages
[lola][I] LAUNCH task # 75 (type FNDP) for 33 NeoElection-COL-7-UpperBounds-11
[lola][I] time limit : 32000000 sec
[lola][I] memory limit: 5 pages
[lola][I] LAUNCH task # 76 (type EQUN) for 33 NeoElection-COL-7-UpperBounds-11
[lola][I] time limit : 32000000 sec
[lola][I] memory limit: 5 pages
[lola][I] FINISHED task # 77 (type EXCL) for NeoElection-COL-7-UpperBounds-11
[lola][I] time used : 0
[lola][I] memory pages used : 1
[lola][W] CANCELED task # 75 (type FNDP) for NeoElection-COL-7-UpperBounds-11 (obsolete)
[lola][W] CANCELED task # 76 (type EQUN) for NeoElection-COL-7-UpperBounds-11 (obsolete)
[lola][I] FINISHED task # 73 (type EQUN) for NeoElection-COL-7-UpperBounds-06
[lola][I] result : unknown
[lola][I] time used : 0
[lola][I] memory pages used : 0
[lola][I] Structural@Findpath: 0 (upper 0 threshold 0
[lola][I] FINISHED task # 60 (type FNDP) for NeoElection-COL-7-UpperBounds-09
[lola][I] tried executions : 1
[lola][I] time used : 0
[lola][I] FINISHED task # 76 (type EQUN) for NeoElection-COL-7-UpperBounds-11
[lola][I] result : unknown
[lola][I] time used : 0
[lola][I] memory pages used : 0
[lola][I] FINISHED task # 70 (type EQUN) for NeoElection-COL-7-UpperBounds-13
[lola][I] result : unknown
[lola][I] time used : 0
[lola][I] memory pages used : 0
[lola][I] Structural@Findpath: 0 (upper 0 threshold 0
[lola][I] FINISHED task # 75 (type FNDP) for NeoElection-COL-7-UpperBounds-11
[lola][I] tried executions : 1
[lola][I] time used : 0
[lola][I] Structural@Findpath: 0 (upper 0 threshold 0
[lola][I] FINISHED task # 54 (type FNDP) for NeoElection-COL-7-UpperBounds-02
[lola][I] tried executions : 1
[lola][I] time used : 0
[lola][I] Structural@Findpath: 42 (upper 42 threshold 0
[lola][I] FINISHED task # 72 (type FNDP) for NeoElection-COL-7-UpperBounds-06
[lola][I] tried executions : 1
[lola][I] time used : 0
[lola][I] Structural Bound for (p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 <= 0) is 7
[lola][I] LAUNCH task # 80 (type EXCL) for 9 NeoElection-COL-7-UpperBounds-03
[lola][I] time limit : 599 sec
[lola][I] memory limit: 2000 pages
[lola][I] LAUNCH task # 78 (type FNDP) for 9 NeoElection-COL-7-UpperBounds-03
[lola][I] time limit : 32000000 sec
[lola][I] memory limit: 5 pages
[lola][I] LAUNCH task # 79 (type EQUN) for 9 NeoElection-COL-7-UpperBounds-03
[lola][I] time limit : 32000000 sec
[lola][I] memory limit: 5 pages
[lola][I] FINISHED task # 80 (type EXCL) for NeoElection-COL-7-UpperBounds-03
[lola][I] markings : 8
[lola][I] fired transitions : 7
[lola][I] time used : 0
[lola][I] memory pages used : 1
[lola][W] CANCELED task # 78 (type FNDP) for NeoElection-COL-7-UpperBounds-03 (obsolete)
[lola][W] CANCELED task # 79 (type EQUN) for NeoElection-COL-7-UpperBounds-03 (obsolete)
[lola][I] Structural@Findpath: 7 (upper 7 threshold 0
[lola][I] FINISHED task # 69 (type FNDP) for NeoElection-COL-7-UpperBounds-13
[lola][I] tried executions : 1
[lola][I] time used : 0
[lola][I] Structural@Findpath: 0 (upper 0 threshold 0
[lola][I] FINISHED task # 48 (type FNDP) for NeoElection-COL-7-UpperBounds-10
[lola][I] tried executions : 1
[lola][I] time used : 0
[lola][I] Structural@Findpath: 7 (upper 7 threshold 0
[lola][I] FINISHED task # 78 (type FNDP) for NeoElection-COL-7-UpperBounds-03
[lola][I] tried executions : 1
[lola][I] time used : 0
[lola][I] FINISHED task # 79 (type EQUN) for NeoElection-COL-7-UpperBounds-03
[lola][I] time used : 0
[lola][I] Structural Bound for (p7121 + p7122 + p7123 + p7124 + p7125 + p7126 + p7127 <= 0) is 7
[lola][I] Structural Bound for (p4520 + p4528 + p4536 + p4544 + p4568 + p4576 + p4584 + p4592 + p4616 + p4624 + p4632 + p4640 + p4664 + p4672 + p4680 + p4688 + p4712 + p4720 + p4728 + p4736 + p4760 + p4768 + p4776 + p4784 + p4856 + p4864 + p4872 + p4880 + p4952 + p4960 + p4968 + p4976 + p5000 + p5008 + p5016 + p5024 + p5048 + p5056 + p5064 + p5072 + p5096 + p5104 + p5112 + p5120 + p5144 + p5152 + p5160 + p5168 + p5240 + p5248 + p5256 + p5264 + p5288 + p5296 + p5304 + p5312 + p5384 + p5392 + p5400 + p5408 + p5432 + p5440 + p5448 + p5456 + p5480 + p5488 + p5496 + p5504 + p5528 + p5536 + p5544 + p5552 + p5624 + p5632 + p5640 + p5648 + p5672 + p5680 + p5688 + p5696 + p5720 + p5728 + p5736 + p5744 + p5816 + p5824 + p5832 + p5840 + p5864 + p5872 + p5880 + p5888 + p5912 + p5920 + p5928 + p5936 + p6008 + p6016 + p6024 + p6032 + p6056 + p6064 + p6072 + p6080 + p6104 + p6112 + p6120 + p6128 + p6152 + p6160 + p6168 + p6176 + p6248 + p6256 + p6264 + p6272 + p6296 + p6304 + p6312 + p6320 + p6392 + p6400 + p6408 + p6416 + p6440 + p6448 + p6456 + p6464 + p6488 + p6496 + p6504 + p6512 + p6536 + p6544 + p6552 + p6560 + p6584 + p6592 + p6600 + p6608 + p6680 + p6688 + p6696 + p6704 + p6776 + p6784 + p6792 + p6800 + p6824 + p6832 + p6840 + p6848 + p6872 + p6880 + p6888 + p6896 + p6920 + p6928 + p6936 + p6944 + p6968 + p6976 + p6984 + p6992 + p7016 + p7024 + p7032 + p7040 <= 0) is 42
[lola][I] LAUNCH task # 83 (type EXCL) for 42 NeoElection-COL-7-UpperBounds-14
[lola][I] time limit : 719 sec
[lola][I] memory limit: 2000 pages
[lola][I] LAUNCH task # 81 (type FNDP) for 42 NeoElection-COL-7-UpperBounds-14
[lola][I] time limit : 32000000 sec
[lola][I] memory limit: 5 pages
[lola][I] LAUNCH task # 82 (type EQUN) for 42 NeoElection-COL-7-UpperBounds-14
[lola][I] time limit : 32000000 sec
[lola][I] memory limit: 5 pages
[lola][I] Structural Bound for (p3577 + p3578 + p3579 + p3580 + p3581 + p3582 + p3583 <= 0) is 7
[lola][I] LAUNCH task # 84 (type FNDP) for 45 NeoElection-COL-7-UpperBounds-15
[lola][I] time limit : 32000000 sec
[lola][I] memory limit: 5 pages
[lola][I] Structural@Findpath: 7 (upper 7 threshold 0
[lola][I] Structural@Findpath: 42 (upper 42 threshold 0
[lola][I] FINISHED task # 84 (type FNDP) for NeoElection-COL-7-UpperBounds-15
[lola][I] tried executions : 1
[lola][I] time used : 0
[lola][I] LAUNCH task # 87 (type FNDP) for 36 NeoElection-COL-7-UpperBounds-12
[lola][I] time limit : 32000000 sec
[lola][I] memory limit: 5 pages
[lola][I] Structural@Findpath: 7 (upper 7 threshold 0
[lola][I] Structural@Findpath: 7 (upper 7 threshold 0
[lola][I] FINISHED task # 87 (type FNDP) for NeoElection-COL-7-UpperBounds-12
[lola][I] tried executions : 1
[lola][I] time used : 0
[lola][I] Structural@Findpath: 7 (upper 7 threshold 0
[lola][I] Structural@Findpath: 7 (upper 7 threshold 0
[lola][I] Structural@Findpath: 7 (upper 7 threshold 0
[lola][I] Structural@Findpath: 7 (upper 7 threshold 0
[lola][I] Structural@Findpath: 7 (upper 7 threshold 0
[lola][I] Structural@Findpath: 7 (upper 7 threshold 0
[lola][I] Structural@Findpath: 7 (upper 7 threshold 0
[lola][I] Structural@Findpath: 7 (upper 7 threshold 0
[lola][I] Structural@Findpath: 7 (upper 7 threshold 0
[lola][I] Structural@Findpath: 7 (upper 7 threshold 0
[lola][I] Structural@Findpath: 7 (upper 7 threshold 0
[lola][I] Structural@Findpath: 7 (upper 7 threshold 0
[lola][I] Structural@Findpath: 7 (upper 7 threshold 0
[lola][I] Structural@Findpath: 7 (upper 7 threshold 0
[lola][I] Structural@Findpath: 7 (upper 7 threshold 0
[lola][I] Structural@Findpath: 7 (upper 7 threshold 0
[lola][I] Structural@Findpath: 7 (upper 7 threshold 0
[lola][I] Structural@Findpath: 7 (upper 7 threshold 0
[lola][I] Structural@Findpath: 7 (upper 7 threshold 0
[lola][I] Structural@Findpath: 7 (upper 7 threshold 0
[lola][I] Structural@Findpath: 7 (upper 7 threshold 0
[lola][I] Structural@Findpath: 7 (upper 7 threshold 0
[lola][I] Structural@Findpath: 7 (upper 7 threshold 0
[lola][I] Structural@Findpath: 7 (upper 7 threshold 0
[lola][I] Structural@Findpath: 7 (upper 7 threshold 0
[lola][I] Structural@Findpath: 7 (upper 7 threshold 0
[lola][I] Structural@Findpath: 7 (upper 7 threshold 0
[lola][I] Structural@Findpath: 7 (upper 7 threshold 0
[lola][I] Structural@Findpath: 7 (upper 7 threshold 0
[lola][I] Structural@Findpath: 7 (upper 7 threshold 0
[lola][I] FINISHED task # 83 (type EXCL) for NeoElection-COL-7-UpperBounds-14
[lola][I] markings : 12171
[lola][I] fired transitions : 47923
[lola][I] time used : 0
[lola][I] memory pages used : 1
[lola][W] CANCELED task # 81 (type FNDP) for NeoElection-COL-7-UpperBounds-14 (obsolete)
[lola][W] CANCELED task # 82 (type EQUN) for NeoElection-COL-7-UpperBounds-14 (obsolete)
[lola][I] Structural@Findpath: 7 (upper 7 threshold 0
[lola][I] Structural Bound for (p88 + p96 + p104 + p112 + p120 + p128 + p136 + p144 + p152 + p160 + p168 + p176 + p192 <= 0) is 1073741824
[lola][I] LAUNCH task # 92 (type EXCL) for 24 NeoElection-COL-7-UpperBounds-08
[lola][I] time limit : 1799 sec
[lola][I] memory limit: 2000 pages
[lola][I] LAUNCH task # 90 (type FNDP) for 24 NeoElection-COL-7-UpperBounds-08
[lola][I] time limit : 32000000 sec
[lola][I] memory limit: 5 pages
[lola][I] LAUNCH task # 91 (type EQUN) for 24 NeoElection-COL-7-UpperBounds-08
[lola][I] time limit : 32000000 sec
[lola][I] memory limit: 5 pages
[lola][I] FINISHED task # 91 (type EQUN) for NeoElection-COL-7-UpperBounds-08
[lola][I] result : unknown
[lola][I] time used : 0
[lola][I] memory pages used : 0
[lola][I] FINISHED task # 92 (type EXCL) for NeoElection-COL-7-UpperBounds-08
[lola][I] markings : 1
[lola][I] time used : 0
[lola][I] memory pages used : 1
[lola][W] CANCELED task # 90 (type FNDP) for NeoElection-COL-7-UpperBounds-08 (obsolete)
[lola][I] Structural Bound for (p3413 + p3414 + p3415 + p3416 + p3417 + p3418 + p3419 + p3420 + p3421 + p3422 + p3423 + p3424 + p3425 + p3426 + p3427 + p3428 + p3429 + p3430 + p3431 + p3435 + p3436 + p3437 + p3440 + p3441 + p3442 + p3443 + p3444 + p3445 + p3446 + p3447 + p3448 + p3449 + p3450 + p3451 + p3452 + p3453 + p3454 + p3455 + p3459 + p3460 + p3461 + p3462 + p3463 + p3464 + p3467 + p3468 + p3469 + p3470 + p3471 + p3472 + p3473 + p3474 + p3475 + p3476 + p3477 + p3478 + p3479 + p3483 + p3484 + p3485 + p3486 + p3487 + p3488 + p3489 + p3490 + p3491 + p3494 + p3495 + p3496 + p3497 + p3498 + p3499 + p3500 + p3501 + p3502 + p3503 + p3507 + p3508 + p3509 + p3510 + p3511 + p3512 + p3513 + p3514 + p3515 + p3516 + p3517 + p3518 + p3521 + p3522 + p3523 + p3524 + p3525 + p3526 + p3527 + p3531 + p3532 + p3533 + p3534 + p3535 + p3536 + p3537 + p3538 + p3539 + p3540 + p3541 + p3542 + p3543 + p3544 + p3545 + p3548 + p3549 + p3550 + p3551 + p3555 + p3556 + p3557 + p3558 + p3559 + p3560 + p3561 + p3562 + p3563 + p3564 + p3565 + p3566 + p3567 + p3568 + p3569 + p3570 + p3571 + p3572 + p3575 <= 0) is 1073741824
[lola][I] LAUNCH task # 95 (type EXCL) for 3 NeoElection-COL-7-UpperBounds-01
[lola][I] time limit : 3598 sec
[lola][I] memory limit: 2000 pages
[lola][I] LAUNCH task # 93 (type FNDP) for 3 NeoElection-COL-7-UpperBounds-01
[lola][I] time limit : 32000000 sec
[lola][I] memory limit: 5 pages
[lola][I] LAUNCH task # 94 (type EQUN) for 3 NeoElection-COL-7-UpperBounds-01
[lola][I] time limit : 32000000 sec
[lola][I] memory limit: 5 pages
[lola][I] FINISHED task # 94 (type EQUN) for NeoElection-COL-7-UpperBounds-01
[lola][I] result : unknown
[lola][I] time used : 0
[lola][I] memory pages used : 0
[lola][I] FINISHED task # 95 (type EXCL) for NeoElection-COL-7-UpperBounds-01
[lola][I] markings : 1
[lola][I] time used : 0
[lola][I] memory pages used : 1
[lola][W] CANCELED task # 93 (type FNDP) for NeoElection-COL-7-UpperBounds-01 (obsolete)
[lola][I] Portfolio finished: no open formulas

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="NeoElection-COL-7"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lola"
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-5568"
echo " Executing tool lola"
echo " Input is NeoElection-COL-7, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r247-tall-171654353500485"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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