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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.8M
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 98K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 373K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 43K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 115K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 421K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 39K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 248K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 912K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.6K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.8K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 3 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 2.5M Apr 27 15:14 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 PhilosophersDyn-PT-10-CTLCardinality-00
FORMULA_NAME PhilosophersDyn-PT-10-CTLCardinality-01
FORMULA_NAME PhilosophersDyn-PT-10-CTLCardinality-02
FORMULA_NAME PhilosophersDyn-PT-10-CTLCardinality-03
FORMULA_NAME PhilosophersDyn-PT-10-CTLCardinality-04
FORMULA_NAME PhilosophersDyn-PT-10-CTLCardinality-05
FORMULA_NAME PhilosophersDyn-PT-10-CTLCardinality-06
FORMULA_NAME PhilosophersDyn-PT-10-CTLCardinality-07
FORMULA_NAME PhilosophersDyn-PT-10-CTLCardinality-08
FORMULA_NAME PhilosophersDyn-PT-10-CTLCardinality-09
FORMULA_NAME PhilosophersDyn-PT-10-CTLCardinality-10
FORMULA_NAME PhilosophersDyn-PT-10-CTLCardinality-11
FORMULA_NAME PhilosophersDyn-PT-10-CTLCardinality-12
FORMULA_NAME PhilosophersDyn-PT-10-CTLCardinality-13
FORMULA_NAME PhilosophersDyn-PT-10-CTLCardinality-14
FORMULA_NAME PhilosophersDyn-PT-10-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591137221589

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 22:33:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-02 22:33:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 22:33:43] [INFO ] Load time of PNML (sax parser for PT used): 223 ms
[2020-06-02 22:33:43] [INFO ] Transformed 170 places.
[2020-06-02 22:33:43] [INFO ] Transformed 2310 transitions.
[2020-06-02 22:33:43] [INFO ] Parsed PT model containing 170 places and 2310 transitions in 273 ms.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 41 ms.
Incomplete random walk after 100000 steps, including 11932 resets, run finished after 2085 ms. (steps per millisecond=47 ) properties seen :[1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1]
[2020-06-02 22:33:45] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2020-06-02 22:33:45] [INFO ] Computed 39 place invariants in 66 ms
[2020-06-02 22:33:45] [INFO ] [Real]Absence check using 27 positive place invariants in 29 ms returned sat
[2020-06-02 22:33:45] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 6 ms returned sat
[2020-06-02 22:33:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:33:46] [INFO ] [Real]Absence check using state equation in 828 ms returned sat
[2020-06-02 22:33:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:33:46] [INFO ] [Nat]Absence check using 27 positive place invariants in 23 ms returned sat
[2020-06-02 22:33:46] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 7 ms returned sat
[2020-06-02 22:33:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:33:47] [INFO ] [Nat]Absence check using state equation in 735 ms returned sat
[2020-06-02 22:33:47] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2020-06-02 22:33:48] [INFO ] [Nat]Added 1030 Read/Feed constraints in 1045 ms returned sat
[2020-06-02 22:33:49] [INFO ] Deduced a trap composed of 48 places in 453 ms
[2020-06-02 22:33:49] [INFO ] Deduced a trap composed of 56 places in 380 ms
[2020-06-02 22:33:50] [INFO ] Deduced a trap composed of 48 places in 367 ms
[2020-06-02 22:33:50] [INFO ] Deduced a trap composed of 48 places in 359 ms
[2020-06-02 22:33:50] [INFO ] Deduced a trap composed of 48 places in 309 ms
[2020-06-02 22:33:51] [INFO ] Deduced a trap composed of 48 places in 369 ms
[2020-06-02 22:33:51] [INFO ] Deduced a trap composed of 56 places in 348 ms
[2020-06-02 22:33:52] [INFO ] Deduced a trap composed of 56 places in 338 ms
[2020-06-02 22:33:52] [INFO ] Deduced a trap composed of 56 places in 299 ms
[2020-06-02 22:33:53] [INFO ] Deduced a trap composed of 72 places in 398 ms
[2020-06-02 22:33:53] [INFO ] Deduced a trap composed of 48 places in 391 ms
[2020-06-02 22:33:53] [INFO ] Deduced a trap composed of 56 places in 382 ms
[2020-06-02 22:33:54] [INFO ] Deduced a trap composed of 48 places in 333 ms
[2020-06-02 22:33:54] [INFO ] Deduced a trap composed of 48 places in 335 ms
[2020-06-02 22:33:55] [INFO ] Deduced a trap composed of 40 places in 384 ms
[2020-06-02 22:33:56] [INFO ] Deduced a trap composed of 56 places in 410 ms
[2020-06-02 22:33:56] [INFO ] Deduced a trap composed of 48 places in 407 ms
[2020-06-02 22:33:57] [INFO ] Deduced a trap composed of 48 places in 399 ms
[2020-06-02 22:33:57] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 8362 ms
[2020-06-02 22:33:57] [INFO ] Computed and/alt/rep : 2220/268350/1860 causal constraints in 707 ms.
[2020-06-02 22:34:06] [INFO ] Added : 95 causal constraints over 19 iterations in 9739 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-02 22:34:06] [INFO ] [Real]Absence check using 27 positive place invariants in 5 ms returned unsat
[2020-06-02 22:34:06] [INFO ] [Real]Absence check using 27 positive place invariants in 17 ms returned sat
[2020-06-02 22:34:07] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 11 ms returned sat
[2020-06-02 22:34:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:34:07] [INFO ] [Real]Absence check using state equation in 610 ms returned sat
[2020-06-02 22:34:07] [INFO ] [Real]Added 1030 Read/Feed constraints in 216 ms returned sat
[2020-06-02 22:34:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:34:07] [INFO ] [Nat]Absence check using 27 positive place invariants in 20 ms returned sat
[2020-06-02 22:34:07] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 8 ms returned sat
[2020-06-02 22:34:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:34:08] [INFO ] [Nat]Absence check using state equation in 822 ms returned sat
[2020-06-02 22:34:09] [INFO ] [Nat]Added 1030 Read/Feed constraints in 685 ms returned sat
[2020-06-02 22:34:09] [INFO ] Computed and/alt/rep : 2220/268350/1860 causal constraints in 389 ms.
[2020-06-02 22:34:27] [INFO ] Added : 145 causal constraints over 29 iterations in 18392 ms. Result :unknown
[2020-06-02 22:34:27] [INFO ] [Real]Absence check using 27 positive place invariants in 13 ms returned unsat
[2020-06-02 22:34:28] [INFO ] [Real]Absence check using 27 positive place invariants in 5 ms returned unsat
[2020-06-02 22:34:28] [INFO ] [Real]Absence check using 27 positive place invariants in 10 ms returned unsat
[2020-06-02 22:34:28] [INFO ] [Real]Absence check using 27 positive place invariants in 12 ms returned sat
[2020-06-02 22:34:28] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned unsat
[2020-06-02 22:34:28] [INFO ] [Real]Absence check using 27 positive place invariants in 7 ms returned sat
[2020-06-02 22:34:28] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 1 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 6 simplifications.
[2020-06-02 22:34:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-02 22:34:28] [INFO ] Flatten gal took : 361 ms
[2020-06-02 22:34:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-02 22:34:28] [INFO ] Flatten gal took : 160 ms
FORMULA PhilosophersDyn-PT-10-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 22:34:28] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2020-06-02 22:34:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 31 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ PhilosophersDyn-PT-10 @ 3570 seconds
check_solution: Variable C31 = -0.921983284479 is below its lower bound 0
check_solution: Variable C35 = -0.921983284479 is below its lower bound 0
check_solution: Variable C47 = -0.921983284479 is below its lower bound 0
check_solution: Variable C48 = -0.921983284479 is below its lower bound 0
check_solution: Variable C50 = -0.921983284479 is below its lower bound 0
check_solution: Variable C56 = -0.921983284479 is below its lower bound 0
check_solution: Variable C65 = -0.921983284479 is below its lower bound 0
check_solution: Variable C66 = -0.921983284479 is below its lower bound 0
check_solution: Variable C77 = -0.921983284479 is below its lower bound 0
check_solution: Variable C79 = -0.921983284479 is below its lower bound 0

Seriously low accuracy found ||*|| = 20.3524 (rel. error 20.3524)
check_solution: Constraint R1 = 1e+30 is above its equality of -1
check_solution: Constraint R2 = 1e+30 is above its equality of 0
check_solution: Constraint R3 = 1e+30 is above its equality of 0
check_solution: Constraint R4 = 1e+30 is above its equality of 0
check_solution: Constraint R5 = 1e+30 is above its equality of 0
check_solution: Constraint R6 = 1e+30 is above its equality of 0
check_solution: Constraint R7 = 1e+30 is above its equality of 0
check_solution: Constraint R8 = 1e+30 is above its equality of 0
check_solution: Constraint R9 = 1e+30 is above its equality of 0
check_solution: Constraint R10 = 1e+30 is above its equality of 0

Seriously low accuracy found ||*|| = 1e+30 (rel. error 1)

FORMULA PhilosophersDyn-PT-10-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA PhilosophersDyn-PT-10-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA PhilosophersDyn-PT-10-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3453
rslt: Output for CTLCardinality @ PhilosophersDyn-PT-10

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Jun 2 22:34:29 2020
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 248
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 120,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 120,
"visible_transitions": 0
},
"processed": "EX((EX((1 <= p2 + p102 + p112 + p116 + p145 + p166 + p94 + p59 + p38 + p77)) AND AF((p1 + p5 + p6 + p7 + p8 + p9 + p100 + p101 + p103 + p104 + p105 + p110 + p111 + p113 + p114 + p117 + p118 + p119 + p121 + p122 + p123 + p126 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p137 + p139 + p142 + p143 + p147 + p148 + p149 + p150 + p151 + p154 + p156 + p158 + p162 + p163 + p164 + p167 + p168 + p169 + p10 + p14 + p15 + p17 + p18 + p20 + p23 + p74 + p25 + p27 + p28 + p29 + p32 + p33 + p34 + p36 + p37 + p69 + p40 + p64 + p44 + p45 + p62 + p48 + p49 + p50 + p51 + p52 + p53 + p61 + p55 + p56 + p57 + p60 + p54 + p67 + p70 + p73 + p76 + p78 + p79 + p80 + p82 + p84 + p85 + p88 + p89 + p90 + p91 + p92 + p93 + p95 <= p106 + p109 + p125 + p141 + p144 + p160 + p161 + p16 + p81 + p87))))",
"processed_size": 790,
"rewrites": 36
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 494,
"markings": 470,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 267
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "E (F ((3 <= p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98)))",
"processed_size": 75,
"rewrites": 34
},
"result":
{
"edges": 558832,
"markings": 199051,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 287
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((p101 <= p147) OR (p69 <= p112))))",
"processed_size": 42,
"rewrites": 35
},
"result":
{
"produced_by": "state equation",
"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",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 314
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "E (F ((3 <= p2 + p102 + p112 + p116 + p145 + p166 + p94 + p59 + p38 + p77)))",
"processed_size": 76,
"rewrites": 34
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 345
},
"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 ((p73 <= p111)))",
"processed_size": 21,
"rewrites": 34
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 116
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 383
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p44 <= p158) OR (1 <= p12))",
"processed_size": 30,
"rewrites": 36
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 136
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 431
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"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": "EG(AF((p0 + 1 <= p122)))",
"processed_size": 24,
"rewrites": 35
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 493
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "EG((EG((p167 <= p29)) OR ((p88 + 1 <= p12))))",
"processed_size": 45,
"rewrites": 35
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 25,
"markings": 9,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 575
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 160,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 130,
"visible_transitions": 0
},
"processed": "EG((AF((p4 + p136 + p11 + p21 + p22 + p41 + p58 + p46 + p72 + p86 <= p124 + p138 + p159 + p30 + p71 + p66 + p65 + p24 + p12 + p99)) OR ((2 <= p124 + p138 + p159 + p30 + p71 + p66 + p65 + p24 + p12 + p99) OR ((p1 + p5 + p6 + p7 + p8 + p9 + p100 + p101 + p103 + p104 + p105 + p110 + p111 + p113 + p114 + p117 + p118 + p119 + p121 + p122 + p123 + p126 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p137 + p139 + p142 + p143 + p147 + p148 + p149 + p150 + p151 + p154 + p156 + p158 + p162 + p163 + p164 + p167 + p168 + p169 + p10 + p14 + p15 + p17 + p18 + p20 + p23 + p74 + p25 + p27 + p28 + p29 + p32 + p33 + p34 + p36 + p37 + p69 + p40 + p64 + p44 + p45 + p62 + p48 + p49 + p50 + p51 + p52 + p53 + p61 + p55 + p56 + p57 + p60 + p54 + p67 + p70 + p73 + p76 + p78 + p79 + p80 + p82 + p84 + p85 + p88 + p89 + p90 + p91 + p92 + p93 + p95 <= p4 + p136 + p11 + p21 + p22 + p41 + p58 + p46 + p72 + p86) OR (p0 + p107 + p115 + p152 + p153 + p155 + p19 + p63 + p43 + p83 + 1 <= p4 + p136 + p11 + p21 + p22 + p41 + p58 + p46 + p72 + p86)))))",
"processed_size": 1040,
"rewrites": 35
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 460,
"markings": 192,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 690
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p14 <= p169)",
"processed_size": 13,
"rewrites": 33
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 863
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p41 <= 0) OR (p47 + 1 <= p79))",
"processed_size": 33,
"rewrites": 33
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1151
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p56 <= p2)",
"processed_size": 11,
"rewrites": 36
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 61
},
"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": 10,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 863
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((1 <= p61))",
"processed_size": 12,
"rewrites": 36
},
"result":
{
"edges": 654,
"markings": 280,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 32
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1151
},
"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": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "(p2 + p102 + p112 + p116 + p145 + p166 + p94 + p59 + p38 + p77 <= 2)",
"processed_size": 68,
"rewrites": 36
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1727
},
"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": "(p106 + p109 + p125 + p141 + p144 + p160 + p161 + p16 + p81 + p87 + 1 <= p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98)",
"processed_size": 134,
"rewrites": 37
},
"result":
{
"edges": 1623,
"markings": 649,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 110
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3453
},
"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": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "(p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98 <= 2)",
"processed_size": 67,
"rewrites": 37
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

{
"child":
[

{
"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": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "(p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98 <= 2)",
"processed_size": 67,
"rewrites": 37
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 260,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 150,
"visible_transitions": 0
},
"processed": "((p2 + p102 + p112 + p116 + p145 + p166 + p94 + p59 + p38 + p77 + 1 <= p3 + p108 + p127 + p140 + p146 + p97 + p13 + p31 + p35 + p47) AND ((p2 + p102 + p112 + p116 + p145 + p166 + p94 + p59 + p38 + p77 <= 1) OR (2 <= p1 + p5 + p6 + p7 + p8 + p9 + p100 + p101 + p103 + p104 + p105 + p110 + p111 + p113 + p114 + p117 + p118 + p119 + p121 + p122 + p123 + p126 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p137 + p139 + p142 + p143 + p147 + p148 + p149 + p150 + p151 + p154 + p156 + p158 + p162 + p163 + p164 + p167 + p168 + p169 + p10 + p14 + p15 + p17 + p18 + p20 + p23 + p74 + p25 + p27 + p28 + p29 + p32 + p33 + p34 + p36 + p37 + p69 + p40 + p64 + p44 + p45 + p62 + p48 + p49 + p50 + p51 + p52 + p53 + p61 + p55 + p56 + p57 + p60 + p54 + p67 + p70 + p73 + p76 + p78 + p79 + p80 + p82 + p84 + p85 + p88 + p89 + p90 + p91 + p92 + p93 + p95) OR ((p4 + p136 + p11 + p21 + p22 + p41 + p58 + p46 + p72 + p86 <= p124 + p138 + p159 + p30 + p71 + p66 + p65 + p24 + p12 + p99) AND (p1 + p5 + p6 + p7 + p8 + p9 + p100 + p101 + p103 + p104 + p105 + p110 + p111 + p113 + p114 + p117 + p118 + p119 + p121 + p122 + p123 + p126 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p137 + p139 + p142 + p143 + p147 + p148 + p149 + p150 + p151 + p154 + p156 + p158 + p162 + p163 + p164 + p167 + p168 + p169 + p10 + p14 + p15 + p17 + p18 + p20 + p23 + p74 + p25 + p27 + p28 + p29 + p32 + p33 + p34 + p36 + p37 + p69 + p40 + p64 + p44 + p45 + p62 + p48 + p49 + p50 + p51 + p52 + p53 + p61 + p55 + p56 + p57 + p60 + p54 + p67 + p70 + p73 + p76 + p78 + p79 + p80 + p82 + p84 + p85 + p88 + p89 + p90 + p91 + p92 + p93 + p95 <= p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98))))",
"processed_size": 1687,
"rewrites": 33
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 106636,
"runtime": 117.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(G((A(F(**)) OR (** OR (** OR **))))) : (NODEADLOCK OR A(X(A(G(**))))) : A(F(A(G(**)))) : E(X((E(X(**)) AND A(F(**))))) : (A(F(A(G(**)))) OR **) : E(F(**)) : (A(X(*)) AND E(F(**))) : E(G(E(F(*)))) : E(G(A(F(*)))) : E(G(E(F(**)))) : A(G(**)) : E(G(**)) : (** AND (A(F(*)) AND **)) : E(G((E(G(**)) OR **))) : A(F(*))"
},
"net":
{
"arcs": 17110,
"conflict_clusters": 1,
"places": 170,
"places_significant": 131,
"singleton_clusters": 0,
"transitions": 2265
},
"result":
{
"preliminary_value": "yes yes no no no yes no yes no yes no yes no yes no ",
"value": "yes yes no no no yes no yes no yes no yes no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 2435/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 5440
lola: finding significant places
lola: 170 places, 2265 transitions, 131 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: (3 <= p39)
lola: LP says that atomic proposition is always false: (2 <= p155)
lola: LP says that atomic proposition is always false: (2 <= p81)
lola: LP says that atomic proposition is always false: (2 <= p139)
lola: E (G ((((A (F ((p4 + p136 + p11 + p21 + p22 + p41 + p58 + p46 + p72 + p86 <= p124 + p138 + p159 + p30 + p71 + p66 + p65 + p24 + p12 + p99))) OR (2 <= p124 + p138 + p159 + p30 + p71 + p66 + p65 + p24 + p12 + p99)) OR (p1 + p5 + p6 + p7 + p8 + p9 + p100 + p101 + p103 + p104 + p105 + p110 + p111 + p113 + p114 + p117 + p118 + p119 + p121 + p122 + p123 + p126 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p137 + p139 + p142 + p143 + p147 + p148 + p149 + p150 + p151 + p154 + p156 + p158 + p162 + p163 + p164 + p167 + p168 + p169 + p10 + p14 + p15 + p17 + p18 + p20 + p23 + p74 + p25 + p27 + p28 + p29 + p32 + p33 + p34 + p36 + p37 + p69 + p40 + p64 + p44 + p45 + p62 + p48 + p49 + p50 + p51 + p52 + p53 + p61 + p55 + p56 + p57 + p60 + p54 + p67 + p70 + p73 + p76 + p78 + p79 + p80 + p82 + p84 + p85 + p88 + p89 + p90 + p91 + p92 + p93 + p95 <= p4 + p136 + p11 + p21 + p22 + p41 + p58 + p46 + p72 + p86)) OR (p0 + p107 + p115 + p152 + p153 + p155 + p19 + p63 + p43 + p83 + 1 <= p4 + p136 + p11 + p21 + p22 + p41 + p58 + p46 + p72 + p86)))) : (E (X (E (G ((0 <= 0))))) OR A (G (A (X ((p3 + p108 + p127 + p140 + p146 + p97 + p13 + p31 + p35 + p47 <= p124 + p138 + p159 + p30 + p71 + p66 + p65 + p24 + p12 + p99)))))) : A (F (A (G ((p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98 <= p106 + p109 + p125 + p141 + p144 + p160 + p161 + p16 + p81 + p87))))) : E (X ((E (X ((1 <= p2 + p102 + p112 + p116 + p145 + p166 + p94 + p59 + p38 + p77))) AND A (F ((p1 + p5 + p6 + p7 + p8 + p9 + p100 + p101 + p103 + p104 + p105 + p110 + p111 + p113 + p114 + p117 + p118 + p119 + p121 + p122 + p123 + p126 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p137 + p139 + p142 + p143 + p147 + p148 + p149 + p150 + p151 + p154 + p156 + p158 + p162 + p163 + p164 + p167 + p168 + p169 + p10 + p14 + p15 + p17 + p18 + p20 + p23 + p74 + p25 + p27 + p28 + p29 + p32 + p33 + p34 + p36 + p37 + p69 + p40 + p64 + p44 + p45 + p62 + p48 + p49 + p50 + p51 + p52 + p53 + p61 + p55 + p56 + p57 + p60 + p54 + p67 + p70 + p73 + p76 + p78 + p79 + p80 + p82 + p84 + p85 + p88 + p89 + p90 + p91 + p92 + p93 + p95 <= p106 + p109 + p125 + p141 + p144 + p160 + p161 + p16 + p81 + p87)))))) : (A (F (A (G ((3 <= p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98))))) OR ((p2 + p102 + p112 + p116 + p145 + p166 + p94 + p59 + p38 + p77 + 1 <= p3 + p108 + p127 + p140 + p146 + p97 + p13 + p31 + p35 + p47) AND ((p2 + p102 + p112 + p116 + p145 + p166 + p94 + p59 + p38 + p77 <= 1) OR (2 <= p1 + p5 + p6 + p7 + p8 + p9 + p100 + p101 + p103 + p104 + p105 + p110 + p111 + p113 + p114 + p117 + p118 + p119 + p121 + p122 + p123 + p126 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p137 + p139 + p142 + p143 + p147 + p148 + p149 + p150 + p151 + p154 + p156 + p158 + p162 + p163 + p164 + p167 + p168 + p169 + p10 + p14 + p15 + p17 + p18 + p20 + p23 + p74 + p25 + p27 + p28 + p29 + p32 + p33 + p34 + p36 + p37 + p69 + p40 + p64 + p44 + p45 + p62 + p48 + p49 + p50 + p51 + p52 + p53 + p61 + p55 + p56 + p57 + p60 + p54 + p67 + p70 + p73 + p76 + p78 + p79 + p80 + p82 + p84 + p85 + p88 + p89 + p90 + p91 + p92 + p93 + p95) OR ((p4 + p136 + p11 + p21 + p22 + p41 + p58 + p46 + p72 + p86 <= p124 + p138 + p159 + p30 + p71 + p66 + p65 + p24 + p12 + p99) AND (p1 + p5 + p6 + p7 + p8 + p9 + p100 + p101 + p103 + p104 + p105 + p110 + p111 + p113 + p114 + p117 + p118 + p119 + p121 + p122 + p123 + p126 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p137 + p139 + p142 + p143 + p147 + p148 + p149 + p150 + p151 + p154 + p156 + p158 + p162 + p163 + p164 + p167 + p168 + p169 + p10 + p14 + p15 + p17 + p18 + p20 + p23 + p74 + p25 + p27 + p28 + p29 + p32 + p33 + p34 + p36 + p37 + p69 + p40 + p64 + p44 + p45 + p62 + p48 + p49 + p50 + p51 + p52 + p53 + p61 + p55 + p56 + p57 + p60 + p54 + p67 + p70 + p73 + p76 + p78 + p79 + p80 + p82 + p84 + p85 + p88 + p89 + p90 + p91 + p92 + p93 + p95 <= p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98))))) : E (((3 <= p1 + p5 + p6 + p7 + p8 + p9 + p100 + p101 + p103 + p104 + p105 + p110 + p111 + p113 + p114 + p117 + p118 + p119 + p121 + p122 + p123 + p126 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p137 + p139 + p142 + p143 + p147 + p148 + p149 + p150 + p151 + p154 + p156 + p158 + p162 + p163 + p164 + p167 + p168 + p169 + p10 + p14 + p15 + p17 + p18 + p20 + p23 + p74 + p25 + p27 + p28 + p29 + p32 + p33 + p34 + p36 + p37 + p69 + p40 + p64 + p44 + p45 + p62 + p48 + p49 + p50 + p51 + p52 + p53 + p61 + p55 + p56 + p57 + p60 + p54 + p67 + p70 + p73 + p76 + p78 + p79 + p80 + p82 + p84 + p85 + p88 + p89 + p90 + p91 + p92 + p93 + p95) U E (F ((3 <= p2 + p102 + p112 + p116 + p145 + p166 + p94 + p59 + p38 + p77))))) : (NOT(E (X (((3 <= p2 + p102 + p112 + p116 + p145 + p166 + p94 + p59 + p38 + p77) AND (p124 + p138 + p159 + p30 + p71 + p66 + p65 + p24 + p12 + p99 <= p106 + p109 + p125 + p141 + p144 + p160 + p161 + p16 + p81 + p87))))) AND E (F (A (F ((3 <= p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98)))))) : E (G (NOT(A (G ((3 <= p2 + p102 + p112 + p116 + p145 + p166 + p94 + p59 + p38 + p77)))))) : NOT(A (F (E (G ((p122 <= p0)))))) : E (G (E (F (((1 <= p61)))))) : A (G (((p101 <= p147) OR (p69 <= p112)))) : (E (((1 <= 0) U (1 <= 0))) OR E (G ((p73 <= p111)))) : (((p14 <= p169) AND NOT(E (G ((p56 <= p2))))) AND ((p41 <= 0) OR (p47 + 1 <= p79))) : E (G ((E (G ((p167 <= p29))) OR ((p88 + 1 <= p12))))) : NOT(E (G (((p44 <= p158) OR (1 <= p12)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:130
lola: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:473
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
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:326
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 231 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NOT DEADLOCK OR A (X (A (G ((p3 + p108 + p127 + p140 + p146 + p97 + p13 + p31 + p35 + p47 <= p124 + p138 + p159 + p30 + p71 + p66 + p65 + p24 + p12 + p99))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 231 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: 33 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 248 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((E (X ((1 <= p2 + p102 + p112 + p116 + p145 + p166 + p94 + p59 + p38 + p77))) AND A (F ((p1 + p5 + p6 + p7 + p8 + p9 + p100 + p101 + p103 + p104 + p105 + p110 + p111 + p113 + p114 + p117 + p118 + p119 + p121 + p122 + p123 + p126 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p137 + p139 + p142 + p143 + p147 + p148 + p149 + p150 + p151 + p154 + p156 + p158 + p162 + p163 + p164 + p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((EX((1 <= p2 + p102 + p112 + p116 + p145 + p166 + p94 + p59 + p38 + p77)) AND AF((p1 + p5 + p6 + p7 + p8 + p9 + p100 + p101 + p103 + p104 + p105 + p110 + p111 + p113 + p114 + p117 + p118 + p119 + p121 + p122 + p123 + p126 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p137 + p139 + p142 + p143 + p147 + p148 + p149 + p150 + p151 + p154 + p156 + p158 + p162 + p163 + p164 + p167 + p168 ... (shortened)
lola: processed formula length: 790
lola: 36 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 470 markings, 494 edges
lola: ========================================
lola: subprocess 2 will run for 267 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (((p2 + p102 + p112 + p116 + p145 + p166 + p94 + p59 + p38 + p77 <= 2) OR (p106 + p109 + p125 + p141 + p144 + p160 + p161 + p16 + p81 + p87 + 1 <= p124 + p138 + p159 + p30 + p71 + p66 + p65 + p24 + p12 + p99)))) AND E (F ((3 <= p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 267 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((3 <= p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98)))
lola: processed formula length: 75
lola: 34 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98)
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-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-2-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 43756 markings, 112414 edges, 8751 markings/sec, 0 secs
lola: sara is running 5 secs || 91230 markings, 244969 edges, 9495 markings/sec, 5 secs
lola: sara is running 10 secs || 135531 markings, 370668 edges, 8860 markings/sec, 10 secs
lola: sara is running 15 secs || 183294 markings, 510905 edges, 9553 markings/sec, 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 199051 markings, 558832 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p101 <= p147) OR (p69 <= p112))))
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 (((p101 <= p147) OR (p69 <= p112))))
lola: processed formula length: 42
lola: 35 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: ((p147 + 1 <= p101) AND (p112 + 1 <= p69))
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.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 314 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p2 + p102 + p112 + p116 + p145 + p166 + p94 + p59 + p38 + p77)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((3 <= p2 + p102 + p112 + p116 + p145 + p166 + p94 + p59 + p38 + p77)))
lola: processed formula length: 76
lola: 34 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p2 + p102 + p112 + p116 + p145 + p166 + p94 + p59 + p38 + p77)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 5 will run for 345 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p73 <= p111)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p73 <= p111)))
lola: processed formula length: 21
lola: 34 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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 8 markings, 7 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p111 + 1 <= p73)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 6 will run for 383 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p158 + 1 <= p44) AND (p12 <= 0))))
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:788
lola: processed formula: ((p44 <= p158) OR (1 <= p12))
lola: processed formula length: 30
lola: 36 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: ((p158 + 1 <= p44) AND (p12 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 7 will run for 431 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((p0 + 1 <= p122)))))
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((p0 + 1 <= p122)))
lola: processed formula length: 24
lola: 35 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 9 markings, 9 edges
lola: ========================================
lola: subprocess 8 will run for 493 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E (G ((p167 <= p29))) OR ((p88 + 1 <= p12)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((EG((p167 <= p29)) OR ((p88 + 1 <= p12))))
lola: processed formula length: 45
lola: 35 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 9 markings, 25 edges
lola: ========================================
lola: subprocess 9 will run for 575 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (F ((p4 + p136 + p11 + p21 + p22 + p41 + p58 + p46 + p72 + p86 <= p124 + p138 + p159 + p30 + p71 + p66 + p65 + p24 + p12 + p99))) OR ((2 <= p124 + p138 + p159 + p30 + p71 + p66 + p65 + p24 + p12 + p99) OR ((p1 + p5 + p6 + p7 + p8 + p9 + p100 + p101 + p103 + p104 + p105 + p110 + p111 + p113 + p114 + p117 + p118 + p119 + p121 + p122 + p123 + p126 + p128 + p129 + p130 + p131 + p132 + p133 + ... (shortened)
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((p4 + p136 + p11 + p21 + p22 + p41 + p58 + p46 + p72 + p86 <= p124 + p138 + p159 + p30 + p71 + p66 + p65 + p24 + p12 + p99)) OR ((2 <= p124 + p138 + p159 + p30 + p71 + p66 + p65 + p24 + p12 + p99) OR ((p1 + p5 + p6 + p7 + p8 + p9 + p100 + p101 + p103 + p104 + p105 + p110 + p111 + p113 + p114 + p117 + p118 + p119 + p121 + p122 + p123 + p126 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + ... (shortened)
lola: processed formula length: 1040
lola: 35 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: 192 markings, 460 edges
lola: ========================================
lola: subprocess 10 will run for 690 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p14 <= p169) AND (A (F ((p2 + 1 <= p56))) AND ((p41 <= 0) OR (p47 + 1 <= p79))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 690 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p14 <= p169)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p14 <= p169)
lola: processed formula length: 13
lola: 33 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 11 will run for 863 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p41 <= 0) OR (p47 + 1 <= p79))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p41 <= 0) OR (p47 + 1 <= p79))
lola: processed formula length: 33
lola: 33 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 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 12 will run for 1151 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p2 + 1 <= p56)))
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:788
lola: processed formula: (p56 <= p2)
lola: processed formula length: 11
lola: 36 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: (p2 + 1 <= p56)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 9 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 863 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((1 <= p61))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: ((1 <= p61))
lola: processed formula length: 12
lola: 36 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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p61 <= 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 /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 280 markings, 654 edges
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p61))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: subprocess 12 will run for 1151 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((p2 + p102 + p112 + p116 + p145 + p166 + p94 + p59 + p38 + p77 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: (p2 + p102 + p112 + p116 + p145 + p166 + p94 + p59 + p38 + p77 <= 2)
lola: processed formula length: 68
lola: 36 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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 9 markings, 8 edges
lola: ========================================
lola: ========================================
lola: subprocess 13 will run for 1727 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98 <= p106 + p109 + p125 + p141 + p144 + p160 + p161 + p16 + p81 + p87)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p106 + p109 + p125 + p141 + p144 + p160 + p161 + p16 + p81 + p87 + 1 <= p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98)
lola: processed formula length: 134
lola: 37 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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result started, id 1
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 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p106 + p109 + p125 + p141 + p144 + p160 + p161 + p16 + p81 + p87 + 1 <= p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 649 markings, 1623 edges
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: (p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98 <= p106 + p109 + p125 + p141 + p144 + p160 + p161 + p16 + p81 + p87)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: subprocess 14 will run for 3453 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (A (G ((3 <= p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98))))) OR ((p2 + p102 + p112 + p116 + p145 + p166 + p94 + p59 + p38 + p77 + 1 <= p3 + p108 + p127 + p140 + p146 + p97 + p13 + p31 + p35 + p47) AND ((p2 + p102 + p112 + p116 + p145 + p166 + p94 + p59 + p38 + p77 <= 1) OR (2 <= p1 + p5 + p6 + p7 + p8 + p9 + p100 + p101 + p103 + p104 + p105 + p110 + p111 + p113 + p114 + p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 3453 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((3 <= p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: ========================================
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98 <= 2)
lola: processed formula length: 67
lola: 37 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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98 <= 2)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 9 markings, 8 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 (A (G ((3 <= p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98))))) OR ((p2 + p102 + p112 + p116 + p145 + p166 + p94 + p59 + p38 + p77 + 1 <= p3 + p108 + p127 + p140 + p146 + p97 + p13 + p31 + p35 + p47) AND ((p2 + p102 + p112 + p116 + p145 + p166 + p94 + p59 + p38 + p77 <= 1) OR (2 <= p1 + p5 + p6 + p7 + p8 + p9 + p100 + p101 + p103 + p104 + p105 + p110 + p111 + p113 + p114 + p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((3 <= p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98 <= 2)
lola: processed formula length: 67
lola: 37 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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
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 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98 <= 2)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 9 markings, 8 edges
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: (3 <= p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98)
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: ((p2 + p102 + p112 + p116 + p145 + p166 + p94 + p59 + p38 + p77 + 1 <= p3 + p108 + p127 + p140 + p146 + p97 + p13 + p31 + p35 + p47) AND ((p2 + p102 + p112 + p116 + p145 + p166 + p94 + p59 + p38 + p77 <= 1) OR (2 <= p1 + p5 + p6 + p7 + p8 + p9 + p100 + p101 + p103 + p104 + p105 + p110 + p111 + p113 + p114 + p117 + p118 + p119 + p121 + p122 + p123 + p126 + p128 + p129 + p130 + p131 + p132 + p133 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p2 + p102 + p112 + p116 + p145 + p166 + p94 + p59 + p38 + p77 + 1 <= p3 + p108 + p127 + p140 + p146 + p97 + p13 + p31 + p35 + p47) AND ((p2 + p102 + p112 + p116 + p145 + p166 + p94 + p59 + p38 + p77 <= 1) OR (2 <= p1 + p5 + p6 + p7 + p8 + p9 + p100 + p101 + p103 + p104 + p105 + p110 + p111 + p113 + p114 + p117 + p118 + p119 + p121 + p122 + p123 + p126 + p128 + p129 + p130 + p131 + p132 + p133 +... (shortened)
lola: processed formula length: 1687
lola: 33 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 5 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no no no yes no yes no yes no yes no yes no
lola:
preliminary result: yes yes no no no yes no yes no yes no yes no yes no
lola: memory consumption: 106636 KB
lola: time consumption: 117 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="PhilosophersDyn-PT-10"
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 PhilosophersDyn-PT-10, 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-158987871600243"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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