About the Execution of ITS-LoLa for NQueens-PT-08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15742.680 | 3600000.00 | 12774.00 | 46.70 | TFTTFFTFFTTFFTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987852700122.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 NQueens-PT-08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987852700122
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 3.5K Apr 8 13:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 8 13:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 7 16:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 7 16:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 14 12:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 6 19:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 6 19:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 6 02:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 6 02:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:24 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 60K 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 NQueens-PT-08-00
FORMULA_NAME NQueens-PT-08-01
FORMULA_NAME NQueens-PT-08-02
FORMULA_NAME NQueens-PT-08-03
FORMULA_NAME NQueens-PT-08-04
FORMULA_NAME NQueens-PT-08-05
FORMULA_NAME NQueens-PT-08-06
FORMULA_NAME NQueens-PT-08-07
FORMULA_NAME NQueens-PT-08-08
FORMULA_NAME NQueens-PT-08-09
FORMULA_NAME NQueens-PT-08-10
FORMULA_NAME NQueens-PT-08-11
FORMULA_NAME NQueens-PT-08-12
FORMULA_NAME NQueens-PT-08-13
FORMULA_NAME NQueens-PT-08-14
FORMULA_NAME NQueens-PT-08-15
=== Now, execution of the tool begins
BK_START 1591130245719
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 20:37:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-02 20:37:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 20:37:28] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2020-06-02 20:37:28] [INFO ] Transformed 112 places.
[2020-06-02 20:37:28] [INFO ] Transformed 64 transitions.
[2020-06-02 20:37:28] [INFO ] Parsed PT model containing 112 places and 64 transitions in 120 ms.
Reduce places removed 2 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 36 steps, including 4 resets, run visited all 55 properties in 4 ms. (steps per millisecond=9 )
[2020-06-02 20:37:28] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-02 20:37:28] [INFO ] Flatten gal took : 45 ms
FORMULA NQueens-PT-08-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-08-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-08-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-08-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-08-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-08-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 20:37:28] [INFO ] Flatten gal took : 13 ms
[2020-06-02 20:37:28] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2020-06-02 20:37:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ NQueens-PT-08 @ 3570 seconds
FORMULA NQueens-PT-08-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-08-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-08-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-08-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-08-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-08-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-08-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-08-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-08-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-08-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3563
rslt: Output for LTLFireability @ NQueens-PT-08
{
"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=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Jun 2 20:37:28 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 1,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 5,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "X (F ((((((1 <= p69) AND (1 <= p74) AND (1 <= p90) AND (1 <= p102)) OR ((1 <= p70) AND (1 <= p79) AND (1 <= p86) AND (1 <= p108))) U G ((F (((1 <= p67) AND (1 <= p74) AND (1 <= p88) AND (1 <= p100))) OR ((p70 <= 0) OR ((p79 <= 0) OR ((p86 <= 0) OR (p108 <= 0))))))) OR ((1 <= p69) AND (1 <= p74) AND (1 <= p90) AND (1 <= p102)))))",
"processed_size": 331,
"rewrites": 73
},
"result":
{
"edges": 1264305,
"markings": 241242,
"produced_by": "LTL model checker",
"value": true
},
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "F (G ((F (((1 <= p71) AND (1 <= p74) AND (1 <= p92) AND (1 <= p104))) AND (F (((1 <= p68) AND (1 <= p75) AND (1 <= p88) AND (1 <= p102))) OR X (X (((1 <= p71) AND (1 <= p74) AND (1 <= p92) AND (1 <= p104))))))))",
"processed_size": 211,
"rewrites": 73
},
"result":
{
"edges": 10,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 445
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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": "F (G (((1 <= p67) AND (1 <= p76) AND (1 <= p86) AND (1 <= p102))))",
"processed_size": 66,
"rewrites": 73
},
"result":
{
"edges": 8,
"markings": 7,
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X ((F (G (((p70 <= 0) OR (p79 <= 0) OR (p86 <= 0) OR (p108 <= 0)))) OR G (((1 <= p69) AND (1 <= p74) AND (1 <= p90) AND (1 <= p102)))))",
"processed_size": 138,
"rewrites": 73
},
"result":
{
"edges": 1968577,
"markings": 277345,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"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": 2,
"aconj": 1,
"adisj": 0,
"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 (((p67 <= 0) OR (p74 <= 0) OR (p88 <= 0) OR (p100 <= 0)))))",
"processed_size": 70,
"rewrites": 73
},
"result":
{
"edges": 2567,
"markings": 799,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 4,
"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": 712
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "G (((1 <= p67) AND (1 <= p79) AND (1 <= p83) AND (1 <= p105) AND (1 <= p65) AND (1 <= p78) AND (1 <= p82) AND (1 <= p102)))",
"processed_size": 123,
"rewrites": 73
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"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": 5,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 890
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 890
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((1 <= p64) AND (1 <= p79) AND (1 <= p80) AND (1 <= p102))",
"processed_size": 58,
"rewrites": 78
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1187
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 2,
"aneg": 3,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "X (X ((((p70 <= 0) OR (p78 <= 0) OR (p87 <= 0) OR (p107 <= 0)) R (((1 <= p69) AND (1 <= p77) AND (1 <= p87) AND (1 <= p105)) R ((1 <= p64) AND (1 <= p79) AND (1 <= p80) AND (1 <= p102))))))",
"processed_size": 192,
"rewrites": 73
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 7,
"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": 6,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1187
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1187
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X (F ((G (((1 <= p70) AND (1 <= p73) AND (1 <= p92) AND (1 <= p102))) AND ((p71 <= 0) OR (p72 <= 0) OR (p94 <= 0) OR (p102 <= 0)))))",
"processed_size": 135,
"rewrites": 73
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"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": 7,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1781
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 2,
"aconj": 2,
"adisj": 1,
"aneg": 2,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 4,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X ((((((p68 <= 0) OR (p76 <= 0) OR (p87 <= 0) OR (p103 <= 0)) R ((p70 <= 0) OR (p75 <= 0) OR (p90 <= 0) OR (p104 <= 0))) AND ((1 <= p68) AND ((1 <= p76) AND ((1 <= p87) AND (1 <= p103))))) U X (G (((p68 <= 0) OR (p76 <= 0) OR (p87 <= 0) OR (p103 <= 0))))))",
"processed_size": 265,
"rewrites": 73
},
"result":
{
"edges": 7689,
"markings": 1593,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 8,
"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": 3563
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3563
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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": "((1 <= p64) AND (1 <= p77) AND (1 <= p82) AND (1 <= p100))",
"processed_size": 58,
"rewrites": 75
},
"result":
{
"edges": 40340,
"markings": 10172,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 22
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 40856,
"runtime": 7.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(F(((** U G((F(**) OR (** OR (** OR (** OR **)))))) OR **))) : F(G((F(**) AND (F(**) OR X(X(**)))))) : (F(G(**)) AND G(((F(**) AND (** AND (** AND (** AND **)))) OR X((** U G(**)))))) : X((F(G(*)) OR G(**))) : X(X(G(*))) : (G(**) AND X(X((X(G(**)) AND **)))) : (X(X((* R (* R *)))) AND (** AND (** AND (** AND **)))) : ((** OR (G(**) AND F(**))) AND X(F((G(**) AND **)))) : X((((* R *) AND (** AND (** AND (** AND **)))) U X(G(**)))) : (X(X(**)) OR F(*))"
},
"net":
{
"arcs": 320,
"conflict_clusters": 65,
"places": 110,
"places_significant": 64,
"singleton_clusters": 0,
"transitions": 64
},
"result":
{
"preliminary_value": "yes no no yes no no no no no yes ",
"value": "yes no no yes no no no no no yes "
},
"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: 174/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 110
lola: finding significant places
lola: 110 places, 64 transitions, 64 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 LTLFireability.xml
lola: F (X ((((((1 <= p69) AND (1 <= p74) AND (1 <= p90) AND (1 <= p102)) OR ((1 <= p70) AND (1 <= p79) AND (1 <= p86) AND (1 <= p108))) U G (((((F (((1 <= p67) AND (1 <= p74) AND (1 <= p88) AND (1 <= p100))) OR (p70 <= 0)) OR (p79 <= 0)) OR (p86 <= 0)) OR (p108 <= 0)))) OR ((1 <= p69) AND (1 <= p74) AND (1 <= p90) AND (1 <= p102))))) : F ((NOT(X (((1 <= p68) AND (1 <= p75) AND (1 <= p88) AND (1 <= p102)))) U G ((F (((1 <= p68) AND (1 <= p75) AND (1 <= p88) AND (1 <= p102))) U X (X (((1 <= p71) AND (1 <= p74) AND (1 <= p92) AND (1 <= p104)))))))) : G ((((((F (((1 <= p71) AND (1 <= p75) AND (1 <= p91) AND (1 <= p105))) AND (1 <= p67)) AND (1 <= p76)) AND (1 <= p86)) AND (1 <= p102)) U (X (((1 <= p70) AND (1 <= p74) AND (1 <= p91) AND (1 <= p103))) U G (X (((1 <= p67) AND (1 <= p76) AND (1 <= p86) AND (1 <= p102))))))) : X ((F (G (F (NOT(F ((F (((1 <= p70) AND (1 <= p73) AND (1 <= p92) AND (1 <= p102))) U X (((1 <= p70) AND (1 <= p79) AND (1 <= p86) AND (1 <= p108))))))))) OR G (((1 <= p69) AND (1 <= p74) AND (1 <= p90) AND (1 <= p102))))) : G (X (NOT(X (F (((1 <= p67) AND (1 <= p74) AND (1 <= p88) AND (1 <= p100))))))) : (G (((1 <= p67) AND (1 <= p79) AND (1 <= p83) AND (1 <= p105) AND (1 <= p65) AND (1 <= p78) AND (1 <= p82) AND (1 <= p102))) AND X ((X (G (X (((p68 <= 0) OR (p78 <= 0) OR (p85 <= 0) OR (p105 <= 0))))) AND X (((1 <= p67) AND (1 <= p79) AND (1 <= p83) AND (1 <= p105)))))) : ((((X (NOT(X ((((1 <= p70) AND (1 <= p78) AND (1 <= p87) AND (1 <= p107)) U (((p69 <= 0) OR (p77 <= 0) OR (p87 <= 0) OR (p105 <= 0)) U ((p64 <= 0) OR (p79 <= 0) OR (p80 <= 0) OR (p102 <= 0))))))) AND (1 <= p64)) AND (1 <= p79)) AND (1 <= p80)) AND (1 <= p102)) : ((G (((1 <= p66) AND (1 <= p78) AND (1 <= p83) AND (1 <= p103))) U ((1 <= p66) AND (1 <= p78) AND (1 <= p83) AND (1 <= p103))) AND F (X ((G (((1 <= p70) AND (1 <= p73) AND (1 <= p92) AND (1 <= p102))) AND ((p71 <= 0) OR (p72 <= 0) OR (p94 <= 0) OR (p102 <= 0)))))) : X ((((((NOT((((1 <= p68) AND (1 <= p76) AND (1 <= p87) AND (1 <= p103)) U ((1 <= p70) AND (1 <= p75) AND (1 <= p90) AND (1 <= p104)))) AND (1 <= p68)) AND (1 <= p76)) AND (1 <= p87)) AND (1 <= p103)) U X (G (((p68 <= 0) OR (p76 <= 0) OR (p87 <= 0) OR (p103 <= 0)))))) : (X (X (((1 <= p71) AND (1 <= p75) AND (1 <= p91) AND (1 <= p105) AND (1 <= p66) AND (1 <= p86) AND (1 <= p100)))) OR NOT(G (((1 <= p64) AND (1 <= p77) AND (1 <= p82) AND (1 <= p100)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:522
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((((1 <= p69) AND (1 <= p74) AND (1 <= p90) AND (1 <= p102)) OR ((1 <= p70) AND (1 <= p79) AND (1 <= p86) AND (1 <= p108))) U G ((F (((1 <= p67) AND (1 <= p74) AND (1 <= p88) AND (1 <= p100))) OR ((p70 <= 0) OR ((p79 <= 0) OR ((p86 <= 0) OR (p108 <= 0))))))) OR ((1 <= p69) AND (1 <= p74) AND (1 <= p90) AND (1 <= p102)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((((1 <= p69) AND (1 <= p74) AND (1 <= p90) AND (1 <= p102)) OR ((1 <= p70) AND (1 <= p79) AND (1 <= p86) AND (1 <= p108))) U G ((F (((1 <= p67) AND (1 <= p74) AND (1 <= p88) AND (1 <= p100))) OR ((p70 <= 0) OR ((p79 <= 0) OR ((p86 <= 0) OR (p108 <= 0))))))) OR ((1 <= p69) AND (1 <= p74) AND (1 <= p90) AND (1 <= p102)))))
lola: processed formula length: 331
lola: 73 rewrites
lola: closed formula file LTLFireability.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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 241242 markings, 1264305 edges
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (((1 <= p71) AND (1 <= p74) AND (1 <= p92) AND (1 <= p104))) AND (F (((1 <= p68) AND (1 <= p75) AND (1 <= p88) AND (1 <= p102))) OR X (X (((1 <= p71) AND (1 <= p74) AND (1 <= p92) AND (1 <= p104))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (((1 <= p71) AND (1 <= p74) AND (1 <= p92) AND (1 <= p104))) AND (F (((1 <= p68) AND (1 <= p75) AND (1 <= p88) AND (1 <= p102))) OR X (X (((1 <= p71) AND (1 <= p74) AND (1 <= p92) AND (1 <= p104))))))))
lola: processed formula length: 211
lola: 73 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 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: 9 markings, 10 edges
lola: ========================================
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((1 <= p67) AND (1 <= p76) AND (1 <= p86) AND (1 <= p102)))) AND G (((F (((1 <= p71) AND (1 <= p75) AND (1 <= p91) AND (1 <= p105))) AND ((1 <= p67) AND ((1 <= p76) AND ((1 <= p86) AND (1 <= p102))))) OR X ((((1 <= p70) AND (1 <= p74) AND (1 <= p91) AND (1 <= p103)) U G (((1 <= p67) AND (1 <= p76) AND (1 <= p86) AND (1 <= p102))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p67) AND (1 <= p76) AND (1 <= p86) AND (1 <= p102))))
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 (((1 <= p67) AND (1 <= p76) AND (1 <= p86) AND (1 <= p102))))
lola: processed formula length: 66
lola: 73 rewrites
lola: closed formula file LTLFireability.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: 7 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (G (((p70 <= 0) OR (p79 <= 0) OR (p86 <= 0) OR (p108 <= 0)))) OR G (((1 <= p69) AND (1 <= p74) AND (1 <= p90) AND (1 <= p102)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G (((p70 <= 0) OR (p79 <= 0) OR (p86 <= 0) OR (p108 <= 0)))) OR G (((1 <= p69) AND (1 <= p74) AND (1 <= p90) AND (1 <= p102)))))
lola: processed formula length: 138
lola: 73 rewrites
lola: closed formula file LTLFireability.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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 277345 markings, 1968577 edges
lola: ========================================
lola: subprocess 4 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((p67 <= 0) OR (p74 <= 0) OR (p88 <= 0) OR (p100 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((p67 <= 0) OR (p74 <= 0) OR (p88 <= 0) OR (p100 <= 0)))))
lola: processed formula length: 70
lola: 73 rewrites
lola: closed formula file LTLFireability.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: 799 markings, 2567 edges
lola: ========================================
lola: subprocess 5 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((1 <= p67) AND (1 <= p79) AND (1 <= p83) AND (1 <= p105) AND (1 <= p65) AND (1 <= p78) AND (1 <= p82) AND (1 <= p102))) AND X (X ((X (G (((p68 <= 0) OR (p78 <= 0) OR (p85 <= 0) OR (p105 <= 0)))) AND ((1 <= p67) AND (1 <= p79) AND (1 <= p83) AND (1 <= p105))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p67) AND (1 <= p79) AND (1 <= p83) AND (1 <= p105) AND (1 <= p65) AND (1 <= p78) AND (1 <= p82) AND (1 <= p102)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p67) AND (1 <= p79) AND (1 <= p83) AND (1 <= p105) AND (1 <= p65) AND (1 <= p78) AND (1 <= p82) AND (1 <= p102)))
lola: processed formula length: 123
lola: 73 rewrites
lola: closed formula file LTLFireability.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: 8 markings, 8 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 6 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X ((((p70 <= 0) OR (p78 <= 0) OR (p87 <= 0) OR (p107 <= 0)) R (((1 <= p69) AND (1 <= p77) AND (1 <= p87) AND (1 <= p105)) R ((1 <= p64) AND (1 <= p79) AND (1 <= p80) AND (1 <= p102)))))) AND ((1 <= p64) AND ((1 <= p79) AND ((1 <= p80) AND (1 <= p102)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p64) AND ((1 <= p79) AND ((1 <= p80) AND (1 <= p102))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: ((1 <= p64) AND (1 <= p79) AND (1 <= p80) AND (1 <= p102))
lola: processed formula length: 58
lola: 78 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((((p70 <= 0) OR (p78 <= 0) OR (p87 <= 0) OR (p107 <= 0)) R (((1 <= p69) AND (1 <= p77) AND (1 <= p87) AND (1 <= p105)) R ((1 <= p64) AND (1 <= p79) AND (1 <= p80) AND (1 <= p102))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((((p70 <= 0) OR (p78 <= 0) OR (p87 <= 0) OR (p107 <= 0)) R (((1 <= p69) AND (1 <= p77) AND (1 <= p87) AND (1 <= p105)) R ((1 <= p64) AND (1 <= p79) AND (1 <= p80) AND (1 <= p102))))))
lola: processed formula length: 192
lola: 73 rewrites
lola: closed formula file LTLFireability.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: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p66) AND (1 <= p78) AND (1 <= p83) AND (1 <= p103)) OR (G (((1 <= p66) AND (1 <= p78) AND (1 <= p83) AND (1 <= p103))) AND F (((1 <= p66) AND (1 <= p78) AND (1 <= p83) AND (1 <= p103))))) AND X (F ((G (((1 <= p70) AND (1 <= p73) AND (1 <= p92) AND (1 <= p102))) AND ((p71 <= 0) OR (p72 <= 0) OR (p94 <= 0) OR (p102 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G (((1 <= p70) AND (1 <= p73) AND (1 <= p92) AND (1 <= p102))) AND ((p71 <= 0) OR (p72 <= 0) OR (p94 <= 0) OR (p102 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G (((1 <= p70) AND (1 <= p73) AND (1 <= p92) AND (1 <= p102))) AND ((p71 <= 0) OR (p72 <= 0) OR (p94 <= 0) OR (p102 <= 0)))))
lola: processed formula length: 135
lola: 73 rewrites
lola: closed formula file LTLFireability.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: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((((p68 <= 0) OR (p76 <= 0) OR (p87 <= 0) OR (p103 <= 0)) R ((p70 <= 0) OR (p75 <= 0) OR (p90 <= 0) OR (p104 <= 0))) AND ((1 <= p68) AND ((1 <= p76) AND ((1 <= p87) AND (1 <= p103))))) U X (G (((p68 <= 0) OR (p76 <= 0) OR (p87 <= 0) OR (p103 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((((p68 <= 0) OR (p76 <= 0) OR (p87 <= 0) OR (p103 <= 0)) R ((p70 <= 0) OR (p75 <= 0) OR (p90 <= 0) OR (p104 <= 0))) AND ((1 <= p68) AND ((1 <= p76) AND ((1 <= p87) AND (1 <= p103))))) U X (G (((p68 <= 0) OR (p76 <= 0) OR (p87 <= 0) OR (p103 <= 0))))))
lola: processed formula length: 265
lola: 73 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 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: 1593 markings, 7689 edges
lola: ========================================
lola: subprocess 9 will run for 3563 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (((1 <= p71) AND (1 <= p75) AND (1 <= p91) AND (1 <= p105) AND (1 <= p66) AND (1 <= p86) AND (1 <= p100)))) OR F (((p64 <= 0) OR (p77 <= 0) OR (p82 <= 0) OR (p100 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 3563 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p64 <= 0) OR (p77 <= 0) OR (p82 <= 0) OR (p100 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((1 <= p64) AND (1 <= p77) AND (1 <= p82) AND (1 <= p100))
lola: processed formula length: 58
lola: 75 rewrites
lola: closed formula file LTLFireability.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: 10172 markings, 40340 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no yes no no no no no yes
lola:
preliminary result: yes no no yes no no no no no yes
lola: memory consumption: 40856 KB
lola: time consumption: 7 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.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="NQueens-PT-08"
export BK_EXAMINATION="LTLFireability"
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 NQueens-PT-08, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r174-csrt-158987852700122"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NQueens-PT-08.tgz
mv NQueens-PT-08 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;