About the Execution of ITS-LoLa for FMS-PT-01000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15795.440 | 3600000.00 | 484084.00 | 32741.30 | FFFFFFT?FFFFFFTT | 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.r170-smll-158987815300065.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 FMS-PT-01000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-158987815300065
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.1K Apr 1 20:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 1 20:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 1 13:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 1 13:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 1 10:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 1 10:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 1 06:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 1 06:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 1 13:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 1 13:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 16K Mar 24 05:37 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FMS-PT-01000-00
FORMULA_NAME FMS-PT-01000-01
FORMULA_NAME FMS-PT-01000-02
FORMULA_NAME FMS-PT-01000-03
FORMULA_NAME FMS-PT-01000-04
FORMULA_NAME FMS-PT-01000-05
FORMULA_NAME FMS-PT-01000-06
FORMULA_NAME FMS-PT-01000-07
FORMULA_NAME FMS-PT-01000-08
FORMULA_NAME FMS-PT-01000-09
FORMULA_NAME FMS-PT-01000-10
FORMULA_NAME FMS-PT-01000-11
FORMULA_NAME FMS-PT-01000-12
FORMULA_NAME FMS-PT-01000-13
FORMULA_NAME FMS-PT-01000-14
FORMULA_NAME FMS-PT-01000-15
=== Now, execution of the tool begins
BK_START 1591143210315
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 00:13:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 00:13:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 00:13:33] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2020-06-03 00:13:33] [INFO ] Transformed 22 places.
[2020-06-03 00:13:33] [INFO ] Transformed 20 transitions.
[2020-06-03 00:13:33] [INFO ] Parsed PT model containing 22 places and 20 transitions in 130 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100880 steps, including 0 resets, run finished after 125 ms. (steps per millisecond=807 ) properties seen :[1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0]
// Phase 1: matrix 20 rows 22 cols
[2020-06-03 00:13:33] [INFO ] Computed 6 place invariants in 6 ms
[2020-06-03 00:13:33] [INFO ] [Real]Absence check using 6 positive place invariants in 17 ms returned unsat
[2020-06-03 00:13:33] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned unsat
[2020-06-03 00:13:33] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned unsat
[2020-06-03 00:13:33] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned unsat
[2020-06-03 00:13:33] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned unsat
[2020-06-03 00:13:33] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned unsat
[2020-06-03 00:13:33] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2020-06-03 00:13:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:13:34] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2020-06-03 00:13:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:13:34] [INFO ] [Nat]Absence check using 6 positive place invariants in 13 ms returned sat
[2020-06-03 00:13:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:13:34] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2020-06-03 00:13:34] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 6 ms.
[2020-06-03 00:13:34] [INFO ] Added : 5 causal constraints over 1 iterations in 31 ms. Result :sat
[2020-06-03 00:13:34] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 10 simplifications.
[2020-06-03 00:13:34] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 00:13:34] [INFO ] Flatten gal took : 47 ms
FORMULA FMS-PT-01000-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-01000-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-01000-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-01000-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-01000-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 00:13:34] [INFO ] Flatten gal took : 11 ms
[2020-06-03 00:13:34] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2020-06-03 00:13:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ FMS-PT-01000 @ 3570 seconds
FORMULA FMS-PT-01000-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FMS-PT-01000-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FMS-PT-01000-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FMS-PT-01000-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FMS-PT-01000-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FMS-PT-01000-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FMS-PT-01000-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FMS-PT-01000-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FMS-PT-01000-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FMS-PT-01000-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FMS-PT-01000-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3015
rslt: Output for LTLCardinality @ FMS-PT-01000
{
"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": "Wed Jun 3 00:13:35 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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": 2,
"visible_transitions": 0
},
"processed": "X (G (((1 <= p10) OR (F ((1 <= p10)) AND F (G ((p10 + 1 <= p20)))))))",
"processed_size": 69,
"rewrites": 91
},
"result":
{
"edges": 7000,
"markings": 6001,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((p18 + 1 <= p8)))",
"processed_size": 23,
"rewrites": 91
},
"result":
{
"edges": 6,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 410
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((X (X (G (((p15 + 1 <= p12) AND (p19 <= p13))))) OR (p4 <= 1)))",
"processed_size": 66,
"rewrites": 91
},
"result":
{
"edges": 4003,
"markings": 4003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 469
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 2,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(X ((F ((p2 <= 0)) OR (3 <= p8))) U ((p8 <= 2) U (1 <= p19)))",
"processed_size": 61,
"rewrites": 91
},
"result":
{
"edges": 12022,
"markings": 12021,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 547
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"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 (F ((p14 <= 1))))",
"processed_size": 22,
"rewrites": 91
},
"result":
{
"edges": 15,
"markings": 13,
"produced_by": "LTL model checker",
"value": true
},
"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": 656
},
"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": "G (F ((1 <= p8)))",
"processed_size": 17,
"rewrites": 91
},
"result":
{
"edges": 5003,
"markings": 5003,
"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": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 820
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": "G (F ((p6 + 1 <= p7)))",
"processed_size": 22,
"rewrites": 91
},
"result":
{
"edges": 9028,
"markings": 8023,
"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": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1094
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"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": 3,
"visible_transitions": 0
},
"processed": "F (G (((p3 <= p21) OR (G ((2 <= p6)) AND F ((p3 <= p21))))))",
"processed_size": 60,
"rewrites": 91
},
"result":
{
"edges": 27029,
"markings": 21022,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 8,
"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": 1641
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"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": "F (G ((G ((p17 <= 2)) OR (p9 + 1 <= p13))))",
"processed_size": 43,
"rewrites": 91
},
"result":
{
"edges": 7537493,
"markings": 6030997,
"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": 3275
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(F (((p19 <= p8) OR (G ((p7 <= p4)) AND (1 <= p11)))) U G ((p4 + 1 <= p7)))",
"processed_size": 75,
"rewrites": 91
},
"result":
{
"edges": 1004,
"markings": 1003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 3424,
"runtime": 555.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F(*)) : X(G((** OR (F(**) AND F(G(*)))))) : G(F(**)) : F(G((G(*) OR *))) : X(F(*)) : F(G((X(**) AND (** OR ((** U **) AND **))))) : G((X(X(G(**))) OR *)) : (X((F(*) OR **)) U (** U **)) : (F((** OR (G(**) AND **))) U G(*)) : F(G((** OR (G(**) AND F(**))))) : X(X(F(**)))"
},
"net":
{
"arcs": 50,
"conflict_clusters": 17,
"places": 22,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 20
},
"result":
{
"preliminary_value": "no no no no no unknown no no no no yes ",
"value": "no no no no no unknown no no no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 42/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 20 transitions, 16 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: NOT(G (F (G ((p7 <= p6))))) : X (NOT(F (NOT((NOT(G (F ((p20 <= p10)))) U (1 <= p10)))))) : G (((F (NOT(X ((2 <= p8)))) U (0 <= 0)) U X ((1 <= p8)))) : ((0 <= 0) U X (G (NOT(X ((F ((3 <= p17)) AND (p13 <= p9))))))) : NOT(G (X ((p8 <= p18)))) : G (F (G ((X ((2 <= p7)) AND ((p0 <= 0) OR (((3 <= p21) U (2 <= p7)) AND (1 <= p0))))))) : NOT(F ((NOT(X (G (X (((p15 + 1 <= p12) AND (p19 <= p13)))))) AND (2 <= p4)))) : (X ((NOT(G ((1 <= p2))) OR (3 <= p8))) U ((p8 <= 2) U (1 <= p19))) : (F (((p19 <= p8) OR (G ((p7 <= p4)) AND (1 <= p11)))) U NOT(F ((p7 <= p4)))) : F (X (F (((p3 <= p21) U F (X (F (((2 <= p6) U G ((G ((2 <= p6)) U (p3 <= p21))))))))))) : F (X (NOT(X (NOT(((G ((p21 <= p11)) AND (3 <= p16)) U (p14 <= 1)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:169
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p10) OR (F ((1 <= p10)) AND F (G ((p10 + 1 <= p20)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p10) OR (F ((1 <= p10)) AND F (G ((p10 + 1 <= p20)))))))
lola: processed formula length: 69
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
lola: add low 18
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: 6001 markings, 7000 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p18 + 1 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p18 + 1 <= p8)))
lola: processed formula length: 23
lola: 91 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 6 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X ((2 <= p7)) AND ((p0 <= 0) OR (((3 <= p21) U (2 <= p7)) AND (1 <= p0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X ((2 <= p7)) AND ((p0 <= 0) OR (((3 <= p21) U (2 <= p7)) AND (1 <= p0))))))
lola: processed formula length: 83
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3721901 markings, 4652177 edges, 744380 markings/sec, 0 secs
lola: 7802894 markings, 10321178 edges, 816199 markings/sec, 5 secs
lola: 11681737 markings, 15750994 edges, 775769 markings/sec, 10 secs
lola: 15095583 markings, 20530019 edges, 682769 markings/sec, 15 secs
lola: 18568409 markings, 25391902 edges, 694565 markings/sec, 20 secs
lola: 22023452 markings, 30228660 edges, 691009 markings/sec, 25 secs
lola: 25425488 markings, 34990919 edges, 680407 markings/sec, 30 secs
lola: 28760899 markings, 39660243 edges, 667082 markings/sec, 35 secs
lola: 32454787 markings, 45177491 edges, 738778 markings/sec, 40 secs
lola: 36131064 markings, 50692430 edges, 735255 markings/sec, 45 secs
lola: 39410562 markings, 55612279 edges, 655900 markings/sec, 50 secs
lola: 42623176 markings, 60431787 edges, 642523 markings/sec, 55 secs
lola: 45822410 markings, 65231224 edges, 639847 markings/sec, 60 secs
lola: 48998593 markings, 69996078 edges, 635237 markings/sec, 65 secs
lola: 52127446 markings, 74689931 edges, 625771 markings/sec, 70 secs
lola: 55222084 markings, 79332451 edges, 618928 markings/sec, 75 secs
lola: 58276855 markings, 83915169 edges, 610954 markings/sec, 80 secs
lola: 61400388 markings, 89178566 edges, 624707 markings/sec, 85 secs
lola: 64451151 markings, 94490158 edges, 610153 markings/sec, 90 secs
lola: 67491860 markings, 99784928 edges, 608142 markings/sec, 95 secs
lola: 70542636 markings, 105096769 edges, 610155 markings/sec, 100 secs
lola: 73699593 markings, 110590987 edges, 631391 markings/sec, 105 secs
lola: 76843891 markings, 116067819 edges, 628860 markings/sec, 110 secs
lola: 79755847 markings, 121136479 edges, 582391 markings/sec, 115 secs
lola: 82574374 markings, 126044467 edges, 563705 markings/sec, 120 secs
lola: 85396308 markings, 130957563 edges, 564387 markings/sec, 125 secs
lola: 88058451 markings, 135592721 edges, 532429 markings/sec, 130 secs
lola: 90789531 markings, 140347992 edges, 546216 markings/sec, 135 secs
lola: 93543938 markings, 145142550 edges, 550881 markings/sec, 140 secs
lola: 96245018 markings, 149846766 edges, 540216 markings/sec, 145 secs
lola: 98938532 markings, 154535085 edges, 538703 markings/sec, 150 secs
lola: 100782222 markings, 157748846 edges, 368738 markings/sec, 155 secs
lola: 102348315 markings, 160472420 edges, 313219 markings/sec, 160 secs
lola: 104533548 markings, 164279017 edges, 437047 markings/sec, 165 secs
lola: 105854360 markings, 166577444 edges, 264162 markings/sec, 170 secs
lola: 107095504 markings, 168738638 edges, 248229 markings/sec, 175 secs
lola: 108939253 markings, 171947891 edges, 368750 markings/sec, 180 secs
lola: 110525119 markings, 174710261 edges, 317173 markings/sec, 185 secs
lola: 111999144 markings, 177275100 edges, 294805 markings/sec, 190 secs
lola: 113997441 markings, 180755909 edges, 399659 markings/sec, 195 secs
lola: 114802122 markings, 182156576 edges, 160936 markings/sec, 200 secs
lola: 116920786 markings, 185844078 edges, 423733 markings/sec, 205 secs
lola: 117736386 markings, 187265369 edges, 163120 markings/sec, 210 secs
lola: 119391735 markings, 190147845 edges, 331070 markings/sec, 215 secs
lola: 120321442 markings, 191766455 edges, 185941 markings/sec, 220 secs
lola: 121368863 markings, 193590231 edges, 209484 markings/sec, 225 secs
lola: 122394542 markings, 195374861 edges, 205136 markings/sec, 230 secs
lola: 123226292 markings, 196825646 edges, 166350 markings/sec, 235 secs
lola: 123664562 markings, 197586581 edges, 87654 markings/sec, 240 secs
lola: 123715544 markings, 197675130 edges, 10196 markings/sec, 245 secs
lola: 123734131 markings, 197707363 edges, 3717 markings/sec, 250 secs
lola: 123734248 markings, 197707521 edges, 23 markings/sec, 255 secs
lola: 123734342 markings, 197707646 edges, 19 markings/sec, 260 secs
lola: 123734413 markings, 197707740 edges, 14 markings/sec, 265 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 410 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (X (G (((p15 + 1 <= p12) AND (p19 <= p13))))) OR (p4 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (X (G (((p15 + 1 <= p12) AND (p19 <= p13))))) OR (p4 <= 1)))
lola: processed formula length: 66
lola: 91 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: 4003 markings, 4003 edges
lola: ========================================
lola: subprocess 4 will run for 469 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((F ((p2 <= 0)) OR (3 <= p8))) U ((p8 <= 2) U (1 <= p19)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((F ((p2 <= 0)) OR (3 <= p8))) U ((p8 <= 2) U (1 <= p19)))
lola: processed formula length: 61
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 12021 markings, 12022 edges
lola: ========================================
lola: subprocess 5 will run for 547 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((p14 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((p14 <= 1))))
lola: processed formula length: 22
lola: 91 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: 13 markings, 15 edges
lola: ========================================
lola: subprocess 6 will run for 656 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((1 <= p8)))
lola: processed formula length: 17
lola: 91 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: 5003 markings, 5003 edges
lola: ========================================
lola: subprocess 7 will run for 820 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p6 + 1 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p6 + 1 <= p7)))
lola: processed formula length: 22
lola: 91 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: 8023 markings, 9028 edges
lola: ========================================
lola: subprocess 8 will run for 1094 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p3 <= p21) OR (G ((2 <= p6)) AND F ((p3 <= p21))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p3 <= p21) OR (G ((2 <= p6)) AND F ((p3 <= p21))))))
lola: processed formula length: 60
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 21022 markings, 27029 edges
lola: ========================================
lola: subprocess 9 will run for 1641 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G ((p17 <= 2)) OR (p9 + 1 <= p13))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G ((p17 <= 2)) OR (p9 + 1 <= p13))))
lola: processed formula length: 43
lola: 91 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: 4210595 markings, 5262278 edges, 842119 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6030997 markings, 7537493 edges
lola: ========================================
lola: subprocess 10 will run for 3275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((p19 <= p8) OR (G ((p7 <= p4)) AND (1 <= p11)))) U G ((p4 + 1 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((p19 <= p8) OR (G ((p7 <= p4)) AND (1 <= p11)))) U G ((p4 + 1 <= p7)))
lola: processed formula length: 75
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 1003 markings, 1004 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((X ((2 <= p7)) AND ((p0 <= 0) OR (((3 <= p21) U (2 <= p7)) AND (1 <= p0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X ((2 <= p7)) AND ((p0 <= 0) OR (((3 <= p21) U (2 <= p7)) AND (1 <= p0))))))
lola: processed formula length: 83
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3558854 markings, 4448438 edges, 711771 markings/sec, 0 secs
lola: 7606785 markings, 10046710 edges, 809586 markings/sec, 5 secs
lola: 11482340 markings, 15471918 edges, 775111 markings/sec, 10 secs
lola: 15050343 markings, 20466789 edges, 713601 markings/sec, 15 secs
lola: 18520867 markings, 25325094 edges, 694105 markings/sec, 20 secs
lola: 21972133 markings, 30156692 edges, 690253 markings/sec, 25 secs
lola: 25374682 markings, 34919714 edges, 680510 markings/sec, 30 secs
lola: 28747643 markings, 39641692 edges, 674592 markings/sec, 35 secs
lola: 32466186 markings, 45194595 edges, 743709 markings/sec, 40 secs
lola: 36170445 markings, 50751514 edges, 740852 markings/sec, 45 secs
lola: 39481008 markings, 55717960 edges, 662113 markings/sec, 50 secs
lola: 42741558 markings, 60609384 edges, 652110 markings/sec, 55 secs
lola: 45985255 markings, 65475522 edges, 648739 markings/sec, 60 secs
lola: 49179774 markings, 70267886 edges, 638904 markings/sec, 65 secs
lola: 52323429 markings, 74983941 edges, 628731 markings/sec, 70 secs
lola: 55428913 markings, 79642735 edges, 621097 markings/sec, 75 secs
lola: 58494280 markings, 84241348 edges, 613073 markings/sec, 80 secs
lola: 61650762 markings, 89613921 edges, 631296 markings/sec, 85 secs
lola: 64770430 markings, 95044441 edges, 623934 markings/sec, 90 secs
lola: 67834898 markings, 100382161 edges, 612894 markings/sec, 95 secs
lola: 70918211 markings, 105749822 edges, 616663 markings/sec, 100 secs
lola: 74068253 markings, 111233989 edges, 630008 markings/sec, 105 secs
lola: 77219136 markings, 116721959 edges, 630177 markings/sec, 110 secs
lola: 80120682 markings, 121771623 edges, 580309 markings/sec, 115 secs
lola: 82967847 markings, 126728220 edges, 569433 markings/sec, 120 secs
lola: 85774133 markings, 131617307 edges, 561257 markings/sec, 125 secs
lola: 88572101 markings, 136487166 edges, 559594 markings/sec, 130 secs
lola: 91342517 markings, 141309611 edges, 554083 markings/sec, 135 secs
lola: 94107768 markings, 146125145 edges, 553050 markings/sec, 140 secs
lola: 96843301 markings, 150889982 edges, 547107 markings/sec, 145 secs
lola: 99559008 markings, 155615504 edges, 543141 markings/sec, 150 secs
lola: 101649614 markings, 159257692 edges, 418121 markings/sec, 155 secs
lola: 103579358 markings, 162616730 edges, 385949 markings/sec, 160 secs
lola: 104973144 markings, 165043098 edges, 278757 markings/sec, 165 secs
lola: 106261777 markings, 167286232 edges, 257727 markings/sec, 170 secs
lola: 108059234 markings, 170415949 edges, 359491 markings/sec, 175 secs
lola: 109039185 markings, 172121875 edges, 195990 markings/sec, 180 secs
lola: 110766960 markings, 175130851 edges, 345555 markings/sec, 185 secs
lola: 112013257 markings, 177301253 edges, 249259 markings/sec, 190 secs
lola: 113397043 markings, 179710958 edges, 276757 markings/sec, 195 secs
lola: 114865522 markings, 182267321 edges, 293696 markings/sec, 200 secs
lola: 116403951 markings, 184946005 edges, 307686 markings/sec, 205 secs
lola: 117623221 markings, 187068338 edges, 243854 markings/sec, 210 secs
lola: 119213142 markings, 189834811 edges, 317984 markings/sec, 215 secs
lola: 119965677 markings, 191145893 edges, 150507 markings/sec, 220 secs
lola: 121164777 markings, 193232394 edges, 239820 markings/sec, 225 secs
lola: 122097973 markings, 194857985 edges, 186639 markings/sec, 230 secs
lola: 123220612 markings, 196813137 edges, 224528 markings/sec, 235 secs
lola: 123426335 markings, 197170546 edges, 41145 markings/sec, 240 secs
lola: 123428115 markings, 197173116 edges, 356 markings/sec, 245 secs
lola: 123433951 markings, 197185469 edges, 1167 markings/sec, 250 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no no no unknown no no no no yes
lola:
preliminary result: no no no no no unknown no no no no yes
lola: memory consumption: 3424 KB
lola: time consumption: 555 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="FMS-PT-01000"
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 FMS-PT-01000, 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 r170-smll-158987815300065"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FMS-PT-01000.tgz
mv FMS-PT-01000 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 ;