Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.0K Apr 12 07:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 12 07:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 11 08:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 11 08:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Apr 10 14:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 10 14:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 9 21:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 9 21:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 13K Mar 24 05:38 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 Raft-PT-02-CTLFireability-00
FORMULA_NAME Raft-PT-02-CTLFireability-01
FORMULA_NAME Raft-PT-02-CTLFireability-02
FORMULA_NAME Raft-PT-02-CTLFireability-03
FORMULA_NAME Raft-PT-02-CTLFireability-04
FORMULA_NAME Raft-PT-02-CTLFireability-05
FORMULA_NAME Raft-PT-02-CTLFireability-06
FORMULA_NAME Raft-PT-02-CTLFireability-07
FORMULA_NAME Raft-PT-02-CTLFireability-08
FORMULA_NAME Raft-PT-02-CTLFireability-09
FORMULA_NAME Raft-PT-02-CTLFireability-10
FORMULA_NAME Raft-PT-02-CTLFireability-11
FORMULA_NAME Raft-PT-02-CTLFireability-12
FORMULA_NAME Raft-PT-02-CTLFireability-13
FORMULA_NAME Raft-PT-02-CTLFireability-14
FORMULA_NAME Raft-PT-02-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591330421971

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 04:13:45] [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-05 04:13:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 04:13:45] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2020-06-05 04:13:45] [INFO ] Transformed 28 places.
[2020-06-05 04:13:45] [INFO ] Transformed 52 transitions.
[2020-06-05 04:13:45] [INFO ] Found NUPN structural information;
[2020-06-05 04:13:45] [INFO ] Parsed PT model containing 28 places and 52 transitions in 147 ms.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 33 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 583 ms. (steps per millisecond=171 ) properties seen :[1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1]
[2020-06-05 04:13:46] [INFO ] Flow matrix only has 36 transitions (discarded 6 similar events)
// Phase 1: matrix 36 rows 28 cols
[2020-06-05 04:13:46] [INFO ] Computed 4 place invariants in 7 ms
[2020-06-05 04:13:46] [INFO ] [Real]Absence check using 4 positive place invariants in 19 ms returned unsat
[2020-06-05 04:13:46] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2020-06-05 04:13:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:13:46] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2020-06-05 04:13:46] [INFO ] State equation strengthened by 14 read => feed constraints.
[2020-06-05 04:13:46] [INFO ] [Real]Added 14 Read/Feed constraints in 8 ms returned sat
[2020-06-05 04:13:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 04:13:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 37 ms returned sat
[2020-06-05 04:13:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 04:13:46] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2020-06-05 04:13:46] [INFO ] [Nat]Added 14 Read/Feed constraints in 22 ms returned sat
[2020-06-05 04:13:46] [INFO ] Computed and/alt/rep : 41/199/35 causal constraints in 26 ms.
[2020-06-05 04:13:46] [INFO ] Added : 33 causal constraints over 7 iterations in 129 ms. Result :sat
[2020-06-05 04:13:46] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned unsat
[2020-06-05 04:13:46] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned unsat
[2020-06-05 04:13:46] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2020-06-05 04:13:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:13:46] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2020-06-05 04:13:46] [INFO ] [Real]Added 14 Read/Feed constraints in 7 ms returned sat
[2020-06-05 04:13:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 04:13:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 10 ms returned sat
[2020-06-05 04:13:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 04:13:46] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2020-06-05 04:13:46] [INFO ] [Nat]Added 14 Read/Feed constraints in 5 ms returned sat
[2020-06-05 04:13:46] [INFO ] Computed and/alt/rep : 41/199/35 causal constraints in 11 ms.
[2020-06-05 04:13:46] [INFO ] Added : 33 causal constraints over 7 iterations in 102 ms. Result :sat
[2020-06-05 04:13:46] [INFO ] Deduced a trap composed of 5 places in 50 ms
[2020-06-05 04:13:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2020-06-05 04:13:47] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2020-06-05 04:13:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:13:47] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2020-06-05 04:13:47] [INFO ] [Real]Added 14 Read/Feed constraints in 20 ms returned sat
[2020-06-05 04:13:47] [INFO ] Computed and/alt/rep : 41/199/35 causal constraints in 8 ms.
[2020-06-05 04:13:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 04:13:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 8 ms returned sat
[2020-06-05 04:13:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 04:13:47] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2020-06-05 04:13:47] [INFO ] [Nat]Added 14 Read/Feed constraints in 7 ms returned sat
[2020-06-05 04:13:47] [INFO ] Computed and/alt/rep : 41/199/35 causal constraints in 14 ms.
[2020-06-05 04:13:47] [INFO ] Added : 34 causal constraints over 7 iterations in 86 ms. Result :sat
[2020-06-05 04:13:47] [INFO ] Deduced a trap composed of 5 places in 26 ms
[2020-06-05 04:13:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2020-06-05 04:13:47] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2020-06-05 04:13:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:13:47] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2020-06-05 04:13:47] [INFO ] [Real]Added 14 Read/Feed constraints in 5 ms returned sat
[2020-06-05 04:13:47] [INFO ] Computed and/alt/rep : 41/199/35 causal constraints in 9 ms.
[2020-06-05 04:13:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 04:13:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 7 ms returned sat
[2020-06-05 04:13:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 04:13:47] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2020-06-05 04:13:47] [INFO ] [Nat]Added 14 Read/Feed constraints in 4 ms returned sat
[2020-06-05 04:13:47] [INFO ] Computed and/alt/rep : 41/199/35 causal constraints in 8 ms.
[2020-06-05 04:13:47] [INFO ] Added : 34 causal constraints over 7 iterations in 79 ms. Result :sat
[2020-06-05 04:13:47] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2020-06-05 04:13:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:13:47] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2020-06-05 04:13:47] [INFO ] [Real]Added 14 Read/Feed constraints in 4 ms returned sat
[2020-06-05 04:13:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 04:13:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2020-06-05 04:13:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 04:13:47] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2020-06-05 04:13:47] [INFO ] [Nat]Added 14 Read/Feed constraints in 4 ms returned sat
[2020-06-05 04:13:47] [INFO ] Deduced a trap composed of 5 places in 26 ms
[2020-06-05 04:13:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2020-06-05 04:13:47] [INFO ] Computed and/alt/rep : 41/199/35 causal constraints in 8 ms.
[2020-06-05 04:13:47] [INFO ] Added : 33 causal constraints over 7 iterations in 79 ms. Result :sat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-06-05 04:13:48] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-06-05 04:13:48] [INFO ] Flatten gal took : 60 ms
[2020-06-05 04:13:48] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-06-05 04:13:48] [INFO ] Flatten gal took : 34 ms
FORMULA Raft-PT-02-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-02-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-02-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-02-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-02-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-02-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-02-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-02-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-02-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 04:13:48] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2020-06-05 04:13:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ Raft-PT-02 @ 3570 seconds

FORMULA Raft-PT-02-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-02-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-02-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-02-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-02-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-02-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-02-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for CTLFireability @ Raft-PT-02

{
"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": "Fri Jun 5 04:13:49 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(E(((p17 <= 0) OR ((1 <= p20)) OR ((1 <= p14))) U AX(((1 <= p12)))) OR ((1 <= p19)))",
"processed_size": 86,
"rewrites": 9
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 28248,
"markings": 6421,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"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": "EF(AX(((p15 <= 0))))",
"processed_size": 20,
"rewrites": 9
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 34694,
"markings": 7381,
"produced_by": "CTL model checker",
"value": false
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F (((1 <= p20))))",
"processed_size": 20,
"rewrites": 8
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F ((((1 <= p15)) OR ((1 <= p20)))))",
"processed_size": 39,
"rewrites": 8
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((((p15 <= 0)) OR ((p13 <= 0)))))",
"processed_size": 38,
"rewrites": 12
},
"result":
{
"edges": 11323,
"markings": 3711,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": null,
"problems": null
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 0,
"U": 2,
"X": 0,
"aconj": 6,
"adisj": 2,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "(E(EF(((1 <= p20))) U ((1 <= p22) AND (((1 <= p14)) OR ((1 <= p11))) AND (1 <= p25) AND (1 <= p14))) AND (A(((1 <= p5) AND (1 <= p15)) U ((p3 <= 0) OR (p20 <= 0))) OR ((1 <= p10) AND (1 <= p20))))",
"processed_size": 198,
"rewrites": 10
},
"net":
{
"conflict_clusters": 9,
"singleton_clusters": 0
},
"result":
{
"edges": 3906,
"markings": 782,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"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": "A (G (((p11 <= 0) OR (p27 <= 0))))",
"processed_size": 35,
"rewrites": 9
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 25036,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(E((** U A(X(**)))) OR **) : (E((E(F(**)) U **)) AND (A((** U **)) OR **)) : E(F(A(X(**)))) : A(G((** OR **))) : E(F(**)) : (A(G(A(F(*)))) AND A(G(**))) : E(F(**))"
},
"net":
{
"arcs": 139,
"conflict_clusters": 9,
"places": 28,
"places_significant": 24,
"singleton_clusters": 0,
"transitions": 42
},
"result":
{
"preliminary_value": "no yes no yes yes no yes ",
"value": "no yes no yes yes no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 70/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 28
lola: finding significant places
lola: 28 places, 42 transitions, 24 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: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: (E ((((p17 <= 0) OR ((1 <= p20)) OR ((1 <= p14))) U A (X (((1 <= p12)))))) OR ((1 <= p19))) : (E ((E (F (((1 <= p20)))) U ((1 <= p22) AND (((1 <= p14)) OR ((1 <= p11))) AND (1 <= p25) AND (1 <= p14)))) AND (A ((((1 <= p5) AND (1 <= p15)) U ((p3 <= 0) OR (p20 <= 0)))) OR ((1 <= p10) AND (1 <= p20)))) : E (F (A (X (((p15 <= 0)))))) : A (G (((E (X ((1 <= 0))) OR ((p15 <= 0))) OR ((p13 <= 0))))) : E (F ((((1 <= p15)) OR ((1 <= p20))))) : A (G ((NOT(E (G (((1 <= p15) AND (1 <= p21))))) AND ((p11 <= 0) OR (p27 <= 0))))) : E (F (((1 <= p20))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((((p17 <= 0) OR ((1 <= p20)) OR ((1 <= p14))) U A (X (((1 <= p12)))))) OR ((1 <= p19)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: (E(((p17 <= 0) OR ((1 <= p20)) OR ((1 <= p14))) U AX(((1 <= p12)))) OR ((1 <= p19)))
lola: processed formula length: 86
lola: 9 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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 6421 markings, 28248 edges
lola: ========================================
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((p15 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX(((p15 <= 0))))
lola: processed formula length: 20
lola: 9 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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 7381 markings, 34694 edges
lola: ========================================
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p20))))
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 <= p20))))
lola: processed formula length: 20
lola: 8 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 <= p20))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 3 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p15)) OR ((1 <= p20)))))
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 <= p15)) OR ((1 <= p20)))))
lola: processed formula length: 39
lola: 8 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 <= p15)) OR ((1 <= p20)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 4 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p15 <= 0)) OR ((p13 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:767
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: A (G ((((p15 <= 0)) OR ((p13 <= 0)))))
lola: processed formula length: 38
lola: 12 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:721
lola: rewrite Frontend/Parser/formula_rewrite.k:767
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p15)) AND ((1 <= p13)))
lola: state equation task get result unparse finished id 0
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 3711 markings, 11323 edges
lola: ========================================
lola: subprocess 5 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((E (F (((1 <= p20)))) U ((1 <= p22) AND (((1 <= p14)) OR ((1 <= p11))) AND (1 <= p25) AND (1 <= p14)))) AND (A ((((1 <= p5) AND (1 <= p15)) U ((p3 <= 0) OR (p20 <= 0)))) OR ((1 <= p10) AND (1 <= p20))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: (E(EF(((1 <= p20))) U ((1 <= p22) AND (((1 <= p14)) OR ((1 <= p11))) AND (1 <= p25) AND (1 <= p14))) AND (A(((1 <= p5) AND (1 <= p15)) U ((p3 <= 0) OR (p20 <= 0))) OR ((1 <= p10) AND (1 <= p20))))
lola: processed formula length: 198
lola: 10 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 3 significant temporal operators and needs 13 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: 782 markings, 3906 edges
lola: ========================================
lola: subprocess 6 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (A (F (((p15 <= 0) OR (p21 <= 0)))))) AND A (G (((p11 <= 0) OR (p27 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p11 <= 0) OR (p27 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p11 <= 0) OR (p27 <= 0))))
lola: processed formula length: 35
lola: 9 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:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: formula 0: ((1 <= p11) AND (1 <= p27))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes yes no yes
lola:
preliminary result: no yes no yes yes no yes
lola: memory consumption: 25036 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.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="Raft-PT-02"
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 Raft-PT-02, 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 r172-smll-158987827600220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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