fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r182-oct2-158987913900465
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for BusinessProcesses-PT-03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.430 3600000.00 73851.00 88.10 FTFTFFFFTTFFTFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987913900465.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is BusinessProcesses-PT-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913900465
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 3.3K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 22:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 25 22:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 14:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 63K 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 BusinessProcesses-PT-03-00
FORMULA_NAME BusinessProcesses-PT-03-01
FORMULA_NAME BusinessProcesses-PT-03-02
FORMULA_NAME BusinessProcesses-PT-03-03
FORMULA_NAME BusinessProcesses-PT-03-04
FORMULA_NAME BusinessProcesses-PT-03-05
FORMULA_NAME BusinessProcesses-PT-03-06
FORMULA_NAME BusinessProcesses-PT-03-07
FORMULA_NAME BusinessProcesses-PT-03-08
FORMULA_NAME BusinessProcesses-PT-03-09
FORMULA_NAME BusinessProcesses-PT-03-10
FORMULA_NAME BusinessProcesses-PT-03-11
FORMULA_NAME BusinessProcesses-PT-03-12
FORMULA_NAME BusinessProcesses-PT-03-13
FORMULA_NAME BusinessProcesses-PT-03-14
FORMULA_NAME BusinessProcesses-PT-03-15

=== Now, execution of the tool begins

BK_START 1591156674361

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 03:57:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 03:57:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 03:57:56] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2020-06-03 03:57:56] [INFO ] Transformed 274 places.
[2020-06-03 03:57:56] [INFO ] Transformed 237 transitions.
[2020-06-03 03:57:56] [INFO ] Found NUPN structural information;
[2020-06-03 03:57:56] [INFO ] Parsed PT model containing 274 places and 237 transitions in 85 ms.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1192 resets, run finished after 254 ms. (steps per millisecond=393 ) properties seen :[0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0]
// Phase 1: matrix 236 rows 273 cols
[2020-06-03 03:57:56] [INFO ] Computed 43 place invariants in 21 ms
[2020-06-03 03:57:57] [INFO ] [Real]Absence check using 31 positive place invariants in 36 ms returned sat
[2020-06-03 03:57:57] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2020-06-03 03:57:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:57:57] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2020-06-03 03:57:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:57:57] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned unsat
[2020-06-03 03:57:57] [INFO ] [Real]Absence check using 31 positive place invariants in 80 ms returned sat
[2020-06-03 03:57:57] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2020-06-03 03:57:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:57:57] [INFO ] [Real]Absence check using state equation in 365 ms returned sat
[2020-06-03 03:57:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:57:58] [INFO ] [Nat]Absence check using 31 positive place invariants in 11 ms returned unsat
[2020-06-03 03:57:58] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2020-06-03 03:57:58] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2020-06-03 03:57:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:57:58] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2020-06-03 03:57:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:57:58] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned unsat
[2020-06-03 03:57:58] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2020-06-03 03:57:58] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 57 ms returned sat
[2020-06-03 03:57:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:57:59] [INFO ] [Real]Absence check using state equation in 1019 ms returned sat
[2020-06-03 03:57:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:57:59] [INFO ] [Nat]Absence check using 31 positive place invariants in 10 ms returned unsat
[2020-06-03 03:57:59] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2020-06-03 03:57:59] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2020-06-03 03:57:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:58:00] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2020-06-03 03:58:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:58:00] [INFO ] [Nat]Absence check using 31 positive place invariants in 23 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2020-06-03 03:58:00] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2020-06-03 03:58:00] [INFO ] Flatten gal took : 85 ms
FORMULA BusinessProcesses-PT-03-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 03:58:00] [INFO ] Applying decomposition
[2020-06-03 03:58:00] [INFO ] Flatten gal took : 25 ms
[2020-06-03 03:58:00] [INFO ] Decomposing Gal with order
[2020-06-03 03:58:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 03:58:00] [INFO ] Flatten gal took : 58 ms
[2020-06-03 03:58:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 25 ms.
[2020-06-03 03:58:00] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 5 ms.
[2020-06-03 03:58:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ BusinessProcesses-PT-03 @ 3570 seconds

FORMULA BusinessProcesses-PT-03-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-03-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-03-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-03-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-03-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-03-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3512
rslt: Output for LTLCardinality @ BusinessProcesses-PT-03

{
"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=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 03:58:01 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 2,
"aconj": 3,
"adisj": 3,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(X (X (G ((((1 <= p41)) AND ((p29 <= 0)))))) U (((1 <= p31)) AND ((p118 <= 0))))",
"processed_size": 80,
"rewrites": 28
},
"result":
{
"edges": 149,
"markings": 149,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"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": "G ((((1 <= p172)) AND ((p241 <= 0))))",
"processed_size": 37,
"rewrites": 28
},
"result":
{
"edges": 68,
"markings": 68,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 1,
"aconj": 4,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(X (G (((1 <= p257)))) U (F (((1 <= p257))) OR G ((((1 <= p67)) AND ((p79 <= 0))))))",
"processed_size": 84,
"rewrites": 28
},
"result":
{
"edges": 149,
"markings": 149,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "X (G ((((p94 <= 0)) OR ((1 <= p224)))))",
"processed_size": 40,
"rewrites": 28
},
"result":
{
"edges": 149,
"markings": 149,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"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": "G ((((p237 <= 0)) OR ((1 <= p87))))",
"processed_size": 36,
"rewrites": 28
},
"result":
{
"edges": 347,
"markings": 298,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((p59 <= 0))",
"processed_size": 12,
"rewrites": 30
},
"result":
{
"edges": 67,
"markings": 68,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((((p174 <= 0)) AND (F ((((1 <= p200)) AND ((p88 <= 0)))) OR G (((p174 <= 0)))))))",
"processed_size": 87,
"rewrites": 28
},
"result":
{
"edges": 33392122,
"markings": 4990332,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 26092,
"runtime": 58.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(X(G(*))) U **) : ((X(G(**)) U (F(**) OR G(*))) OR G(*)) : X(G(**)) : F(**) : (X(X(((* R *) OR (* OR *)))) AND G(**)) : G(F((* AND (F(*) OR G(*)))))"
},
"net":
{
"arcs": 630,
"conflict_clusters": 215,
"places": 273,
"places_significant": 230,
"singleton_clusters": 0,
"transitions": 236
},
"result":
{
"preliminary_value": "no no no no no no ",
"value": "no no no no no no "
},
"task":
{
"type": "compound"
}
}
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: 509/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 273
lola: finding significant places
lola: 273 places, 236 transitions, 230 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 LTLCardinality.xml
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p118 <= 1)
lola: LP says that atomic proposition is always true: (p257 <= 1)
lola: LP says that atomic proposition is always true: (p257 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p241 <= 1)
lola: LP says that atomic proposition is always true: (p224 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p202 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p174 <= 1)
lola: (G (X (NOT(X ((((p41 <= 0)) OR ((1 <= p29))))))) U (((1 <= p31)) AND ((p118 <= 0)))) : ((G (X (((1 <= p257)))) U (F (((1 <= p257))) OR NOT(F ((((p67 <= 0)) OR ((1 <= p79))))))) OR NOT(F ((((p172 <= 0)) OR ((1 <= p241)))))) : X (G ((((p94 <= 0)) OR ((1 <= p224))))) : F (((1 <= p59))) : (X (NOT(X (((((((p237 <= 0)) OR ((1 <= p87))) U (((p251 <= 0)) OR ((1 <= p202)))) AND ((1 <= p49))) AND ((p167 <= 0)))))) AND G ((((p237 <= 0)) OR ((1 <= p87))))) : G (F (NOT(G ((G ((((p200 <= 0)) OR ((1 <= p88)))) U ((1 <= p174)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (G ((((1 <= p41)) AND ((p29 <= 0)))))) U (((1 <= p31)) AND ((p118 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (X (G ((((1 <= p41)) AND ((p29 <= 0)))))) U (((1 <= p31)) AND ((p118 <= 0))))
lola: processed formula length: 80
lola: 28 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 149 markings, 149 edges
lola: ========================================
lola: subprocess 1 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (G (((1 <= p257)))) U (F (((1 <= p257))) OR G ((((1 <= p67)) AND ((p79 <= 0)))))) OR G ((((1 <= p172)) AND ((p241 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((1 <= p172)) AND ((p241 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((1 <= p172)) AND ((p241 <= 0))))
lola: processed formula length: 37
lola: 28 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 68 markings, 68 edges
lola: ========================================
lola: subprocess 2 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((1 <= p257)))) U (F (((1 <= p257))) OR G ((((1 <= p67)) AND ((p79 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (G (((1 <= p257)))) U (F (((1 <= p257))) OR G ((((1 <= p67)) AND ((p79 <= 0))))))
lola: processed formula length: 84
lola: 28 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 149 markings, 149 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((p94 <= 0)) OR ((1 <= p224)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((p94 <= 0)) OR ((1 <= p224)))))
lola: processed formula length: 40
lola: 28 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 149 markings, 149 edges
lola: ========================================
lola: subprocess 3 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X ((((((1 <= p237)) AND ((p87 <= 0))) R (((1 <= p251)) AND ((p202 <= 0)))) OR (((p49 <= 0)) OR ((1 <= p167)))))) AND G ((((p237 <= 0)) OR ((1 <= p87)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p237 <= 0)) OR ((1 <= p87))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p237 <= 0)) OR ((1 <= p87))))
lola: processed formula length: 36
lola: 28 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 298 markings, 347 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p59)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p59 <= 0))
lola: processed formula length: 12
lola: 30 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 68 markings, 67 edges
lola: ========================================
lola: subprocess 5 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p174 <= 0)) AND (F ((((1 <= p200)) AND ((p88 <= 0)))) OR G (((p174 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((p174 <= 0)) AND (F ((((1 <= p200)) AND ((p88 <= 0)))) OR G (((p174 <= 0)))))))
lola: processed formula length: 87
lola: 28 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 545188 markings, 3180877 edges, 109038 markings/sec, 0 secs
lola: 1023918 markings, 6216960 edges, 95746 markings/sec, 5 secs
lola: 1481206 markings, 9285165 edges, 91458 markings/sec, 10 secs
lola: 1886638 markings, 12176074 edges, 81086 markings/sec, 15 secs
lola: 2329418 markings, 15098844 edges, 88556 markings/sec, 20 secs
lola: 2779923 markings, 18047638 edges, 90101 markings/sec, 25 secs
lola: 3249685 markings, 21133680 edges, 93952 markings/sec, 30 secs
lola: 3671256 markings, 24119956 edges, 84314 markings/sec, 35 secs
lola: 4059150 markings, 27055507 edges, 77579 markings/sec, 40 secs
lola: 4454351 markings, 29972916 edges, 79040 markings/sec, 45 secs
lola: 4932495 markings, 33049364 edges, 95629 markings/sec, 50 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4990332 markings, 33392122 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no
lola:
preliminary result: no no no no no no
lola: memory consumption: 26092 KB
lola: time consumption: 58 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.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="BusinessProcesses-PT-03"
export BK_EXAMINATION="LTLCardinality"
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 BusinessProcesses-PT-03, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r182-oct2-158987913900465"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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