About the Execution of ITS-LoLa for ClientsAndServers-PT-N1000P0
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15797.680 | 3600000.00 | 964800.00 | 19682.10 | FTFFFT?TTTTFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2020-input.r168-smll-158987806400241.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is ClientsAndServers-PT-N1000P0, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-smll-158987806400241
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.6K Mar 30 01:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 30 01:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 15:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 08:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 08:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 26 07:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 26 07:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 9.1K 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 ClientsAndServers-PT-N1000P0-00
FORMULA_NAME ClientsAndServers-PT-N1000P0-01
FORMULA_NAME ClientsAndServers-PT-N1000P0-02
FORMULA_NAME ClientsAndServers-PT-N1000P0-03
FORMULA_NAME ClientsAndServers-PT-N1000P0-04
FORMULA_NAME ClientsAndServers-PT-N1000P0-05
FORMULA_NAME ClientsAndServers-PT-N1000P0-06
FORMULA_NAME ClientsAndServers-PT-N1000P0-07
FORMULA_NAME ClientsAndServers-PT-N1000P0-08
FORMULA_NAME ClientsAndServers-PT-N1000P0-09
FORMULA_NAME ClientsAndServers-PT-N1000P0-10
FORMULA_NAME ClientsAndServers-PT-N1000P0-11
FORMULA_NAME ClientsAndServers-PT-N1000P0-12
FORMULA_NAME ClientsAndServers-PT-N1000P0-13
FORMULA_NAME ClientsAndServers-PT-N1000P0-14
FORMULA_NAME ClientsAndServers-PT-N1000P0-15
=== Now, execution of the tool begins
BK_START 1591246760134
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 04:59:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 04:59:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 04:59:22] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2020-06-04 04:59:22] [INFO ] Transformed 25 places.
[2020-06-04 04:59:22] [INFO ] Transformed 18 transitions.
[2020-06-04 04:59:22] [INFO ] Parsed PT model containing 25 places and 18 transitions in 89 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100047 steps, including 0 resets, run finished after 90 ms. (steps per millisecond=1111 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 18 rows 25 cols
[2020-06-04 04:59:22] [INFO ] Computed 8 place invariants in 4 ms
[2020-06-04 04:59:22] [INFO ] [Real]Absence check using 5 positive place invariants in 17 ms returned sat
[2020-06-04 04:59:22] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 3 ms returned sat
[2020-06-04 04:59:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:59:22] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2020-06-04 04:59:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:59:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2020-06-04 04:59:22] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-04 04:59:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:59:22] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2020-06-04 04:59:22] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints in 4 ms.
[2020-06-04 04:59:22] [INFO ] Added : 4 causal constraints over 1 iterations in 22 ms. Result :sat
[2020-06-04 04:59:23] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-06-04 04:59:23] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 04:59:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:59:23] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2020-06-04 04:59:23] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints in 3 ms.
[2020-06-04 04:59:23] [INFO ] Added : 12 causal constraints over 3 iterations in 21 ms. Result :sat
[2020-06-04 04:59:23] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2020-06-04 04:59:23] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2020-06-04 04:59:23] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2020-06-04 04:59:23] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-06-04 04:59:23] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-04 04:59:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:59:23] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-06-04 04:59:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:59:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2020-06-04 04:59:23] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-04 04:59:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:59:23] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2020-06-04 04:59:23] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints in 2 ms.
[2020-06-04 04:59:23] [INFO ] Added : 13 causal constraints over 3 iterations in 18 ms. Result :sat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-06-04 04:59:23] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-04 04:59:23] [INFO ] Flatten gal took : 35 ms
FORMULA ClientsAndServers-PT-N1000P0-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N1000P0-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N1000P0-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N1000P0-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N1000P0-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 04:59:23] [INFO ] Flatten gal took : 8 ms
[2020-06-04 04:59:23] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-04 04:59:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ClientsAndServers-PT-N1000P0 @ 3570 seconds
FORMULA ClientsAndServers-PT-N1000P0-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N1000P0-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N1000P0-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N1000P0-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N1000P0-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N1000P0-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N1000P0-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N1000P0-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N1000P0-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N1000P0-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N1000P0-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2604
rslt: Output for LTLCardinality @ ClientsAndServers-PT-N1000P0
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 04:59:24 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G ((X (F ((p17 <= p10))) OR (F ((p18 <= p6)) AND (1 <= p8)))))",
"processed_size": 65,
"rewrites": 66
},
"result":
{
"edges": 532111,
"markings": 296090,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "X (F ((p22 <= 1)))",
"processed_size": 18,
"rewrites": 66
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 401
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((X ((X (G ((p9 <= p15))) U (p20 + 1 <= p15))) AND ((p9 <= p15) AND (p23 + 1 <= p9))))",
"processed_size": 88,
"rewrites": 66
},
"result":
{
"edges": 50005,
"markings": 50005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 458
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 458
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"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": "F ((G ((p9 + 1 <= p15)) AND (p10 + 1 <= p18)))",
"processed_size": 46,
"rewrites": 66
},
"result":
{
"edges": 50002,
"markings": 50002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 535
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((F ((2 <= p22)) AND (X ((2 <= p22)) OR (p14 <= p19)))))",
"processed_size": 61,
"rewrites": 66
},
"result":
{
"edges": 50001,
"markings": 50001,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"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": 642
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 642
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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": "G ((3 <= p22))",
"processed_size": 14,
"rewrites": 66
},
"result":
{
"edges": 8020,
"markings": 8020,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 802
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"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": "X (X (G ((p22 <= 2))))",
"processed_size": 22,
"rewrites": 66
},
"result":
{
"edges": 1390356,
"markings": 626180,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 802
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 802
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((p8 <= p20)))",
"processed_size": 19,
"rewrites": 66
},
"result":
{
"edges": 50003,
"markings": 50002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"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": 7,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1069
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": "F (G ((3 <= p16)))",
"processed_size": 18,
"rewrites": 66
},
"result":
{
"edges": 50003,
"markings": 50002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1604
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((G ((p3 <= 2)) AND (p3 <= 2))))",
"processed_size": 37,
"rewrites": 66
},
"result":
{
"edges": 84175,
"markings": 82166,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3208
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3208
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p13 + 1 <= p18)",
"processed_size": 16,
"rewrites": 68
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (((p12 + 1 <= p5) OR (p10 <= 0)))",
"processed_size": 35,
"rewrites": 66
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},
{
"child":
[
{
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p13 + 1 <= p18)",
"processed_size": 16,
"rewrites": 68
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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": 3,
"visible_transitions": 0
},
"processed": "F (G ((((p8 <= 1) AND (p13 + 1 <= p18)) OR (p8 <= 1))))",
"processed_size": 56,
"rewrites": 66
},
"result":
{
"edges": 50003,
"markings": 50002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3144,
"runtime": 966.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(**)) : F(G((G(*) AND **))) : F(G((X(F(**)) OR (F(**) AND **)))) : (F(G(**)) AND F(**)) : (F((X(**) AND **)) AND X((* OR *))) : X(F(*)) : X((X((X(G(**)) U *)) AND (** AND **))) : (F((G(*) AND **)) AND G((F((X(**) OR **)) OR **))) : G(F((F(**) AND (X(**) OR **)))) : (X(X(G(**))) OR G(**)) : (F(G(**)) AND G(((F(*) AND (X(*) AND **)) OR X(X(G(**))))))"
},
"net":
{
"arcs": 54,
"conflict_clusters": 16,
"places": 25,
"places_significant": 17,
"singleton_clusters": 0,
"transitions": 18
},
"result":
{
"preliminary_value": "no no no no unknown yes no no no no no ",
"value": "no no no no unknown yes no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 43/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 800
lola: finding significant places
lola: 25 places, 18 transitions, 17 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: F (G (F (G ((3 <= p16))))) : NOT(G (NOT(G ((NOT((F ((3 <= p3)) U F ((3 <= p3)))) AND (p3 <= 2)))))) : F (G ((F (X ((p17 <= p10))) OR (F ((p18 <= p6)) AND (1 <= p8))))) : (X (F (G (X (G (X ((((p8 <= 1) AND (p13 + 1 <= p18)) OR (p8 <= 1)))))))) AND F ((p18 <= p13))) : (F ((X ((p24 <= p5)) AND (p5 <= p12))) AND (NOT(X ((p5 <= p12))) OR NOT(X ((1 <= p10))))) : F (((NOT(X (X ((p2 <= p3)))) OR NOT(X ((p3 + 1 <= p2)))) U NOT(X (G ((2 <= p22)))))) : (X (((X (G (X ((p9 <= p15)))) U NOT(X ((p15 <= p20)))) AND (p9 <= p15))) AND X ((p23 + 1 <= p9))) : (F ((NOT(F ((p15 <= p9))) AND (p10 + 1 <= p18))) AND G ((F ((X ((2 <= p21)) OR (p18 <= p10))) OR (2 <= p21)))) : F (G (F (((2 <= p22) U (F ((2 <= p22)) AND (X ((2 <= p22)) OR (p14 <= p19))))))) : (X (G (X ((p22 <= 2)))) OR G ((3 <= p22))) : G ((((NOT(G ((p2 + 1 <= p3))) AND NOT(X ((3 <= p21)))) AND (p20 + 1 <= p8)) U X (X (G ((p8 <= p20))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (F ((p17 <= p10))) OR (F ((p18 <= p6)) AND (1 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (F ((p17 <= p10))) OR (F ((p18 <= p6)) AND (1 <= p8)))))
lola: processed formula length: 65
lola: 66 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 296090 markings, 532111 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((X ((p24 <= p5)) AND (p5 <= p12))) AND X (((p12 + 1 <= p5) OR (p10 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p12 + 1 <= p5) OR (p10 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p12 + 1 <= p5) OR (p10 <= 0)))
lola: processed formula length: 35
lola: 66 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((p24 <= p5)) AND (p5 <= p12)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((p24 <= p5)) AND (p5 <= p12)))
lola: processed formula length: 37
lola: 66 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1940023 markings, 4503556 edges, 388005 markings/sec, 0 secs
lola: 3688335 markings, 8860518 edges, 349662 markings/sec, 5 secs
lola: 5366860 markings, 13121056 edges, 335705 markings/sec, 10 secs
lola: 7004179 markings, 17270387 edges, 327464 markings/sec, 15 secs
lola: 8550129 markings, 21218991 edges, 309190 markings/sec, 20 secs
lola: 10058574 markings, 25152812 edges, 301689 markings/sec, 25 secs
lola: 11561720 markings, 28978450 edges, 300629 markings/sec, 30 secs
lola: 13065969 markings, 32902354 edges, 300850 markings/sec, 35 secs
lola: 14605454 markings, 36856194 edges, 307897 markings/sec, 40 secs
lola: 16147279 markings, 40841699 edges, 308365 markings/sec, 45 secs
lola: 17619843 markings, 44770994 edges, 294513 markings/sec, 50 secs
lola: 19172646 markings, 48740689 edges, 310561 markings/sec, 55 secs
lola: 20614799 markings, 52480801 edges, 288431 markings/sec, 60 secs
lola: 22085847 markings, 56378245 edges, 294210 markings/sec, 65 secs
lola: 23461022 markings, 60095834 edges, 275035 markings/sec, 70 secs
lola: 24973732 markings, 63917515 edges, 302542 markings/sec, 75 secs
lola: 26311797 markings, 67441901 edges, 267613 markings/sec, 80 secs
lola: 27838183 markings, 71435337 edges, 305277 markings/sec, 85 secs
lola: 29214421 markings, 75136190 edges, 275248 markings/sec, 90 secs
lola: 30545575 markings, 78765737 edges, 266231 markings/sec, 95 secs
lola: 32050833 markings, 82536985 edges, 301052 markings/sec, 100 secs
lola: 33355055 markings, 85970739 edges, 260844 markings/sec, 105 secs
lola: 34817711 markings, 89781588 edges, 292531 markings/sec, 110 secs
lola: 36203775 markings, 93488921 edges, 277213 markings/sec, 115 secs
lola: 37529054 markings, 97079598 edges, 265056 markings/sec, 120 secs
lola: 38826835 markings, 100613821 edges, 259556 markings/sec, 125 secs
lola: 40200644 markings, 104194419 edges, 274762 markings/sec, 130 secs
lola: 41616517 markings, 107787467 edges, 283175 markings/sec, 135 secs
lola: 42879939 markings, 111141310 edges, 252684 markings/sec, 140 secs
lola: 44363871 markings, 115028813 edges, 296786 markings/sec, 145 secs
lola: 45790579 markings, 118861367 edges, 285342 markings/sec, 150 secs
lola: 47196752 markings, 122666240 edges, 281235 markings/sec, 155 secs
lola: 48535060 markings, 126325830 edges, 267662 markings/sec, 160 secs
lola: 49851983 markings, 129922879 edges, 263385 markings/sec, 165 secs
lola: 51344707 markings, 133701552 edges, 298545 markings/sec, 170 secs
lola: 52654963 markings, 137074270 edges, 262051 markings/sec, 175 secs
lola: 53841212 markings, 140233271 edges, 237250 markings/sec, 180 secs
lola: 55239431 markings, 143909542 edges, 279644 markings/sec, 185 secs
lola: 56659742 markings, 147693018 edges, 284062 markings/sec, 190 secs
lola: 57983167 markings, 151273097 edges, 264685 markings/sec, 195 secs
lola: 59267068 markings, 154752143 edges, 256780 markings/sec, 200 secs
lola: 60544863 markings, 158237128 edges, 255559 markings/sec, 205 secs
lola: 61783371 markings, 161636970 edges, 247702 markings/sec, 210 secs
lola: 63048352 markings, 165107971 edges, 252996 markings/sec, 215 secs
lola: 64450446 markings, 168668402 edges, 280419 markings/sec, 220 secs
lola: 65784071 markings, 172053041 edges, 266725 markings/sec, 225 secs
lola: 66938948 markings, 175113511 edges, 230975 markings/sec, 230 secs
lola: 68122255 markings, 178289454 edges, 236661 markings/sec, 235 secs
lola: 69498024 markings, 181907380 edges, 275154 markings/sec, 240 secs
lola: 70857328 markings, 185536656 edges, 271861 markings/sec, 245 secs
lola: 72155466 markings, 189046158 edges, 259628 markings/sec, 250 secs
lola: 73384314 markings, 192386612 edges, 245770 markings/sec, 255 secs
lola: 74548839 markings, 195566738 edges, 232905 markings/sec, 260 secs
lola: 75689677 markings, 198695274 edges, 228168 markings/sec, 265 secs
lola: 76850340 markings, 201896808 edges, 232133 markings/sec, 270 secs
lola: 77991427 markings, 205028245 edges, 228217 markings/sec, 275 secs
lola: 79064336 markings, 207980414 edges, 214582 markings/sec, 280 secs
lola: 80408300 markings, 211374530 edges, 268793 markings/sec, 285 secs
lola: 81746997 markings, 214739461 edges, 267739 markings/sec, 290 secs
lola: 82881044 markings, 217757438 edges, 226809 markings/sec, 295 secs
lola: 84000912 markings, 220769784 edges, 223974 markings/sec, 300 secs
lola: 85142099 markings, 223827152 edges, 228237 markings/sec, 305 secs
lola: 86471385 markings, 227319679 edges, 265857 markings/sec, 310 secs
lola: 87810283 markings, 230894071 edges, 267780 markings/sec, 315 secs
lola: 89075169 markings, 234317146 edges, 252977 markings/sec, 320 secs
lola: 90277375 markings, 237586001 edges, 240441 markings/sec, 325 secs
lola: 91464870 markings, 240825410 edges, 237499 markings/sec, 330 secs
lola: 92626959 markings, 244008949 edges, 232418 markings/sec, 335 secs
lola: 93764340 markings, 247160166 edges, 227476 markings/sec, 340 secs
lola: 94921374 markings, 250318447 edges, 231407 markings/sec, 345 secs
lola: 96027941 markings, 253365198 edges, 221313 markings/sec, 350 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown no unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown unknown no unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 21644 KB
lola: time consumption: 360 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p22 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p22 <= 1)))
lola: processed formula length: 18
lola: 66 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 3 will run for 401 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((X (G ((p9 <= p15))) U (p20 + 1 <= p15))) AND ((p9 <= p15) AND (p23 + 1 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((X (G ((p9 <= p15))) U (p20 + 1 <= p15))) AND ((p9 <= p15) AND (p23 + 1 <= p9))))
lola: processed formula length: 88
lola: 66 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 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: 50005 markings, 50005 edges
lola: ========================================
lola: subprocess 4 will run for 458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((G ((p9 + 1 <= p15)) AND (p10 + 1 <= p18))) AND G ((F ((X ((2 <= p21)) OR (p18 <= p10))) OR (2 <= p21))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((p9 + 1 <= p15)) AND (p10 + 1 <= p18)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((p9 + 1 <= p15)) AND (p10 + 1 <= p18)))
lola: processed formula length: 46
lola: 66 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 50002 markings, 50002 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 535 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F ((2 <= p22)) AND (X ((2 <= p22)) OR (p14 <= p19)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F ((2 <= p22)) AND (X ((2 <= p22)) OR (p14 <= p19)))))
lola: processed formula length: 61
lola: 66 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 50001 markings, 50001 edges
lola: ========================================
lola: subprocess 6 will run for 642 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (G ((p22 <= 2)))) OR G ((3 <= p22)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 642 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((3 <= p22))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((3 <= p22))
lola: processed formula length: 14
lola: 66 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8020 markings, 8020 edges
lola: ========================================
lola: subprocess 7 will run for 802 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((p22 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((p22 <= 2))))
lola: processed formula length: 22
lola: 66 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 626180 markings, 1390356 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 802 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((p8 <= p20))) AND G (((F ((p3 <= p2)) AND (X ((p21 <= 2)) AND (p20 + 1 <= p8))) OR X (X (G ((p8 <= p20)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 802 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p8 <= p20)))
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 ((p8 <= p20)))
lola: processed formula length: 19
lola: 66 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 50002 markings, 50003 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 8 will run for 1069 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((3 <= p16)))
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 ((3 <= p16)))
lola: processed formula length: 18
lola: 66 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 50002 markings, 50003 edges
lola: ========================================
lola: subprocess 9 will run for 1604 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G ((p3 <= 2)) AND (p3 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G ((p3 <= 2)) AND (p3 <= 2))))
lola: processed formula length: 37
lola: 66 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 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: 82166 markings, 84175 edges
lola: ========================================
lola: subprocess 10 will run for 3208 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((((p8 <= 1) AND (p13 + 1 <= p18)) OR (p8 <= 1)))) AND F ((p18 <= p13)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 3208 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p18 <= p13))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p13 + 1 <= p18)
lola: processed formula length: 16
lola: 68 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: 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: (F ((X ((p24 <= p5)) AND (p5 <= p12))) AND X (((p12 + 1 <= p5) OR (p10 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: X (((p12 + 1 <= p5) OR (p10 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p12 + 1 <= p5) OR (p10 <= 0)))
lola: processed formula length: 35
lola: 66 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F ((X ((p24 <= p5)) AND (p5 <= p12)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((p24 <= p5)) AND (p5 <= p12)))
lola: processed formula length: 37
lola: 66 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1979224 markings, 4605040 edges, 395845 markings/sec, 0 secs
lola: 3674768 markings, 8824226 edges, 339109 markings/sec, 5 secs
lola: 5298006 markings, 12943201 edges, 324648 markings/sec, 10 secs
lola: 6893235 markings, 16982494 edges, 319046 markings/sec, 15 secs
lola: 8413543 markings, 20866319 edges, 304062 markings/sec, 20 secs
lola: 9912959 markings, 24767268 edges, 299883 markings/sec, 25 secs
lola: 11372519 markings, 28484684 edges, 291912 markings/sec, 30 secs
lola: 12830715 markings, 32283008 edges, 291639 markings/sec, 35 secs
lola: 14222483 markings, 35920110 edges, 278354 markings/sec, 40 secs
lola: 15649048 markings, 39545155 edges, 285313 markings/sec, 45 secs
lola: 17078104 markings, 43316363 edges, 285811 markings/sec, 50 secs
lola: 18416270 markings, 46897991 edges, 267633 markings/sec, 55 secs
lola: 19810213 markings, 50398959 edges, 278789 markings/sec, 60 secs
lola: 21228911 markings, 54093045 edges, 283740 markings/sec, 65 secs
lola: 22538340 markings, 57596828 edges, 261886 markings/sec, 70 secs
lola: 23797092 markings, 61000002 edges, 251750 markings/sec, 75 secs
lola: 25194718 markings, 64498406 edges, 279525 markings/sec, 80 secs
lola: 26465564 markings, 67816327 edges, 254169 markings/sec, 85 secs
lola: 27864134 markings, 71506209 edges, 279714 markings/sec, 90 secs
lola: 29139376 markings, 74930721 edges, 255048 markings/sec, 95 secs
lola: 30366633 markings, 78266884 edges, 245451 markings/sec, 100 secs
lola: 31741800 markings, 81752486 edges, 275033 markings/sec, 105 secs
lola: 32975858 markings, 84960455 edges, 246812 markings/sec, 110 secs
lola: 34265632 markings, 88332600 edges, 257955 markings/sec, 115 secs
lola: 35604786 markings, 91881817 edges, 267831 markings/sec, 120 secs
lola: 36830326 markings, 95181030 edges, 245108 markings/sec, 125 secs
lola: 38013707 markings, 98408979 edges, 236676 markings/sec, 130 secs
lola: 39158246 markings, 101539312 edges, 228908 markings/sec, 135 secs
lola: 40557752 markings, 105047528 edges, 279901 markings/sec, 140 secs
lola: 41788503 markings, 108241775 edges, 246150 markings/sec, 145 secs
lola: 42955969 markings, 111349478 edges, 233493 markings/sec, 150 secs
lola: 44388613 markings, 115096306 edges, 286529 markings/sec, 155 secs
lola: 45691984 markings, 118588624 edges, 260674 markings/sec, 160 secs
lola: 46938098 markings, 121957647 edges, 249223 markings/sec, 165 secs
lola: 48167529 markings, 125310643 edges, 245886 markings/sec, 170 secs
lola: 49371647 markings, 128602192 edges, 240824 markings/sec, 175 secs
lola: 50625567 markings, 131943612 edges, 250784 markings/sec, 180 secs
lola: 52019620 markings, 135407241 edges, 278811 markings/sec, 185 secs
lola: 53102530 markings, 138268441 edges, 216582 markings/sec, 190 secs
lola: 54193526 markings, 141168334 edges, 218199 markings/sec, 195 secs
lola: 55510748 markings, 144622734 edges, 263444 markings/sec, 200 secs
lola: 56811204 markings, 148094556 edges, 260091 markings/sec, 205 secs
lola: 58032276 markings, 151410420 edges, 244214 markings/sec, 210 secs
lola: 59212666 markings, 154603130 edges, 236078 markings/sec, 215 secs
lola: 60359228 markings, 157733317 edges, 229312 markings/sec, 220 secs
lola: 61513325 markings, 160893042 edges, 230819 markings/sec, 225 secs
lola: 62611743 markings, 163931697 edges, 219684 markings/sec, 230 secs
lola: 63815121 markings, 167097347 edges, 240676 markings/sec, 235 secs
lola: 65128937 markings, 170338626 edges, 262763 markings/sec, 240 secs
lola: 66323451 markings, 173487210 edges, 238903 markings/sec, 245 secs
lola: 67507760 markings, 176638642 edges, 236862 markings/sec, 250 secs
lola: 68746346 markings, 179961602 edges, 247717 markings/sec, 255 secs
lola: 70106243 markings, 183522735 edges, 271979 markings/sec, 260 secs
lola: 71384320 markings, 186960272 edges, 255615 markings/sec, 265 secs
lola: 72609665 markings, 190281031 edges, 245069 markings/sec, 270 secs
lola: 73793261 markings, 193515762 edges, 236719 markings/sec, 275 secs
lola: 74937789 markings, 196642234 edges, 228906 markings/sec, 280 secs
lola: 76041662 markings, 199657168 edges, 220775 markings/sec, 285 secs
lola: 77106636 markings, 202585686 edges, 212995 markings/sec, 290 secs
lola: 78193298 markings, 205593634 edges, 217332 markings/sec, 295 secs
lola: 79261195 markings, 208529423 edges, 213579 markings/sec, 300 secs
lola: 80590765 markings, 211829794 edges, 265914 markings/sec, 305 secs
lola: 81815634 markings, 214924952 edges, 244974 markings/sec, 310 secs
lola: 82850841 markings, 217674777 edges, 207041 markings/sec, 315 secs
lola: 83873381 markings, 220416041 edges, 204508 markings/sec, 320 secs
lola: 84897365 markings, 223160153 edges, 204797 markings/sec, 325 secs
lola: 86079666 markings, 226292274 edges, 236460 markings/sec, 330 secs
lola: 87376661 markings, 229730504 edges, 259399 markings/sec, 335 secs
lola: 88572566 markings, 232956044 edges, 239181 markings/sec, 340 secs
lola: 89792423 markings, 236275327 edges, 243971 markings/sec, 345 secs
lola: 90973036 markings, 239500434 edges, 236123 markings/sec, 350 secs
lola: 92179439 markings, 242806236 edges, 241281 markings/sec, 355 secs
lola: 93369353 markings, 246055571 edges, 237983 markings/sec, 360 secs
lola: 94533498 markings, 249243844 edges, 232829 markings/sec, 365 secs
lola: 95709827 markings, 252493193 edges, 235266 markings/sec, 370 secs
lola: 96861472 markings, 255667033 edges, 230329 markings/sec, 375 secs
lola: 98057493 markings, 258971806 edges, 239204 markings/sec, 380 secs
lola: 101470718 markings, 267651892 edges, 682645 markings/sec, 385 secs
lola: 102552946 markings, 270526053 edges, 216446 markings/sec, 390 secs
lola: 103528645 markings, 273165718 edges, 195140 markings/sec, 395 secs
lola: 104573125 markings, 275964020 edges, 208896 markings/sec, 400 secs
lola: 105598897 markings, 278750700 edges, 205154 markings/sec, 405 secs
lola: 106879049 markings, 282112868 edges, 256030 markings/sec, 410 secs
lola: 108221275 markings, 285695467 edges, 268445 markings/sec, 415 secs
lola: 109462580 markings, 289065128 edges, 248261 markings/sec, 420 secs
lola: 110672779 markings, 292339756 edges, 242040 markings/sec, 425 secs
lola: 111857726 markings, 295576483 edges, 236989 markings/sec, 430 secs
lola: 112983653 markings, 298657021 edges, 225185 markings/sec, 435 secs
lola: 114086909 markings, 301715628 edges, 220651 markings/sec, 440 secs
lola: 114983787 markings, 304148850 edges, 179376 markings/sec, 445 secs
lola: 115987001 markings, 306954770 edges, 200643 markings/sec, 450 secs
lola: 116865245 markings, 309337401 edges, 175649 markings/sec, 455 secs
lola: 117685482 markings, 311621328 edges, 164047 markings/sec, 460 secs
lola: 118676351 markings, 314341230 edges, 198174 markings/sec, 465 secs
lola: 119407268 markings, 316359968 edges, 146183 markings/sec, 470 secs
lola: 120376853 markings, 319088364 edges, 193917 markings/sec, 475 secs
lola: 121558769 markings, 322333624 edges, 236383 markings/sec, 480 secs
lola: 122798635 markings, 325421157 edges, 247973 markings/sec, 485 secs
lola: 123963413 markings, 328281881 edges, 232956 markings/sec, 490 secs
lola: 124696240 markings, 330196867 edges, 146565 markings/sec, 495 secs
lola: 125540728 markings, 332424698 edges, 168898 markings/sec, 500 secs
lola: 126585109 markings, 335221937 edges, 208876 markings/sec, 505 secs
lola: 127565003 markings, 337888967 edges, 195979 markings/sec, 510 secs
lola: 128459291 markings, 340296967 edges, 178858 markings/sec, 515 secs
lola: 129413933 markings, 342891832 edges, 190928 markings/sec, 520 secs
lola: 130436712 markings, 345693691 edges, 204556 markings/sec, 525 secs
lola: 131283872 markings, 347860607 edges, 169432 markings/sec, 530 secs
lola: 132190873 markings, 350273966 edges, 181400 markings/sec, 535 secs
lola: 133073707 markings, 352638510 edges, 176567 markings/sec, 540 secs
lola: 134049335 markings, 355277696 edges, 195126 markings/sec, 545 secs
lola: 134972091 markings, 357784320 edges, 184551 markings/sec, 550 secs
lola: 135999920 markings, 360591878 edges, 205566 markings/sec, 555 secs
lola: 136726022 markings, 362574633 edges, 145220 markings/sec, 560 secs
lola: 137649837 markings, 365107702 edges, 184763 markings/sec, 565 secs
lola: 138352713 markings, 367046752 edges, 140575 markings/sec, 570 secs
lola: 139439315 markings, 370021523 edges, 217320 markings/sec, 575 secs
lola: 140124203 markings, 371923376 edges, 136978 markings/sec, 580 secs
lola: 140745957 markings, 373624323 edges, 124351 markings/sec, 585 secs
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: (F (G ((((p8 <= 1) AND (p13 + 1 <= p18)) OR (p8 <= 1)))) AND F ((p18 <= p13)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F ((p18 <= p13))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p13 + 1 <= p18)
lola: processed formula length: 16
lola: 68 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((((p8 <= 1) AND (p13 + 1 <= p18)) OR (p8 <= 1))))
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 ((((p8 <= 1) AND (p13 + 1 <= p18)) OR (p8 <= 1))))
lola: processed formula length: 56
lola: 66 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 50002 markings, 50003 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no unknown yes no no no no no
lola:
preliminary result: no no no no unknown yes no no no no no
lola: memory consumption: 3144 KB
lola: time consumption: 966 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ClientsAndServers-PT-N1000P0"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is ClientsAndServers-PT-N1000P0, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-smll-158987806400241"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N1000P0.tgz
mv ClientsAndServers-PT-N1000P0 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;