Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 916K
-rw-r--r-- 1 mcc users 7.9K Apr 30 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 30 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 30 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 30 13:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 30 13:04 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Apr 30 13:04 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 18K Apr 30 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 30 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 30 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 30 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 30 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 30 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 24K Apr 30 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 30 13:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 30 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K Apr 30 13:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 30 13:04 equiv_col
-rw-r--r-- 1 mcc users 2 Apr 30 13:04 instance
-rw-r--r-- 1 mcc users 6 Apr 30 13:04 iscolored
-rw-r--r-- 1 mcc users 317K Apr 30 13:04 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 LamportFastMutEx-PT-8-CTLCardinality-00
FORMULA_NAME LamportFastMutEx-PT-8-CTLCardinality-01
FORMULA_NAME LamportFastMutEx-PT-8-CTLCardinality-02
FORMULA_NAME LamportFastMutEx-PT-8-CTLCardinality-03
FORMULA_NAME LamportFastMutEx-PT-8-CTLCardinality-04
FORMULA_NAME LamportFastMutEx-PT-8-CTLCardinality-05
FORMULA_NAME LamportFastMutEx-PT-8-CTLCardinality-06
FORMULA_NAME LamportFastMutEx-PT-8-CTLCardinality-07
FORMULA_NAME LamportFastMutEx-PT-8-CTLCardinality-08
FORMULA_NAME LamportFastMutEx-PT-8-CTLCardinality-09
FORMULA_NAME LamportFastMutEx-PT-8-CTLCardinality-10
FORMULA_NAME LamportFastMutEx-PT-8-CTLCardinality-11
FORMULA_NAME LamportFastMutEx-PT-8-CTLCardinality-12
FORMULA_NAME LamportFastMutEx-PT-8-CTLCardinality-13
FORMULA_NAME LamportFastMutEx-PT-8-CTLCardinality-14
FORMULA_NAME LamportFastMutEx-PT-8-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591219794497

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 21:29:56] [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-03 21:29:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 21:29:56] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2020-06-03 21:29:56] [INFO ] Transformed 315 places.
[2020-06-03 21:29:56] [INFO ] Transformed 666 transitions.
[2020-06-03 21:29:56] [INFO ] Parsed PT model containing 315 places and 666 transitions in 123 ms.
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 82 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 60 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 410 ms. (steps per millisecond=243 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1]
[2020-06-03 21:29:57] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2020-06-03 21:29:57] [INFO ] Computed 82 place invariants in 11 ms
[2020-06-03 21:29:57] [INFO ] [Real]Absence check using 82 positive place invariants in 52 ms returned sat
[2020-06-03 21:29:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:29:57] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2020-06-03 21:29:57] [INFO ] State equation strengthened by 128 read => feed constraints.
[2020-06-03 21:29:57] [INFO ] [Real]Added 128 Read/Feed constraints in 31 ms returned sat
[2020-06-03 21:29:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:29:58] [INFO ] [Nat]Absence check using 82 positive place invariants in 67 ms returned sat
[2020-06-03 21:29:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:29:58] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2020-06-03 21:29:58] [INFO ] [Nat]Added 128 Read/Feed constraints in 34 ms returned sat
[2020-06-03 21:29:58] [INFO ] Deduced a trap composed of 8 places in 89 ms
[2020-06-03 21:29:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2020-06-03 21:29:58] [INFO ] Computed and/alt/rep : 576/5248/408 causal constraints in 61 ms.
[2020-06-03 21:29:59] [INFO ] Added : 170 causal constraints over 36 iterations in 1456 ms. Result :sat
[2020-06-03 21:29:59] [INFO ] [Real]Absence check using 82 positive place invariants in 21 ms returned unsat
[2020-06-03 21:30:00] [INFO ] [Real]Absence check using 82 positive place invariants in 94 ms returned sat
[2020-06-03 21:30:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:30:01] [INFO ] [Real]Absence check using state equation in 904 ms returned sat
[2020-06-03 21:30:01] [INFO ] [Real]Added 128 Read/Feed constraints in 44 ms returned sat
[2020-06-03 21:30:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:30:01] [INFO ] [Nat]Absence check using 82 positive place invariants in 423 ms returned sat
[2020-06-03 21:30:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:30:02] [INFO ] [Nat]Absence check using state equation in 1441 ms returned sat
[2020-06-03 21:30:02] [INFO ] [Nat]Added 128 Read/Feed constraints in 26 ms returned sat
[2020-06-03 21:30:04] [INFO ] Deduced a trap composed of 17 places in 1441 ms
[2020-06-03 21:30:04] [INFO ] Deduced a trap composed of 18 places in 236 ms
[2020-06-03 21:30:04] [INFO ] Deduced a trap composed of 21 places in 92 ms
[2020-06-03 21:30:06] [INFO ] Deduced a trap composed of 47 places in 1624 ms
[2020-06-03 21:30:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3481 ms
[2020-06-03 21:30:06] [INFO ] Computed and/alt/rep : 576/5248/408 causal constraints in 35 ms.
[2020-06-03 21:30:10] [INFO ] Added : 324 causal constraints over 65 iterations in 3581 ms. Result :sat
[2020-06-03 21:30:10] [INFO ] Deduced a trap composed of 9 places in 102 ms
[2020-06-03 21:30:10] [INFO ] Deduced a trap composed of 9 places in 77 ms
[2020-06-03 21:30:10] [INFO ] Deduced a trap composed of 9 places in 67 ms
[2020-06-03 21:30:10] [INFO ] Deduced a trap composed of 9 places in 88 ms
[2020-06-03 21:30:10] [INFO ] Deduced a trap composed of 17 places in 73 ms
[2020-06-03 21:30:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 721 ms
[2020-06-03 21:30:10] [INFO ] [Real]Absence check using 82 positive place invariants in 9 ms returned unsat
[2020-06-03 21:30:10] [INFO ] [Real]Absence check using 82 positive place invariants in 5 ms returned unsat
[2020-06-03 21:30:10] [INFO ] [Real]Absence check using 82 positive place invariants in 12 ms returned unsat
[2020-06-03 21:30:10] [INFO ] [Real]Absence check using 82 positive place invariants in 15 ms returned unsat
[2020-06-03 21:30:10] [INFO ] [Real]Absence check using 82 positive place invariants in 5 ms returned unsat
[2020-06-03 21:30:10] [INFO ] [Real]Absence check using 82 positive place invariants in 18 ms returned unsat
[2020-06-03 21:30:11] [INFO ] [Real]Absence check using 82 positive place invariants in 5 ms returned unsat
[2020-06-03 21:30:11] [INFO ] [Real]Absence check using 82 positive place invariants in 11 ms returned unsat
[2020-06-03 21:30:11] [INFO ] [Real]Absence check using 82 positive place invariants in 5 ms returned unsat
[2020-06-03 21:30:11] [INFO ] [Real]Absence check using 82 positive place invariants in 4 ms returned unsat
Successfully simplified 11 atomic propositions for a total of 11 simplifications.
[2020-06-03 21:30:11] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 21:30:11] [INFO ] Flatten gal took : 122 ms
[2020-06-03 21:30:11] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 21:30:11] [INFO ] Flatten gal took : 67 ms
FORMULA LamportFastMutEx-PT-8-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-8-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-8-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 21:30:11] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 6 ms.
[2020-06-03 21:30:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 6 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ LamportFastMutEx-PT-8 @ 3570 seconds

FORMULA LamportFastMutEx-PT-8-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-8-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-8-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-8-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-8-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-8-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-8-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-8-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-8-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-8-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-8-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-8-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-8-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3097
rslt: Output for CTLCardinality @ LamportFastMutEx-PT-8

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 21:30:11 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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": 18
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"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": "TRUE",
"processed_size": 4,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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": "TRUE",
"processed_size": 4,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "A(EX((p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 <= p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58)) U EG((2 <= p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257)))",
"processed_size": 170,
"rewrites": 21
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 18,
"markings": 9,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"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": "(p229 <= 0)",
"processed_size": 11,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"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": "(p148 <= p137)",
"processed_size": 14,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((1 <= p122)))",
"processed_size": 19,
"rewrites": 19
},
"result":
{
"edges": 9,
"markings": 10,
"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": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"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 ((p243 <= p115)))",
"processed_size": 22,
"rewrites": 20
},
"result":
{
"edges": 21,
"markings": 22,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"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": 509
},
"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": 32,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 32,
"visible_transitions": 0
},
"processed": "A (G (((p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 <= p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257))))",
"processed_size": 215,
"rewrites": 20
},
"result":
{
"edges": 54,
"markings": 55,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 88,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 88,
"visible_transitions": 0
},
"processed": "E (G (((p170 + p171 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + 1 <= p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42) OR ((p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 <= 1) AND (p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 <= 1)))))",
"processed_size": 634,
"rewrites": 19
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 328
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "AG(E((p120 <= p7) U (p153 <= p62)))",
"processed_size": 35,
"rewrites": 20
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 261246232,
"markings": 43966072,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 776
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "EG((EG((p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 <= p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257)) OR ((p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 <= 2))))",
"processed_size": 180,
"rewrites": 20
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 27,
"markings": 9,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1034
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 48,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 48,
"visible_transitions": 0
},
"processed": "A(((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241) OR (p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97)) U EG((p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 <= p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74)))",
"processed_size": 313,
"rewrites": 20
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 10,
"markings": 9,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1552
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 32,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 32,
"visible_transitions": 0
},
"processed": "A ((((p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 <= 1) AND (p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 <= 1)) U (p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + 1 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97)))",
"processed_size": 228,
"rewrites": 23
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 104
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "universal_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3104
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "((3 <= p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249) R F ((p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 <= 2)))",
"processed_size": 121,
"rewrites": 27
},
"result":
{
"edges": 1262712,
"markings": 339134,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "existential single path",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 26824,
"runtime": 473.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(G(**)) : A((** U E(G(**)))) : E((** U E(G(**)))) : E(G((E(G(**)) OR **))) : FALSE : A((E(X(**)) U E(G(**)))) : A((** U **)) : A(G(**)) : (** AND (A(X(**)) OR (** AND E(F(**))))) : TRUE : A(G(E((** U **)))) : TRUE : A(G(**))"
},
"net":
{
"arcs": 2560,
"conflict_clusters": 11,
"places": 266,
"places_significant": 184,
"singleton_clusters": 0,
"transitions": 584
},
"result":
{
"preliminary_value": "yes yes yes yes no no no no yes yes no yes no ",
"value": "yes yes yes yes no no no no yes yes no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 850/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 266
lola: finding significant places
lola: 266 places, 584 transitions, 184 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: (p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 <= 8)
lola: E (G (((p170 + p171 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + 1 <= p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42) OR ((p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 <= 1) AND (p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 <= 1))))) : A ((((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241) OR (p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97)) U E (G ((p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 <= p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74))))) : E (((p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 <= 2) U E (G ((3 <= p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50))))) : E (G ((E (G ((p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 <= p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257))) OR ((p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 <= 2))))) : NOT(E (G (E (G ((0 <= 0)))))) : A ((E (X ((p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 <= p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58))) U E (G ((2 <= p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257))))) : A ((((p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 <= 1) AND (p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 <= 1)) U (p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + 1 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97))) : A (G (E (G (((p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 <= p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257)))))) : (A (((1 <= 0) U (p148 <= p137))) AND (A (X ((p169 + 1 <= p239))) OR ((p229 <= 0) AND E (F ((1 <= p122)))))) : E (G ((0 <= 0))) : A (G (E (((p120 <= p7) U (p153 <= p62))))) : E (G (E (((1 <= 0) U (0 <= 0))))) : A (G ((p243 <= p115)))
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:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:184
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 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: 18 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 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (X ((p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 <= p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58))) U E (G ((2 <= p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(EX((p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 <= p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58)) U EG((2 <= p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257)))
lola: processed formula length: 170
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 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: 9 markings, 18 edges
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p148 <= p137) AND (A (X ((p169 + 1 <= p239))) OR ((p229 <= 0) AND E (F ((1 <= p122))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p229 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p229 <= 0)
lola: processed formula length: 11
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p148 <= p137)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p148 <= p137)
lola: processed formula length: 14
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p122)))
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 <= p122)))
lola: processed formula length: 19
lola: 19 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: (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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p243 <= p115)))
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 ((p243 <= p115)))
lola: processed formula length: 22
lola: 20 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: (p115 + 1 <= p243)
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: 22 markings, 21 edges
lola: ========================================
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 <= p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257))))
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 (((p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 <= p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257))))
lola: processed formula length: 215
lola: 20 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: ((p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + 1 <= p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265) AND (p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7))
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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 55 markings, 54 edges
lola: ========================================
lola: subprocess 7 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p170 + p171 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p170 + p171 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180 + ... (shortened)
lola: processed formula length: 634
lola: 19 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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 <= p170 + p171 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172) AND ((2 <= p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265) OR (2 <= p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 9 markings, 9 edges
lola: ========================================
lola: subprocess 8 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (((p120 <= p7) U (p153 <= p62)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(E((p120 <= p7) U (p153 <= p62)))
lola: processed formula length: 35
lola: 20 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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 676500 markings, 2807600 edges, 135300 markings/sec, 0 secs
lola: 1249241 markings, 5308743 edges, 114548 markings/sec, 5 secs
lola: 1800896 markings, 7812719 edges, 110331 markings/sec, 10 secs
lola: 2316995 markings, 10227851 edges, 103220 markings/sec, 15 secs
lola: 2787578 markings, 12465000 edges, 94117 markings/sec, 20 secs
lola: 3270203 markings, 14808576 edges, 96525 markings/sec, 25 secs
lola: 3786068 markings, 17345408 edges, 103173 markings/sec, 30 secs
lola: 4309265 markings, 19979581 edges, 104639 markings/sec, 35 secs
lola: 4823872 markings, 22684920 edges, 102921 markings/sec, 40 secs
lola: 5325320 markings, 25428674 edges, 100290 markings/sec, 45 secs
lola: 5824642 markings, 28140460 edges, 99864 markings/sec, 50 secs
lola: 6304111 markings, 30789424 edges, 95894 markings/sec, 55 secs
lola: 6780116 markings, 33424794 edges, 95201 markings/sec, 60 secs
lola: 7255192 markings, 36033415 edges, 95015 markings/sec, 65 secs
lola: 7732091 markings, 38525697 edges, 95380 markings/sec, 70 secs
lola: 8206524 markings, 41071445 edges, 94887 markings/sec, 75 secs
lola: 8709174 markings, 43889579 edges, 100530 markings/sec, 80 secs
lola: 9202060 markings, 46639639 edges, 98577 markings/sec, 85 secs
lola: 9690381 markings, 49457476 edges, 97664 markings/sec, 90 secs
lola: 10179658 markings, 52193505 edges, 97855 markings/sec, 95 secs
lola: 10697535 markings, 55214231 edges, 103575 markings/sec, 100 secs
lola: 11208672 markings, 58240184 edges, 102227 markings/sec, 105 secs
lola: 11720118 markings, 61412743 edges, 102289 markings/sec, 110 secs
lola: 12225978 markings, 64440320 edges, 101172 markings/sec, 115 secs
lola: 12733587 markings, 67412302 edges, 101522 markings/sec, 120 secs
lola: 13224121 markings, 70422970 edges, 98107 markings/sec, 125 secs
lola: 13755177 markings, 73547446 edges, 106211 markings/sec, 130 secs
lola: 14240626 markings, 76580462 edges, 97090 markings/sec, 135 secs
lola: 14767901 markings, 79613496 edges, 105455 markings/sec, 140 secs
lola: 15260961 markings, 82517259 edges, 98612 markings/sec, 145 secs
lola: 15741427 markings, 85755339 edges, 96093 markings/sec, 150 secs
lola: 16247515 markings, 88784348 edges, 101218 markings/sec, 155 secs
lola: 16741936 markings, 91788738 edges, 98884 markings/sec, 160 secs
lola: 17216647 markings, 94671823 edges, 94942 markings/sec, 165 secs
lola: 17709054 markings, 97671142 edges, 98481 markings/sec, 170 secs
lola: 18199543 markings, 100720420 edges, 98098 markings/sec, 175 secs
lola: 18687273 markings, 103582067 edges, 97546 markings/sec, 180 secs
lola: 19169747 markings, 106494903 edges, 96495 markings/sec, 185 secs
lola: 19651668 markings, 109418698 edges, 96384 markings/sec, 190 secs
lola: 20131052 markings, 112360011 edges, 95877 markings/sec, 195 secs
lola: 20632299 markings, 115462805 edges, 100249 markings/sec, 200 secs
lola: 21113109 markings, 118397985 edges, 96162 markings/sec, 205 secs
lola: 21590553 markings, 121366650 edges, 95489 markings/sec, 210 secs
lola: 22075376 markings, 124264858 edges, 96965 markings/sec, 215 secs
lola: 22539498 markings, 127192610 edges, 92824 markings/sec, 220 secs
lola: 23022678 markings, 130107864 edges, 96636 markings/sec, 225 secs
lola: 23493169 markings, 132992206 edges, 94098 markings/sec, 230 secs
lola: 23970573 markings, 136052991 edges, 95481 markings/sec, 235 secs
lola: 24447088 markings, 139051469 edges, 95303 markings/sec, 240 secs
lola: 24911827 markings, 141889120 edges, 92948 markings/sec, 245 secs
lola: 25380956 markings, 144807191 edges, 93826 markings/sec, 250 secs
lola: 25841221 markings, 147683154 edges, 92053 markings/sec, 255 secs
lola: 26308414 markings, 150565184 edges, 93439 markings/sec, 260 secs
lola: 26770963 markings, 153407116 edges, 92510 markings/sec, 265 secs
lola: 27224790 markings, 156139908 edges, 90765 markings/sec, 270 secs
lola: 27682719 markings, 158961489 edges, 91586 markings/sec, 275 secs
lola: 28138101 markings, 161814655 edges, 91076 markings/sec, 280 secs
lola: 28608311 markings, 164753120 edges, 94042 markings/sec, 285 secs
lola: 29075983 markings, 167682064 edges, 93534 markings/sec, 290 secs
lola: 29553096 markings, 170454540 edges, 95423 markings/sec, 295 secs
lola: 30009307 markings, 173278631 edges, 91242 markings/sec, 300 secs
lola: 30479196 markings, 176231447 edges, 93978 markings/sec, 305 secs
lola: 30957090 markings, 179192773 edges, 95579 markings/sec, 310 secs
lola: 31417652 markings, 182133102 edges, 92112 markings/sec, 315 secs
lola: 31864694 markings, 184845437 edges, 89408 markings/sec, 320 secs
lola: 32315408 markings, 187688610 edges, 90143 markings/sec, 325 secs
lola: 32768841 markings, 190515390 edges, 90687 markings/sec, 330 secs
lola: 33225951 markings, 193241078 edges, 91422 markings/sec, 335 secs
lola: 33681732 markings, 196046114 edges, 91156 markings/sec, 340 secs
lola: 34148119 markings, 198928287 edges, 93277 markings/sec, 345 secs
lola: 34603657 markings, 201752529 edges, 91108 markings/sec, 350 secs
lola: 35053658 markings, 204434728 edges, 90000 markings/sec, 355 secs
lola: 35498237 markings, 207309341 edges, 88916 markings/sec, 360 secs
lola: 35944444 markings, 210056211 edges, 89241 markings/sec, 365 secs
lola: 36395331 markings, 212931700 edges, 90177 markings/sec, 370 secs
lola: 36866543 markings, 215751556 edges, 94242 markings/sec, 375 secs
lola: 37305859 markings, 218509385 edges, 87863 markings/sec, 380 secs
lola: 37751397 markings, 221319803 edges, 89108 markings/sec, 385 secs
lola: 38218587 markings, 224109466 edges, 93438 markings/sec, 390 secs
lola: 38661242 markings, 226870893 edges, 88531 markings/sec, 395 secs
lola: 39115053 markings, 229837197 edges, 90762 markings/sec, 400 secs
lola: 39554511 markings, 232623224 edges, 87892 markings/sec, 405 secs
lola: 39990146 markings, 235425255 edges, 87127 markings/sec, 410 secs
lola: 40435414 markings, 238357888 edges, 89054 markings/sec, 415 secs
lola: 40883084 markings, 241354663 edges, 89534 markings/sec, 420 secs
lola: 41332169 markings, 244424381 edges, 89817 markings/sec, 425 secs
lola: 41779140 markings, 247185115 edges, 89394 markings/sec, 430 secs
lola: 42228300 markings, 250129005 edges, 89832 markings/sec, 435 secs
lola: 42669645 markings, 252885625 edges, 88269 markings/sec, 440 secs
lola: 43107669 markings, 255584046 edges, 87605 markings/sec, 445 secs
lola: 43582211 markings, 258675378 edges, 94908 markings/sec, 450 secs
lola: 43966072 markings, 261246232 edges, 76772 markings/sec, 455 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 43966072 markings, 261246232 edges
lola: ========================================
lola: subprocess 9 will run for 776 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E (G ((p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 <= p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257))) OR ((p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((EG((p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 <= p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257)) OR ((p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 <= 2))))
lola: processed formula length: 180
lola: 20 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 2 significant temporal operators and needs 9 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: 9 markings, 27 edges
lola: ========================================
lola: subprocess 10 will run for 1034 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241) OR (p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97)) U E (G ((p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 <= p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241) OR (p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97)) U EG((p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 <= p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74)))
lola: processed formula length: 313
lola: 20 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 2 significant temporal operators and needs 9 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: 9 markings, 10 edges
lola: ========================================
lola: subprocess 11 will run for 1552 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 <= 1) AND (p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 <= 1)) U (p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + 1 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A ((((p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 <= 1) AND (p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 <= 1)) U (p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + 1 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97)))
lola: processed formula length: 228
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 /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl 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: 1
lola: formula 0: ((p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 <= 1) AND (p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 <= 1))
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: state equation task get result unparse finished id 0
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: 9 markings, 9 edges
lola: ========================================
lola: subprocess 12 will run for 3104 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 <= 2) U E (G ((3 <= p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50)))))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:663
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((3 <= p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249) R F ((p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 <= 2)))
lola: processed formula length: 121
lola: 27 rewrites
lola: closed formula file CTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 282619 markings, 1043286 edges, 56524 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The existential single path CTL formula holds.
lola: 339134 markings, 1262712 edges
lola: RESULT
lola:
SUMMARY: yes yes yes yes no no no no yes yes no yes no
lola:
preliminary result: yes yes yes yes no no no no yes yes no yes no
lola: ========================================
lola: memory consumption: 26824 KB
lola: time consumption: 473 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="LamportFastMutEx-PT-8"
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 LamportFastMutEx-PT-8, 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 r184-oct2-158987928900691"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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