fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r176-tajo-158987871600259
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for Planning-PT-none

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15798.090 3600000.00 589094.00 29323.40 ?FTT?TTFFTFTFFTF normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r176-tajo-158987871600259.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 Planning-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987871600259
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 3.0K Apr 12 05:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 12 05:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 11 04:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 11 04:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 14 12:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 10 12:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 10 12:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 9 17:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 9 17:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 10 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 10 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 56K Mar 24 05:37 model.pnml
-rw-r--r-- 1 mcc users 1 Mar 24 05:37 unfinite

--------------------
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 Planning-PT-none-CTLCardinality-00
FORMULA_NAME Planning-PT-none-CTLCardinality-01
FORMULA_NAME Planning-PT-none-CTLCardinality-02
FORMULA_NAME Planning-PT-none-CTLCardinality-03
FORMULA_NAME Planning-PT-none-CTLCardinality-04
FORMULA_NAME Planning-PT-none-CTLCardinality-05
FORMULA_NAME Planning-PT-none-CTLCardinality-06
FORMULA_NAME Planning-PT-none-CTLCardinality-07
FORMULA_NAME Planning-PT-none-CTLCardinality-08
FORMULA_NAME Planning-PT-none-CTLCardinality-09
FORMULA_NAME Planning-PT-none-CTLCardinality-10
FORMULA_NAME Planning-PT-none-CTLCardinality-11
FORMULA_NAME Planning-PT-none-CTLCardinality-12
FORMULA_NAME Planning-PT-none-CTLCardinality-13
FORMULA_NAME Planning-PT-none-CTLCardinality-14
FORMULA_NAME Planning-PT-none-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591138691523

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 22:58:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-02 22:58:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 22:58:13] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2020-06-02 22:58:13] [INFO ] Transformed 126 places.
[2020-06-02 22:58:13] [INFO ] Transformed 128 transitions.
[2020-06-02 22:58:13] [INFO ] Parsed PT model containing 126 places and 128 transitions in 82 ms.
Reduce places removed 2 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 430 ms. (steps per millisecond=232 ) properties seen :[1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0]
[2020-06-02 22:58:13] [INFO ] Flow matrix only has 112 transitions (discarded 16 similar events)
// Phase 1: matrix 112 rows 124 cols
[2020-06-02 22:58:13] [INFO ] Computed 42 place invariants in 5 ms
[2020-06-02 22:58:13] [INFO ] [Real]Absence check using 36 positive place invariants in 22 ms returned unsat
[2020-06-02 22:58:13] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned unsat
[2020-06-02 22:58:13] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned sat
[2020-06-02 22:58:13] [INFO ] [Real]Absence check using 36 positive and 6 generalized place invariants in 2 ms returned sat
[2020-06-02 22:58:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:58:13] [INFO ] [Real]Absence check using state equation in 25 ms returned unsat
[2020-06-02 22:58:13] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned sat
[2020-06-02 22:58:13] [INFO ] [Real]Absence check using 36 positive and 6 generalized place invariants in 2 ms returned sat
[2020-06-02 22:58:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:58:14] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2020-06-02 22:58:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:58:14] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned unsat
[2020-06-02 22:58:14] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned unsat
[2020-06-02 22:58:14] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned unsat
[2020-06-02 22:58:14] [INFO ] [Real]Absence check using 36 positive place invariants in 9 ms returned unsat
[2020-06-02 22:58:14] [INFO ] [Real]Absence check using 36 positive place invariants in 9 ms returned sat
[2020-06-02 22:58:14] [INFO ] [Real]Absence check using 36 positive and 6 generalized place invariants in 2 ms returned sat
[2020-06-02 22:58:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:58:14] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
[2020-06-02 22:58:14] [INFO ] [Real]Absence check using 36 positive place invariants in 10 ms returned sat
[2020-06-02 22:58:14] [INFO ] [Real]Absence check using 36 positive and 6 generalized place invariants in 1 ms returned sat
[2020-06-02 22:58:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:58:14] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2020-06-02 22:58:14] [INFO ] State equation strengthened by 32 read => feed constraints.
[2020-06-02 22:58:14] [INFO ] [Real]Added 32 Read/Feed constraints in 6 ms returned sat
[2020-06-02 22:58:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:58:14] [INFO ] [Nat]Absence check using 36 positive place invariants in 10 ms returned sat
[2020-06-02 22:58:14] [INFO ] [Nat]Absence check using 36 positive and 6 generalized place invariants in 3 ms returned sat
[2020-06-02 22:58:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:58:14] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2020-06-02 22:58:14] [INFO ] [Nat]Added 32 Read/Feed constraints in 4 ms returned sat
[2020-06-02 22:58:14] [INFO ] Computed and/alt/rep : 97/294/81 causal constraints in 7 ms.
[2020-06-02 22:58:14] [INFO ] Added : 48 causal constraints over 10 iterations in 106 ms. Result :sat
[2020-06-02 22:58:14] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned unsat
[2020-06-02 22:58:14] [INFO ] [Real]Absence check using 36 positive place invariants in 11 ms returned unsat
[2020-06-02 22:58:14] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned unsat
[2020-06-02 22:58:14] [INFO ] [Real]Absence check using 36 positive place invariants in 9 ms returned sat
[2020-06-02 22:58:14] [INFO ] [Real]Absence check using 36 positive and 6 generalized place invariants in 2 ms returned sat
[2020-06-02 22:58:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:58:14] [INFO ] [Real]Absence check using state equation in 20 ms returned unsat
Successfully simplified 12 atomic propositions for a total of 12 simplifications.
[2020-06-02 22:58:14] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-02 22:58:14] [INFO ] Flatten gal took : 36 ms
[2020-06-02 22:58:14] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-02 22:58:14] [INFO ] Flatten gal took : 12 ms
FORMULA Planning-PT-none-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Planning-PT-none-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Planning-PT-none-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Planning-PT-none-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Planning-PT-none-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Planning-PT-none-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 22:58:14] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2020-06-02 22:58:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ Planning-PT-none @ 3570 seconds

FORMULA Planning-PT-none-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-CTLCardinality-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-CTLCardinality-00 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Planning-PT-none-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3000
rslt: Output for CTLCardinality @ Planning-PT-none

{
"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=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Jun 2 22:58:15 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"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": "FALSE",
"processed_size": 5,
"rewrites": 20
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 428
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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 ((p26 + 1 <= p27)))",
"processed_size": 24,
"rewrites": 21
},
"result":
{
"edges": 5,
"markings": 6,
"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": 489
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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 ((p122 <= p6)))",
"processed_size": 20,
"rewrites": 22
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 571
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((3 <= p5) AND (p34 <= p45))))",
"processed_size": 36,
"rewrites": 21
},
"result":
{
"edges": 9,
"markings": 10,
"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": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 685
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (F (((3 <= p43) AND (p28 <= p97) AND (p5 + 1 <= p73))))",
"processed_size": 57,
"rewrites": 21
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 856
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (F (((p98 <= p19) AND (3 <= p18) AND (p103 <= p49))))",
"processed_size": 55,
"rewrites": 21
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1641
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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": "(3 <= p24)",
"processed_size": 10,
"rewrites": 24
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 0
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3283
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "(p18 <= p84)",
"processed_size": 12,
"rewrites": 20
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "(p18 <= p84)",
"processed_size": 12,
"rewrites": 20
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p95 <= 0)",
"processed_size": 10,
"rewrites": 23
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3920,
"runtime": 569.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(E(F(**)))) : (A(F(**)) OR **) : E(F(**)) : A(X(E(F(**)))) : E(F(**)) : A(G(A(F(*)))) : FALSE : E(F(**)) : A(G(**)) : E(F(**))"
},
"net":
{
"arcs": 612,
"conflict_clusters": 74,
"places": 124,
"places_significant": 82,
"singleton_clusters": 0,
"transitions": 128
},
"result":
{
"preliminary_value": "unknown no yes unknown yes no no yes no yes ",
"value": "unknown no yes unknown yes no no 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: 252/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3968
lola: finding significant places
lola: 124 places, 128 transitions, 82 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 CTLCardinality.xml
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: A (G (E (F ((p49 <= 0))))) : ((E (((0 <= 0) U (1 <= 0))) OR A (((0 <= 0) U (1 <= p95)))) OR (p18 <= p84)) : E (F (((3 <= p43) AND (p28 <= p97) AND (p5 + 1 <= p73)))) : (A (X (E (F ((3 <= p2))))) OR E (X ((1 <= 0)))) : E (F ((p26 + 1 <= p27))) : A (G (NOT(E (G ((3 <= p24)))))) : NOT(E (G ((0 <= 0)))) : E (F (((3 <= p5) AND (p34 <= p45)))) : A (G (E (((1 <= 0) U (p122 <= p6))))) : E (F (((p98 <= p19) AND (3 <= p18) AND (p103 <= p49))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:121
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:183
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((3 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF((3 <= p2)))
lola: processed formula length: 17
lola: 22 rewrites
lola: closed formula file CTLCardinality.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: 3736209 markings, 3736209 edges, 747242 markings/sec, 0 secs
lola: 7161357 markings, 7161357 edges, 685030 markings/sec, 5 secs
lola: 10599830 markings, 10599830 edges, 687695 markings/sec, 10 secs
lola: 14197980 markings, 14197980 edges, 719630 markings/sec, 15 secs
lola: 17540895 markings, 17540895 edges, 668583 markings/sec, 20 secs
lola: 21009781 markings, 21009785 edges, 693777 markings/sec, 25 secs
lola: 24275364 markings, 24275364 edges, 653117 markings/sec, 30 secs
lola: 27749006 markings, 27749006 edges, 694728 markings/sec, 35 secs
lola: 31192846 markings, 31192845 edges, 688768 markings/sec, 40 secs
lola: 34643718 markings, 34643718 edges, 690174 markings/sec, 45 secs
lola: 37947514 markings, 37947514 edges, 660759 markings/sec, 50 secs
lola: 41128037 markings, 41128037 edges, 636105 markings/sec, 55 secs
lola: 44335624 markings, 44335623 edges, 641517 markings/sec, 60 secs
lola: 47509744 markings, 47509743 edges, 634824 markings/sec, 65 secs
lola: 50662600 markings, 50662599 edges, 630571 markings/sec, 70 secs
lola: 54073849 markings, 54073849 edges, 682250 markings/sec, 75 secs
lola: 57428648 markings, 57428648 edges, 670960 markings/sec, 80 secs
lola: 60589894 markings, 60589897 edges, 632249 markings/sec, 85 secs
lola: 63347605 markings, 63348213 edges, 551542 markings/sec, 90 secs
lola: 65298947 markings, 65299114 edges, 390268 markings/sec, 95 secs
lola: 67223554 markings, 67224219 edges, 384921 markings/sec, 100 secs
lola: 69353992 markings, 69354507 edges, 426088 markings/sec, 105 secs
lola: 71355354 markings, 71355354 edges, 400272 markings/sec, 110 secs
lola: 73319367 markings, 73319368 edges, 392803 markings/sec, 115 secs
lola: 75482148 markings, 75482148 edges, 432556 markings/sec, 120 secs
lola: 77678818 markings, 77678819 edges, 439334 markings/sec, 125 secs
lola: 79100592 markings, 79100591 edges, 284355 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 428 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p26 + 1 <= p27)))
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 ((p26 + 1 <= p27)))
lola: processed formula length: 24
lola: 21 rewrites
lola: closed formula file CTLCardinality.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: (p26 + 1 <= p27)
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: 6 markings, 5 edges
lola: ========================================
lola: subprocess 3 will run for 489 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p122 <= p6)))
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 ((p122 <= p6)))
lola: processed formula length: 20
lola: 22 rewrites
lola: closed formula file CTLCardinality.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: formula 0: (p6 + 1 <= p122)
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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 4 will run for 571 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p5) AND (p34 <= p45))))
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 (((3 <= p5) AND (p34 <= p45))))
lola: processed formula length: 36
lola: 21 rewrites
lola: closed formula file CTLCardinality.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: ((3 <= p5) AND (p34 <= p45))
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
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 5 will run for 685 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p43) AND (p28 <= p97) AND (p5 + 1 <= p73))))
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 (((3 <= p43) AND (p28 <= p97) AND (p5 + 1 <= p73))))
lola: processed formula length: 57
lola: 21 rewrites
lola: closed formula file CTLCardinality.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: ((3 <= p43) AND (p28 <= p97) AND (p5 + 1 <= p73))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 6 will run for 856 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p98 <= p19) AND (3 <= p18) AND (p103 <= p49))))
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 (((p98 <= p19) AND (3 <= p18) AND (p103 <= p49))))
lola: processed formula length: 55
lola: 21 rewrites
lola: closed formula file CTLCardinality.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: ((p98 <= p19) AND (3 <= p18) AND (p103 <= p49))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: state equation: write sara problem file to CTLCardinality-6-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 7 will run for 1142 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((p49 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (p49 <= 0)
lola: processed formula length: 10
lola: 23 rewrites
lola: closed formula file CTLCardinality.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 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p49 <= 0)
lola: state equation task get result unparse finished id 1
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: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p49)
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 CTLCardinality-7-0.sara
lola: state equation: write sara problem file to CTLCardinality-7-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-7-0.sara.
sara: try reading problem file CTLCardinality-7-1.sara.
sara: try reading problem file CTLCardinality-6-0.sara.
sara: place or transition ordering is non-deterministic
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 || 3408421 markings, 3408421 edges, 681684 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 7286383 markings, 7286382 edges, 775592 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 10873591 markings, 10873591 edges, 717442 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 14672063 markings, 14672063 edges, 759694 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 18460077 markings, 18460077 edges, 757603 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 22225999 markings, 22225999 edges, 753184 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 25978979 markings, 25978979 edges, 750596 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 29726467 markings, 29726466 edges, 749498 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 33452660 markings, 33452660 edges, 745239 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 37162645 markings, 37162645 edges, 741997 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 40852467 markings, 40852467 edges, 737964 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 44541332 markings, 44541331 edges, 737773 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 48181679 markings, 48181679 edges, 728069 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 51854755 markings, 51854755 edges, 734615 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 55526909 markings, 55526909 edges, 734431 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 59190667 markings, 59190666 edges, 732752 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 62836309 markings, 62836309 edges, 729128 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 66475840 markings, 66475840 edges, 727906 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 70146802 markings, 70146802 edges, 734192 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 73548889 markings, 73548888 edges, 680417 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 75953975 markings, 75953975 edges, 481017 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 78300712 markings, 78300714 edges, 469347 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 80856416 markings, 80856415 edges, 511141 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 83217231 markings, 83217230 edges, 472163 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 86244693 markings, 86244692 edges, 605492 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 88285649 markings, 88285649 edges, 408191 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 90756656 markings, 90756656 edges, 494201 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 1641 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((p24 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (3 <= p24)
lola: processed formula length: 10
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG 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: 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: (p24 <= 2)
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 task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (3 <= p24)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 10 markings, 10 edges
lola: ========================================
lola: subprocess 9 will run for 3283 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((1 <= p95))) OR (p18 <= p84))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 3283 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p18 <= p84)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p18 <= p84)
lola: processed formula length: 12
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((3 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF((3 <= p2)))
lola: processed formula length: 17
lola: 22 rewrites
lola: closed formula file CTLCardinality.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: 3626265 markings, 3626265 edges, 725253 markings/sec, 0 secs
lola: 7239905 markings, 7239905 edges, 722728 markings/sec, 5 secs
lola: 10700419 markings, 10700419 edges, 692103 markings/sec, 10 secs
lola: 13888852 markings, 13888852 edges, 637687 markings/sec, 15 secs
lola: 17219770 markings, 17219770 edges, 666184 markings/sec, 20 secs
lola: 20751095 markings, 20751095 edges, 706265 markings/sec, 25 secs
lola: 24270412 markings, 24270412 edges, 703863 markings/sec, 30 secs
lola: 27590924 markings, 27590933 edges, 664102 markings/sec, 35 secs
lola: 30854187 markings, 30854187 edges, 652653 markings/sec, 40 secs
lola: 34216873 markings, 34216873 edges, 672537 markings/sec, 45 secs
lola: 37601598 markings, 37601598 edges, 676945 markings/sec, 50 secs
lola: 40956913 markings, 40956912 edges, 671063 markings/sec, 55 secs
lola: 44111025 markings, 44111025 edges, 630822 markings/sec, 60 secs
lola: 47567003 markings, 47567003 edges, 691196 markings/sec, 65 secs
lola: 50647071 markings, 50647071 edges, 616014 markings/sec, 70 secs
lola: 53919323 markings, 53919322 edges, 654450 markings/sec, 75 secs
lola: 57397029 markings, 57397029 edges, 695541 markings/sec, 80 secs
lola: 60874431 markings, 60874431 edges, 695480 markings/sec, 85 secs
lola: 64085059 markings, 64085187 edges, 642126 markings/sec, 90 secs
lola: 67067664 markings, 67067996 edges, 596521 markings/sec, 95 secs
lola: 69016091 markings, 69016684 edges, 389685 markings/sec, 100 secs
lola: 71359242 markings, 71359661 edges, 468630 markings/sec, 105 secs
lola: 73526609 markings, 73526609 edges, 433473 markings/sec, 110 secs
lola: 75747608 markings, 75747607 edges, 444200 markings/sec, 115 secs
lola: 77512649 markings, 77512648 edges, 353008 markings/sec, 120 secs
lola: 78721975 markings, 78721975 edges, 241865 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((p49 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (p49 <= 0)
lola: processed formula length: 10
lola: 23 rewrites
lola: closed formula file CTLCardinality.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: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 <= p49)
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 task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p49 <= 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 CTLCardinality-11-0.sara
lola: state equation: write sara problem file to CTLCardinality-11-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-11-1.sara.
sara: try reading problem file CTLCardinality-11-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 3875314 markings, 3875314 edges, 775063 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 7753536 markings, 7753536 edges, 775644 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 11584688 markings, 11584688 edges, 766230 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 15206094 markings, 15206094 edges, 724281 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 18772237 markings, 18772236 edges, 713229 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 22297717 markings, 22297717 edges, 705096 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 26038833 markings, 26038833 edges, 748223 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 29784520 markings, 29784519 edges, 749137 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 33488876 markings, 33488876 edges, 740871 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 37137585 markings, 37137585 edges, 729742 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 40805486 markings, 40805486 edges, 733580 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 44477830 markings, 44477830 edges, 734469 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 48128562 markings, 48128562 edges, 730146 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 51664314 markings, 51664313 edges, 707150 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 55017806 markings, 55017806 edges, 670698 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 58442496 markings, 58442495 edges, 684938 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 61958442 markings, 61958442 edges, 703189 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 65297862 markings, 65297862 edges, 667884 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 68629765 markings, 68629764 edges, 666381 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 72280254 markings, 72280254 edges, 730098 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 75609489 markings, 75609489 edges, 665847 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 78014945 markings, 78014944 edges, 481091 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 80389411 markings, 80389411 edges, 474893 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 83298673 markings, 83298672 edges, 581852 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 85029708 markings, 85029707 edges, 346207 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 86996131 markings, 86996130 edges, 393285 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 89077812 markings, 89077812 edges, 416336 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 90911540 markings, 90911540 edges, 366746 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (A (F ((1 <= p95))) OR (p18 <= p84))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p18 <= p84)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p18 <= p84)
lola: processed formula length: 12
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p95)))
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: (p95 <= 0)
lola: processed formula length: 10
lola: 23 rewrites
lola: closed formula file CTLCardinality.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: 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 <= p95)
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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: unknown no yes unknown yes no no yes no yes
lola:
preliminary result: unknown no yes unknown yes no no yes no yes
lola: memory consumption: 3920 KB
lola: time consumption: 569 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.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="Planning-PT-none"
export BK_EXAMINATION="CTLCardinality"
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 Planning-PT-none, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r176-tajo-158987871600259"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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