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-158987872400787.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 QuasiCertifProtocol-PT-06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987872400787
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 5.8K Apr 12 06:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 12 06:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 11 07:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 11 07:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.8K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Apr 10 13:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 10 13:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Apr 9 20:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 9 20:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.3K Apr 10 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 153K 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 QuasiCertifProtocol-PT-06-CTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591181892416

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 10:58:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 10:58:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 10:58:14] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2020-06-03 10:58:14] [INFO ] Transformed 270 places.
[2020-06-03 10:58:14] [INFO ] Transformed 116 transitions.
[2020-06-03 10:58:14] [INFO ] Parsed PT model containing 270 places and 116 transitions in 104 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
Incomplete random walk after 100000 steps, including 9838 resets, run finished after 457 ms. (steps per millisecond=218 ) properties seen :[0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0]
// Phase 1: matrix 116 rows 270 cols
[2020-06-03 10:58:14] [INFO ] Computed 155 place invariants in 14 ms
[2020-06-03 10:58:14] [INFO ] [Real]Absence check using 3 positive place invariants in 20 ms returned sat
[2020-06-03 10:58:14] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 73 ms returned sat
[2020-06-03 10:58:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:15] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2020-06-03 10:58:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:58:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 17 ms returned sat
[2020-06-03 10:58:15] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 78 ms returned sat
[2020-06-03 10:58:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:15] [INFO ] [Nat]Absence check using state equation in 577 ms returned unsat
[2020-06-03 10:58:16] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-06-03 10:58:16] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 66 ms returned sat
[2020-06-03 10:58:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:16] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2020-06-03 10:58:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:58:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-06-03 10:58:16] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 53 ms returned sat
[2020-06-03 10:58:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:16] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2020-06-03 10:58:16] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 23 ms.
[2020-06-03 10:58:16] [INFO ] Added : 48 causal constraints over 10 iterations in 175 ms. Result :sat
[2020-06-03 10:58:16] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-06-03 10:58:17] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 50 ms returned sat
[2020-06-03 10:58:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:17] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2020-06-03 10:58:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:58:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-06-03 10:58:17] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 50 ms returned sat
[2020-06-03 10:58:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:17] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2020-06-03 10:58:17] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-06-03 10:58:17] [INFO ] Added : 58 causal constraints over 12 iterations in 133 ms. Result :sat
[2020-06-03 10:58:17] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-03 10:58:17] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 19 ms returned unsat
[2020-06-03 10:58:17] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-03 10:58:17] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 47 ms returned sat
[2020-06-03 10:58:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:17] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2020-06-03 10:58:17] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-06-03 10:58:18] [INFO ] Added : 49 causal constraints over 10 iterations in 106 ms. Result :sat
[2020-06-03 10:58:18] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-06-03 10:58:18] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 34 ms returned sat
[2020-06-03 10:58:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:18] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2020-06-03 10:58:18] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 5 ms.
[2020-06-03 10:58:18] [INFO ] Added : 18 causal constraints over 4 iterations in 66 ms. Result :sat
[2020-06-03 10:58:18] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-03 10:58:18] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 35 ms returned sat
[2020-06-03 10:58:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:18] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2020-06-03 10:58:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:58:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-03 10:58:18] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 36 ms returned sat
[2020-06-03 10:58:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:18] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2020-06-03 10:58:18] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 11 ms.
[2020-06-03 10:58:18] [INFO ] Added : 48 causal constraints over 10 iterations in 87 ms. Result :sat
[2020-06-03 10:58:18] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned unsat
[2020-06-03 10:58:18] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-06-03 10:58:19] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 66 ms returned sat
[2020-06-03 10:58:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:19] [INFO ] [Real]Absence check using state equation in 85 ms returned unsat
[2020-06-03 10:58:19] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-03 10:58:19] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 77 ms returned sat
[2020-06-03 10:58:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:19] [INFO ] [Real]Absence check using state equation in 61 ms returned unsat
[2020-06-03 10:58:19] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-06-03 10:58:19] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 51 ms returned sat
[2020-06-03 10:58:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:19] [INFO ] [Real]Absence check using state equation in 146 ms returned unsat
[2020-06-03 10:58:19] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-03 10:58:19] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 48 ms returned sat
[2020-06-03 10:58:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:19] [INFO ] [Real]Absence check using state equation in 46 ms returned unsat
[2020-06-03 10:58:19] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-03 10:58:19] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 44 ms returned sat
[2020-06-03 10:58:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:19] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2020-06-03 10:58:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:58:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-03 10:58:20] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 79 ms returned sat
[2020-06-03 10:58:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:20] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2020-06-03 10:58:20] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 18 ms.
[2020-06-03 10:58:20] [INFO ] Added : 51 causal constraints over 11 iterations in 239 ms. Result :sat
[2020-06-03 10:58:20] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-03 10:58:20] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 82 ms returned sat
[2020-06-03 10:58:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:20] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2020-06-03 10:58:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:58:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-03 10:58:21] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 43 ms returned sat
[2020-06-03 10:58:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:21] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2020-06-03 10:58:21] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-06-03 10:58:21] [INFO ] Added : 50 causal constraints over 10 iterations in 127 ms. Result :sat
[2020-06-03 10:58:21] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 9 simplifications.
[2020-06-03 10:58:21] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 10:58:21] [INFO ] Flatten gal took : 75 ms
[2020-06-03 10:58:21] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 10:58:21] [INFO ] Flatten gal took : 42 ms
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 10:58:21] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2020-06-03 10:58:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ QuasiCertifProtocol-PT-06 @ 3570 seconds

FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for CTLCardinality @ QuasiCertifProtocol-PT-06

{
"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 10:58:22 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 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": "(p15 <= 1)",
"processed_size": 10,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "(p264 + p262 + p263 + p265 + p266 + p268 + p269 <= p54)",
"processed_size": 55,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(3 <= p170 + p169 + p164 + p160 + p159 + p158 + p157)",
"processed_size": 53,
"rewrites": 24
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"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": 396
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p54 <= 0)",
"processed_size": 10,
"rewrites": 23
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space /EXEG",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "((p256 + p242 + p241 + p240 + p239 + p238 + p237 <= 0) AND (p49 + 1 <= p8))",
"processed_size": 75,
"rewrites": 24
},
"result":
{
"edges": 23379,
"markings": 6427,
"produced_by": "state space /EXEF",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p163 + 1 <= p82) AND (p122 <= 0))",
"processed_size": 35,
"rewrites": 24
},
"result":
{
"edges": 18260,
"markings": 6280,
"produced_by": "state space /EXEF",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"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": "(p203 + 1 <= p4)",
"processed_size": 16,
"rewrites": 23
},
"result":
{
"edges": 13321,
"markings": 5558,
"produced_by": "state space /EXEF",
"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_from_a_successor",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A (G ((2 <= p51 + p50 + p48 + p47 + p46 + p45 + p52)))",
"processed_size": 54,
"rewrites": 23
},
"result":
{
"edges": 7,
"markings": 8,
"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": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (G ((p53 <= p76)))",
"processed_size": 20,
"rewrites": 22
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"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": 65,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 65,
"visible_transitions": 0
},
"processed": "((p44 + p43 + p42 + p41 + p40 + p38 + p37 + 1 <= p256 + p242 + p241 + p240 + p239 + p238 + p237) OR (p54 + 1 <= p100 + p103 + p104 + p105 + p106 + p107 + p108 + p57 + p58 + p59 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) OR (p55 <= 0))",
"processed_size": 428,
"rewrites": 24
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 47
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 0,
"G": 2,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 21,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "E(AG((p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p246 + p245 + p244 + p243 + p247 + p248 + p250)) U AG((3 <= p39 + p36 + p35 + p34 + p33 + p30 + p29)))",
"processed_size": 144,
"rewrites": 24
},
"net":
{
"conflict_clusters": 32,
"singleton_clusters": 0
},
"result":
{
"edges": 1035173,
"markings": 197245,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"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": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 10,
"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": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"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": "EG(AF((p253 <= p224 + p223 + p222 + p221 + p249 + p251 + p252)))",
"processed_size": 64,
"rewrites": 23
},
"net":
{
"conflict_clusters": 32,
"singleton_clusters": 0
},
"result":
{
"edges": 237,
"markings": 133,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 20888,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "TRUE : (NODEADLOCK AND E(G(A(F(**))))) : E((A(G(**)) U A(G(**)))) : (** AND (A(F(**)) AND (E(X(**)) OR **))) : E(X(E(G(*)))) : A(X(A(G(**)))) : A(G(**)) : A(F(**)) : E(G(**)) : A(X(A(G(**)))) : E(X(E(F(*))))"
},
"net":
{
"arcs": 659,
"conflict_clusters": 32,
"places": 270,
"places_significant": 115,
"singleton_clusters": 0,
"transitions": 116
},
"result":
{
"preliminary_value": "yes yes no no yes no no no yes no yes ",
"value": "yes yes no no yes no no no yes no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 386/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8640
lola: finding significant places
lola: 270 places, 116 transitions, 115 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: E (G ((0 <= 0))) : (E (X ((0 <= 0))) AND E (G (A (F ((p253 <= p224 + p223 + p222 + p221 + p249 + p251 + p252)))))) : E ((A (G ((p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p246 + p245 + p244 + p243 + p247 + p248 + p250))) U A (G ((3 <= p39 + p36 + p35 + p34 + p33 + p30 + p29))))) : (((p264 + p262 + p263 + p265 + p266 + p268 + p269 <= p54) AND A (((0 <= 0) U (p170 + p169 + p164 + p160 + p159 + p158 + p157 <= 2)))) AND (E (X ((3 <= p246 + p245 + p244 + p243 + p247 + p248 + p250))) OR (p15 <= 1))) : E (X (NOT(A (F ((1 <= p54)))))) : A (G (A (X (((1 <= p256 + p242 + p241 + p240 + p239 + p238 + p237) OR (p8 <= p49)))))) : A (G ((2 <= p51 + p50 + p48 + p47 + p46 + p45 + p52))) : (E (X ((1 <= 0))) OR A (F (((p256 + p242 + p241 + p240 + p239 + p238 + p237 <= p44 + p43 + p42 + p41 + p40 + p38 + p37) AND (p100 + p103 + p104 + p105 + p106 + p107 + p108 + p57 + p58 + p59 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p54) AND (1 <= p55))))) : E (G ((p53 <= p76))) : A (G (A (X (((p82 <= p163) OR (1 <= p122)))))) : NOT(A (X (A (G ((p4 <= p203))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:398
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p264 + p262 + p263 + p265 + p266 + p268 + p269 <= p54) AND (A (F ((p170 + p169 + p164 + p160 + p159 + p158 + p157 <= 2))) AND (E (X ((3 <= p246 + p245 + p244 + p243 + p247 + p248 + p250))) OR (p15 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p15 <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p15 <= 1)
lola: processed formula length: 10
lola: 21 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 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p264 + p262 + p263 + p265 + p266 + p268 + p269 <= p54)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p264 + p262 + p263 + p265 + p266 + p268 + p269 <= p54)
lola: processed formula length: 55
lola: 21 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 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p170 + p169 + p164 + p160 + p159 + p158 + p157 <= 2)))
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: (3 <= p170 + p169 + p164 + p160 + p159 + p158 + p157)
lola: processed formula length: 53
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 / 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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 11 markings, 10 edges
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: (p170 + p169 + p164 + p160 + p159 + p158 + p157 <= 2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((p54 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: rewrite Frontend/Parser/formula_rewrite.k:715
lola: processed formula: (p54 <= 0)
lola: processed formula length: 10
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /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: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p54 <= 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 /EXEG
lola: The predicate is possibly preserved from some successor.
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (((1 <= p256 + p242 + p241 + p240 + p239 + p238 + p237) OR (p8 <= p49))))))
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: ((p256 + p242 + p241 + p240 + p239 + p238 + p237 <= 0) AND (p49 + 1 <= p8))
lola: processed formula length: 75
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: 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: ((p256 + p242 + p241 + p240 + p239 + p238 + p237 <= 0) AND (p49 + 1 <= p8))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 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.
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 6427 markings, 23379 edges
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (((p82 <= p163) OR (1 <= p122))))))
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: ((p163 + 1 <= p82) AND (p122 <= 0))
lola: processed formula length: 35
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: 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: ((p163 + 1 <= p82) AND (p122 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-4-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 6280 markings, 18260 edges
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((p203 + 1 <= p4)))))
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: (p203 + 1 <= p4)
lola: processed formula length: 16
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 /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: (p203 + 1 <= p4)
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: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 5558 markings, 13321 edges
lola: ========================================
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p51 + p50 + p48 + p47 + p46 + p45 + p52)))
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 ((2 <= p51 + p50 + p48 + p47 + p46 + p45 + p52)))
lola: processed formula length: 54
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: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: (p51 + p50 + p48 + p47 + p46 + p45 + p52 <= 1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 7 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p53 <= p76)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p53 <= p76)))
lola: processed formula length: 20
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / 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: (p76 + 1 <= p53)
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: 11 markings, 10 edges
lola: ========================================
lola: subprocess 8 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p256 + p242 + p241 + p240 + p239 + p238 + p237 <= p44 + p43 + p42 + p41 + p40 + p38 + p37) AND (p100 + p103 + p104 + p105 + p106 + p107 + p108 + p57 + p58 + p59 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p... (shortened)
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: ((p44 + p43 + p42 + p41 + p40 + p38 + p37 + 1 <= p256 + p242 + p241 + p240 + p239 + p238 + p237) OR (p54 + 1 <= p100 + p103 + p104 + p105 + p106 + p107 + p108 + p57 + p58 + p59 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 ... (shortened)
lola: processed formula length: 428
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 / 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: write sara problem file to CTLCardinality-7-0.sara
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:700
lola: state equation task get result rewrite finished id 0
lola: The predicate does not eventually occur.
lola: state equation task get result unparse finished++ id 0
lola: 11 markings, 10 edges
lola: formula 0: ((p256 + p242 + p241 + p240 + p239 + p238 + p237 <= p44 + p43 + p42 + p41 + p40 + p38 + p37) AND (p100 + p103 + p104 + p105 + p106 + p107 + p108 + p57 + p58 + p59 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p54) AND (1 <= p55))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 9 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A (G ((p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p246 + p245 + p244 + p243 + p247 + p248 + p250))) U A (G ((3 <= p39 + p36 + p35 + p34 + p33 + p30 + p29)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(AG((p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p246 + p245 + p244 + p243 + p247 + p248 + p250)) U AG((3 <= p39 + p36 + p35 + p34 + p33 + p30 + p29)))
lola: processed formula length: 144
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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 197245 markings, 1035173 edges
lola: ========================================
lola: subprocess 10 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NOT DEADLOCK AND E (G (A (F ((p253 <= p224 + p223 + p222 + p221 + p249 + p251 + p252))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 3565 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: 21 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (NOT DEADLOCK AND E (G (A (F ((p253 <= p224 + p223 + p222 + p221 + p249 + p251 + p252))))))
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: 21 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: E (G (A (F ((p253 <= p224 + p223 + p222 + p221 + p249 + p251 + p252)))))
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((p253 <= p224 + p223 + p222 + p221 + p249 + p251 + p252)))
lola: processed formula length: 64
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 133 markings, 237 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no no yes no no no yes no yes
lola:
preliminary result: yes yes no no yes no no no yes no yes
lola: memory consumption: 20888 KB
lola: time consumption: 5 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="QuasiCertifProtocol-PT-06"
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 QuasiCertifProtocol-PT-06, 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-158987872400787"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-06.tgz
mv QuasiCertifProtocol-PT-06 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;