Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987913700313.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is BridgeAndVehicles-PT-V20P10N20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913700313
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 5.0K Mar 26 02:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 26 02:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 94K Mar 25 20:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 275K Mar 25 20:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.4K Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 45K Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 142K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Mar 25 17:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 31K Mar 25 17:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 74K Mar 25 12:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 215K Mar 25 12:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K Mar 25 17:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1.1M 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 BridgeAndVehicles-PT-V20P10N20-00
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-01
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-02
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-03
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-04
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-05
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-06
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-07
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-08
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-09
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-10
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-11
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-12
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-13
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-14
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-15

=== Now, execution of the tool begins

BK_START 1591143279013

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 00:14:42] [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:14:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 00:14:42] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2020-06-03 00:14:42] [INFO ] Transformed 78 places.
[2020-06-03 00:14:42] [INFO ] Transformed 968 transitions.
[2020-06-03 00:14:42] [INFO ] Parsed PT model containing 78 places and 968 transitions in 238 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 99 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 575 resets, run finished after 424 ms. (steps per millisecond=235 ) properties seen :[0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-06-03 00:14:42] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 78 cols
[2020-06-03 00:14:42] [INFO ] Computed 7 place invariants in 7 ms
[2020-06-03 00:14:43] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned unsat
[2020-06-03 00:14:43] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-03 00:14:43] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned unsat
[2020-06-03 00:14:43] [INFO ] [Real]Absence check using 7 positive place invariants in 17 ms returned unsat
[2020-06-03 00:14:43] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-03 00:14:43] [INFO ] [Real]Absence check using 7 positive place invariants in 53 ms returned unsat
[2020-06-03 00:14:43] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-03 00:14:43] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-03 00:14:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:14:43] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2020-06-03 00:14:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:14:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 40 ms returned sat
[2020-06-03 00:14:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:14:43] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2020-06-03 00:14:43] [INFO ] State equation strengthened by 42 read => feed constraints.
[2020-06-03 00:14:43] [INFO ] [Nat]Added 42 Read/Feed constraints in 20 ms returned sat
[2020-06-03 00:14:43] [INFO ] Computed and/alt/rep : 965/22439/167 causal constraints in 71 ms.
[2020-06-03 00:14:47] [INFO ] Added : 156 causal constraints over 38 iterations in 3723 ms. Result :sat
[2020-06-03 00:14:47] [INFO ] Deduced a trap composed of 25 places in 157 ms
[2020-06-03 00:14:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2020-06-03 00:14:47] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-03 00:14:47] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
Successfully simplified 9 atomic propositions for a total of 11 simplifications.
[2020-06-03 00:14:47] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-03 00:14:47] [INFO ] Flatten gal took : 152 ms
FORMULA BridgeAndVehicles-PT-V20P10N20-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N20-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N20-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N20-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N20-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N20-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 00:14:48] [INFO ] Flatten gal took : 54 ms
[2020-06-03 00:14:48] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 16 ms.
[2020-06-03 00:14:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ BridgeAndVehicles-PT-V20P10N20 @ 3570 seconds

FORMULA BridgeAndVehicles-PT-V20P10N20-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N20-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N20-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N20-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N20-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N20-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N20-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N20-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N20-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N20-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2928
rslt: Output for LTLCardinality @ BridgeAndVehicles-PT-V20P10N20

{
"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:14:48 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 353
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": 2,
"visible_transitions": 0
},
"processed": "G (F ((X ((p0 <= p24)) OR (p0 <= p24))))",
"processed_size": 40,
"rewrites": 91
},
"result":
{
"edges": 54850749,
"markings": 12679005,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 385
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 385
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p52 + 1 <= p24)",
"processed_size": 16,
"rewrites": 93
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 22
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 433
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F ((p26 + p27 + 1 <= p56)))",
"processed_size": 30,
"rewrites": 91
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 433
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 433
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((1 <= p50 + p51))",
"processed_size": 20,
"rewrites": 91
},
"result":
{
"edges": 169,
"markings": 169,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 495
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((1 <= p50 + p51)))",
"processed_size": 24,
"rewrites": 91
},
"result":
{
"edges": 171,
"markings": 170,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 495
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (F ((p0 <= 1)))",
"processed_size": 17,
"rewrites": 91
},
"result":
{
"edges": 25048482,
"markings": 7860979,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 572
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 4,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 5,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (X (G (((G ((p49 + 1 <= p53 + p54)) OR (p56 <= 0)) AND F ((G ((p53 + p54 + 1 <= p50 + p51)) OR (G ((p56 <= 0)) AND (p53 + p54 + 1 <= p50 + p51))))))))",
"processed_size": 152,
"rewrites": 91
},
"result":
{
"edges": 299755749,
"markings": 31738227,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 632
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 632
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(F ((p51 <= p23)) U ((p22 <= p25) AND (p51 <= p23)))",
"processed_size": 52,
"rewrites": 91
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 790
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G (((p51 <= p23) OR (p65 <= 0))))",
"processed_size": 36,
"rewrites": 91
},
"result":
{
"edges": 169,
"markings": 169,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 790
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"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": 3,
"visible_transitions": 0
},
"processed": "F (G ((G ((p23 <= p0)) AND X ((p52 <= p0)))))",
"processed_size": 45,
"rewrites": 91
},
"result":
{
"edges": 221936410,
"markings": 38559737,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 976
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((p23 <= p25) U X (F ((F ((G ((p0 <= 1)) OR ((p22 <= p50) AND (p0 <= 1)))) OR X ((p50 + 1 <= p22))))))",
"processed_size": 102,
"rewrites": 91
},
"result":
{
"edges": 46381,
"markings": 12691,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"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": 1464
},
"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": "F (G ((p24 + 1 <= p25)))",
"processed_size": 24,
"rewrites": 91
},
"result":
{
"edges": 171,
"markings": 170,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2928
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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 ((p22 + 1 <= p25))",
"processed_size": 20,
"rewrites": 91
},
"result":
{
"edges": 1215,
"markings": 601,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"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": 38052,
"runtime": 642.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F((X(**) OR **))) : (X(F(*)) AND F(**)) : (G(**) OR (G((X(G(**)) OR **)) AND F(G(**)))) : X(F(*)) : X(X(G(((G(*) OR *) AND F((G(*) OR (G(*) AND *))))))) : F(G(*)) : ((F(**) U **) AND X(G((** OR *)))) : G(*) : F(G((G(**) AND X(**)))) : (** U X(F((F((G(*) OR (* AND *))) OR X(*)))))"
},
"net":
{
"arcs": 7350,
"conflict_clusters": 5,
"places": 78,
"places_significant": 71,
"singleton_clusters": 0,
"transitions": 968
},
"result":
{
"preliminary_value": "yes yes no yes no no no no yes yes ",
"value": "yes yes no yes no no no no yes 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: 1046/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2496
lola: finding significant places
lola: 78 places, 968 transitions, 71 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: G (F (((p24 + 1 <= p0) U (X ((p0 <= p24)) OR (p0 <= p24))))) : (NOT(G (X ((p56 <= p26 + p27)))) AND F ((p24 <= p52))) : (G ((G (((G ((p23 <= p49)) U (1 <= 0)) U X ((p24 <= p52)))) OR (1 <= p50 + p51))) U G ((1 <= p50 + p51))) : F (X (((1 <= 0) U NOT(G ((2 <= p0)))))) : G (X (NOT(X (F (((F ((p53 + p54 <= p49)) AND (1 <= p56)) OR G ((F ((1 <= p56)) U (p50 + p51 <= p53 + p54))))))))) : F (X (G (NOT(G (F ((p25 <= p24))))))) : ((F ((p51 <= p23)) U ((p22 <= p25) AND (p51 <= p23))) AND NOT(F ((NOT(X ((p51 <= p23))) AND X ((1 <= p65)))))) : NOT(F ((F ((p66 <= p43)) U (p25 <= p22)))) : F (NOT(F (NOT(X (G ((G ((p23 <= p0)) AND X ((p52 <= p0))))))))) : ((p23 <= p25) U NOT(G (X (G ((G (((p50 + 1 <= p22) U (2 <= p0))) AND X ((p22 <= p50))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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: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:329
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: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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:329
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:332
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X ((p0 <= p24)) OR (p0 <= p24))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X ((p0 <= p24)) OR (p0 <= p24))))
lola: processed formula length: 40
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: 1311475 markings, 4091234 edges, 262295 markings/sec, 0 secs
lola: 2511543 markings, 7970144 edges, 240014 markings/sec, 5 secs
lola: 3654573 markings, 11764260 edges, 228606 markings/sec, 10 secs
lola: 4632136 markings, 16204677 edges, 195513 markings/sec, 15 secs
lola: 5551375 markings, 20482705 edges, 183848 markings/sec, 20 secs
lola: 6423984 markings, 24597677 edges, 174522 markings/sec, 25 secs
lola: 7283785 markings, 28696422 edges, 171960 markings/sec, 30 secs
lola: 8147949 markings, 32742511 edges, 172833 markings/sec, 35 secs
lola: 8978677 markings, 36802618 edges, 166146 markings/sec, 40 secs
lola: 9819296 markings, 40854748 edges, 168124 markings/sec, 45 secs
lola: 10648175 markings, 44872172 edges, 165776 markings/sec, 50 secs
lola: 11444457 markings, 48931089 edges, 159256 markings/sec, 55 secs
lola: 12263546 markings, 53006760 edges, 163818 markings/sec, 60 secs
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: 12679005 markings, 54850749 edges
lola: subprocess 1 will run for 385 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((p26 + p27 + 1 <= p56))) AND F ((p24 <= p52)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 385 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p24 <= p52))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p52 + 1 <= p24)
lola: processed formula length: 16
lola: 93 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
========================================
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 433 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p26 + p27 + 1 <= p56)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p26 + p27 + 1 <= p56)))
lola: processed formula length: 30
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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 433 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((1 <= p50 + p51)) OR (G ((X (G ((p24 <= p52))) OR (1 <= p50 + p51))) AND F (G ((1 <= p50 + p51)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 433 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p50 + p51))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p50 + p51))
lola: processed formula length: 20
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: 169 markings, 169 edges
lola: ========================================
lola: subprocess 3 will run for 495 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p50 + p51)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((1 <= p50 + p51)))
lola: processed formula length: 24
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: 170 markings, 171 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 495 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p0 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p0 <= 1)))
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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1337105 markings, 4065552 edges, 267421 markings/sec, 0 secs
lola: 2583508 markings, 8007178 edges, 249281 markings/sec, 5 secs
lola: 3782828 markings, 11835890 edges, 239864 markings/sec, 10 secs
lola: 4961755 markings, 15643157 edges, 235785 markings/sec, 15 secs
lola: 6119031 markings, 19341399 edges, 231455 markings/sec, 20 secs
lola: 7226086 markings, 22983563 edges, 221411 markings/sec, 25 secs
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: 7860979 markings, 25048482 edges
lola: ========================================
lola: subprocess 4 will run for 572 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((G ((p49 + 1 <= p53 + p54)) OR (p56 <= 0)) AND F ((G ((p53 + p54 + 1 <= p50 + p51)) OR (G ((p56 <= 0)) AND (p53 + p54 + 1 <= p50 + p51))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((G ((p49 + 1 <= p53 + p54)) OR (p56 <= 0)) AND F ((G ((p53 + p54 + 1 <= p50 + p51)) OR (G ((p56 <= 0)) AND (p53 + p54 + 1 <= p50 + p51))))))))
lola: processed formula length: 152
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 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: 741999 markings, 5651678 edges, 148400 markings/sec, 0 secs
lola: 1403637 markings, 11489211 edges, 132328 markings/sec, 5 secs
lola: 2050611 markings, 17253020 edges, 129395 markings/sec, 10 secs
lola: 2691280 markings, 22983103 edges, 128134 markings/sec, 15 secs
lola: 3324705 markings, 28622838 edges, 126685 markings/sec, 20 secs
lola: 3932181 markings, 34393847 edges, 121495 markings/sec, 25 secs
lola: 4565303 markings, 39990307 edges, 126624 markings/sec, 30 secs
lola: 5150814 markings, 45679100 edges, 117102 markings/sec, 35 secs
lola: 5778095 markings, 51137339 edges, 125456 markings/sec, 40 secs
lola: 6360513 markings, 56874225 edges, 116484 markings/sec, 45 secs
lola: 6986912 markings, 62353746 edges, 125280 markings/sec, 50 secs
lola: 7562845 markings, 67957377 edges, 115187 markings/sec, 55 secs
lola: 8143105 markings, 73575666 edges, 116052 markings/sec, 60 secs
lola: 8764869 markings, 78906116 edges, 124353 markings/sec, 65 secs
lola: 9326155 markings, 84503754 edges, 112257 markings/sec, 70 secs
lola: 9905103 markings, 90142036 edges, 115790 markings/sec, 75 secs
lola: 10529504 markings, 95519253 edges, 124880 markings/sec, 80 secs
lola: 11084940 markings, 100943136 edges, 111087 markings/sec, 85 secs
lola: 11657547 markings, 106626353 edges, 114521 markings/sec, 90 secs
lola: 12213958 markings, 112056473 edges, 111282 markings/sec, 95 secs
lola: 12838416 markings, 117260167 edges, 124892 markings/sec, 100 secs
lola: 13375988 markings, 122674367 edges, 107514 markings/sec, 105 secs
lola: 13946764 markings, 128341993 edges, 114155 markings/sec, 110 secs
lola: 14495154 markings, 133732464 edges, 109678 markings/sec, 115 secs
lola: 15116975 markings, 138944409 edges, 124364 markings/sec, 120 secs
lola: 15660506 markings, 144247014 edges, 108706 markings/sec, 125 secs
lola: 16203468 markings, 149775468 edges, 108592 markings/sec, 130 secs
lola: 16771007 markings, 155367727 edges, 113508 markings/sec, 135 secs
lola: 17310078 markings, 160637485 edges, 107814 markings/sec, 140 secs
lola: 17932741 markings, 165745280 edges, 124533 markings/sec, 145 secs
lola: 18465691 markings, 171026319 edges, 106590 markings/sec, 150 secs
lola: 18992738 markings, 176426024 edges, 105409 markings/sec, 155 secs
lola: 19556649 markings, 182021119 edges, 112782 markings/sec, 160 secs
lola: 20108127 markings, 187444687 edges, 110296 markings/sec, 165 secs
lola: 20709030 markings, 192730228 edges, 120181 markings/sec, 170 secs
lola: 21281466 markings, 197826931 edges, 114487 markings/sec, 175 secs
lola: 21793975 markings, 203083525 edges, 102502 markings/sec, 180 secs
lola: 22324699 markings, 208503078 edges, 106145 markings/sec, 185 secs
lola: 22880921 markings, 214024463 edges, 111244 markings/sec, 190 secs
lola: 23418848 markings, 219312643 edges, 107585 markings/sec, 195 secs
lola: 23962883 markings, 224530836 edges, 108807 markings/sec, 200 secs
lola: 24582073 markings, 229475357 edges, 123838 markings/sec, 205 secs
lola: 25091884 markings, 234719272 edges, 101962 markings/sec, 210 secs
lola: 25602742 markings, 239959437 edges, 102172 markings/sec, 215 secs
lola: 26144742 markings, 245458651 edges, 108400 markings/sec, 220 secs
lola: 26696237 markings, 250898405 edges, 110299 markings/sec, 225 secs
lola: 27233773 markings, 256182842 edges, 107507 markings/sec, 230 secs
lola: 27860242 markings, 261241895 edges, 125294 markings/sec, 235 secs
lola: 28402218 markings, 266366693 edges, 108395 markings/sec, 240 secs
lola: 28912616 markings, 271611450 edges, 102080 markings/sec, 245 secs
lola: 29421530 markings, 276832726 edges, 101783 markings/sec, 250 secs
lola: 29951047 markings, 282238171 edges, 105903 markings/sec, 255 secs
lola: 30509104 markings, 287777722 edges, 111611 markings/sec, 260 secs
lola: 31031883 markings, 292949155 edges, 104556 markings/sec, 265 secs
lola: 31560928 markings, 298096982 edges, 105809 markings/sec, 270 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: 31738227 markings, 299755749 edges
lola: ========================================
lola: subprocess 5 will run for 632 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F ((p51 <= p23)) U ((p22 <= p25) AND (p51 <= p23))) AND X (G (((p51 <= p23) OR (p65 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 632 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p51 <= p23)) U ((p22 <= p25) AND (p51 <= p23)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((p51 <= p23)) U ((p22 <= p25) AND (p51 <= p23)))
lola: processed formula length: 52
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: 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 6 will run for 790 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p51 <= p23) OR (p65 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p51 <= p23) OR (p65 <= 0))))
lola: processed formula length: 36
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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 169 markings, 169 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 790 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((G ((p23 <= p0)) AND X ((p52 <= p0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G ((p23 <= p0)) AND X ((p52 <= p0)))))
lola: processed formula length: 45
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: 986324 markings, 5212095 edges, 197265 markings/sec, 0 secs
lola: 1883358 markings, 10450599 edges, 179407 markings/sec, 5 secs
lola: 2803772 markings, 15568885 edges, 184083 markings/sec, 10 secs
lola: 3675519 markings, 20681819 edges, 174349 markings/sec, 15 secs
lola: 4557091 markings, 25801682 edges, 176314 markings/sec, 20 secs
lola: 5469045 markings, 30799957 edges, 182391 markings/sec, 25 secs
lola: 6330365 markings, 35774128 edges, 172264 markings/sec, 30 secs
lola: 7185408 markings, 40803287 edges, 171009 markings/sec, 35 secs
lola: 8067130 markings, 45703521 edges, 176344 markings/sec, 40 secs
lola: 8906941 markings, 50690116 edges, 167962 markings/sec, 45 secs
lola: 9761072 markings, 55460232 edges, 170826 markings/sec, 50 secs
lola: 10622020 markings, 60368968 edges, 172190 markings/sec, 55 secs
lola: 11439592 markings, 65271608 edges, 163514 markings/sec, 60 secs
lola: 12334581 markings, 70089223 edges, 178998 markings/sec, 65 secs
lola: 13135597 markings, 75008658 edges, 160203 markings/sec, 70 secs
lola: 13979178 markings, 79734294 edges, 168716 markings/sec, 75 secs
lola: 14854914 markings, 84527621 edges, 175147 markings/sec, 80 secs
lola: 15639934 markings, 89392179 edges, 157004 markings/sec, 85 secs
lola: 16480671 markings, 94109926 edges, 168147 markings/sec, 90 secs
lola: 17329969 markings, 98867334 edges, 169860 markings/sec, 95 secs
lola: 18172462 markings, 103751752 edges, 168499 markings/sec, 100 secs
lola: 18903640 markings, 108476125 edges, 146236 markings/sec, 105 secs
lola: 19786950 markings, 113096385 edges, 176662 markings/sec, 110 secs
lola: 20640372 markings, 117829587 edges, 170684 markings/sec, 115 secs
lola: 21455337 markings, 122747435 edges, 162993 markings/sec, 120 secs
lola: 22218916 markings, 127578277 edges, 152716 markings/sec, 125 secs
lola: 23099286 markings, 132165351 edges, 176074 markings/sec, 130 secs
lola: 23930378 markings, 136809633 edges, 166218 markings/sec, 135 secs
lola: 24760135 markings, 141637024 edges, 165951 markings/sec, 140 secs
lola: 25492399 markings, 146396741 edges, 146453 markings/sec, 145 secs
lola: 26363548 markings, 151001932 edges, 174230 markings/sec, 150 secs
lola: 27168752 markings, 155571383 edges, 161041 markings/sec, 155 secs
lola: 28032863 markings, 160280952 edges, 172822 markings/sec, 160 secs
lola: 28796981 markings, 165039704 edges, 152824 markings/sec, 165 secs
lola: 29512705 markings, 169666146 edges, 143145 markings/sec, 170 secs
lola: 30395890 markings, 174230424 edges, 176637 markings/sec, 175 secs
lola: 31199286 markings, 178799581 edges, 160679 markings/sec, 180 secs
lola: 32043461 markings, 183475489 edges, 168835 markings/sec, 185 secs
lola: 32848260 markings, 188251266 edges, 160960 markings/sec, 190 secs
lola: 33553584 markings, 192852147 edges, 141065 markings/sec, 195 secs
lola: 34397679 markings, 197334473 edges, 168819 markings/sec, 200 secs
lola: 35194827 markings, 201880653 edges, 159430 markings/sec, 205 secs
lola: 35988668 markings, 206379457 edges, 158768 markings/sec, 210 secs
lola: 36854019 markings, 211088301 edges, 173070 markings/sec, 215 secs
lola: 37597999 markings, 215765600 edges, 148796 markings/sec, 220 secs
lola: 38314756 markings, 220440876 edges, 143351 markings/sec, 225 secs
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: 38559737 markings, 221936410 edges
lola: ========================================
lola: subprocess 7 will run for 976 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p23 <= p25) U X (F ((F ((G ((p0 <= 1)) OR ((p22 <= p50) AND (p0 <= 1)))) OR X ((p50 + 1 <= p22))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p23 <= p25) U X (F ((F ((G ((p0 <= 1)) OR ((p22 <= p50) AND (p0 <= 1)))) OR X ((p50 + 1 <= p22))))))
lola: processed formula length: 102
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 12691 markings, 46381 edges
lola: ========================================
lola: subprocess 8 will run for 1464 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p24 + 1 <= p25)))
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 ((p24 + 1 <= p25)))
lola: processed formula length: 24
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: 170 markings, 171 edges
lola: ========================================
lola: subprocess 9 will run for 2928 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p22 + 1 <= p25))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p22 + 1 <= p25))
lola: processed formula length: 20
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: 601 markings, 1215 edges
lola: RESULT
lola:
SUMMARY: yes yes no yes no no no no yes yes
lola:
preliminary result: yes yes no yes no no no no yes yes
lola: ========================================
lola: memory consumption: 38052 KB
lola: time consumption: 642 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="BridgeAndVehicles-PT-V20P10N20"
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 BridgeAndVehicles-PT-V20P10N20, 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 r182-oct2-158987913700313"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V20P10N20.tgz
mv BridgeAndVehicles-PT-V20P10N20 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;