Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 3.0K Mar 26 02:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 26 02:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 22:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 14:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 47K 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 BusinessProcesses-PT-01-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591156213162

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 03:50:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 03:50:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 03:50:14] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2020-06-03 03:50:14] [INFO ] Transformed 200 places.
[2020-06-03 03:50:14] [INFO ] Transformed 178 transitions.
[2020-06-03 03:50:14] [INFO ] Found NUPN structural information;
[2020-06-03 03:50:14] [INFO ] Parsed PT model containing 200 places and 178 transitions in 75 ms.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Incomplete random walk after 100000 steps, including 1149 resets, run finished after 164 ms. (steps per millisecond=609 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 177 rows 199 cols
[2020-06-03 03:50:14] [INFO ] Computed 30 place invariants in 8 ms
[2020-06-03 03:50:14] [INFO ] [Real]Absence check using 20 positive place invariants in 41 ms returned unsat
[2020-06-03 03:50:14] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned unsat
[2020-06-03 03:50:15] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2020-06-03 03:50:15] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 4 ms returned sat
[2020-06-03 03:50:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:50:15] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2020-06-03 03:50:15] [INFO ] Deduced a trap composed of 9 places in 92 ms
[2020-06-03 03:50:15] [INFO ] Deduced a trap composed of 24 places in 59 ms
[2020-06-03 03:50:15] [INFO ] Deduced a trap composed of 8 places in 56 ms
[2020-06-03 03:50:15] [INFO ] Deduced a trap composed of 14 places in 22 ms
[2020-06-03 03:50:15] [INFO ] Deduced a trap composed of 15 places in 19 ms
[2020-06-03 03:50:15] [INFO ] Deduced a trap composed of 23 places in 16 ms
[2020-06-03 03:50:15] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 328 ms
[2020-06-03 03:50:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:50:15] [INFO ] [Nat]Absence check using 20 positive place invariants in 23 ms returned sat
[2020-06-03 03:50:15] [INFO ] [Nat]Absence check using 20 positive and 10 generalized place invariants in 4 ms returned sat
[2020-06-03 03:50:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:50:15] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2020-06-03 03:50:15] [INFO ] Deduced a trap composed of 13 places in 67 ms
[2020-06-03 03:50:15] [INFO ] Deduced a trap composed of 15 places in 42 ms
[2020-06-03 03:50:15] [INFO ] Deduced a trap composed of 20 places in 35 ms
[2020-06-03 03:50:15] [INFO ] Deduced a trap composed of 28 places in 35 ms
[2020-06-03 03:50:15] [INFO ] Deduced a trap composed of 14 places in 38 ms
[2020-06-03 03:50:15] [INFO ] Deduced a trap composed of 23 places in 35 ms
[2020-06-03 03:50:15] [INFO ] Deduced a trap composed of 49 places in 36 ms
[2020-06-03 03:50:16] [INFO ] Deduced a trap composed of 14 places in 32 ms
[2020-06-03 03:50:16] [INFO ] Deduced a trap composed of 53 places in 60 ms
[2020-06-03 03:50:16] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 473 ms
[2020-06-03 03:50:16] [INFO ] Computed and/alt/rep : 176/482/176 causal constraints in 8 ms.
[2020-06-03 03:50:16] [INFO ] Added : 120 causal constraints over 25 iterations in 333 ms. Result :sat
[2020-06-03 03:50:16] [INFO ] Deduced a trap composed of 55 places in 43 ms
[2020-06-03 03:50:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2020-06-03 03:50:16] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2020-06-03 03:50:16] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 3 ms returned sat
[2020-06-03 03:50:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:50:16] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2020-06-03 03:50:16] [INFO ] Deduced a trap composed of 14 places in 41 ms
[2020-06-03 03:50:16] [INFO ] Deduced a trap composed of 8 places in 27 ms
[2020-06-03 03:50:16] [INFO ] Deduced a trap composed of 11 places in 25 ms
[2020-06-03 03:50:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 127 ms
[2020-06-03 03:50:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:50:16] [INFO ] [Nat]Absence check using 20 positive place invariants in 17 ms returned sat
[2020-06-03 03:50:16] [INFO ] [Nat]Absence check using 20 positive and 10 generalized place invariants in 3 ms returned sat
[2020-06-03 03:50:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:50:16] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2020-06-03 03:50:16] [INFO ] Deduced a trap composed of 14 places in 30 ms
[2020-06-03 03:50:17] [INFO ] Deduced a trap composed of 12 places in 23 ms
[2020-06-03 03:50:17] [INFO ] Deduced a trap composed of 10 places in 19 ms
[2020-06-03 03:50:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 100 ms
[2020-06-03 03:50:17] [INFO ] Computed and/alt/rep : 176/482/176 causal constraints in 9 ms.
[2020-06-03 03:50:17] [INFO ] Added : 138 causal constraints over 29 iterations in 443 ms. Result :sat
[2020-06-03 03:50:17] [INFO ] [Real]Absence check using 20 positive place invariants in 35 ms returned sat
[2020-06-03 03:50:17] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 4 ms returned sat
[2020-06-03 03:50:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:50:17] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2020-06-03 03:50:17] [INFO ] Deduced a trap composed of 11 places in 91 ms
[2020-06-03 03:50:18] [INFO ] Deduced a trap composed of 8 places in 138 ms
[2020-06-03 03:50:18] [INFO ] Deduced a trap composed of 14 places in 70 ms
[2020-06-03 03:50:18] [INFO ] Deduced a trap composed of 16 places in 52 ms
[2020-06-03 03:50:18] [INFO ] Deduced a trap composed of 24 places in 33 ms
[2020-06-03 03:50:18] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 457 ms
[2020-06-03 03:50:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:50:18] [INFO ] [Nat]Absence check using 20 positive place invariants in 35 ms returned sat
[2020-06-03 03:50:18] [INFO ] [Nat]Absence check using 20 positive and 10 generalized place invariants in 4 ms returned sat
[2020-06-03 03:50:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:50:18] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2020-06-03 03:50:18] [INFO ] Deduced a trap composed of 8 places in 58 ms
[2020-06-03 03:50:18] [INFO ] Deduced a trap composed of 55 places in 46 ms
[2020-06-03 03:50:18] [INFO ] Deduced a trap composed of 57 places in 55 ms
[2020-06-03 03:50:18] [INFO ] Deduced a trap composed of 9 places in 50 ms
[2020-06-03 03:50:18] [INFO ] Deduced a trap composed of 51 places in 44 ms
[2020-06-03 03:50:18] [INFO ] Deduced a trap composed of 56 places in 39 ms
[2020-06-03 03:50:18] [INFO ] Deduced a trap composed of 57 places in 46 ms
[2020-06-03 03:50:19] [INFO ] Deduced a trap composed of 53 places in 35 ms
[2020-06-03 03:50:19] [INFO ] Deduced a trap composed of 55 places in 40 ms
[2020-06-03 03:50:19] [INFO ] Deduced a trap composed of 45 places in 45 ms
[2020-06-03 03:50:19] [INFO ] Deduced a trap composed of 24 places in 16 ms
[2020-06-03 03:50:19] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 606 ms
[2020-06-03 03:50:19] [INFO ] Computed and/alt/rep : 176/482/176 causal constraints in 7 ms.
[2020-06-03 03:50:19] [INFO ] Added : 145 causal constraints over 29 iterations in 396 ms. Result :sat
[2020-06-03 03:50:19] [INFO ] Deduced a trap composed of 58 places in 45 ms
[2020-06-03 03:50:19] [INFO ] Deduced a trap composed of 58 places in 39 ms
[2020-06-03 03:50:19] [INFO ] Deduced a trap composed of 59 places in 50 ms
[2020-06-03 03:50:19] [INFO ] Deduced a trap composed of 57 places in 78 ms
[2020-06-03 03:50:20] [INFO ] Deduced a trap composed of 55 places in 138 ms
[2020-06-03 03:50:20] [INFO ] Deduced a trap composed of 52 places in 38 ms
[2020-06-03 03:50:20] [INFO ] Deduced a trap composed of 58 places in 42 ms
[2020-06-03 03:50:20] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 611 ms
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-03 03:50:20] [INFO ] Flatten gal took : 37 ms
[2020-06-03 03:50:20] [INFO ] Flatten gal took : 13 ms
[2020-06-03 03:50:20] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2020-06-03 03:50:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ BusinessProcesses-PT-01 @ 3570 seconds

FORMULA BusinessProcesses-PT-01-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-01-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for CTLFireability @ BusinessProcesses-PT-01

{
"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=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 03:50:20 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "NOT DEADLOCK",
"processed_size": 12,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"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": "EX(((p143 <= 0)))",
"processed_size": 17,
"rewrites": 24
},
"net":
{
"conflict_clusters": 155,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "((1 <= p104) AND (1 <= p23))",
"processed_size": 28,
"rewrites": 25
},
"result":
{
"edges": 17,
"markings": 18,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 45464,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(E(F(A(X(**)))) OR (E(F(A(G(**)))) OR (E(F(**)) AND A(F(**))))) : A(F(A(G(*)))) : (E(X(E(F(**)))) AND E(X(**))) : E(F(**)) : E(F(**)) : NODEADLOCK : E(X(E((** U **)))) : E(F(**)) : E(F((E(X(**)) AND **))) : A(F(A(G(**)))) : E(X((** AND E(F(**))))) : E(F(**)) : (A(G(*)) OR **) : ((A(F(**)) AND E(G(**))) OR (** AND A(G(*)))) : E(F(**)) : (E(G(*)) AND (E(F(**)) OR E(X(E(F(**))))))"
},
"net":
{
"arcs": 485,
"conflict_clusters": 155,
"places": 199,
"places_significant": 169,
"singleton_clusters": 0,
"transitions": 177
},
"result":
{
"interim_value": "unknown unknown yes unknown unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown ",
"preliminary_value": "unknown unknown yes unknown unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 376/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 199
lola: finding significant places
lola: 199 places, 177 transitions, 169 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 CTLFireability.xml
lola: LP says that atomic proposition is always true: (p192 <= 1)
lola: LP says that atomic proposition is always true: (p192 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p188 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p143 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p155 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p126 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p137 <= 1)
lola: LP says that atomic proposition is always true: (p192 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p131 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p186 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p186 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p128 <= 1)
lola: LP says that atomic proposition is always true: (p187 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p184 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p134 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p162 <= 1)
lola: LP says that atomic proposition is always true: (p136 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p128 <= 1)
lola: LP says that atomic proposition is always true: (p187 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p192 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p134 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p168 <= 1)
lola: LP says that atomic proposition is always true: (p195 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p148 <= 1)
lola: LP says that atomic proposition is always true: (p183 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p137 <= 1)
lola: LP says that atomic proposition is always true: (p192 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p133 <= 1)
lola: LP says that atomic proposition is always true: (p178 <= 1)
lola: LP says that atomic proposition is always true: (p198 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: (E (F ((A (X (((1 <= p192)))) OR A (G (((1 <= p192))))))) OR (E (F (((1 <= p24)))) AND A (F (((1 <= p66) AND (1 <= p188)))))) : NOT(E (G (E (F (((1 <= p167))))))) : (E (X (E (F (((1 <= p104) AND (1 <= p23)))))) AND E (X (((p143 <= 0))))) : E (F (E (((((1 <= p50)) OR ((1 <= p155))) U ((1 <= p106) AND (1 <= p126)))))) : E (F (((1 <= p51) AND (1 <= p137) AND (1 <= p192)))) : E (X ((0 <= 0))) : E (X (E ((((p4 <= 0)) U ((1 <= p131)))))) : E (F (((1 <= p18)))) : E (F ((E (X (((1 <= p186) AND (1 <= p37)))) AND ((1 <= p58))))) : A (F (A (G (((2 <= p13) OR (p13 <= 0)))))) : E (X ((((p186 <= 0)) AND E (F (((1 <= p40))))))) : A (((((1 <= p65) AND (1 <= p128) AND (1 <= p187)) OR ((1 <= p69) AND (1 <= p72))) U E (F (((1 <= p60) AND (1 <= p18)))))) : (NOT(E (F (((1 <= p69) AND (1 <= p72) AND (1 <= p115))))) OR ((1 <= p111) AND ((p32 <= 0)) AND ((p68 <= 0) OR (p123 <= 0) OR (p184 <= 0) OR ((1 <= p3))) AND ((p134 <= 0) OR (p11 <= 0)) AND ((p49 <= 0) OR ((1 <= p109)) OR (p20 <= 0) OR (p93 <= 0) OR (p162 <= 0)))) : ((A (F (((((1 <= p136)) OR ((1 <= p71) AND (1 <= p128) AND (1 <= p187))) AND (((1 <= p121)) OR ((1 <= p10) AND (1 <= p117) AND (1 <= p192)))))) AND E (G (((p30 <= 0) OR ((1 <= p83)) OR ((1 <= p134)))))) OR (((p70 <= 0)) AND NOT(E (F (((1 <= p168))))))) : E ((((p195 <= 0)) U E (F ((((p14 <= 1) AND (1 <= p14)) OR ((1 <= p64))))))) : (NOT(A (F (((1 <= p183) AND ((p26 <= 0) OR (p103 <= 0) OR (p148 <= 0)))))) AND E (F (((((1 <= p51) AND (1 <= p137) AND (1 <= p192)) OR ((1 <= p54) AND (1 <= p133) AND (1 <= p178)) OR ((1 <= p198))) OR E (X (((1 <= p18))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:446
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: rewrite Frontend/Parser/formula_rewrite.k:452
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:473
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT DEADLOCK
lola: processed formula length: 12
lola: 23 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (E (F (((1 <= p104) AND (1 <= p23)))))) AND E (X (((p143 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((p143 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((p143 <= 0)))
lola: processed formula length: 17
lola: 24 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (((1 <= p104) AND (1 <= p23))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: ((1 <= p104) AND (1 <= p23))
lola: processed formula length: 28
lola: 25 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p104) AND (1 <= p23))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 18 markings, 17 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (X (((1 <= p192)))))) OR (E (F (A (G (((1 <= p192)))))) OR (E (F (((1 <= p24)))) AND A (F (((1 <= p66) AND (1 <= p188)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p24))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p24))))
lola: processed formula length: 20
lola: 24 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p24))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: 38 markings, 37 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p66) AND (1 <= p188))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p66 <= 0) OR (p188 <= 0))
lola: processed formula length: 28
lola: 26 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 68 markings, 68 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((1 <= p192))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p192 <= 0))
lola: processed formula length: 13
lola: 27 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p192))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-4-0.sara
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p192 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-4-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-4-1.sara.
sara: try reading problem file CTLFireability-4-0.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 573934 markings, 3818613 edges, 114787 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1067250 markings, 7526067 edges, 98663 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 1561385 markings, 11261748 edges, 98827 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 2010293 markings, 14956754 edges, 89782 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 2435960 markings, 18572701 edges, 85133 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 2910744 markings, 22254197 edges, 94957 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 3345065 markings, 25916462 edges, 86864 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 3767837 markings, 29506565 edges, 84554 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 4198541 markings, 33152757 edges, 86141 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 4583489 markings, 36719476 edges, 76990 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 4958601 markings, 40222414 edges, 75022 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 5390594 markings, 43776377 edges, 86399 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 5905940 markings, 47541350 edges, 103069 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 6354914 markings, 51179023 edges, 89795 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 6754896 markings, 54626929 edges, 79996 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 7158536 markings, 58086212 edges, 80728 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 7521090 markings, 61454351 edges, 72511 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 7870347 markings, 64765922 edges, 69851 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 8265292 markings, 68251567 edges, 78989 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 8633662 markings, 71663190 edges, 73674 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 8979789 markings, 74941148 edges, 69225 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 9326739 markings, 78215623 edges, 69390 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 9651656 markings, 81477681 edges, 64983 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 9964220 markings, 84750791 edges, 62513 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 10267667 markings, 87904339 edges, 60689 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 10683815 markings, 91571035 edges, 83230 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 11185176 markings, 95367040 edges, 100272 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 11614771 markings, 99026283 edges, 85919 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 12039153 markings, 102629389 edges, 84876 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 12455444 markings, 106265980 edges, 83258 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 12822328 markings, 109760737 edges, 73377 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 13196818 markings, 113230398 edges, 74898 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 13608146 markings, 116850370 edges, 82266 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 13976687 markings, 120361338 edges, 73708 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 14340576 markings, 123826261 edges, 72778 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 14700035 markings, 127322171 edges, 71892 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 15021580 markings, 130705110 edges, 64309 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 15334685 markings, 134017506 edges, 62621 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 15756272 markings, 137719934 edges, 84317 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 16247229 markings, 141473227 edges, 98191 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 16683389 markings, 145084616 edges, 87232 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 17096919 markings, 148689376 edges, 82706 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 17483774 markings, 152203464 edges, 77371 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 17918181 markings, 155900296 edges, 86881 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 18328241 markings, 159525600 edges, 82012 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 18696779 markings, 163054440 edges, 73708 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 19031843 markings, 166511509 edges, 67013 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 19408972 markings, 170155365 edges, 75426 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 19832254 markings, 173876861 edges, 84656 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 20221985 markings, 177508753 edges, 77946 markings/sec, 245 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown yes unknown unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown unknown yes unknown unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 846400 KB
lola: time consumption: 257 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: memory consumption: 45464 KB
lola: time consumption: 257 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: lola: caught signal User defined signal 1 - aborting LoLA
lola: time limit reached - aborting
lola:
preliminary result: unknown unknown yes unknown unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola:
preliminary result: unknown unknown yes unknown unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 45464 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 16100428 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16100436 kB

--------------------
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="BusinessProcesses-PT-01"
export BK_EXAMINATION="CTLFireability"
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 BusinessProcesses-PT-01, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r182-oct2-158987913900452"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-01.tgz
mv BusinessProcesses-PT-01 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;