About the Execution of 2020-gold for RefineWMG-PT-010011
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16257.340 | 3600000.00 | 762480.00 | 45361.20 | ?FFFFTFFTTF?FFF? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2021-input.r189-tajo-162089432900317.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-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 gold2020
Input is RefineWMG-PT-010011, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tajo-162089432900317
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 125K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 105K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 10:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 10:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 25 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 10K Mar 25 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 24K May 5 16:51 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 RefineWMG-PT-010011-00
FORMULA_NAME RefineWMG-PT-010011-01
FORMULA_NAME RefineWMG-PT-010011-02
FORMULA_NAME RefineWMG-PT-010011-03
FORMULA_NAME RefineWMG-PT-010011-04
FORMULA_NAME RefineWMG-PT-010011-05
FORMULA_NAME RefineWMG-PT-010011-06
FORMULA_NAME RefineWMG-PT-010011-07
FORMULA_NAME RefineWMG-PT-010011-08
FORMULA_NAME RefineWMG-PT-010011-09
FORMULA_NAME RefineWMG-PT-010011-10
FORMULA_NAME RefineWMG-PT-010011-11
FORMULA_NAME RefineWMG-PT-010011-12
FORMULA_NAME RefineWMG-PT-010011-13
FORMULA_NAME RefineWMG-PT-010011-14
FORMULA_NAME RefineWMG-PT-010011-15
=== Now, execution of the tool begins
BK_START 1621428693729
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 12:51:35] [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]
[2021-05-19 12:51:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 12:51:35] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2021-05-19 12:51:35] [INFO ] Transformed 54 places.
[2021-05-19 12:51:35] [INFO ] Transformed 43 transitions.
[2021-05-19 12:51:35] [INFO ] Parsed PT model containing 54 places and 43 transitions in 64 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 106 ms. (steps per millisecond=943 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1]
// Phase 1: matrix 43 rows 54 cols
[2021-05-19 12:51:35] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-19 12:51:36] [INFO ] [Real]Absence check using 22 positive place invariants in 17 ms returned sat
[2021-05-19 12:51:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 12:51:36] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2021-05-19 12:51:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 12:51:36] [INFO ] [Nat]Absence check using 22 positive place invariants in 11 ms returned sat
[2021-05-19 12:51:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 12:51:36] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2021-05-19 12:51:36] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 12 ms.
[2021-05-19 12:51:36] [INFO ] Added : 22 causal constraints over 5 iterations in 45 ms. Result :sat
[2021-05-19 12:51:36] [INFO ] [Real]Absence check using 22 positive place invariants in 10 ms returned sat
[2021-05-19 12:51:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 12:51:36] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-19 12:51:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 12:51:36] [INFO ] [Nat]Absence check using 22 positive place invariants in 11 ms returned sat
[2021-05-19 12:51:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 12:51:36] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2021-05-19 12:51:36] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 2 ms.
[2021-05-19 12:51:36] [INFO ] Added : 21 causal constraints over 5 iterations in 25 ms. Result :sat
[2021-05-19 12:51:36] [INFO ] [Real]Absence check using 22 positive place invariants in 2 ms returned unsat
[2021-05-19 12:51:36] [INFO ] [Real]Absence check using 22 positive place invariants in 6 ms returned sat
[2021-05-19 12:51:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 12:51:36] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-19 12:51:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 12:51:36] [INFO ] [Nat]Absence check using 22 positive place invariants in 9 ms returned sat
[2021-05-19 12:51:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 12:51:36] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2021-05-19 12:51:36] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 4 ms.
[2021-05-19 12:51:36] [INFO ] Added : 21 causal constraints over 5 iterations in 27 ms. Result :sat
[2021-05-19 12:51:36] [INFO ] [Real]Absence check using 22 positive place invariants in 6 ms returned sat
[2021-05-19 12:51:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 12:51:36] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-19 12:51:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 12:51:36] [INFO ] [Nat]Absence check using 22 positive place invariants in 7 ms returned sat
[2021-05-19 12:51:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 12:51:36] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2021-05-19 12:51:36] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 4 ms.
[2021-05-19 12:51:36] [INFO ] Added : 21 causal constraints over 5 iterations in 26 ms. Result :sat
[2021-05-19 12:51:36] [INFO ] [Real]Absence check using 22 positive place invariants in 3 ms returned unsat
[2021-05-19 12:51:36] [INFO ] [Real]Absence check using 22 positive place invariants in 6 ms returned sat
[2021-05-19 12:51:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 12:51:36] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-19 12:51:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 12:51:36] [INFO ] [Nat]Absence check using 22 positive place invariants in 10 ms returned sat
[2021-05-19 12:51:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 12:51:36] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2021-05-19 12:51:36] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 4 ms.
[2021-05-19 12:51:36] [INFO ] Added : 21 causal constraints over 5 iterations in 26 ms. Result :sat
[2021-05-19 12:51:36] [INFO ] [Real]Absence check using 22 positive place invariants in 5 ms returned sat
[2021-05-19 12:51:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 12:51:36] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-19 12:51:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 12:51:36] [INFO ] [Nat]Absence check using 22 positive place invariants in 7 ms returned sat
[2021-05-19 12:51:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 12:51:36] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2021-05-19 12:51:36] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 3 ms.
[2021-05-19 12:51:36] [INFO ] Added : 22 causal constraints over 5 iterations in 22 ms. Result :sat
[2021-05-19 12:51:36] [INFO ] [Real]Absence check using 22 positive place invariants in 2 ms returned unsat
[2021-05-19 12:51:36] [INFO ] [Real]Absence check using 22 positive place invariants in 1 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 4 simplifications.
[2021-05-19 12:51:36] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-19 12:51:36] [INFO ] Flatten gal took : 28 ms
FORMULA RefineWMG-PT-010011-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-010011-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-010011-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 12:51:36] [INFO ] Flatten gal took : 7 ms
[2021-05-19 12:51:36] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-19 12:51:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ RefineWMG-PT-010011 @ 3570 seconds
FORMULA RefineWMG-PT-010011-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-010011-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-010011-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-010011-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-010011-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-010011-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-010011-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-010011-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-010011-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-010011-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-010011-00 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-010011-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-010011-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2810
rslt: Output for LTLCardinality @ RefineWMG-PT-010011
{
"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 May 19 12:51:37 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 286
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 286
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((p5 <= 0)))",
"processed_size": 17,
"rewrites": 105
},
"result":
{
"edges": 258,
"markings": 214,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"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": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 312
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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 (G ((2 <= p42)))",
"processed_size": 18,
"rewrites": 105
},
"result":
{
"edges": 2232,
"markings": 1452,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 343
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"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": 2,
"visible_transitions": 0
},
"processed": "G ((X (G (((p42 + 1 <= p15)))) AND (p15 <= p42)))",
"processed_size": 49,
"rewrites": 105
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 381
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 381
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F ((G ((F ((p8 + 1 <= p7)) AND (p21 + 1 <= p15))) OR (p21 + 1 <= p15))))",
"processed_size": 75,
"rewrites": 105
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 429
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G ((G (F ((p22 + 1 <= p29))) AND ((2 <= p35) AND (p22 + 1 <= p29)))))",
"processed_size": 72,
"rewrites": 105
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 490
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((3 <= p44) U ((p46 <= 2) OR X ((X (G (((p46 <= 2) R (p33 + 1 <= p21)))) AND (3 <= p46)))))",
"processed_size": 91,
"rewrites": 105
},
"result":
{
"edges": 352515,
"markings": 228110,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"compoundnumber": 6,
"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": 572
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "X (F ((p15 <= p8)))",
"processed_size": 19,
"rewrites": 105
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 687
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 687
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"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": 3,
"visible_transitions": 0
},
"processed": "F ((((1 <= p51) U (p40 <= p16)) AND (1 <= p51)))",
"processed_size": 48,
"rewrites": 105
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"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": null
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 827
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((((p43 <= 1) R (p1 + 1 <= p14)) AND X (F ((p1 + 1 <= p14))))))",
"processed_size": 68,
"rewrites": 105
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 9,
"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": 1595
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((p43 <= 2)))",
"processed_size": 18,
"rewrites": 105
},
"result":
{
"edges": 84,
"markings": 65,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"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": 3189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": "G (F ((G ((2 <= p7)) OR (p53 <= p37))))",
"processed_size": 39,
"rewrites": 105
},
"result":
{
"edges": 1118,
"markings": 754,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"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": 3,
"visible_transitions": 0
},
"processed": "F ((((1 <= p51) U (p40 <= p16)) AND (1 <= p51)))",
"processed_size": 48,
"rewrites": 105
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3356,
"runtime": 760.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((X(F((F(*) AND (G(*) AND *)))) OR F(**))) : (F(G(*)) AND G((** OR X(X(X(G(*))))))) : X(G(**)) : G((X(G(**)) AND **)) : (G(F((G((F(*) AND *)) OR *))) AND X(*)) : X(G((G(F(*)) AND (* AND *)))) : (** U (** OR X((X(G((* R *))) AND **)))) : X(F(**)) : G(F((G(**) OR **))) : (F(((** U **) AND **)) AND X(X(G(**)))) : F(G(*)) : G(F(((* R *) AND X(F(*))))) : G(F((X(X(F(*))) OR *)))"
},
"net":
{
"arcs": 128,
"conflict_clusters": 33,
"places": 54,
"places_significant": 32,
"singleton_clusters": 0,
"transitions": 43
},
"result":
{
"preliminary_value": "unknown no no no no no no yes no unknown no no unknown ",
"value": "unknown no no no no no no yes no unknown no no unknown "
},
"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: 97/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1728
lola: finding significant places
lola: 54 places, 43 transitions, 32 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: X ((NOT(X (G (((G ((p16 <= p44)) OR F ((p16 <= p44))) OR (p38 <= p47))))) OR F ((p0 <= p10)))) : G ((((1 <= p5) AND (2 <= p22)) U X (NOT(F (X (X (F (((p33 + 1 <= p2) U (1 <= p5)))))))))) : G (X ((2 <= p42))) : G ((X (G (((p42 + 1 <= p15)))) AND (p15 <= p42))) : (NOT(F (X (G ((F ((G ((p7 <= p8)) OR (p15 <= p21))) AND (p15 <= p21)))))) AND NOT(X ((1 <= p41)))) : NOT(X (F (((G (X (F (G ((p29 <= p22))))) OR (p35 <= 1)) OR (p29 <= p22))))) : ((3 <= p44) U ((p46 <= 2) OR (X (G (NOT(X (((3 <= p46) U (p21 <= p33)))))) AND X ((3 <= p46))))) : X (((X (X (X (G ((3 <= p34))))) AND G (((p15 <= p8) AND (p34 <= 2)))) U F ((p15 <= p8)))) : G (F ((G ((2 <= p7)) OR (p53 <= p37)))) : (F ((((1 <= p51) U (p40 <= p16)) AND (1 <= p51))) AND G (X (X ((p50 <= p2))))) : F (X (F (X (NOT(X (X (((0 <= 0) U F (X ((3 <= p43))))))))))) : G (F (G (NOT(G ((((2 <= p43) U (p14 <= p1)) OR G (X ((p14 <= p1))))))))) : NOT(F (G ((X (X (NOT(F (NOT(G ((p23 <= p15))))))) AND (1 <= p9)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k: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:374
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:525
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (F ((F ((p44 + 1 <= p16)) AND (G ((p44 + 1 <= p16)) AND (p47 + 1 <= p38))))) OR F ((p0 <= p10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F ((F ((p44 + 1 <= p16)) AND (G ((p44 + 1 <= p16)) AND (p47 + 1 <= p38))))) OR F ((p0 <= p10))))
lola: processed formula length: 103
lola: 105 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: 4093271 markings, 6236627 edges, 818654 markings/sec, 0 secs
lola: 8206271 markings, 12503341 edges, 822600 markings/sec, 5 secs
lola: 12246930 markings, 18659842 edges, 808132 markings/sec, 10 secs
lola: 16451204 markings, 25065620 edges, 840855 markings/sec, 15 secs
lola: 20400808 markings, 31083385 edges, 789921 markings/sec, 20 secs
lola: 24649708 markings, 37557162 edges, 849780 markings/sec, 25 secs
lola: 29007248 markings, 44196460 edges, 871508 markings/sec, 30 secs
lola: 33283403 markings, 50711769 edges, 855231 markings/sec, 35 secs
lola: 37511303 markings, 57153553 edges, 845580 markings/sec, 40 secs
lola: 41928782 markings, 63884182 edges, 883496 markings/sec, 45 secs
lola: 46369893 markings, 70650814 edges, 888222 markings/sec, 50 secs
lola: 50836198 markings, 77455853 edges, 893261 markings/sec, 55 secs
lola: 55241454 markings, 84167857 edges, 881051 markings/sec, 60 secs
lola: 59545779 markings, 90726078 edges, 860865 markings/sec, 65 secs
lola: 63810423 markings, 97223855 edges, 852929 markings/sec, 70 secs
lola: 68084776 markings, 103736412 edges, 854871 markings/sec, 75 secs
lola: 70697278 markings, 107719614 edges, 522500 markings/sec, 80 secs
lola: 72857774 markings, 111009906 edges, 432099 markings/sec, 85 secs
lola: 74888779 markings, 114105360 edges, 406201 markings/sec, 90 secs
lola: 77290736 markings, 117766152 edges, 480391 markings/sec, 95 secs
lola: 79876979 markings, 121703449 edges, 517249 markings/sec, 100 secs
lola: 82678141 markings, 125971392 edges, 560232 markings/sec, 105 secs
lola: 85483825 markings, 130246235 edges, 561137 markings/sec, 110 secs
lola: 86406456 markings, 131651988 edges, 184526 markings/sec, 115 secs
lola: lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 286 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((p5 <= 0))) AND G ((((1 <= p5) AND (2 <= p22)) OR X (X (X (G ((p5 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 286 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p5 <= 0)))
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 ((p5 <= 0)))
lola: processed formula length: 17
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 41
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: 214 markings, 258 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((2 <= p42)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((2 <= p42)))
lola: processed formula length: 18
lola: 105 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: 1452 markings, 2232 edges
lola: ========================================
lola: subprocess 3 will run for 343 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (G (((p42 + 1 <= p15)))) AND (p15 <= p42)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (G (((p42 + 1 <= p15)))) AND (p15 <= p42)))
lola: processed formula length: 49
lola: 105 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: 12 markings, 12 edges
lola: ========================================
lola: subprocess 4 will run for 381 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((G ((F ((p8 + 1 <= p7)) AND (p21 + 1 <= p15))) OR (p21 + 1 <= p15)))) AND X ((p41 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 381 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((F ((p8 + 1 <= p7)) AND (p21 + 1 <= p15))) OR (p21 + 1 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((F ((p8 + 1 <= p7)) AND (p21 + 1 <= p15))) OR (p21 + 1 <= p15))))
lola: processed formula length: 75
lola: 105 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: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 429 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G (F ((p22 + 1 <= p29))) AND ((2 <= p35) AND (p22 + 1 <= p29)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (F ((p22 + 1 <= p29))) AND ((2 <= p35) AND (p22 + 1 <= p29)))))
lola: processed formula length: 72
lola: 105 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: 12 markings, 12 edges
lola: ========================================
lola: subprocess 6 will run for 490 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= p44) U ((p46 <= 2) OR X ((X (G (((p46 <= 2) R (p33 + 1 <= p21)))) AND (3 <= p46)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((3 <= p44) U ((p46 <= 2) OR X ((X (G (((p46 <= 2) R (p33 + 1 <= p21)))) AND (3 <= p46)))))
lola: processed formula length: 91
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 228110 markings, 352515 edges
lola: ========================================
lola: subprocess 7 will run for 572 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p15 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p15 <= p8)))
lola: processed formula length: 19
lola: 105 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: 12 markings, 11 edges
lola: ========================================
lola: subprocess 8 will run for 687 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((((1 <= p51) U (p40 <= p16)) AND (1 <= p51))) AND X (X (G ((p50 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 687 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p51) U (p40 <= p16)) AND (1 <= p51)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((((1 <= p51) U (p40 <= p16)) AND (1 <= p51)))
lola: processed formula length: 48
lola: 105 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 858 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((p50 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((p50 <= p2))))
lola: processed formula length: 23
lola: 105 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: 4513895 markings, 6976007 edges, 902779 markings/sec, 0 secs
lola: 9320125 markings, 14403800 edges, 961246 markings/sec, 5 secs
lola: 14000288 markings, 21636790 edges, 936033 markings/sec, 10 secs
lola: 18685777 markings, 28877996 edges, 937098 markings/sec, 15 secs
lola: 23333175 markings, 36060335 edges, 929480 markings/sec, 20 secs
lola: 27405672 markings, 42354199 edges, 814499 markings/sec, 25 secs
lola: 31725021 markings, 49029553 edges, 863870 markings/sec, 30 secs
lola: 36096572 markings, 55785583 edges, 874310 markings/sec, 35 secs
lola: 40716040 markings, 62924764 edges, 923894 markings/sec, 40 secs
lola: 45487273 markings, 70298490 edges, 954247 markings/sec, 45 secs
lola: 50193099 markings, 77571125 edges, 941165 markings/sec, 50 secs
lola: 54893937 markings, 84836059 edges, 940168 markings/sec, 55 secs
lola: 59566077 markings, 92056639 edges, 934428 markings/sec, 60 secs
lola: 64216070 markings, 99242994 edges, 929999 markings/sec, 65 secs
lola: 68807198 markings, 106338373 edges, 918226 markings/sec, 70 secs
lola: 72729820 markings, 112401343 edges, 784524 markings/sec, 75 secs
lola: 75455459 markings, 116614603 edges, 545128 markings/sec, 80 secs
lola: 78206657 markings, 120866016 edges, 550240 markings/sec, 85 secs
lola: 79386235 markings, 122687791 edges, 235916 markings/sec, 90 secs
lola: 82216094 markings, 127063376 edges, 565972 markings/sec, 95 secs
lola: 84016743 markings, 129844034 edges, 360130 markings/sec, 100 secs
lola: 86981519 markings, 134425959 edges, 592955 markings/sec, 105 secs
lola: 88744650 markings, 137150801 edges, 352626 markings/sec, 110 secs
lola: 88870068 markings, 137344622 edges, 25084 markings/sec, 115 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: subprocess 9 will run for 827 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p43 <= 1) R (p1 + 1 <= p14)) AND X (F ((p1 + 1 <= p14))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((p43 <= 1) R (p1 + 1 <= p14)) AND X (F ((p1 + 1 <= p14))))))
lola: processed formula length: 68
lola: 105 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: 12 markings, 12 edges
lola: ========================================
lola: subprocess 10 will run for 1102 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (X (F ((p15 + 1 <= p23)))) OR (p9 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (X (F ((p15 + 1 <= p23)))) OR (p9 <= 0))))
lola: processed formula length: 51
lola: 105 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: 4304502 markings, 6652390 edges, 860900 markings/sec, 0 secs
lola: 8646717 markings, 13363082 edges, 868443 markings/sec, 5 secs
lola: 12912767 markings, 19956096 edges, 853210 markings/sec, 10 secs
lola: 17358010 markings, 26825990 edges, 889049 markings/sec, 15 secs
lola: 21818462 markings, 33719415 edges, 892090 markings/sec, 20 secs
lola: 26241139 markings, 40554465 edges, 884535 markings/sec, 25 secs
lola: 30592647 markings, 47279517 edges, 870302 markings/sec, 30 secs
lola: 35019552 markings, 54121100 edges, 885381 markings/sec, 35 secs
lola: 39782343 markings, 61481779 edges, 952558 markings/sec, 40 secs
lola: 44414062 markings, 68639888 edges, 926344 markings/sec, 45 secs
lola: 49022748 markings, 75762404 edges, 921737 markings/sec, 50 secs
lola: 53683486 markings, 82965367 edges, 932148 markings/sec, 55 secs
lola: 57974785 markings, 89597373 edges, 858260 markings/sec, 60 secs
lola: 62563138 markings, 96688458 edges, 917671 markings/sec, 65 secs
lola: 67143756 markings, 103767607 edges, 916124 markings/sec, 70 secs
lola: 71621515 markings, 110690179 edges, 895552 markings/sec, 75 secs
lola: 75125917 markings, 116105936 edges, 700880 markings/sec, 80 secs
lola: 78363914 markings, 121107847 edges, 647599 markings/sec, 85 secs
lola: 79871930 markings, 123438422 edges, 301603 markings/sec, 90 secs
lola: 82376295 markings, 127308799 edges, 500873 markings/sec, 95 secs
lola: 84591685 markings, 130732597 edges, 443078 markings/sec, 100 secs
lola: 86397584 markings, 133523508 edges, 361180 markings/sec, 105 secs
lola: 88221479 markings, 136342263 edges, 364779 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 1595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p43 <= 2)))
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 ((p43 <= 2)))
lola: processed formula length: 18
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 41
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: 65 markings, 84 edges
lola: ========================================
lola: subprocess 12 will run for 3189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((2 <= p7)) OR (p53 <= p37))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((2 <= p7)) OR (p53 <= p37))))
lola: processed formula length: 39
lola: 105 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: 754 markings, 1118 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X ((X (F ((F ((p44 + 1 <= p16)) AND (G ((p44 + 1 <= p16)) AND (p47 + 1 <= p38))))) OR F ((p0 <= p10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F ((F ((p44 + 1 <= p16)) AND (G ((p44 + 1 <= p16)) AND (p47 + 1 <= p38))))) OR F ((p0 <= p10))))
lola: processed formula length: 103
lola: 105 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: 3634171 markings, 5537127 edges, 726834 markings/sec, 0 secs
lola: 7429977 markings, 11320558 edges, 759161 markings/sec, 5 secs
lola: 11030094 markings, 16805824 edges, 720023 markings/sec, 10 secs
lola: 14754403 markings, 22480310 edges, 744862 markings/sec, 15 secs
lola: 18725156 markings, 28530305 edges, 794151 markings/sec, 20 secs
lola: 22647872 markings, 34507090 edges, 784543 markings/sec, 25 secs
lola: 26464877 markings, 40322820 edges, 763401 markings/sec, 30 secs
lola: 30822387 markings, 46962076 edges, 871502 markings/sec, 35 secs
lola: 35132085 markings, 53528493 edges, 861940 markings/sec, 40 secs
lola: 39217495 markings, 59753163 edges, 817082 markings/sec, 45 secs
lola: 43405848 markings, 66134695 edges, 837671 markings/sec, 50 secs
lola: 47794099 markings, 72820792 edges, 877650 markings/sec, 55 secs
lola: 51954428 markings, 79159620 edges, 832066 markings/sec, 60 secs
lola: 56124606 markings, 85513466 edges, 834036 markings/sec, 65 secs
lola: 60444304 markings, 92095110 edges, 863940 markings/sec, 70 secs
lola: 64163588 markings, 97761943 edges, 743857 markings/sec, 75 secs
lola: 67912032 markings, 103473214 edges, 749689 markings/sec, 80 secs
lola: 71268446 markings, 108591388 edges, 671283 markings/sec, 85 secs
lola: 73360696 markings, 111774989 edges, 418450 markings/sec, 90 secs
lola: 75690676 markings, 115325089 edges, 465996 markings/sec, 95 secs
lola: 78118709 markings, 119024472 edges, 485607 markings/sec, 100 secs
lola: 80863162 markings, 123206031 edges, 548891 markings/sec, 105 secs
lola: 83381806 markings, 127043525 edges, 503729 markings/sec, 110 secs
lola: 85824667 markings, 130765563 edges, 488572 markings/sec, 115 secs
lola: 86408497 markings, 131655096 edges, 116766 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F ((((1 <= p51) U (p40 <= p16)) AND (1 <= p51))) AND X (X (G ((p50 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p51) U (p40 <= p16)) AND (1 <= p51)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((((1 <= p51) U (p40 <= p16)) AND (1 <= p51)))
lola: processed formula length: 48
lola: 105 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (X (G ((p50 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((p50 <= p2))))
lola: processed formula length: 23
lola: 105 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: 4798080 markings, 7415197 edges, 959616 markings/sec, 0 secs
lola: 9545753 markings, 14752511 edges, 949535 markings/sec, 5 secs
lola: 13902289 markings, 21485338 edges, 871307 markings/sec, 10 secs
lola: 18248725 markings, 28202553 edges, 869287 markings/sec, 15 secs
lola: 23118566 markings, 35728662 edges, 973968 markings/sec, 20 secs
lola: 27811703 markings, 42981696 edges, 938627 markings/sec, 25 secs
lola: 32076165 markings, 49572249 edges, 852892 markings/sec, 30 secs
lola: 36066235 markings, 55738704 edges, 798014 markings/sec, 35 secs
lola: 40445021 markings, 62505920 edges, 875757 markings/sec, 40 secs
lola: 44516763 markings, 68798642 edges, 814348 markings/sec, 45 secs
lola: 48541346 markings, 75018416 edges, 804917 markings/sec, 50 secs
lola: 52648911 markings, 81366476 edges, 821513 markings/sec, 55 secs
lola: 56883468 markings, 87910787 edges, 846911 markings/sec, 60 secs
lola: 61345184 markings, 94806171 edges, 892343 markings/sec, 65 secs
lola: 65502888 markings, 101231712 edges, 831541 markings/sec, 70 secs
lola: 69593010 markings, 107552815 edges, 818024 markings/sec, 75 secs
lola: 73401171 markings, 113438229 edges, 761632 markings/sec, 80 secs
lola: 74985666 markings, 115888035 edges, 316899 markings/sec, 85 secs
lola: 77367114 markings, 119568907 edges, 476290 markings/sec, 90 secs
lola: 79118150 markings, 122273486 edges, 350207 markings/sec, 95 secs
lola: 81313588 markings, 125667343 edges, 439088 markings/sec, 100 secs
lola: 83934852 markings, 129717476 edges, 524253 markings/sec, 105 secs
lola: 86334700 markings, 133427668 edges, 479970 markings/sec, 110 secs
lola: 88719374 markings, 137111735 edges, 476935 markings/sec, 115 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: G (F ((X (X (F ((p15 + 1 <= p23)))) OR (p9 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (X (F ((p15 + 1 <= p23)))) OR (p9 <= 0))))
lola: processed formula length: 51
lola: 105 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: 4365436 markings, 6746576 edges, 873087 markings/sec, 0 secs
lola: 8851676 markings, 13679841 edges, 897248 markings/sec, 5 secs
lola: 13425102 markings, 20747865 edges, 914685 markings/sec, 10 secs
lola: 17632067 markings, 27249533 edges, 841393 markings/sec, 15 secs
lola: 21705983 markings, 33545585 edges, 814783 markings/sec, 20 secs
lola: 26016786 markings, 40207739 edges, 862161 markings/sec, 25 secs
lola: 30651444 markings, 47370389 edges, 926932 markings/sec, 30 secs
lola: 35384105 markings, 54684498 edges, 946532 markings/sec, 35 secs
lola: 39748987 markings, 61430220 edges, 872976 markings/sec, 40 secs
lola: 43764835 markings, 67636537 edges, 803170 markings/sec, 45 secs
lola: 47652924 markings, 73645403 edges, 777618 markings/sec, 50 secs
lola: 51595839 markings, 79738998 edges, 788583 markings/sec, 55 secs
lola: 55661510 markings, 86022312 edges, 813134 markings/sec, 60 secs
lola: 59686309 markings, 92242457 edges, 804960 markings/sec, 65 secs
lola: 63800012 markings, 98599995 edges, 822741 markings/sec, 70 secs
lola: 67770959 markings, 104736918 edges, 794189 markings/sec, 75 secs
lola: 71925658 markings, 111158597 edges, 830940 markings/sec, 80 secs
lola: 74082515 markings, 114491764 edges, 431371 markings/sec, 85 secs
lola: 76262474 markings, 117860169 edges, 435992 markings/sec, 90 secs
lola: 80140629 markings, 123855916 edges, 775631 markings/sec, 95 secs
lola: 80440529 markings, 124317149 edges, 59980 markings/sec, 100 secs
lola: 83424969 markings, 128929484 edges, 596888 markings/sec, 105 secs
lola: 86251478 markings, 133297713 edges, 565302 markings/sec, 110 secs
lola: 88598408 markings, 136924793 edges, 469386 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: unknown no no no no no no yes no unknown no no unknown
lola:
preliminary result: unknown no no no no no no yes no unknown no no unknown
lola: memory consumption: 3356 KB
lola: time consumption: 760 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="RefineWMG-PT-010011"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# 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 gold2020"
echo " Input is RefineWMG-PT-010011, 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 r189-tajo-162089432900317"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-010011.tgz
mv RefineWMG-PT-010011 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 ;