About the Execution of ITS-LoLa for RwMutex-PT-r0020w0010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15741.630 | 3600000.00 | 118704.00 | 18333.00 | TTFTTFFFFTFTFFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2020-input.r186-oct2-158987938800300.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is RwMutex-PT-r0020w0010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938800300
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 3.6K Apr 12 12:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 12 12:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 11 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 11 13:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 14 12:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 10 17:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 10 17:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 9 23:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 9 23:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 43K Mar 24 05:38 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 RwMutex-PT-r0020w0010-CTLFireability-00
FORMULA_NAME RwMutex-PT-r0020w0010-CTLFireability-01
FORMULA_NAME RwMutex-PT-r0020w0010-CTLFireability-02
FORMULA_NAME RwMutex-PT-r0020w0010-CTLFireability-03
FORMULA_NAME RwMutex-PT-r0020w0010-CTLFireability-04
FORMULA_NAME RwMutex-PT-r0020w0010-CTLFireability-05
FORMULA_NAME RwMutex-PT-r0020w0010-CTLFireability-06
FORMULA_NAME RwMutex-PT-r0020w0010-CTLFireability-07
FORMULA_NAME RwMutex-PT-r0020w0010-CTLFireability-08
FORMULA_NAME RwMutex-PT-r0020w0010-CTLFireability-09
FORMULA_NAME RwMutex-PT-r0020w0010-CTLFireability-10
FORMULA_NAME RwMutex-PT-r0020w0010-CTLFireability-11
FORMULA_NAME RwMutex-PT-r0020w0010-CTLFireability-12
FORMULA_NAME RwMutex-PT-r0020w0010-CTLFireability-13
FORMULA_NAME RwMutex-PT-r0020w0010-CTLFireability-14
FORMULA_NAME RwMutex-PT-r0020w0010-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1591233091549
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 01:11:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 01:11:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 01:11:33] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2020-06-04 01:11:33] [INFO ] Transformed 80 places.
[2020-06-04 01:11:33] [INFO ] Transformed 60 transitions.
[2020-06-04 01:11:33] [INFO ] Parsed PT model containing 80 places and 60 transitions in 90 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 363 ms. (steps per millisecond=275 ) properties seen :[0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1]
// Phase 1: matrix 60 rows 80 cols
[2020-06-04 01:11:34] [INFO ] Computed 50 place invariants in 5 ms
[2020-06-04 01:11:34] [INFO ] [Real]Absence check using 50 positive place invariants in 16 ms returned unsat
[2020-06-04 01:11:34] [INFO ] [Real]Absence check using 50 positive place invariants in 31 ms returned sat
[2020-06-04 01:11:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 01:11:35] [INFO ] [Real]Absence check using state equation in 481 ms returned sat
[2020-06-04 01:11:35] [INFO ] Computed and/alt/rep : 30/30/30 causal constraints in 31 ms.
[2020-06-04 01:11:35] [INFO ] Added : 0 causal constraints over 0 iterations in 63 ms. Result :sat
[2020-06-04 01:11:35] [INFO ] [Real]Absence check using 50 positive place invariants in 21 ms returned sat
[2020-06-04 01:11:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 01:11:35] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2020-06-04 01:11:35] [INFO ] Computed and/alt/rep : 30/30/30 causal constraints in 2 ms.
[2020-06-04 01:11:35] [INFO ] Added : 0 causal constraints over 0 iterations in 29 ms. Result :sat
[2020-06-04 01:11:35] [INFO ] [Real]Absence check using 50 positive place invariants in 11 ms returned sat
[2020-06-04 01:11:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 01:11:35] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2020-06-04 01:11:35] [INFO ] Computed and/alt/rep : 30/30/30 causal constraints in 6 ms.
[2020-06-04 01:11:35] [INFO ] Added : 0 causal constraints over 0 iterations in 30 ms. Result :sat
[2020-06-04 01:11:35] [INFO ] [Real]Absence check using 50 positive place invariants in 10 ms returned unsat
[2020-06-04 01:11:35] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned unsat
[2020-06-04 01:11:35] [INFO ] [Real]Absence check using 50 positive place invariants in 4 ms returned unsat
[2020-06-04 01:11:35] [INFO ] [Real]Absence check using 50 positive place invariants in 120 ms returned sat
[2020-06-04 01:11:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 01:11:35] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2020-06-04 01:11:35] [INFO ] Computed and/alt/rep : 30/30/30 causal constraints in 4 ms.
[2020-06-04 01:11:35] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
[2020-06-04 01:11:35] [INFO ] [Real]Absence check using 50 positive place invariants in 167 ms returned sat
[2020-06-04 01:11:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 01:11:35] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2020-06-04 01:11:35] [INFO ] Computed and/alt/rep : 30/30/30 causal constraints in 4 ms.
[2020-06-04 01:11:35] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
[2020-06-04 01:11:35] [INFO ] [Real]Absence check using 50 positive place invariants in 3 ms returned unsat
[2020-06-04 01:11:36] [INFO ] [Real]Absence check using 50 positive place invariants in 70 ms returned unsat
[2020-06-04 01:11:36] [INFO ] [Real]Absence check using 50 positive place invariants in 279 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 7 simplifications.
[2020-06-04 01:11:36] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-04 01:11:36] [INFO ] Flatten gal took : 86 ms
[2020-06-04 01:11:36] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-04 01:11:36] [INFO ] Flatten gal took : 18 ms
FORMULA RwMutex-PT-r0020w0010-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0020w0010-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0020w0010-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0020w0010-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0020w0010-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0020w0010-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0020w0010-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0020w0010-CTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 01:11:36] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2020-06-04 01:11:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ RwMutex-PT-r0020w0010 @ 3570 seconds
FORMULA RwMutex-PT-r0020w0010-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0020w0010-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0020w0010-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0020w0010-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0020w0010-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0020w0010-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0020w0010-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0020w0010-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3498
rslt: Output for CTLFireability @ RwMutex-PT-r0020w0010
{
"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=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 01:11:36 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": "(1 <= p0)",
"processed_size": 9,
"rewrites": 20
},
"result":
{
"edges": 60,
"markings": 31,
"produced_by": "tscc_search",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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": "(p30 <= 0)",
"processed_size": 10,
"rewrites": 21
},
"result":
{
"edges": 11010068,
"markings": 1048586,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 593
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": "(1 <= p36)",
"processed_size": 10,
"rewrites": 20
},
"result":
{
"edges": 11534374,
"markings": 1048586,
"produced_by": "tscc_search",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 711
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "((p3 <= 0) OR (p58 <= 0))",
"processed_size": 26,
"rewrites": 20
},
"result":
{
"edges": 11534374,
"markings": 1048586,
"produced_by": "tscc_search",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 887
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 21,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 21,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "((p14 <= 0) OR (p47 <= 0) OR (p48 <= 0) OR (p49 <= 0) OR (p50 <= 0) OR (p51 <= 0) OR (p52 <= 0) OR (p53 <= 0) OR (p54 <= 0) OR (p56 <= 0) OR (p57 <= 0) OR (p58 <= 0) OR (p59 <= 0) OR (p60 <= 0) OR (p61 <= 0) OR (p62 <= 0) OR (p63 <= 0) OR (p64 <= 0) OR (p65 <= 0) OR (p67 <= 0) OR (p68 <= 0))",
"processed_size": 312,
"rewrites": 21
},
"result":
{
"edges": 20971540,
"markings": 1048586,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 21,
"problems": 21
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1179
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 22,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "((p24 <= 0) OR (p47 <= 0) OR (p48 <= 0) OR (p49 <= 0) OR (p50 <= 0) OR (p51 <= 0) OR (p52 <= 0) OR (p53 <= 0) OR (p54 <= 0) OR (p56 <= 0) OR (p57 <= 0) OR (p58 <= 0) OR (p59 <= 0) OR (p60 <= 0) OR (p61 <= 0) OR (p62 <= 0) OR (p63 <= 0) OR (p64 <= 0) OR (p65 <= 0) OR (p67 <= 0) OR (p68 <= 0) OR (p18 <= 0))",
"processed_size": 327,
"rewrites": 20
},
"result":
{
"edges": 20971540,
"markings": 1048586,
"produced_by": "tscc_search",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 22,
"problems": 22
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1764
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 0,
"U": 2,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "EF((E((1 <= p70) U ((1 <= p54) AND (1 <= p79))) AND A((1 <= p39) U (1 <= p75))))",
"processed_size": 80,
"rewrites": 20
},
"net":
{
"conflict_clusters": 31,
"singleton_clusters": 0
},
"result":
{
"edges": 22872096,
"markings": 1048586,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3515
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3515
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": "(1 <= p30)",
"processed_size": 10,
"rewrites": 20
},
"result":
{
"edges": 11534374,
"markings": 1048586,
"produced_by": "tscc_search",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": "(1 <= p30)",
"processed_size": 10,
"rewrites": 20
},
"result":
{
"edges": 11534374,
"markings": 1048586,
"produced_by": "tscc_search",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "((1 <= p11) AND (1 <= p47))",
"processed_size": 27,
"rewrites": 21
},
"result":
{
"edges": 11534355,
"markings": 1048586,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 26440,
"runtime": 72.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(E(F(**)))) : E(F(A(G(**)))) : A(G(E(F(**)))) : A(G(E(F(*)))) : E(F((E((** U **)) AND A((** U **))))) : E(F(A(G(**)))) : (E(F(A(G(*)))) AND A(G(E(F(**))))) : A(G(E(F(**))))"
},
"net":
{
"arcs": 560,
"conflict_clusters": 31,
"places": 80,
"places_significant": 30,
"singleton_clusters": 0,
"transitions": 60
},
"result":
{
"preliminary_value": "yes no yes yes no no no yes ",
"value": "yes no yes yes 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: 140/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 80
lola: finding significant places
lola: 80 places, 60 transitions, 30 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 CTLFireability.xml
lola: NOT(E (F (NOT(E (F ((1 <= p0))))))) : E (F (E (G (A (G ((1 <= p30))))))) : A (G (E (F (((p24 <= 0) OR (p47 <= 0) OR (p48 <= 0) OR (p49 <= 0) OR (p50 <= 0) OR (p51 <= 0) OR (p52 <= 0) OR (p53 <= 0) OR (p54 <= 0) OR (p56 <= 0) OR (p57 <= 0) OR (p58 <= 0) OR (p59 <= 0) OR (p60 <= 0) OR (p61 <= 0) OR (p62 <= 0) OR (p63 <= 0) OR (p64 <= 0) OR (p65 <= 0) OR (p67 <= 0) OR (p68 <= 0) OR (p18 <= 0)))))) : A (G (NOT(A (G (((1 <= p3) AND (1 <= p58))))))) : E (F ((E (((1 <= p70) U ((1 <= p54) AND (1 <= p79)))) AND A (((1 <= p39) U (1 <= p75)))))) : E (F (A (G (((1 <= p14) AND (1 <= p47) AND (1 <= p48) AND (1 <= p49) AND (1 <= p50) AND (1 <= p51) AND (1 <= p52) AND (1 <= p53) AND (1 <= p54) AND (1 <= p56) AND (1 <= p57) AND (1 <= p58) AND (1 <= p59) AND (1 <= p60) AND (1 <= p61) AND (1 <= p62) AND (1 <= p63) AND (1 <= p64) AND (1 <= p65) AND (1 <= p67) AND (1 <= p68)))))) : (NOT(A (G (E (F (((1 <= p11) AND (1 <= p47))))))) AND A (G (E (F ((1 <= p30)))))) : A (G (E (F ((1 <= p36)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:476
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((1 <= p0)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (1 <= p0)
lola: processed formula length: 9
lola: 20 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 31 markings, 60 edges
lola: ========================================
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((1 <= p30)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p30 <= 0)
lola: processed formula length: 10
lola: 21 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p30)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: state equation: write sara problem file to CTLFireability-0.sara
lola: state equation: calling and running sara
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p30 <= 0)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
sara: try reading problem file CTLFireability-0.sara.
lola: state equation: write sara problem file to CTLFireability-1.sara
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-1.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 1021750 markings, 10084419 edges, 204350 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 1048586 markings, 11010068 edges
lola: ========================================
lola: subprocess 2 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((1 <= p36)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (1 <= p36)
lola: processed formula length: 10
lola: 20 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (1 <= p36)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p36 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-2-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: write sara problem file to CTLFireability-2-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-2-1.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 999675 markings, 9276160 edges, 199935 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 1048586 markings, 11534374 edges
lola: ========================================
lola: subprocess 3 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((p3 <= 0) OR (p58 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((p3 <= 0) OR (p58 <= 0))
lola: processed formula length: 26
lola: 20 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p3) AND (1 <= p58))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p3 <= 0) OR (p58 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-3-1.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-3-0.sara
sara: try reading problem file CTLFireability-3-1.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-3-0.sara.
lola: state equation 1: solution produced
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 998795 markings, 9237992 edges, 199759 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 1048586 markings, 11534374 edges
lola: ========================================
lola: subprocess 4 will run for 887 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((1 <= p14) AND (1 <= p47) AND (1 <= p48) AND (1 <= p49) AND (1 <= p50) AND (1 <= p51) AND (1 <= p52) AND (1 <= p53) AND (1 <= p54) AND (1 <= p56) AND (1 <= p57) AND (1 <= p58) AND (1 <= p59) AND (1 <= p60) AND (1 <= p61) AND (1 <= p62) AND (1 <= p63) AND (1 <= p64) AND (1 <= p65) AND (1 <= p67) AND (1 <= p68))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p14 <= 0) OR (p47 <= 0) OR (p48 <= 0) OR (p49 <= 0) OR (p50 <= 0) OR (p51 <= 0) OR (p52 <= 0) OR (p53 <= 0) OR (p54 <= 0) OR (p56 <= 0) OR (p57 <= 0) OR (p58 <= 0) OR (p59 <= 0) OR (p60 <= 0) OR (p61 <= 0) OR (p62 <= 0) OR (p63 <= 0) OR (p64 <= 0) OR (p65 <= 0) OR (p67 <= 0) OR (p68 <= 0))
lola: processed formula length: 312
lola: 21 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p14) AND (1 <= p47) AND (1 <= p48) AND (1 <= p49) AND (1 <= p50) AND (1 <= p51) AND (1 <= p52) AND (1 <= p53) AND (1 <= p54) AND (1 <= p56) AND (1 <= p57) AND (1 <= p58) AND (1 <= p59) AND (1 <= p60) AND (1 <= p61) AND (1 <= p62) AND (1 <= p63) AND (1 <= p64) AND (1 <= p65) AND (1 <= p67) AND (1 <= p68))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 21 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-4-0.sara
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p14 <= 0) OR (p47 <= 0) OR (p48 <= 0) OR (p49 <= 0) OR (p50 <= 0) OR (p51 <= 0) OR (p52 <= 0) OR (p53 <= 0) OR (p54 <= 0) OR (p56 <= 0) OR (p57 <= 0) OR (p58 <= 0) OR (p59 <= 0) OR (p60 <= 0) OR (p61 <= 0) OR (p62 <= 0) OR (p63 <= 0) OR (p64 <= 0) OR (p65 <= 0) OR (p67 <= 0) OR (p68 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 21 literals and 21 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-4-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-4-1.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 1048393 markings, 9722008 edges, 209679 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 1048586 markings, 20971540 edges
lola: ========================================
lola: subprocess 5 will run for 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((p24 <= 0) OR (p47 <= 0) OR (p48 <= 0) OR (p49 <= 0) OR (p50 <= 0) OR (p51 <= 0) OR (p52 <= 0) OR (p53 <= 0) OR (p54 <= 0) OR (p56 <= 0) OR (p57 <= 0) OR (p58 <= 0) OR (p59 <= 0) OR (p60 <= 0) OR (p61 <= 0) OR (p62 <= 0) OR (p63 <= 0) OR (p64 <= 0) OR (p65 <= 0) OR (p67 <= 0) OR (p68 <= 0) OR (p18 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((p24 <= 0) OR (p47 <= 0) OR (p48 <= 0) OR (p49 <= 0) OR (p50 <= 0) OR (p51 <= 0) OR (p52 <= 0) OR (p53 <= 0) OR (p54 <= 0) OR (p56 <= 0) OR (p57 <= 0) OR (p58 <= 0) OR (p59 <= 0) OR (p60 <= 0) OR (p61 <= 0) OR (p62 <= 0) OR (p63 <= 0) OR (p64 <= 0) OR (p65 <= 0) OR (p67 <= 0) OR (p68 <= 0) OR (p18 <= 0))
lola: processed formula length: 327
lola: 20 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p24) AND (1 <= p47) AND (1 <= p48) AND (1 <= p49) AND (1 <= p50) AND (1 <= p51) AND (1 <= p52) AND (1 <= p53) AND (1 <= p54) AND (1 <= p56) AND (1 <= p57) AND (1 <= p58) AND (1 <= p59) AND (1 <= p60) AND (1 <= p61) AND (1 <= p62) AND (1 <= p63) AND (1 <= p64) AND (1 <= p65) AND (1 <= p67) AND (1 <= p68) AND (1 <= p18))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 22 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p24 <= 0) OR (p47 <= 0) OR (p48 <= 0) OR (p49 <= 0) OR (p50 <= 0) OR (p51 <= 0) OR (p52 <= 0) OR (p53 <= 0) OR (p54 <= 0) OR (p56 <= 0) OR (p57 <= 0) OR (p58 <= 0) OR (p59 <= 0) OR (p60 <= 0) OR (p61 <= 0) OR (p62 <= 0) OR (p63 <= 0) OR (p64 <= 0) OR (p65 <= 0) OR (p67 <= 0) OR (p68 <= 0) OR (p18 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 22 literals and 22 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-5-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-5-1.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: write sara problem file to CTLFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-5-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 1048410 markings, 10067199 edges, 209682 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 1048586 markings, 20971540 edges
lola: ========================================
lola: subprocess 6 will run for 1764 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (((1 <= p70) U ((1 <= p54) AND (1 <= p79)))) AND A (((1 <= p39) U (1 <= p75))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((E((1 <= p70) U ((1 <= p54) AND (1 <= p79))) AND A((1 <= p39) U (1 <= p75))))
lola: processed formula length: 80
lola: 20 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1047929 markings, 8381586 edges, 209586 markings/sec, 0 secs
lola: 1048531 markings, 15543385 edges, 120 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1048586 markings, 22872096 edges
lola: ========================================
lola: subprocess 7 will run for 3515 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G (((p11 <= 0) OR (p47 <= 0)))))) AND A (G (E (F ((1 <= p30))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 3515 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((1 <= p30)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (1 <= p30)
lola: processed formula length: 10
lola: 20 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p30 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-7-0.sara
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (1 <= p30)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-7-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-7-0.sara.
sara: try reading problem file CTLFireability-7-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 979328 markings, 9913848 edges, 195866 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 1048586 markings, 11534374 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (F (A (G (((p11 <= 0) OR (p47 <= 0)))))) AND A (G (E (F ((1 <= p30))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((1 <= p30)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (1 <= p30)
lola: processed formula length: 10
lola: 20 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p30 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (1 <= p30)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-8-1.sara
lola: state equation: write sara problem file to CTLFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-8-1.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-8-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 956085 markings, 9425487 edges, 191217 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 1048586 markings, 11534374 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((p11 <= 0) OR (p47 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((1 <= p11) AND (1 <= p47))
lola: processed formula length: 27
lola: 21 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p11 <= 0) OR (p47 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-9-0.sara
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p11) AND (1 <= p47))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-9-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-9-0.sara.
sara: try reading problem file CTLFireability-9-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 974990 markings, 9901611 edges, 194998 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 1048586 markings, 11534355 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes yes no no no yes
lola:
preliminary result: yes no yes yes no no no yes
lola: memory consumption: 26440 KB
lola: time consumption: 72 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 16122244 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16121984 kB
--------------------
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="RwMutex-PT-r0020w0010"
export BK_EXAMINATION="CTLFireability"
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 RwMutex-PT-r0020w0010, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r186-oct2-158987938800300"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RwMutex-PT-r0020w0010.tgz
mv RwMutex-PT-r0020w0010 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;