Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r170-smll-158987815800385.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is FlexibleBarrier-PT-20a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-158987815800385
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 3.5K Apr 4 19:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 4 19:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 4 08:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 4 08:41 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 3.5K Apr 8 14:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 3 21:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 3 21:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 3 13:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 3 13:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 4 01:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 321K 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 FlexibleBarrier-PT-20a-00
FORMULA_NAME FlexibleBarrier-PT-20a-01
FORMULA_NAME FlexibleBarrier-PT-20a-02
FORMULA_NAME FlexibleBarrier-PT-20a-03
FORMULA_NAME FlexibleBarrier-PT-20a-04
FORMULA_NAME FlexibleBarrier-PT-20a-05
FORMULA_NAME FlexibleBarrier-PT-20a-06
FORMULA_NAME FlexibleBarrier-PT-20a-07
FORMULA_NAME FlexibleBarrier-PT-20a-08
FORMULA_NAME FlexibleBarrier-PT-20a-09
FORMULA_NAME FlexibleBarrier-PT-20a-10
FORMULA_NAME FlexibleBarrier-PT-20a-11
FORMULA_NAME FlexibleBarrier-PT-20a-12
FORMULA_NAME FlexibleBarrier-PT-20a-13
FORMULA_NAME FlexibleBarrier-PT-20a-14
FORMULA_NAME FlexibleBarrier-PT-20a-15

=== Now, execution of the tool begins

BK_START 1591401880397

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-06 00:04:43] [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-06 00:04:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-06 00:04:43] [INFO ] Load time of PNML (sax parser for PT used): 243 ms
[2020-06-06 00:04:43] [INFO ] Transformed 243 places.
[2020-06-06 00:04:43] [INFO ] Transformed 1064 transitions.
[2020-06-06 00:04:43] [INFO ] Found NUPN structural information;
[2020-06-06 00:04:43] [INFO ] Parsed PT model containing 243 places and 1064 transitions in 326 ms.
Ensure Unique test removed 362 transitions
Reduce redundant transitions removed 362 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 40 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 692 ms. (steps per millisecond=144 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1]
[2020-06-06 00:04:44] [INFO ] Flow matrix only has 682 transitions (discarded 20 similar events)
// Phase 1: matrix 682 rows 243 cols
[2020-06-06 00:04:44] [INFO ] Computed 22 place invariants in 18 ms
[2020-06-06 00:04:44] [INFO ] [Real]Absence check using 22 positive place invariants in 23 ms returned unsat
[2020-06-06 00:04:45] [INFO ] [Real]Absence check using 22 positive place invariants in 35 ms returned sat
[2020-06-06 00:04:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 00:04:45] [INFO ] [Real]Absence check using state equation in 700 ms returned sat
[2020-06-06 00:04:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 00:04:46] [INFO ] [Nat]Absence check using 22 positive place invariants in 24 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-06 00:04:46] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-06 00:04:46] [INFO ] Flatten gal took : 199 ms
FORMULA FlexibleBarrier-PT-20a-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20a-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20a-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20a-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20a-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20a-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20a-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-06 00:04:46] [INFO ] Applying decomposition
[2020-06-06 00:04:46] [INFO ] Flatten gal took : 95 ms
[2020-06-06 00:04:46] [INFO ] Decomposing Gal with order
[2020-06-06 00:04:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-06 00:04:47] [INFO ] Removed a total of 1182 redundant transitions.
[2020-06-06 00:04:47] [INFO ] Flatten gal took : 171 ms
[2020-06-06 00:04:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 140 labels/synchronizations in 22 ms.
[2020-06-06 00:04:47] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2020-06-06 00:04:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 11 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ FlexibleBarrier-PT-20a @ 3570 seconds

FORMULA FlexibleBarrier-PT-20a-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-20a-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-20a-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-20a-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-20a-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-20a-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-20a-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-20a-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-20a-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3053
rslt: Output for LTLCardinality @ FlexibleBarrier-PT-20a

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sat Jun 6 00:04:48 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((((1 <= p195)) AND ((p27 <= 0)))))",
"processed_size": 40,
"rewrites": 36
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 4,
"adisj": 2,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X ((X (G ((((p97 <= 0)) OR ((1 <= p65))))) OR F ((((1 <= p195)) AND ((p22 <= 0)))))))",
"processed_size": 89,
"rewrites": 36
},
"result":
{
"edges": 4891310,
"markings": 1718644,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 507
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 1,
"aconj": 6,
"adisj": 3,
"aneg": 0,
"comp": 6,
"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": "F (G ((F ((((p98 <= 0)) OR ((1 <= p18)))) AND ((((p116 <= 0)) OR ((1 <= p190))) OR X (F ((((p98 <= 0)) OR ((1 <= p18)))))))))",
"processed_size": 128,
"rewrites": 36
},
"result":
{
"edges": 13531460,
"markings": 4805682,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 584
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 9,
"U": 0,
"X": 2,
"aconj": 14,
"adisj": 7,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 3,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F ((F (G ((G ((((p74 <= 0)) OR ((1 <= p223)))) OR (G ((((p44 <= 0)) OR ((1 <= p103)))) AND F (G ((((p74 <= 0)) OR ((1 <= p223))))))))) AND G ((X ((((p74 <= 0)) OR ((1 <= p223)))) OR G ((G ((((p74 <= 0)) OR ((1 <= p223)))) OR (G ((((p44 <= 0)) OR ((1 <= p103)))) AND F (G ((((p74 <= 0)) OR ((1 <= p223)))))))))))))",
"processed_size": 323,
"rewrites": 36
},
"result":
{
"edges": 4502623,
"markings": 1245549,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 1618
},
"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": 656
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 656
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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 (((p52 <= 0))))",
"processed_size": 20,
"rewrites": 36
},
"result":
{
"edges": 10883,
"markings": 1678,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 820
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (X ((((p166 <= 0)) OR ((1 <= p191))))))",
"processed_size": 45,
"rewrites": 36
},
"result":
{
"edges": 546,
"markings": 222,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 820
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((((1 <= p0)) AND ((p23 <= 0)))))",
"processed_size": 38,
"rewrites": 36
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 1094
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F ((X ((((p87 <= 0)) OR ((1 <= p45)))) AND (((p216 <= 0)) OR ((1 <= p109))))))",
"processed_size": 83,
"rewrites": 36
},
"result":
{
"edges": 7,
"markings": 7,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1641
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((X ((((1 <= p234)) OR ((p178 <= 0)) OR ((1 <= p73)))) OR ((1 <= p239))))",
"processed_size": 77,
"rewrites": 36
},
"result":
{
"edges": 1,
"markings": 2,
"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": 3282
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((((p231 <= 0)) OR ((1 <= p20))))",
"processed_size": 36,
"rewrites": 36
},
"result":
{
"edges": 3437867,
"markings": 487223,
"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": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 31932,
"runtime": 517.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G(*)) : X(X((X(G(**)) OR F(*)))) : F(G((F(**) AND (** OR X(F(**)))))) : X(F((F(G((G(**) OR (G(**) AND F(G(**)))))) AND G((X(**) OR G((G(**) OR (G(**) AND F(G(**)))))))))) : (X(X(X(**))) OR F(G(*))) : G(**) : X(F(*)) : G(F((X(**) AND **))) : F((X(**) OR **))"
},
"net":
{
"arcs": 3149,
"conflict_clusters": 84,
"places": 243,
"places_significant": 221,
"singleton_clusters": 0,
"transitions": 702
},
"result":
{
"preliminary_value": "no no no no no no no no yes ",
"value": "no no no no no no no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 945/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 243
lola: finding significant places
lola: 243 places, 702 transitions, 221 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: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p190 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p223 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p223 <= 1)
lola: LP says that atomic proposition is always true: (p191 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p234 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p239 <= 1)
lola: NOT(X (((0 <= 0) U ((1 <= 0) U (((p195 <= 0)) OR ((1 <= p27))))))) : NOT(X (X ((F (NOT(X ((((p97 <= 0)) OR ((1 <= p65)))))) AND G ((((p195 <= 0)) OR ((1 <= p22)))))))) : F (G (((((p116 <= 0)) OR ((1 <= p190))) U X (F ((((p98 <= 0)) OR ((1 <= p18)))))))) : X (F (G ((X ((((p74 <= 0)) OR ((1 <= p223)))) U G ((G ((((p44 <= 0)) OR ((1 <= p103)))) U G ((((p74 <= 0)) OR ((1 <= p223)))))))))) : (X (X (X ((((p166 <= 0)) OR ((1 <= p191)))))) OR NOT(F (G (F (((1 <= p52))))))) : G ((((p231 <= 0)) OR ((1 <= p20)))) : NOT(G (X (G ((((p0 <= 0)) OR ((1 <= p23))))))) : G (F ((X ((((p87 <= 0)) OR ((1 <= p45)))) AND (((p216 <= 0)) OR ((1 <= p109)))))) : F ((X ((((1 <= p234)) OR ((p178 <= 0)) OR ((1 <= p73)))) OR ((1 <= p239))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:169
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:371
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: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:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((1 <= p195)) AND ((p27 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((1 <= p195)) AND ((p27 <= 0)))))
lola: processed formula length: 40
lola: 36 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((X (G ((((p97 <= 0)) OR ((1 <= p65))))) OR F ((((1 <= p195)) AND ((p22 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X (G ((((p97 <= 0)) OR ((1 <= p65))))) OR F ((((1 <= p195)) AND ((p22 <= 0)))))))
lola: processed formula length: 89
lola: 36 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: 555426 markings, 1437415 edges, 111085 markings/sec, 0 secs
lola: 1085305 markings, 2977985 edges, 105976 markings/sec, 5 secs
lola: 1574955 markings, 4470287 edges, 97930 markings/sec, 10 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: 1718644 markings, 4891310 edges
lola: ========================================
lola: subprocess 2 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((((p98 <= 0)) OR ((1 <= p18)))) AND ((((p116 <= 0)) OR ((1 <= p190))) OR X (F ((((p98 <= 0)) OR ((1 <= p18)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((((p98 <= 0)) OR ((1 <= p18)))) AND ((((p116 <= 0)) OR ((1 <= p190))) OR X (F ((((p98 <= 0)) OR ((1 <= p18)))))))))
lola: processed formula length: 128
lola: 36 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: 622739 markings, 1574501 edges, 124548 markings/sec, 0 secs
lola: 1213596 markings, 3169036 edges, 118171 markings/sec, 5 secs
lola: 1741770 markings, 4705222 edges, 105635 markings/sec, 10 secs
lola: 2253633 markings, 6226711 edges, 102373 markings/sec, 15 secs
lola: 2759527 markings, 7747776 edges, 101179 markings/sec, 20 secs
lola: 3366481 markings, 9339694 edges, 121391 markings/sec, 25 secs
lola: 3917622 markings, 10902977 edges, 110228 markings/sec, 30 secs
lola: 4432922 markings, 12419610 edges, 103060 markings/sec, 35 secs
lola: add low 662
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: 4805682 markings, 13531460 edges
lola: ========================================
lola: subprocess 3 will run for 584 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F (G ((G ((((p74 <= 0)) OR ((1 <= p223)))) OR (G ((((p44 <= 0)) OR ((1 <= p103)))) AND F (G ((((p74 <= 0)) OR ((1 <= p223))))))))) AND G ((X ((((p74 <= 0)) OR ((1 <= p223)))) OR G ((G ((((p74 <= 0)) OR ((1 <= p223)))) OR (G ((((p44 <= 0)) OR ((1 <= p103)))) AND F (G ((((p74 <= 0)) OR ((1 <= p223)))))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F (G ((G ((((p74 <= 0)) OR ((1 <= p223)))) OR (G ((((p44 <= 0)) OR ((1 <= p103)))) AND F (G ((((p74 <= 0)) OR ((1 <= p223))))))))) AND G ((X ((((p74 <= 0)) OR ((1 <= p223)))) OR G ((G ((((p74 <= 0)) OR ((1 <= p223)))) OR (G ((((p44 <= 0)) OR ((1 <= p103)))) AND F (G ((((p74 <= 0)) OR ((1 <= p223)))))))))))))
lola: processed formula length: 323
lola: 36 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 1618 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: 176905 markings, 487018 edges, 35381 markings/sec, 0 secs
lola: 323212 markings, 930006 edges, 29261 markings/sec, 5 secs
lola: 462118 markings, 1438386 edges, 27781 markings/sec, 10 secs
lola: 602493 markings, 1928303 edges, 28075 markings/sec, 15 secs
lola: 738549 markings, 2459607 edges, 27211 markings/sec, 20 secs
lola: 895529 markings, 2941576 edges, 31396 markings/sec, 25 secs
lola: 1053585 markings, 3441551 edges, 31611 markings/sec, 30 secs
lola: 1203993 markings, 4281819 edges, 30082 markings/sec, 35 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: 1245549 markings, 4502623 edges
lola: ========================================
lola: subprocess 4 will run for 656 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (X ((((p166 <= 0)) OR ((1 <= p191)))))) OR F (G (((p52 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 656 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p52 <= 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 (((p52 <= 0))))
lola: processed formula length: 20
lola: 36 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 663
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: 1678 markings, 10883 edges
lola: ========================================
lola: subprocess 5 will run for 820 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X ((((p166 <= 0)) OR ((1 <= p191))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X ((((p166 <= 0)) OR ((1 <= p191))))))
lola: processed formula length: 45
lola: 36 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: 222 markings, 546 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 820 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((1 <= p0)) AND ((p23 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((1 <= p0)) AND ((p23 <= 0)))))
lola: processed formula length: 38
lola: 36 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 6 will run for 1094 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X ((((p87 <= 0)) OR ((1 <= p45)))) AND (((p216 <= 0)) OR ((1 <= p109))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X ((((p87 <= 0)) OR ((1 <= p45)))) AND (((p216 <= 0)) OR ((1 <= p109))))))
lola: processed formula length: 83
lola: 36 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 7 will run for 1641 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((((1 <= p234)) OR ((p178 <= 0)) OR ((1 <= p73)))) OR ((1 <= p239))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((((1 <= p234)) OR ((p178 <= 0)) OR ((1 <= p73)))) OR ((1 <= p239))))
lola: processed formula length: 77
lola: 36 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 8 will run for 3282 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p231 <= 0)) OR ((1 <= p20))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p231 <= 0)) OR ((1 <= p20))))
lola: processed formula length: 36
lola: 36 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: 11357 markings, 101888 edges, 2271 markings/sec, 0 secs
lola: 23086 markings, 203877 edges, 2346 markings/sec, 5 secs
lola: 34047 markings, 301831 edges, 2192 markings/sec, 10 secs
lola: 44220 markings, 408890 edges, 2035 markings/sec, 15 secs
lola: 57278 markings, 494149 edges, 2612 markings/sec, 20 secs
lola: 67656 markings, 572378 edges, 2076 markings/sec, 25 secs
lola: 77974 markings, 668461 edges, 2064 markings/sec, 30 secs
lola: 88387 markings, 764497 edges, 2083 markings/sec, 35 secs
lola: 99593 markings, 858552 edges, 2241 markings/sec, 40 secs
lola: 112009 markings, 938567 edges, 2483 markings/sec, 45 secs
lola: 122506 markings, 1010876 edges, 2099 markings/sec, 50 secs
lola: 133454 markings, 1098381 edges, 2190 markings/sec, 55 secs
lola: 143868 markings, 1181582 edges, 2083 markings/sec, 60 secs
lola: 154127 markings, 1265548 edges, 2052 markings/sec, 65 secs
lola: 163803 markings, 1349338 edges, 1935 markings/sec, 70 secs
lola: 176135 markings, 1425147 edges, 2466 markings/sec, 75 secs
lola: 187702 markings, 1498478 edges, 2313 markings/sec, 80 secs
lola: 198088 markings, 1562392 edges, 2077 markings/sec, 85 secs
lola: 208710 markings, 1642870 edges, 2124 markings/sec, 90 secs
lola: 218821 markings, 1719599 edges, 2022 markings/sec, 95 secs
lola: 229258 markings, 1793542 edges, 2087 markings/sec, 100 secs
lola: 239083 markings, 1860053 edges, 1965 markings/sec, 105 secs
lola: 248745 markings, 1947426 edges, 1932 markings/sec, 110 secs
lola: 258956 markings, 2048626 edges, 2042 markings/sec, 115 secs
lola: 271089 markings, 2110579 edges, 2427 markings/sec, 120 secs
lola: 282255 markings, 2176988 edges, 2233 markings/sec, 125 secs
lola: 293220 markings, 2246028 edges, 2193 markings/sec, 130 secs
lola: 303701 markings, 2315780 edges, 2096 markings/sec, 135 secs
lola: 313997 markings, 2379429 edges, 2059 markings/sec, 140 secs
lola: 324052 markings, 2453622 edges, 2011 markings/sec, 145 secs
lola: 333839 markings, 2520033 edges, 1957 markings/sec, 150 secs
lola: 344791 markings, 2598930 edges, 2190 markings/sec, 155 secs
lola: 355798 markings, 2658008 edges, 2201 markings/sec, 160 secs
lola: 366452 markings, 2721813 edges, 2131 markings/sec, 165 secs
lola: 376696 markings, 2783713 edges, 2049 markings/sec, 170 secs
lola: 386883 markings, 2844458 edges, 2037 markings/sec, 175 secs
lola: 396795 markings, 2907928 edges, 1982 markings/sec, 180 secs
lola: 406680 markings, 2973616 edges, 1977 markings/sec, 185 secs
lola: 417139 markings, 3052231 edges, 2092 markings/sec, 190 secs
lola: 428030 markings, 3108089 edges, 2178 markings/sec, 195 secs
lola: 438318 markings, 3163230 edges, 2058 markings/sec, 200 secs
lola: 448729 markings, 3222558 edges, 2082 markings/sec, 205 secs
lola: 458901 markings, 3277623 edges, 2034 markings/sec, 210 secs
lola: 468916 markings, 3332335 edges, 2003 markings/sec, 215 secs
lola: 479055 markings, 3390417 edges, 2028 markings/sec, 220 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: 487223 markings, 3437867 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no yes
lola:
preliminary result: no no no no no no no no yes
lola: memory consumption: 31932 KB
lola: time consumption: 517 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="FlexibleBarrier-PT-20a"
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 FlexibleBarrier-PT-20a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-smll-158987815800385"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-20a.tgz
mv FlexibleBarrier-PT-20a 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 ;