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.r178-tajo-158987883201017.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 Eratosthenes-PT-020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987883201017
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 4.0K Apr 14 12:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 14 12:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 14 12:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 14 12:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 8 15:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 15:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 14 12:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 14 12:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 14 12:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 14 12:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 14 12:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 14 12:24 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 15K 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 Eratosthenes-PT-020-00
FORMULA_NAME Eratosthenes-PT-020-01
FORMULA_NAME Eratosthenes-PT-020-02
FORMULA_NAME Eratosthenes-PT-020-03
FORMULA_NAME Eratosthenes-PT-020-04
FORMULA_NAME Eratosthenes-PT-020-05
FORMULA_NAME Eratosthenes-PT-020-06
FORMULA_NAME Eratosthenes-PT-020-07
FORMULA_NAME Eratosthenes-PT-020-08
FORMULA_NAME Eratosthenes-PT-020-09
FORMULA_NAME Eratosthenes-PT-020-10
FORMULA_NAME Eratosthenes-PT-020-11
FORMULA_NAME Eratosthenes-PT-020-12
FORMULA_NAME Eratosthenes-PT-020-13
FORMULA_NAME Eratosthenes-PT-020-14
FORMULA_NAME Eratosthenes-PT-020-15

=== Now, execution of the tool begins

BK_START 1591258290107

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 08:11:31] [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-04 08:11:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 08:11:31] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2020-06-04 08:11:31] [INFO ] Transformed 19 places.
[2020-06-04 08:11:31] [INFO ] Transformed 27 transitions.
[2020-06-04 08:11:31] [INFO ] Found NUPN structural information;
[2020-06-04 08:11:31] [INFO ] Parsed PT model containing 19 places and 27 transitions in 77 ms.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 9309 resets, run finished after 156 ms. (steps per millisecond=641 ) properties seen :[0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1]
[2020-06-04 08:11:31] [INFO ] Flow matrix only has 11 transitions (discarded 9 similar events)
// Phase 1: matrix 11 rows 11 cols
[2020-06-04 08:11:31] [INFO ] Computed 0 place invariants in 2 ms
[2020-06-04 08:11:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:11:32] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2020-06-04 08:11:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:11:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:11:32] [INFO ] [Nat]Absence check using state equation in 11 ms returned unsat
[2020-06-04 08:11:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:11:32] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2020-06-04 08:11:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:11:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:11:32] [INFO ] [Nat]Absence check using state equation in 5 ms returned unsat
[2020-06-04 08:11:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:11:32] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2020-06-04 08:11:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:11:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:11:32] [INFO ] [Nat]Absence check using state equation in 5 ms returned unsat
[2020-06-04 08:11:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:11:32] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2020-06-04 08:11:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:11:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:11:32] [INFO ] [Nat]Absence check using state equation in 4 ms returned unsat
[2020-06-04 08:11:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:11:32] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-04 08:11:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:11:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:11:32] [INFO ] [Nat]Absence check using state equation in 4 ms returned unsat
[2020-06-04 08:11:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:11:32] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-04 08:11:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:11:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:11:32] [INFO ] [Nat]Absence check using state equation in 3 ms returned unsat
[2020-06-04 08:11:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 08:11:32] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-04 08:11:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 08:11:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 08:11:32] [INFO ] [Nat]Absence check using state equation in 4 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 8 simplifications.
[2020-06-04 08:11:32] [INFO ] Initial state reduction rules for CTL removed 13 formulas.
[2020-06-04 08:11:32] [INFO ] Flatten gal took : 32 ms
FORMULA Eratosthenes-PT-020-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-020-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-020-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-020-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-020-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-020-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-020-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-020-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-020-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-020-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-020-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-020-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-020-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 08:11:32] [INFO ] Applying decomposition
[2020-06-04 08:11:32] [INFO ] Flatten gal took : 4 ms
[2020-06-04 08:11:32] [INFO ] Decomposing Gal with order
[2020-06-04 08:11:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 08:11:32] [INFO ] Removed a total of 8 redundant transitions.
[2020-06-04 08:11:32] [INFO ] Flatten gal took : 28 ms
[2020-06-04 08:11:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2020-06-04 08:11:32] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2020-06-04 08:11:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Eratosthenes-PT-020 @ 3570 seconds

FORMULA Eratosthenes-PT-020-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Eratosthenes-PT-020-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Eratosthenes-PT-020-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLCardinality @ Eratosthenes-PT-020

{
"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": "Thu Jun 4 08:11:32 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"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 <= p5))",
"processed_size": 11,
"rewrites": 20
},
"result":
{
"edges": 569,
"markings": 178,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(((p6 <= 0)) OR ((1 <= p2)))",
"processed_size": 29,
"rewrites": 20
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((X (((1 <= p8))) OR (((p10 <= 0)) OR ((1 <= p4)))))",
"processed_size": 54,
"rewrites": 18
},
"result":
{
"edges": 6938,
"markings": 1039,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"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 ((((p8 <= 0)) OR ((1 <= p10)))))",
"processed_size": 38,
"rewrites": 18
},
"result":
{
"edges": 7170,
"markings": 735,
"produced_by": "LTL model checker",
"value": true
},
"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"
}
}
],
"exit":
{
"error": null,
"memory": 19408,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(**)) : (X(G(*)) AND (F(*) AND F(*))) : G((X(**) OR (** OR **)))"
},
"net":
{
"arcs": 38,
"conflict_clusters": 3,
"places": 11,
"places_significant": 11,
"singleton_clusters": 0,
"transitions": 20
},
"result":
{
"preliminary_value": "yes no no ",
"value": "yes 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: 31/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 11
lola: finding significant places
lola: 11 places, 20 transitions, 11 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: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: ((0 <= 0) U (F ((((p8 <= 0)) OR ((1 <= p10)))) U G (X (X ((((p8 <= 0)) OR ((1 <= p10)))))))) : ((G (NOT(X (((1 <= p5))))) AND NOT(G (((1 <= p5))))) AND NOT(G ((((p6 <= 0)) OR ((1 <= p2)))))) : G (((X (((1 <= p8))) OR ((p10 <= 0))) OR ((1 <= p4))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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: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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((p5 <= 0)))) AND (F (((p5 <= 0))) AND F ((((1 <= p6)) AND ((p2 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p5 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((1 <= p5))
lola: processed formula length: 11
lola: 20 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 178 markings, 569 edges
lola: ========================================
lola: subprocess 1 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p6)) AND ((p2 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (((p6 <= 0)) OR ((1 <= p2)))
lola: processed formula length: 29
lola: 20 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 12 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (((1 <= p8))) OR (((p10 <= 0)) OR ((1 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (((1 <= p8))) OR (((p10 <= 0)) OR ((1 <= p4)))))
lola: processed formula length: 54
lola: 18 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1039 markings, 6938 edges
lola: ========================================
lola: subprocess 2 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p8 <= 0)) OR ((1 <= p10)))))
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 ((((p8 <= 0)) OR ((1 <= p10)))))
lola: processed formula length: 38
lola: 18 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 735 markings, 7170 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no
lola:
preliminary result: yes no no
lola: memory consumption: 19408 KB
lola: time consumption: 3 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="Eratosthenes-PT-020"
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 Eratosthenes-PT-020, 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 r178-tajo-158987883201017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Eratosthenes-PT-020.tgz
mv Eratosthenes-PT-020 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;