About the Execution of ITS-LoLa for PolyORBLF-PT-S06J04T04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15744.010 | 3600000.00 | 402024.00 | 130.70 | FFFFTTTFFFFTFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r176-tajo-158987872000507.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is PolyORBLF-PT-S06J04T04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987872000507
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.7M
-rw-r--r-- 1 mcc users 8.0K Apr 12 05:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 12 05:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 05:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 11 05:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.8K Apr 14 12:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K Apr 10 12:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 10 12:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 9 18:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 9 18:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 10 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Apr 10 22:22 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 9.4M 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 PolyORBLF-PT-S06J04T04-CTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1591159832143
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 04:50:34] [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 04:50:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 04:50:34] [INFO ] Load time of PNML (sax parser for PT used): 506 ms
[2020-06-03 04:50:34] [INFO ] Transformed 454 places.
[2020-06-03 04:50:34] [INFO ] Transformed 6994 transitions.
[2020-06-03 04:50:34] [INFO ] Parsed PT model containing 454 places and 6994 transitions in 614 ms.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 96 ms.
Incomplete random walk after 100000 steps, including 614 resets, run finished after 716 ms. (steps per millisecond=139 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1]
[2020-06-03 04:50:35] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
// Phase 1: matrix 1590 rows 454 cols
[2020-06-03 04:50:35] [INFO ] Computed 50 place invariants in 101 ms
[2020-06-03 04:50:36] [INFO ] [Real]Absence check using 19 positive place invariants in 27 ms returned sat
[2020-06-03 04:50:36] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 17 ms returned unsat
[2020-06-03 04:50:36] [INFO ] [Real]Absence check using 19 positive place invariants in 51 ms returned sat
[2020-06-03 04:50:36] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 27 ms returned sat
[2020-06-03 04:50:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:50:39] [INFO ] [Real]Absence check using state equation in 2848 ms returned sat
[2020-06-03 04:50:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:50:39] [INFO ] [Nat]Absence check using 19 positive place invariants in 75 ms returned sat
[2020-06-03 04:50:39] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 15 ms returned unsat
[2020-06-03 04:50:39] [INFO ] [Real]Absence check using 19 positive place invariants in 17 ms returned sat
[2020-06-03 04:50:39] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 4 ms returned unsat
[2020-06-03 04:50:39] [INFO ] [Real]Absence check using 19 positive place invariants in 23 ms returned unsat
[2020-06-03 04:50:39] [INFO ] [Real]Absence check using 19 positive place invariants in 18 ms returned sat
[2020-06-03 04:50:39] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 19 ms returned unsat
[2020-06-03 04:50:39] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2020-06-03 04:50:39] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 16 ms returned unsat
[2020-06-03 04:50:39] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2020-06-03 04:50:39] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 21 ms returned sat
[2020-06-03 04:50:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:50:41] [INFO ] [Real]Absence check using state equation in 1931 ms returned sat
[2020-06-03 04:50:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:50:41] [INFO ] [Nat]Absence check using 19 positive place invariants in 20 ms returned sat
[2020-06-03 04:50:41] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 12 ms returned unsat
[2020-06-03 04:50:41] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2020-06-03 04:50:41] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 13 ms returned unsat
[2020-06-03 04:50:41] [INFO ] [Real]Absence check using 19 positive place invariants in 20 ms returned sat
[2020-06-03 04:50:41] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 22 ms returned unsat
[2020-06-03 04:50:41] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned unsat
[2020-06-03 04:50:42] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2020-06-03 04:50:42] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 23 ms returned unsat
[2020-06-03 04:50:42] [INFO ] [Real]Absence check using 19 positive place invariants in 16 ms returned sat
[2020-06-03 04:50:42] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 5 ms returned unsat
Successfully simplified 12 atomic propositions for a total of 12 simplifications.
[2020-06-03 04:50:42] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-03 04:50:42] [INFO ] Flatten gal took : 259 ms
[2020-06-03 04:50:42] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-03 04:50:42] [INFO ] Flatten gal took : 138 ms
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 04:50:42] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2020-06-03 04:50:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 20 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ PolyORBLF-PT-S06J04T04 @ 3570 seconds
check_solution: Variable C138 = -0.108441253635 is below its lower bound 0
check_solution: Variable C438 = -0.000703838631349 is below its lower bound 0
check_solution: Variable C737 = -0.205669999123 is below its lower bound 0
check_solution: Constraint R6 = 3.61881145295 is above its equality of 0
check_solution: Constraint R7 = 4.82508193727 is above its equality of 0
check_solution: Constraint R24 = 0 is above its equality of -1
check_solution: Constraint R65 = 6.9502657775e-310 is above its equality of -1
check_solution: Constraint R77 = 1.14375573206e-311 is above its equality of -1
check_solution: Constraint R81 = 2.5357849713e-311 is above its equality of -1
check_solution: Constraint R99 = 4.43709320008e-311 is above its equality of -10
Seriously low accuracy found ||*|| = 21.8247 (rel. error 9.61183)
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3219
rslt: Output for CTLCardinality @ PolyORBLF-PT-S06J04T04
{
"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 04:50:43 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 424
},
"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": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(1 <= p383 + p25 + p453 + p443)",
"processed_size": 31,
"rewrites": 14
},
"result":
{
"edges": 84,
"markings": 85,
"produced_by": "state space /EXEG",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 16
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 485
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 485
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "(p107 + p111 + p177 + p190 + p211 + p231 + p249 + p254 + p282 + p286 + p308 + p320 + p378 + p385 + p418 + p427 + p431 + p444 + p44 + p58 <= 0)",
"processed_size": 142,
"rewrites": 14
},
"result":
{
"edges": 1855,
"markings": 690,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 80
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "AX(EG((p148 + p247 + p60 + p97 <= p169)))",
"processed_size": 41,
"rewrites": 13
},
"net":
{
"conflict_clusters": 159,
"singleton_clusters": 0
},
"result":
{
"edges": 47299665,
"markings": 14345256,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 648
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "EG((EX((p325 + p373 + p452 + p46 <= p314)) OR (3 <= p0 + p326 + p387 + p77)))",
"processed_size": 77,
"rewrites": 13
},
"net":
{
"conflict_clusters": 159,
"singleton_clusters": 0
},
"result":
{
"edges": 53249,
"markings": 16006,
"produced_by": "CTL model checker",
"value": true
},
"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": 810
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 810
},
"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": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "(p336 + p345 + p384 + p446 <= p105 + p233 + p305 + p342)",
"processed_size": 56,
"rewrites": 11
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1080
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"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": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "E (G ((p336 + p345 + p384 + p446 <= p197 + p292 + p312 + p372)))",
"processed_size": 64,
"rewrites": 12
},
"result":
{
"edges": 1071007,
"markings": 446490,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 16
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1609
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 33,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 33,
"visible_transitions": 0
},
"processed": "A (G ((((p215 + p275 + p67 + p99 <= p4 + p130 + p132 + p139 + p157 + p183 + p221 + p223 + p234 + p259 + p268 + p272 + p278 + p296 + p304 + p68 + p328 + p329 + p394 + p435 + p437 + p29 + p40 + p78) AND (p80 <= p213 + p284 + p298 + p400)))))",
"processed_size": 239,
"rewrites": 13
},
"result":
{
"edges": 12,
"markings": 13,
"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": 3219
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "EX((p149 + p202 + p303 + p362 + p406 + p41 <= p120 + p250 + p285 + p90))",
"processed_size": 72,
"rewrites": 12
},
"net":
{
"conflict_clusters": 159,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1073
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p391 + 1 <= p317)",
"processed_size": 18,
"rewrites": 14
},
"result":
{
"edges": 86,
"markings": 87,
"produced_by": "state space /EXEF",
"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_from_all_successors",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1609
},
"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": "((p381 <= 1) AND (p322 <= 0))",
"processed_size": 29,
"rewrites": 14
},
"result":
{
"edges": 214,
"markings": 215,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3219
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3219
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (G ((p166 + p203 + p271 + p16 + p71 <= 1)))",
"processed_size": 45,
"rewrites": 12
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 240
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (G ((p166 + p203 + p271 + p16 + p71 <= 1)))",
"processed_size": 45,
"rewrites": 12
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 240
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "((p144 + p208 + p355 + p55 + 1 <= p7 + p279 + p412 + p422 + p74) OR (p411 <= 1) OR (p283 + p343 + p430 + p47 <= 1))",
"processed_size": 117,
"rewrites": 14
},
"result":
{
"edges": 27,
"markings": 28,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 568
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 60244,
"runtime": 351.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(F(**)) OR (A(F(*)) AND E(G(*)))) : A(X(A(F(*)))) : (A(X(**)) AND A(F(**))) : A(X(E(G(**)))) : E(G((E(X(**)) OR **))) : (A(G(**)) OR (E(X(**)) AND (** AND E(G(**))))) : A(X(A(G(**)))) : A(F(**))"
},
"net":
{
"arcs": 9892,
"conflict_clusters": 159,
"places": 454,
"places_significant": 404,
"singleton_clusters": 0,
"transitions": 1614
},
"result":
{
"preliminary_value": "no no no yes yes yes no no ",
"value": "no no no yes yes yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 2068/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 14528
lola: finding significant places
lola: 454 places, 1614 transitions, 404 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 <= p334)
lola: (A (F (((p7 + p279 + p412 + p422 + p74 <= p144 + p208 + p355 + p55) AND (2 <= p411) AND (2 <= p283 + p343 + p430 + p47)))) OR (NOT(E (G ((p120 + p250 + p285 + p90 <= p3 + p150 + p185 + p195 + p198 + p225 + p258 + p277 + p281 + p300 + p333 + p340 + p346 + p347 + p367 + p434 + p441 + p13 + p28 + p88)))) AND NOT(A (F ((2 <= p166 + p203 + p271 + p16 + p71)))))) : A (X (NOT(E (G ((1 <= p383 + p25 + p453 + p443)))))) : (A (X ((2 <= p127 + p154 + p448 + p354 + p306 + p81))) AND A (F ((1 <= p107 + p111 + p177 + p190 + p211 + p231 + p249 + p254 + p282 + p286 + p308 + p320 + p378 + p385 + p418 + p427 + p431 + p444 + p44 + p58)))) : A (X (E (G ((p148 + p247 + p60 + p97 <= p169))))) : E (G ((E (X ((p325 + p373 + p452 + p46 <= p314))) OR (3 <= p0 + p326 + p387 + p77)))) : (A (G ((((p215 + p275 + p67 + p99 <= p4 + p130 + p132 + p139 + p157 + p183 + p221 + p223 + p234 + p259 + p268 + p272 + p278 + p296 + p304 + p68 + p328 + p329 + p394 + p435 + p437 + p29 + p40 + p78) AND (p80 <= p213 + p284 + p298 + p400))))) OR ((E (X ((p149 + p202 + p303 + p362 + p406 + p41 <= p120 + p250 + p285 + p90))) AND (p336 + p345 + p384 + p446 <= p105 + p233 + p305 + p342)) AND E (G ((p336 + p345 + p384 + p446 <= p197 + p292 + p312 + p372))))) : A (X (A (G ((p317 <= p391))))) : A (F (A (F (((2 <= p381) OR (1 <= p322))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:392
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 424 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((p383 + p25 + p453 + p443 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:754
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (1 <= p383 + p25 + p453 + p443)
lola: processed formula length: 31
lola: 14 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 /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based 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:753
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: (p383 + p25 + p453 + p443 <= 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: no
lola: produced by: state space /EXEG
lola: The predicate does not eventually occur from all successors.
lola: 85 markings, 84 edges
lola: ========================================
lola: subprocess 1 will run for 485 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((2 <= p127 + p154 + p448 + p354 + p306 + p81))) AND A (F ((1 <= p107 + p111 + p177 + p190 + p211 + p231 + p249 + p254 + p282 + p286 + p308 + p320 + p378 + p385 + p418 + p427 + p431 + p444 + p44 + p58))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 485 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p107 + p111 + p177 + p190 + p211 + p231 + p249 + p254 + p282 + p286 + p308 + p320 + p378 + p385 + p418 + p427 + p431 + p444 + p44 + p58)))
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: (p107 + p111 + p177 + p190 + p211 + p231 + p249 + p254 + p282 + p286 + p308 + p320 + p378 + p385 + p418 + p427 + p431 + p444 + p44 + p58 <= 0)
lola: processed formula length: 142
lola: 14 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 <= p107 + p111 + p177 + p190 + p211 + p231 + p249 + p254 + p282 + p286 + p308 + p320 + p378 + p385 + p418 + p427 + p431 + p444 + p44 + p58)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 690 markings, 1855 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((p148 + p247 + p60 + p97 <= p169)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EG((p148 + p247 + p60 + p97 <= p169)))
lola: processed formula length: 41
lola: 13 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 535507 markings, 1468667 edges, 107101 markings/sec, 0 secs
lola: 962283 markings, 2864637 edges, 85355 markings/sec, 5 secs
lola: 1411361 markings, 4362586 edges, 89816 markings/sec, 10 secs
lola: 1857771 markings, 5846176 edges, 89282 markings/sec, 15 secs
lola: 2308689 markings, 7351223 edges, 90184 markings/sec, 20 secs
lola: 2763503 markings, 8843280 edges, 90963 markings/sec, 25 secs
lola: 3225588 markings, 10450152 edges, 92417 markings/sec, 30 secs
lola: 3694525 markings, 12031753 edges, 93787 markings/sec, 35 secs
lola: 4157178 markings, 13633081 edges, 92531 markings/sec, 40 secs
lola: 4598595 markings, 15221030 edges, 88283 markings/sec, 45 secs
lola: 5132445 markings, 16606221 edges, 106770 markings/sec, 50 secs
lola: 5596554 markings, 17946816 edges, 92822 markings/sec, 55 secs
lola: 6031898 markings, 19400434 edges, 87069 markings/sec, 60 secs
lola: 6509633 markings, 20968631 edges, 95547 markings/sec, 65 secs
lola: 6973124 markings, 22535311 edges, 92698 markings/sec, 70 secs
lola: 7425293 markings, 24064801 edges, 90434 markings/sec, 75 secs
lola: 7853198 markings, 25460451 edges, 85581 markings/sec, 80 secs
lola: 8280250 markings, 26909479 edges, 85410 markings/sec, 85 secs
lola: 8739399 markings, 28496989 edges, 91830 markings/sec, 90 secs
lola: 9153813 markings, 29905619 edges, 82883 markings/sec, 95 secs
lola: 9550931 markings, 31327992 edges, 79424 markings/sec, 100 secs
lola: 10026217 markings, 32665357 edges, 95057 markings/sec, 105 secs
lola: 10491990 markings, 34177682 edges, 93155 markings/sec, 110 secs
lola: 10942911 markings, 35695581 edges, 90184 markings/sec, 115 secs
lola: 11376148 markings, 37104213 edges, 86647 markings/sec, 120 secs
lola: 11837545 markings, 38670552 edges, 92279 markings/sec, 125 secs
lola: 12311227 markings, 40216781 edges, 94736 markings/sec, 130 secs
lola: 12761711 markings, 41789933 edges, 90097 markings/sec, 135 secs
lola: 13224212 markings, 43350879 edges, 92500 markings/sec, 140 secs
lola: 13686597 markings, 44921937 edges, 92477 markings/sec, 145 secs
lola: 14132501 markings, 46492777 edges, 89181 markings/sec, 150 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 14345256 markings, 47299665 edges
lola: ========================================
lola: subprocess 3 will run for 648 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E (X ((p325 + p373 + p452 + p46 <= p314))) OR (3 <= p0 + p326 + p387 + p77))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((EX((p325 + p373 + p452 + p46 <= p314)) OR (3 <= p0 + p326 + p387 + p77)))
lola: processed formula length: 77
lola: 13 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 16006 markings, 53249 edges
lola: ========================================
lola: subprocess 4 will run for 810 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((((p215 + p275 + p67 + p99 <= p4 + p130 + p132 + p139 + p157 + p183 + p221 + p223 + p234 + p259 + p268 + p272 + p278 + p296 + p304 + p68 + p328 + p329 + p394 + p435 + p437 + p29 + p40 + p78) AND (p80 <= p213 + p284 + p298 + p400))))) OR (E (X ((p149 + p202 + p303 + p362 + p406 + p41 <= p120 + p250 + p285 + p90))) AND ((p336 + p345 + p384 + p446 <= p105 + p233 + p305 + p342) AND E (G ((p336 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 810 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p336 + p345 + p384 + p446 <= p105 + p233 + p305 + p342)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p336 + p345 + p384 + p446 <= p105 + p233 + p305 + p342)
lola: processed formula length: 56
lola: 11 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 1080 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p336 + p345 + p384 + p446 <= p197 + p292 + p312 + p372)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p336 + p345 + p384 + p446 <= p197 + p292 + p312 + p372)))
lola: processed formula length: 64
lola: 12 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: (p197 + p292 + p312 + p372 + 1 <= p336 + p345 + p384 + p446)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-5-0.sara.
sara: place or transition ordering is non-deterministic
lola: 103282 markings, 229785 edges, 20656 markings/sec, 0 secs || sara is running 0 secs
lola: 203506 markings, 466535 edges, 20045 markings/sec, 5 secs || sara is running 5 secs
lola: 309940 markings, 725634 edges, 21287 markings/sec, 10 secs || sara is running 10 secs
lola: 415438 markings, 985017 edges, 21100 markings/sec, 15 secs || sara is running 15 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 446490 markings, 1071007 edges
lola: ========================================
lola: subprocess 6 will run for 1609 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p215 + p275 + p67 + p99 <= p4 + p130 + p132 + p139 + p157 + p183 + p221 + p223 + p234 + p259 + p268 + p272 + p278 + p296 + p304 + p68 + p328 + p329 + p394 + p435 + p437 + p29 + p40 + p78) AND (p80 <= p213 + p284 + p298 + p400)))))
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 ((((p215 + p275 + p67 + p99 <= p4 + p130 + p132 + p139 + p157 + p183 + p221 + p223 + p234 + p259 + p268 + p272 + p278 + p296 + p304 + p68 + p328 + p329 + p394 + p435 + p437 + p29 + p40 + p78) AND (p80 <= p213 + p284 + p298 + p400)))))
lola: processed formula length: 239
lola: 13 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: (((p4 + p130 + p132 + p139 + p157 + p183 + p221 + p223 + p234 + p259 + p268 + p272 + p278 + p296 + p304 + p68 + p328 + p329 + p394 + p435 + p437 + p29 + p40 + p78 + 1 <= p215 + p275 + p67 + p99) OR (p213 + p284 + p298 + p400 + 1 <= p80)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 7 will run for 3219 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((p149 + p202 + p303 + p362 + p406 + p41 <= p120 + p250 + p285 + p90)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((p149 + p202 + p303 + p362 + p406 + p41 <= p120 + p250 + p285 + p90))
lola: processed formula length: 72
lola: 12 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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 5 will run for 1073 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((p317 <= p391)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p391 + 1 <= p317)
lola: processed formula length: 18
lola: 14 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: 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: (p391 + 1 <= p317)
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 /EXEF
lola: The predicate is not invariant from successors.
lola: 87 markings, 86 edges
lola: ========================================
lola: subprocess 6 will run for 1609 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= p381) OR (1 <= p322))))
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: ((p381 <= 1) AND (p322 <= 0))
lola: processed formula length: 29
lola: 14 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 <= p381) OR (1 <= p322))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 215 markings, 214 edges
lola: ========================================
lola: subprocess 7 will run for 3219 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((p7 + p279 + p412 + p422 + p74 <= p144 + p208 + p355 + p55) AND (2 <= p411) AND (2 <= p283 + p343 + p430 + p47)))) OR (A (F ((p3 + p150 + p185 + p195 + p198 + p225 + p258 + p277 + p281 + p300 + p333 + p340 + p346 + p347 + p367 + p434 + p441 + p13 + p28 + p88 + 1 <= p120 + p250 + p285 + p90))) AND E (G ((p166 + p203 + p271 + p16 + p71 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 3219 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p166 + p203 + p271 + p16 + p71 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p166 + p203 + p271 + p16 + p71 <= 1)))
lola: processed formula length: 45
lola: 12 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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (2 <= p166 + p203 + p271 + p16 + p71)
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 is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (F (((p7 + p279 + p412 + p422 + p74 <= p144 + p208 + p355 + p55) AND (2 <= p411) AND (2 <= p283 + p343 + p430 + p47)))) OR (A (F ((p3 + p150 + p185 + p195 + p198 + p225 + p258 + p277 + p281 + p300 + p333 + p340 + p346 + p347 + p367 + p434 + p441 + p13 + p28 + p88 + 1 <= p120 + p250 + p285 + p90))) AND E (G ((p166 + p203 + p271 + p16 + p71 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (G ((p166 + p203 + p271 + p16 + p71 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p166 + p203 + p271 + p16 + p71 <= 1)))
lola: processed formula length: 45
lola: 12 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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (2 <= p166 + p203 + p271 + p16 + p71)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (((p7 + p279 + p412 + p422 + p74 <= p144 + p208 + p355 + p55) AND (2 <= p411) AND (2 <= p283 + p343 + p430 + p47))))
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: ((p144 + p208 + p355 + p55 + 1 <= p7 + p279 + p412 + p422 + p74) OR (p411 <= 1) OR (p283 + p343 + p430 + p47 <= 1))
lola: processed formula length: 117
lola: 14 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: ((p7 + p279 + p412 + p422 + p74 <= p144 + p208 + p355 + p55) AND (2 <= p411) AND (2 <= p283 + p343 + p430 + p47))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 28 markings, 27 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes yes yes no no
lola:
preliminary result: no no no yes yes yes no no
lola: memory consumption: 60244 KB
lola: time consumption: 351 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="PolyORBLF-PT-S06J04T04"
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 PolyORBLF-PT-S06J04T04, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r176-tajo-158987872000507"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S06J04T04.tgz
mv PolyORBLF-PT-S06J04T04 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 ;