About the Execution of ITS-LoLa for DES-PT-10a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15743.170 | 3600000.00 | 36335.00 | 116.80 | TFFFFTFTFFTFFTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r180-ebro-158987899900241.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 DES-PT-10a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987899900241
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 2.8K Mar 30 01:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 30 01:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:17 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.0K Apr 8 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 27 08:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 27 08:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 26 08:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 26 08:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 43K 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 DES-PT-10a-00
FORMULA_NAME DES-PT-10a-01
FORMULA_NAME DES-PT-10a-02
FORMULA_NAME DES-PT-10a-03
FORMULA_NAME DES-PT-10a-04
FORMULA_NAME DES-PT-10a-05
FORMULA_NAME DES-PT-10a-06
FORMULA_NAME DES-PT-10a-07
FORMULA_NAME DES-PT-10a-08
FORMULA_NAME DES-PT-10a-09
FORMULA_NAME DES-PT-10a-10
FORMULA_NAME DES-PT-10a-11
FORMULA_NAME DES-PT-10a-12
FORMULA_NAME DES-PT-10a-13
FORMULA_NAME DES-PT-10a-14
FORMULA_NAME DES-PT-10a-15
=== Now, execution of the tool begins
BK_START 1591177506375
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 09:45:09] [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 09:45:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 09:45:09] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2020-06-03 09:45:09] [INFO ] Transformed 155 places.
[2020-06-03 09:45:09] [INFO ] Transformed 112 transitions.
[2020-06-03 09:45:09] [INFO ] Found NUPN structural information;
[2020-06-03 09:45:09] [INFO ] Parsed PT model containing 155 places and 112 transitions in 189 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 37 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 2210 resets, run finished after 642 ms. (steps per millisecond=155 ) properties seen :[1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1]
// Phase 1: matrix 98 rows 155 cols
[2020-06-03 09:45:10] [INFO ] Computed 59 place invariants in 32 ms
[2020-06-03 09:45:10] [INFO ] [Real]Absence check using 33 positive place invariants in 53 ms returned sat
[2020-06-03 09:45:10] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 31 ms returned sat
[2020-06-03 09:45:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:45:10] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2020-06-03 09:45:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:45:11] [INFO ] [Nat]Absence check using 33 positive place invariants in 18 ms returned unsat
[2020-06-03 09:45:11] [INFO ] [Real]Absence check using 33 positive place invariants in 22 ms returned sat
[2020-06-03 09:45:11] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 18 ms returned sat
[2020-06-03 09:45:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:45:11] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2020-06-03 09:45:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:45:11] [INFO ] [Nat]Absence check using 33 positive place invariants in 21 ms returned unsat
[2020-06-03 09:45:11] [INFO ] [Real]Absence check using 33 positive place invariants in 21 ms returned sat
[2020-06-03 09:45:11] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 18 ms returned sat
[2020-06-03 09:45:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:45:11] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2020-06-03 09:45:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:45:11] [INFO ] [Nat]Absence check using 33 positive place invariants in 30 ms returned sat
[2020-06-03 09:45:11] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 21 ms returned sat
[2020-06-03 09:45:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:45:11] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2020-06-03 09:45:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 09:45:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2020-06-03 09:45:12] [INFO ] Computed and/alt/rep : 97/364/97 causal constraints in 20 ms.
[2020-06-03 09:45:12] [INFO ] Added : 80 causal constraints over 16 iterations in 439 ms. Result :sat
[2020-06-03 09:45:12] [INFO ] Deduced a trap composed of 18 places in 82 ms
[2020-06-03 09:45:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2020-06-03 09:45:12] [INFO ] [Real]Absence check using 33 positive place invariants in 93 ms returned sat
[2020-06-03 09:45:12] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 26 ms returned sat
[2020-06-03 09:45:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:45:13] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2020-06-03 09:45:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:45:13] [INFO ] [Nat]Absence check using 33 positive place invariants in 44 ms returned unsat
[2020-06-03 09:45:13] [INFO ] [Real]Absence check using 33 positive place invariants in 21 ms returned sat
[2020-06-03 09:45:13] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 16 ms returned sat
[2020-06-03 09:45:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:45:13] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2020-06-03 09:45:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:45:13] [INFO ] [Nat]Absence check using 33 positive place invariants in 22 ms returned unsat
[2020-06-03 09:45:13] [INFO ] [Real]Absence check using 33 positive place invariants in 65 ms returned sat
[2020-06-03 09:45:13] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 17 ms returned sat
[2020-06-03 09:45:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:45:13] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2020-06-03 09:45:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:45:14] [INFO ] [Nat]Absence check using 33 positive place invariants in 21 ms returned sat
[2020-06-03 09:45:14] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 117 ms returned sat
[2020-06-03 09:45:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:45:14] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2020-06-03 09:45:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2020-06-03 09:45:14] [INFO ] Deduced a trap composed of 9 places in 47 ms
[2020-06-03 09:45:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2020-06-03 09:45:14] [INFO ] Computed and/alt/rep : 97/364/97 causal constraints in 16 ms.
[2020-06-03 09:45:15] [INFO ] Added : 89 causal constraints over 18 iterations in 632 ms. Result :sat
[2020-06-03 09:45:15] [INFO ] [Real]Absence check using 33 positive place invariants in 40 ms returned sat
[2020-06-03 09:45:15] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 41 ms returned sat
[2020-06-03 09:45:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:45:15] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2020-06-03 09:45:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:45:15] [INFO ] [Nat]Absence check using 33 positive place invariants in 17 ms returned unsat
[2020-06-03 09:45:15] [INFO ] [Real]Absence check using 33 positive place invariants in 28 ms returned sat
[2020-06-03 09:45:15] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 22 ms returned sat
[2020-06-03 09:45:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:45:15] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2020-06-03 09:45:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:45:15] [INFO ] [Nat]Absence check using 33 positive place invariants in 29 ms returned unsat
[2020-06-03 09:45:15] [INFO ] [Real]Absence check using 33 positive place invariants in 21 ms returned sat
[2020-06-03 09:45:15] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 18 ms returned sat
[2020-06-03 09:45:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:45:16] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2020-06-03 09:45:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:45:16] [INFO ] [Nat]Absence check using 33 positive place invariants in 33 ms returned sat
[2020-06-03 09:45:16] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 200 ms returned sat
[2020-06-03 09:45:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:45:16] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2020-06-03 09:45:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 24 ms returned sat
[2020-06-03 09:45:16] [INFO ] Computed and/alt/rep : 97/364/97 causal constraints in 42 ms.
[2020-06-03 09:45:17] [INFO ] Added : 92 causal constraints over 19 iterations in 639 ms. Result :sat
[2020-06-03 09:45:17] [INFO ] [Real]Absence check using 33 positive place invariants in 20 ms returned sat
[2020-06-03 09:45:17] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 17 ms returned sat
[2020-06-03 09:45:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:45:17] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2020-06-03 09:45:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:45:17] [INFO ] [Nat]Absence check using 33 positive place invariants in 35 ms returned sat
[2020-06-03 09:45:17] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 94 ms returned sat
[2020-06-03 09:45:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:45:18] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2020-06-03 09:45:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2020-06-03 09:45:18] [INFO ] Computed and/alt/rep : 97/364/97 causal constraints in 44 ms.
[2020-06-03 09:45:18] [INFO ] Added : 91 causal constraints over 19 iterations in 675 ms. Result :sat
[2020-06-03 09:45:19] [INFO ] [Real]Absence check using 33 positive place invariants in 22 ms returned sat
[2020-06-03 09:45:19] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 17 ms returned sat
[2020-06-03 09:45:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:45:19] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2020-06-03 09:45:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:45:19] [INFO ] [Nat]Absence check using 33 positive place invariants in 30 ms returned sat
[2020-06-03 09:45:19] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 68 ms returned sat
[2020-06-03 09:45:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:45:19] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2020-06-03 09:45:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2020-06-03 09:45:19] [INFO ] Computed and/alt/rep : 97/364/97 causal constraints in 18 ms.
[2020-06-03 09:45:20] [INFO ] Added : 94 causal constraints over 19 iterations in 480 ms. Result :sat
Successfully simplified 6 atomic propositions for a total of 8 simplifications.
[2020-06-03 09:45:20] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-06-03 09:45:20] [INFO ] Flatten gal took : 100 ms
FORMULA DES-PT-10a-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 09:45:20] [INFO ] Applying decomposition
[2020-06-03 09:45:20] [INFO ] Flatten gal took : 38 ms
[2020-06-03 09:45:20] [INFO ] Decomposing Gal with order
[2020-06-03 09:45:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 09:45:20] [INFO ] Removed a total of 83 redundant transitions.
[2020-06-03 09:45:20] [INFO ] Flatten gal took : 96 ms
[2020-06-03 09:45:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 21 ms.
[2020-06-03 09:45:20] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 6 ms.
[2020-06-03 09:45:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 9 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ DES-PT-10a @ 3570 seconds
FORMULA DES-PT-10a-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-10a-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-10a-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-10a-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-10a-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-10a-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-10a-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for LTLCardinality @ DES-PT-10a
{
"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": "Wed Jun 3 09:45:21 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 4,
"adisj": 2,
"aneg": 2,
"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": 2,
"visible_transitions": 0
},
"processed": "G ((X (X (F ((((1 <= p7)) AND ((p123 <= 0)))))) AND F ((((1 <= p7)) AND ((p123 <= 0))))))",
"processed_size": 89,
"rewrites": 68
},
"result":
{
"edges": 45,
"markings": 45,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p29))",
"processed_size": 12,
"rewrites": 68
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 2,
"aneg": 1,
"comp": 3,
"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 (X (G (((((1 <= p108)) AND ((p125 <= 0))) OR ((1 <= p54))))))",
"processed_size": 64,
"rewrites": 68
},
"result":
{
"edges": 233221,
"markings": 51612,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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": "F (G ((((p99 <= 0)) OR ((1 <= p138)))))",
"processed_size": 40,
"rewrites": 68
},
"result":
{
"edges": 16763,
"markings": 8802,
"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": "stabilization",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"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": "F (G ((((1 <= p82)) AND ((p91 <= 0)))))",
"processed_size": 39,
"rewrites": 68
},
"result":
{
"edges": 12819,
"markings": 7086,
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 3,
"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": "G (F (((((p152 <= 0)) OR ((1 <= p27))) OR (((1 <= p17)) AND ((p46 <= 0))))))",
"processed_size": 77,
"rewrites": 68
},
"result":
{
"edges": 384,
"markings": 364,
"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": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 3,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((((p68 <= 0)) OR ((1 <= p71)) OR (((1 <= p55)) AND ((p74 <= 0)))))",
"processed_size": 71,
"rewrites": 68
},
"result":
{
"edges": 26,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"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": 3565
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"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": "G ((((1 <= p60)) AND ((p91 <= 0))))",
"processed_size": 35,
"rewrites": 68
},
"result":
{
"edges": 26,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"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": "G ((((1 <= p60)) AND ((p91 <= 0))))",
"processed_size": 35,
"rewrites": 68
},
"result":
{
"edges": 26,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 2,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((F ((((p143 <= 0)) OR ((1 <= p80)))) AND (((1 <= p36)) OR (((p143 <= 0)) OR ((1 <= p80))))))",
"processed_size": 97,
"rewrites": 68
},
"result":
{
"edges": 1503,
"markings": 1202,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 28132,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(G((F(**) AND (** OR **))) OR (G(*) AND F(G((F(**) AND (** OR **)))))) : G((X(X(F(*))) AND F(*))) : F(G(*)) : G(F((** OR **))) : G(*) : F(G(**)) : (X(X(G(*))) OR (F(*) AND **))"
},
"net":
{
"arcs": 488,
"conflict_clusters": 46,
"places": 155,
"places_significant": 96,
"singleton_clusters": 0,
"transitions": 98
},
"result":
{
"preliminary_value": "no no no no no no no ",
"value": "no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 253/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 155
lola: finding significant places
lola: 155 places, 98 transitions, 96 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: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p138 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: (NOT(F ((X (((1 <= p36))) U F ((((p60 <= 0)) OR ((1 <= p91))))))) U G ((((1 <= p36)) U (((p143 <= 0)) OR ((1 <= p80)))))) : G ((NOT(X (X (NOT(F (NOT(G ((((p7 <= 0)) OR ((1 <= p123)))))))))) AND NOT(G ((((p7 <= 0)) OR ((1 <= p123))))))) : F (NOT(F (G (((0 <= 0) U NOT(F (NOT(F (X ((((p82 <= 0)) OR ((1 <= p91))))))))))))) : G (NOT(X ((NOT(F ((((p152 <= 0)) OR ((1 <= p27))))) AND NOT(F ((((1 <= p17)) AND ((p46 <= 0))))))))) : G (NOT(F ((((1 <= p68)) AND ((p71 <= 0)) AND (((p55 <= 0)) OR ((1 <= p74))))))) : G (NOT(G (NOT(((((1 <= p62)) AND ((p100 <= 0)) AND ((1 <= p144)) AND ((p49 <= 0))) U G ((((p99 <= 0)) OR ((1 <= p138))))))))) : (G (X (NOT(X (((((p108 <= 0)) OR ((1 <= p125))) AND ((p54 <= 0))))))) OR (NOT(G ((((p108 <= 0)) OR ((1 <= p125))))) AND ((1 <= p29))))
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (X (F ((((1 <= p7)) AND ((p123 <= 0)))))) AND F ((((1 <= p7)) AND ((p123 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (X (F ((((1 <= p7)) AND ((p123 <= 0)))))) AND F ((((1 <= p7)) AND ((p123 <= 0))))))
lola: processed formula length: 89
lola: 68 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 45 markings, 45 edges
lola: ========================================
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (G (((((1 <= p108)) AND ((p125 <= 0))) OR ((1 <= p54)))))) OR (F ((((1 <= p108)) AND ((p125 <= 0)))) AND ((1 <= p29))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p29))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p29))
lola: processed formula length: 12
lola: 68 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((((1 <= p108)) AND ((p125 <= 0))) OR ((1 <= p54))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((((1 <= p108)) AND ((p125 <= 0))) OR ((1 <= p54))))))
lola: processed formula length: 64
lola: 68 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 51612 markings, 233221 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p99 <= 0)) OR ((1 <= p138)))))
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 ((((p99 <= 0)) OR ((1 <= p138)))))
lola: processed formula length: 40
lola: 68 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 63
lola: add low 67
lola: add low 69
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: 8802 markings, 16763 edges
lola: ========================================
lola: subprocess 3 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((1 <= p82)) AND ((p91 <= 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 ((((1 <= p82)) AND ((p91 <= 0)))))
lola: processed formula length: 39
lola: 68 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 62
lola: add low 88
lola: add low 67
lola: add low 3
lola: add low 54
lola: add low 97
lola: add low 52
lola: add low 53
lola: add low 7
lola: add low 92
lola: add low 94
lola: add low 90
lola: add low 0
lola: add low 93
lola: add low 55
lola: add low 2
lola: add low 79
lola: add low 80
lola: add low 78
lola: add low 81
lola: add low 77
lola: add low 82
lola: add low 76
lola: add low 83
lola: add low 75
lola: add low 74
lola: add low 85
lola: add low 73
lola: add low 72
lola: add low 1
lola: add low 87
lola: add low 51
lola: add low 69
lola: add low 56
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: 7086 markings, 12819 edges
lola: ========================================
lola: subprocess 4 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((((p152 <= 0)) OR ((1 <= p27))) OR (((1 <= p17)) AND ((p46 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((((p152 <= 0)) OR ((1 <= p27))) OR (((1 <= p17)) AND ((p46 <= 0))))))
lola: processed formula length: 77
lola: 68 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: 364 markings, 384 edges
lola: ========================================
lola: subprocess 5 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p68 <= 0)) OR ((1 <= p71)) OR (((1 <= p55)) AND ((p74 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p68 <= 0)) OR ((1 <= p71)) OR (((1 <= p55)) AND ((p74 <= 0)))))
lola: processed formula length: 71
lola: 68 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: 26 markings, 26 edges
lola: ========================================
lola: subprocess 6 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((F ((((p143 <= 0)) OR ((1 <= p80)))) AND (((1 <= p36)) OR (((p143 <= 0)) OR ((1 <= p80)))))) OR (G ((((1 <= p60)) AND ((p91 <= 0)))) AND F (G ((F ((((p143 <= 0)) OR ((1 <= p80)))) AND (((1 <= p36)) OR (((p143 <= 0)) OR ((1 <= p80)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((1 <= p60)) AND ((p91 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((1 <= p60)) AND ((p91 <= 0))))
lola: processed formula length: 35
lola: 68 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: 26 markings, 26 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G ((F ((((p143 <= 0)) OR ((1 <= p80)))) AND (((1 <= p36)) OR (((p143 <= 0)) OR ((1 <= p80)))))) OR (G ((((1 <= p60)) AND ((p91 <= 0)))) AND F (G ((F ((((p143 <= 0)) OR ((1 <= p80)))) AND (((1 <= p36)) OR (((p143 <= 0)) OR ((1 <= p80)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G ((((1 <= p60)) AND ((p91 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((1 <= p60)) AND ((p91 <= 0))))
lola: processed formula length: 35
lola: 68 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: 26 markings, 26 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((F ((((p143 <= 0)) OR ((1 <= p80)))) AND (((1 <= p36)) OR (((p143 <= 0)) OR ((1 <= p80))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((((p143 <= 0)) OR ((1 <= p80)))) AND (((1 <= p36)) OR (((p143 <= 0)) OR ((1 <= p80))))))
lola: processed formula length: 97
lola: 68 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: 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: 1202 markings, 1503 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no
lola:
preliminary result: no no no no no no no
lola: memory consumption: 28132 KB
lola: time consumption: 5 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="DES-PT-10a"
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 DES-PT-10a, 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 r180-ebro-158987899900241"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-10a.tgz
mv DES-PT-10a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;