About the Execution of ITS-LoLa for BridgeAndVehicles-PT-V50P50N50
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15742.750 | 3600000.00 | 736692.00 | 188.00 | TTFTFTTFFTFFTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2020-input.r182-oct2-158987913800395.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 BridgeAndVehicles-PT-V50P50N50, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913800395
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 11K Mar 26 02:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Mar 26 02:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 351K Mar 25 21:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 992K Mar 25 21:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 195K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 611K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 25 17:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 36K Mar 25 17:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 484K Mar 25 13:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.4M Mar 25 13:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 6.0M Mar 24 05:37 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-CTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-CTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-CTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-CTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-CTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-CTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-CTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-CTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-CTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-CTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-CTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-CTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-CTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-CTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-CTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1591149260275
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 01:54:22] [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 01:54:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 01:54:22] [INFO ] Load time of PNML (sax parser for PT used): 243 ms
[2020-06-03 01:54:22] [INFO ] Transformed 168 places.
[2020-06-03 01:54:22] [INFO ] Transformed 5408 transitions.
[2020-06-03 01:54:22] [INFO ] Parsed PT model containing 168 places and 5408 transitions in 311 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 102 ms.
Incomplete random walk after 100000 steps, including 235 resets, run finished after 1220 ms. (steps per millisecond=81 ) properties seen :[0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0]
[2020-06-03 01:54:24] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 168 cols
[2020-06-03 01:54:24] [INFO ] Computed 7 place invariants in 14 ms
[2020-06-03 01:54:24] [INFO ] [Real]Absence check using 7 positive place invariants in 16 ms returned sat
[2020-06-03 01:54:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:54:24] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2020-06-03 01:54:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:54:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2020-06-03 01:54:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:54:24] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2020-06-03 01:54:24] [INFO ] State equation strengthened by 102 read => feed constraints.
[2020-06-03 01:54:24] [INFO ] [Nat]Added 102 Read/Feed constraints in 68 ms returned sat
[2020-06-03 01:54:25] [INFO ] Computed and/alt/rep : 5405/288599/407 causal constraints in 459 ms.
[2020-06-03 01:54:36] [INFO ] Added : 230 causal constraints over 46 iterations in 11362 ms. Result :sat
[2020-06-03 01:54:36] [INFO ] Deduced a trap composed of 7 places in 690 ms
[2020-06-03 01:54:38] [INFO ] Deduced a trap composed of 5 places in 477 ms
[2020-06-03 01:54:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3675 ms
[2020-06-03 01:54:40] [INFO ] [Real]Absence check using 7 positive place invariants in 28 ms returned unsat
[2020-06-03 01:54:40] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
[2020-06-03 01:54:40] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-03 01:54:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:54:40] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2020-06-03 01:54:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:54:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2020-06-03 01:54:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:54:40] [INFO ] [Nat]Absence check using state equation in 377 ms returned sat
[2020-06-03 01:54:40] [INFO ] [Nat]Added 102 Read/Feed constraints in 83 ms returned sat
[2020-06-03 01:54:41] [INFO ] Deduced a trap composed of 54 places in 846 ms
[2020-06-03 01:54:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 902 ms
[2020-06-03 01:54:42] [INFO ] Computed and/alt/rep : 5405/288599/407 causal constraints in 622 ms.
[2020-06-03 01:54:59] [INFO ] Added : 245 causal constraints over 49 iterations in 17339 ms. Result :sat
[2020-06-03 01:54:59] [INFO ] Deduced a trap composed of 5 places in 448 ms
[2020-06-03 01:55:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1227 ms
[2020-06-03 01:55:00] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned unsat
[2020-06-03 01:55:00] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-03 01:55:00] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-03 01:55:00] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned unsat
[2020-06-03 01:55:00] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2020-06-03 01:55:00] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
[2020-06-03 01:55:00] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-03 01:55:00] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2020-06-03 01:55:00] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2020-06-03 01:55:00] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned unsat
[2020-06-03 01:55:00] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
Successfully simplified 13 atomic propositions for a total of 15 simplifications.
[2020-06-03 01:55:01] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-03 01:55:01] [INFO ] Flatten gal took : 355 ms
[2020-06-03 01:55:01] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-03 01:55:01] [INFO ] Flatten gal took : 270 ms
FORMULA BridgeAndVehicles-PT-V50P50N50-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N50-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N50-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N50-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N50-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N50-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 01:55:01] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2020-06-03 01:55:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 41 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ BridgeAndVehicles-PT-V50P50N50 @ 3570 seconds
FORMULA BridgeAndVehicles-PT-V50P50N50-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V50P50N50-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V50P50N50-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V50P50N50-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V50P50N50-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V50P50N50-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V50P50N50-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V50P50N50-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V50P50N50-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V50P50N50-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2937
rslt: Output for CTLCardinality @ BridgeAndVehicles-PT-V50P50N50
{
"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": "Wed Jun 3 01:55:01 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 355
},
"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": "DEADLOCK",
"processed_size": 8,
"rewrites": 22
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"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": 22
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 444
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 444
},
"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": "(p115 <= 0)",
"processed_size": 11,
"rewrites": 22
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 507
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(p55 <= p110 + p111)",
"processed_size": 20,
"rewrites": 24
},
"result":
{
"edges": 146,
"markings": 147,
"produced_by": "state space /EXEF",
"value": true
},
"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": "reachability_from_a_successor",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 507
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 507
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p112 <= 0) AND (p115 <= 0))",
"processed_size": 29,
"rewrites": 25
},
"result":
{
"edges": 777543,
"markings": 396529,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 51
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 586
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 586
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p34) AND (p39 <= p156))",
"processed_size": 30,
"rewrites": 22
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 703
},
"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 <= p164)))",
"processed_size": 19,
"rewrites": 23
},
"result":
{
"edges": 139,
"markings": 140,
"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": 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": 703
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((p112 <= 1))",
"processed_size": 13,
"rewrites": 25
},
"result":
{
"edges": 408,
"markings": 409,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 51
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 879
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (G (((3 <= p55))))",
"processed_size": 20,
"rewrites": 23
},
"result":
{
"edges": 408,
"markings": 409,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 104
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1171
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "AF(EG(((p152 <= p140) OR (p52 <= p145))))",
"processed_size": 42,
"rewrites": 24
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 1585920,
"markings": 560343,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1755
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "EG((AF((p54 <= p138)) AND (p152 <= p84)))",
"processed_size": 41,
"rewrites": 24
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 147026873,
"markings": 29770734,
"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": 2937
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2937
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "NOT DEADLOCK",
"processed_size": 12,
"rewrites": 22
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F ((p0 <= 0)))",
"processed_size": 17,
"rewrites": 23
},
"result":
{
"edges": 50,
"markings": 51,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 11,
"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": 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": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "NOT DEADLOCK",
"processed_size": 12,
"rewrites": 22
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"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 <= p0)",
"processed_size": 9,
"rewrites": 22
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F ((p0 <= 0)))",
"processed_size": 17,
"rewrites": 23
},
"result":
{
"edges": 50,
"markings": 51,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 12,
"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"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 235640,
"runtime": 633.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(G(**)) : (** AND (E(F(*)) AND NODEADLOCK)) : DEADLOCK : (E(X(E(F(**)))) AND **) : TRUE : (A(F(**)) OR (A(F(**)) OR E(X(E(F(**)))))) : A(F(**)) : (E(F(**)) OR (A(X(**)) OR **)) : A(F(E(G(**)))) : E(G((A(F(**)) AND **)))"
},
"net":
{
"arcs": 42330,
"conflict_clusters": 5,
"places": 168,
"places_significant": 161,
"singleton_clusters": 0,
"transitions": 5408
},
"result":
{
"preliminary_value": "yes yes no yes yes yes no yes yes no ",
"value": "yes yes no yes yes yes no yes 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: 5576/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 5376
lola: finding significant places
lola: 168 places, 5408 transitions, 161 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 false: (2 <= p56 + p57)
lola: LP says that atomic proposition is always false: (3 <= p56 + p57)
lola: E (G (((3 <= p55)))) : (((3 <= p0) AND NOT(A (G ((1 <= p0))))) AND E (X ((0 <= 0)))) : A (X ((1 <= 0))) : (E (X (E (F ((p55 <= p110 + p111))))) AND (E (G ((1 <= 0))) OR (p115 <= 0))) : E (G ((A (X ((0 <= 0))) OR (p52 <= 1)))) : ((A (F ((1 <= p115))) OR A (F (((1 <= p112) OR (1 <= p115))))) OR E (F (E (X ((p0 <= p53)))))) : A (F (((2 <= p112)))) : ((E (((0 <= 0) U (1 <= p164))) OR A (X ((p7 <= p142)))) OR ((1 <= p34) AND (p39 <= p156))) : A (F (E (G (((p152 <= p140) OR (p52 <= p145)))))) : E (G ((A (F ((p54 <= p138))) AND (p152 <= p84))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
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:130
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:136
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: DEADLOCK
lola: processed formula length: 8
lola: 22 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 395 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: 22 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: subprocess 2 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (E (F ((p55 <= p110 + p111))))) AND (p115 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 2 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p115 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p115 <= 0)
lola: processed formula length: 11
lola: 22 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 3 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((p55 <= p110 + p111)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: (p55 <= p110 + p111)
lola: processed formula length: 20
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 /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p55 <= p110 + p111)
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 /EXEF
lola: The predicate is reachable from some successor.
lola: 147 markings, 146 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((1 <= p115))) OR (A (F (((1 <= p112) OR (1 <= p115)))) OR E (X (E (F ((p0 <= p53)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p112) OR (1 <= p115))))
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: ((p112 <= 0) AND (p115 <= 0))
lola: processed formula length: 29
lola: 25 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 <= p112) OR (1 <= p115))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-3-0.sara.
sara: place or transition ordering is non-deterministic
lola: 53707 markings, 104410 edges, 10741 markings/sec, 0 secs || sara is running 0 secs
lola: 105203 markings, 206498 edges, 10299 markings/sec, 5 secs || sara is running 5 secs
lola: 156612 markings, 307793 edges, 10282 markings/sec, 10 secs || sara is running 10 secs
lola: 206766 markings, 405946 edges, 10031 markings/sec, 15 secs || sara is running 15 secs
lola: 258260 markings, 508020 edges, 10299 markings/sec, 20 secs || sara is running 20 secs
lola: 308576 markings, 606078 edges, 10063 markings/sec, 25 secs || sara is running 25 secs
lola: 359385 markings, 706425 edges, 10162 markings/sec, 30 secs || sara is running 30 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 396529 markings, 777543 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 586 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((1 <= p164))) OR (A (X ((p7 <= p142))) OR ((1 <= p34) AND (p39 <= p156))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 586 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p34) AND (p39 <= p156))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p34) AND (p39 <= p156))
lola: processed formula length: 30
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 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 5 will run for 703 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p164)))
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 <= p164)))
lola: processed formula length: 19
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)
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 <= p164)
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: 140 markings, 139 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 703 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= p112))))
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: ((p112 <= 1))
lola: processed formula length: 13
lola: 25 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: ((2 <= p112))
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: 409 markings, 408 edges
lola: ========================================
lola: subprocess 6 will run for 879 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((3 <= p55))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((3 <= p55))))
lola: processed formula length: 20
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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p55 <= 2))
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 / EG
lola: The predicate is possibly preserved.
lola: 409 markings, 408 edges
lola: ========================================
lola: subprocess 7 will run for 1171 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((p152 <= p140) OR (p52 <= p145))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG(((p152 <= p140) OR (p52 <= p145))))
lola: processed formula length: 42
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: 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: 495324 markings, 1403990 edges, 99065 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 560343 markings, 1585920 edges
lola: ========================================
lola: subprocess 8 will run for 1755 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (F ((p54 <= p138))) AND (p152 <= p84))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((AF((p54 <= p138)) AND (p152 <= p84)))
lola: processed formula length: 41
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: 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: 350935 markings, 1624507 edges, 70187 markings/sec, 0 secs
lola: 692641 markings, 3270899 edges, 68341 markings/sec, 5 secs
lola: 1030941 markings, 4899216 edges, 67660 markings/sec, 10 secs
lola: 1429587 markings, 6150831 edges, 79729 markings/sec, 15 secs
lola: 1853464 markings, 7257178 edges, 84775 markings/sec, 20 secs
lola: 2247551 markings, 8512260 edges, 78817 markings/sec, 25 secs
lola: 2616521 markings, 9788837 edges, 73794 markings/sec, 30 secs
lola: 2980386 markings, 11055581 edges, 72773 markings/sec, 35 secs
lola: 3327814 markings, 12265887 edges, 69486 markings/sec, 40 secs
lola: 3657275 markings, 13748777 edges, 65892 markings/sec, 45 secs
lola: 3933389 markings, 14943636 edges, 55223 markings/sec, 50 secs
lola: 4314844 markings, 16122441 edges, 76291 markings/sec, 55 secs
lola: 4583470 markings, 17604240 edges, 53725 markings/sec, 60 secs
lola: 4910755 markings, 18725837 edges, 65457 markings/sec, 65 secs
lola: 5210883 markings, 20236468 edges, 60026 markings/sec, 70 secs
lola: 5526709 markings, 21361077 edges, 63165 markings/sec, 75 secs
lola: 5808346 markings, 22852501 edges, 56327 markings/sec, 80 secs
lola: 6117532 markings, 23923055 edges, 61837 markings/sec, 85 secs
lola: 6346763 markings, 25393437 edges, 45846 markings/sec, 90 secs
lola: 6710484 markings, 26485712 edges, 72744 markings/sec, 95 secs
lola: 6928718 markings, 27857809 edges, 43647 markings/sec, 100 secs
lola: 7237083 markings, 29293403 edges, 61673 markings/sec, 105 secs
lola: 7496760 markings, 30339603 edges, 51935 markings/sec, 110 secs
lola: 7723666 markings, 31742099 edges, 45381 markings/sec, 115 secs
lola: 8077241 markings, 32829859 edges, 70715 markings/sec, 120 secs
lola: 8314269 markings, 34193897 edges, 47406 markings/sec, 125 secs
lola: 8547683 markings, 35608481 edges, 46683 markings/sec, 130 secs
lola: 8894231 markings, 36687876 edges, 69310 markings/sec, 135 secs
lola: 9107456 markings, 38013931 edges, 42645 markings/sec, 140 secs
lola: 9332575 markings, 39397857 edges, 45024 markings/sec, 145 secs
lola: 9678548 markings, 40433287 edges, 69195 markings/sec, 150 secs
lola: 9872189 markings, 41777571 edges, 38728 markings/sec, 155 secs
lola: 10104216 markings, 43190538 edges, 46405 markings/sec, 160 secs
lola: 10460416 markings, 44261848 edges, 71240 markings/sec, 165 secs
lola: 10670261 markings, 45596893 edges, 41969 markings/sec, 170 secs
lola: 10881889 markings, 46908057 edges, 42326 markings/sec, 175 secs
lola: 11194980 markings, 48324935 edges, 62618 markings/sec, 180 secs
lola: 11470584 markings, 49341317 edges, 55121 markings/sec, 185 secs
lola: 11678125 markings, 50687280 edges, 41508 markings/sec, 190 secs
lola: 11903329 markings, 52126025 edges, 45041 markings/sec, 195 secs
lola: 12275520 markings, 53138806 edges, 74438 markings/sec, 200 secs
lola: 12469760 markings, 54525082 edges, 38848 markings/sec, 205 secs
lola: 12680857 markings, 55876801 edges, 42219 markings/sec, 210 secs
lola: 12979421 markings, 57328111 edges, 59713 markings/sec, 215 secs
lola: 13277118 markings, 58317920 edges, 59539 markings/sec, 220 secs
lola: 13468348 markings, 59672655 edges, 38246 markings/sec, 225 secs
lola: 13671077 markings, 61006063 edges, 40546 markings/sec, 230 secs
lola: 13996020 markings, 62447822 edges, 64989 markings/sec, 235 secs
lola: 14265993 markings, 63411782 edges, 53995 markings/sec, 240 secs
lola: 14444459 markings, 64730997 edges, 35693 markings/sec, 245 secs
lola: 14671094 markings, 66045848 edges, 45327 markings/sec, 250 secs
lola: 14966060 markings, 67482275 edges, 58993 markings/sec, 255 secs
lola: 15255734 markings, 68400713 edges, 57935 markings/sec, 260 secs
lola: 15445743 markings, 69764749 edges, 38002 markings/sec, 265 secs
lola: 15652748 markings, 71099667 edges, 41401 markings/sec, 270 secs
lola: 15909429 markings, 72527864 edges, 51336 markings/sec, 275 secs
lola: 16245889 markings, 73482417 edges, 67292 markings/sec, 280 secs
lola: 16436356 markings, 74850371 edges, 38093 markings/sec, 285 secs
lola: 16624172 markings, 76209449 edges, 37563 markings/sec, 290 secs
lola: 16857263 markings, 77564638 edges, 46618 markings/sec, 295 secs
lola: 17177980 markings, 78733680 edges, 64143 markings/sec, 300 secs
lola: 17423295 markings, 79794871 edges, 49063 markings/sec, 305 secs
lola: 17604520 markings, 81126162 edges, 36245 markings/sec, 310 secs
lola: 17825467 markings, 82412875 edges, 44189 markings/sec, 315 secs
lola: 18041098 markings, 83803764 edges, 43126 markings/sec, 320 secs
lola: 18401997 markings, 84695838 edges, 72180 markings/sec, 325 secs
lola: 18588014 markings, 86015097 edges, 37203 markings/sec, 330 secs
lola: 18779946 markings, 87308960 edges, 38386 markings/sec, 335 secs
lola: 18986682 markings, 88601665 edges, 41347 markings/sec, 340 secs
lola: 19212986 markings, 89957096 edges, 45261 markings/sec, 345 secs
lola: 19573802 markings, 90865087 edges, 72163 markings/sec, 350 secs
lola: 19758376 markings, 92192033 edges, 36915 markings/sec, 355 secs
lola: 19952372 markings, 93571705 edges, 38799 markings/sec, 360 secs
lola: 20168510 markings, 94882254 edges, 43228 markings/sec, 365 secs
lola: 20411925 markings, 96309267 edges, 48683 markings/sec, 370 secs
lola: 20758701 markings, 97236943 edges, 69355 markings/sec, 375 secs
lola: 20952741 markings, 98615404 edges, 38808 markings/sec, 380 secs
lola: 21146680 markings, 99986250 edges, 38788 markings/sec, 385 secs
lola: 21359432 markings, 101263351 edges, 42550 markings/sec, 390 secs
lola: 21573738 markings, 102651439 edges, 42861 markings/sec, 395 secs
lola: 21940063 markings, 103546315 edges, 73265 markings/sec, 400 secs
lola: 22139139 markings, 104882610 edges, 39815 markings/sec, 405 secs
lola: 22332078 markings, 106193145 edges, 38588 markings/sec, 410 secs
lola: 22522488 markings, 107550690 edges, 38082 markings/sec, 415 secs
lola: 22737544 markings, 108920092 edges, 43011 markings/sec, 420 secs
lola: 23069168 markings, 110160159 edges, 66325 markings/sec, 425 secs
lola: 23329309 markings, 111206307 edges, 52028 markings/sec, 430 secs
lola: 23523036 markings, 112560923 edges, 38745 markings/sec, 435 secs
lola: 23716575 markings, 113895206 edges, 38708 markings/sec, 440 secs
lola: 23931098 markings, 115214885 edges, 42905 markings/sec, 445 secs
lola: 24199405 markings, 116649908 edges, 53661 markings/sec, 450 secs
lola: 24530500 markings, 117513532 edges, 66219 markings/sec, 455 secs
lola: 24715853 markings, 118864641 edges, 37071 markings/sec, 460 secs
lola: 24909492 markings, 120201447 edges, 38728 markings/sec, 465 secs
lola: 25103332 markings, 121561549 edges, 38768 markings/sec, 470 secs
lola: 25333577 markings, 122929377 edges, 46049 markings/sec, 475 secs
lola: 25645658 markings, 124286019 edges, 62416 markings/sec, 480 secs
lola: 25941702 markings, 125250383 edges, 59209 markings/sec, 485 secs
lola: 26136304 markings, 126639324 edges, 38920 markings/sec, 490 secs
lola: 26330443 markings, 128023258 edges, 38828 markings/sec, 495 secs
lola: 26524284 markings, 129396125 edges, 38768 markings/sec, 500 secs
lola: 26739630 markings, 130757059 edges, 43069 markings/sec, 505 secs
lola: 27088015 markings, 131791751 edges, 69677 markings/sec, 510 secs
lola: 27335540 markings, 132949885 edges, 49505 markings/sec, 515 secs
lola: 27529280 markings, 134308139 edges, 38748 markings/sec, 520 secs
lola: 27723419 markings, 135691926 edges, 38828 markings/sec, 525 secs
lola: 27917560 markings, 137078429 edges, 38828 markings/sec, 530 secs
lola: 28148103 markings, 138463360 edges, 46109 markings/sec, 535 secs
lola: 28497032 markings, 139454007 edges, 69786 markings/sec, 540 secs
lola: 28736089 markings, 140681440 edges, 47811 markings/sec, 545 secs
lola: 28926334 markings, 142048937 edges, 38049 markings/sec, 550 secs
lola: 29119173 markings, 143400966 edges, 38568 markings/sec, 555 secs
lola: 29312720 markings, 144786157 edges, 38709 markings/sec, 560 secs
lola: 29558279 markings, 146188935 edges, 49112 markings/sec, 565 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 29770734 markings, 147026873 edges
lola: ========================================
lola: subprocess 9 will run for 2937 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= p0) AND (E (F ((p0 <= 0))) AND NOT DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 2937 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT DEADLOCK
lola: processed formula length: 12
lola: 22 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: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p0 <= 0)))
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 ((p0 <= 0)))
lola: processed formula length: 17
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)
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: (p0 <= 0)
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: 51 markings, 50 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((3 <= p0) AND (E (F ((p0 <= 0))) AND NOT DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: NOT DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT DEADLOCK
lola: processed formula length: 12
lola: 22 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: ========================================
lola: ...considering subproblem: (3 <= p0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p0)
lola: processed formula length: 9
lola: 22 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: ========================================
lola: ...considering subproblem: E (F ((p0 <= 0)))
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 ((p0 <= 0)))
lola: processed formula length: 17
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)
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: (p0 <= 0)
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: 51 markings, 50 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no yes yes yes no yes yes no
lola:
preliminary result: yes yes no yes yes yes no yes yes no
lola: memory consumption: 235640 KB
lola: time consumption: 633 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="BridgeAndVehicles-PT-V50P50N50"
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 BridgeAndVehicles-PT-V50P50N50, 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 r182-oct2-158987913800395"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V50P50N50.tgz
mv BridgeAndVehicles-PT-V50P50N50 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 '
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 ;