Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r166-smll-158987787600385.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 AutoFlight-PT-02a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-158987787600385
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.3K Mar 25 23:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 25 23:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 14:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 25 14:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 25 10:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 25 10:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 25 17:54 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 16K 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 AutoFlight-PT-02a-00
FORMULA_NAME AutoFlight-PT-02a-01
FORMULA_NAME AutoFlight-PT-02a-02
FORMULA_NAME AutoFlight-PT-02a-03
FORMULA_NAME AutoFlight-PT-02a-04
FORMULA_NAME AutoFlight-PT-02a-05
FORMULA_NAME AutoFlight-PT-02a-06
FORMULA_NAME AutoFlight-PT-02a-07
FORMULA_NAME AutoFlight-PT-02a-08
FORMULA_NAME AutoFlight-PT-02a-09
FORMULA_NAME AutoFlight-PT-02a-10
FORMULA_NAME AutoFlight-PT-02a-11
FORMULA_NAME AutoFlight-PT-02a-12
FORMULA_NAME AutoFlight-PT-02a-13
FORMULA_NAME AutoFlight-PT-02a-14
FORMULA_NAME AutoFlight-PT-02a-15

=== Now, execution of the tool begins

BK_START 1591447311478

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-06 12:41:54] [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-06 12:41:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-06 12:41:54] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2020-06-06 12:41:54] [INFO ] Transformed 57 places.
[2020-06-06 12:41:54] [INFO ] Transformed 55 transitions.
[2020-06-06 12:41:54] [INFO ] Found NUPN structural information;
[2020-06-06 12:41:54] [INFO ] Parsed PT model containing 57 places and 55 transitions in 149 ms.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 33 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 3963 resets, run finished after 539 ms. (steps per millisecond=185 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1]
// Phase 1: matrix 45 rows 57 cols
[2020-06-06 12:41:55] [INFO ] Computed 16 place invariants in 6 ms
[2020-06-06 12:41:55] [INFO ] [Real]Absence check using 15 positive place invariants in 67 ms returned sat
[2020-06-06 12:41:55] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-06 12:41:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 12:41:55] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2020-06-06 12:41:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 12:41:55] [INFO ] [Nat]Absence check using 15 positive place invariants in 28 ms returned sat
[2020-06-06 12:41:55] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned unsat
[2020-06-06 12:41:55] [INFO ] [Real]Absence check using 15 positive place invariants in 13 ms returned sat
[2020-06-06 12:41:55] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 15 ms returned sat
[2020-06-06 12:41:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 12:41:55] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2020-06-06 12:41:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 12:41:56] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned unsat
[2020-06-06 12:41:56] [INFO ] [Real]Absence check using 15 positive place invariants in 16 ms returned sat
[2020-06-06 12:41:56] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-06 12:41:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 12:41:56] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2020-06-06 12:41:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 12:41:56] [INFO ] [Nat]Absence check using 15 positive place invariants in 13 ms returned unsat
[2020-06-06 12:41:56] [INFO ] [Real]Absence check using 15 positive place invariants in 16 ms returned sat
[2020-06-06 12:41:56] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-06 12:41:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 12:41:56] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2020-06-06 12:41:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 12:41:56] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned unsat
[2020-06-06 12:41:56] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2020-06-06 12:41:56] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-06 12:41:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 12:41:56] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2020-06-06 12:41:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 12:41:56] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned unsat
[2020-06-06 12:41:56] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2020-06-06 12:41:56] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-06 12:41:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 12:41:56] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2020-06-06 12:41:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 12:41:56] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned unsat
[2020-06-06 12:41:56] [INFO ] [Real]Absence check using 15 positive place invariants in 23 ms returned sat
[2020-06-06 12:41:56] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-06 12:41:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 12:41:56] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2020-06-06 12:41:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 12:41:56] [INFO ] [Nat]Absence check using 15 positive place invariants in 16 ms returned sat
[2020-06-06 12:41:56] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 2 ms returned unsat
[2020-06-06 12:41:56] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2020-06-06 12:41:56] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 5 ms returned sat
[2020-06-06 12:41:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 12:41:56] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2020-06-06 12:41:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 12:41:56] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 9 simplifications.
[2020-06-06 12:41:57] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-06-06 12:41:57] [INFO ] Flatten gal took : 71 ms
FORMULA AutoFlight-PT-02a-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02a-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02a-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02a-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02a-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02a-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02a-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02a-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-06 12:41:57] [INFO ] Applying decomposition
[2020-06-06 12:41:57] [INFO ] Flatten gal took : 20 ms
[2020-06-06 12:41:57] [INFO ] Decomposing Gal with order
[2020-06-06 12:41:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-06 12:41:57] [INFO ] Removed a total of 12 redundant transitions.
[2020-06-06 12:41:57] [INFO ] Flatten gal took : 66 ms
[2020-06-06 12:41:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 9 ms.
[2020-06-06 12:41:57] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 6 ms.
[2020-06-06 12:41:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ AutoFlight-PT-02a @ 3570 seconds

FORMULA AutoFlight-PT-02a-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-02a-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-02a-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-02a-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-02a-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-02a-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-02a-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLCardinality @ AutoFlight-PT-02a

{
"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": "Sat Jun 6 12:41:58 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 1,
"aconj": 6,
"adisj": 2,
"aneg": 4,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((G ((G (F ((((1 <= p1)) AND ((p16 <= 0))))) AND (((1 <= p1)) AND ((p16 <= 0))))) AND X ((((1 <= p1)) AND ((p16 <= 0)))))))",
"processed_size": 128,
"rewrites": 41
},
"result":
{
"edges": 198,
"markings": 98,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 1,
"adisj": 2,
"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": "X (X (X (G ((((p36 <= 0)) OR ((1 <= p29)))))))",
"processed_size": 47,
"rewrites": 41
},
"result":
{
"edges": 767,
"markings": 344,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 1,
"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": 1,
"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": "F (G ((((p52 <= 0)) OR ((1 <= p34)))))",
"processed_size": 39,
"rewrites": 41
},
"result":
{
"edges": 24,
"markings": 21,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"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": "((p16 <= 0))",
"processed_size": 12,
"rewrites": 43
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 1,
"X": 0,
"aconj": 8,
"adisj": 4,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(F (((((p56 <= 0)) OR ((1 <= p49))) OR (G (F ((((p56 <= 0)) OR ((1 <= p49))))) AND F ((((p56 <= 0)) OR ((1 <= p49))))))) U G ((((p56 <= 0)) OR ((1 <= p49)))))",
"processed_size": 162,
"rewrites": 41
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"compoundnumber": 5,
"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": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 1,
"X": 0,
"aconj": 11,
"adisj": 6,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(((((p20 <= 0)) OR ((1 <= p10))) AND G (((((p20 <= 0)) OR ((1 <= p10))) AND ((p34 <= 0))))) U G (((((p29 <= 0)) OR ((1 <= p46))) OR (G ((((p45 <= 0)) OR ((1 <= p36)))) AND F ((((p29 <= 0)) OR ((1 <= p46))))))))",
"processed_size": 215,
"rewrites": 41
},
"result":
{
"edges": 171,
"markings": 148,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 26
},
"compoundnumber": 6,
"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": 27460,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F((G((G(F(*)) AND (* AND *))) AND X(*)))) : ((** AND G(**)) U G((** OR (G(**) AND F(**))))) : G(F(**)) : X(X(X(G(*)))) : F(**) : (F((** OR (G(F(**)) AND F(**)))) U G(**)) : (F(G(**)) AND G((G(F(*)) OR (** OR X(G(**))))))"
},
"net":
{
"arcs": 160,
"conflict_clusters": 29,
"places": 57,
"places_significant": 41,
"singleton_clusters": 0,
"transitions": 45
},
"result":
{
"preliminary_value": "no no no no yes no no ",
"value": "no no no no yes 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: 102/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 57
lola: finding significant places
lola: 57 places, 45 transitions, 41 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: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: X (G (NOT(G (X ((F (((F (G ((((p1 <= 0)) OR ((1 <= p16))))) OR ((p1 <= 0))) OR ((1 <= p16)))) OR X ((((p1 <= 0)) OR ((1 <= p16)))))))))) : ((((1 <= 0) U (((p20 <= 0)) OR ((1 <= p10)))) AND G (((((p20 <= 0)) OR ((1 <= p10))) AND ((p34 <= 0))))) U G ((G ((((p45 <= 0)) OR ((1 <= p36)))) U (((p29 <= 0)) OR ((1 <= p46)))))) : G (F ((((1 <= p30)) AND ((p0 <= 0))))) : X (X (NOT(X (F ((((1 <= p36)) AND ((p29 <= 0)))))))) : (NOT(G (X (((1 <= p41))))) U (X (((1 <= p16))) U ((0 <= 0) U ((1 <= p16))))) : (F ((F (G (F ((((p56 <= 0)) OR ((1 <= p49)))))) U (((p56 <= 0)) OR ((1 <= p49))))) U G ((((p56 <= 0)) OR ((1 <= p49))))) : G (((G (NOT(G (((1 <= p6))))) OR ((1 <= p6))) U X (G ((((p52 <= 0)) OR ((1 <= p34)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((G (F ((((1 <= p1)) AND ((p16 <= 0))))) AND (((1 <= p1)) AND ((p16 <= 0))))) AND X ((((1 <= p1)) AND ((p16 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((G (F ((((1 <= p1)) AND ((p16 <= 0))))) AND (((1 <= p1)) AND ((p16 <= 0))))) AND X ((((1 <= p1)) AND ((p16 <= 0)))))))
lola: processed formula length: 128
lola: 41 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: 98 markings, 198 edges
lola: ========================================
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G ((((p36 <= 0)) OR ((1 <= p29)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G ((((p36 <= 0)) OR ((1 <= p29)))))))
lola: processed formula length: 47
lola: 41 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 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: 344 markings, 767 edges
lola: ========================================
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((((p52 <= 0)) OR ((1 <= p34))))) AND G ((G (F (((p6 <= 0)))) OR (((1 <= p6)) OR X (G ((((p52 <= 0)) OR ((1 <= p34)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p52 <= 0)) OR ((1 <= p34)))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((p52 <= 0)) OR ((1 <= p34)))))
lola: processed formula length: 39
lola: 41 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: add low 28
lola: add low 3
lola: add low 27
lola: add low 5
lola: add low 37
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: 21 markings, 24 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p16)))
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: ((p16 <= 0))
lola: processed formula length: 12
lola: 43 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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((1 <= p30)) AND ((p0 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((1 <= p30)) AND ((p0 <= 0)))))
lola: processed formula length: 38
lola: 41 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: 12 markings, 12 edges
lola: ========================================
lola: subprocess 5 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((((p56 <= 0)) OR ((1 <= p49))) OR (G (F ((((p56 <= 0)) OR ((1 <= p49))))) AND F ((((p56 <= 0)) OR ((1 <= p49))))))) U G ((((p56 <= 0)) OR ((1 <= p49)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((((p56 <= 0)) OR ((1 <= p49))) OR (G (F ((((p56 <= 0)) OR ((1 <= p49))))) AND F ((((p56 <= 0)) OR ((1 <= p49))))))) U G ((((p56 <= 0)) OR ((1 <= p49)))))
lola: processed formula length: 162
lola: 41 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 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: 12 markings, 12 edges
lola: ========================================
lola: subprocess 6 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((((p20 <= 0)) OR ((1 <= p10))) AND G (((((p20 <= 0)) OR ((1 <= p10))) AND ((p34 <= 0))))) U G (((((p29 <= 0)) OR ((1 <= p46))) OR (G ((((p45 <= 0)) OR ((1 <= p36)))) AND F ((((p29 <= 0)) OR ((1 <= p46))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((((p20 <= 0)) OR ((1 <= p10))) AND G (((((p20 <= 0)) OR ((1 <= p10))) AND ((p34 <= 0))))) U G (((((p29 <= 0)) OR ((1 <= p46))) OR (G ((((p45 <= 0)) OR ((1 <= p36)))) AND F ((((p29 <= 0)) OR ((1 <= p46))))))))
lola: processed formula length: 215
lola: 41 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 26 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: 148 markings, 171 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes no no
lola:
preliminary result: no no no no yes no no
lola: memory consumption: 27460 KB
lola: time consumption: 3 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="AutoFlight-PT-02a"
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 AutoFlight-PT-02a, 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 r166-smll-158987787600385"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-02a.tgz
mv AutoFlight-PT-02a 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 ;