Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 3.0K Mar 26 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 26 02:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 22:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 22:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 14:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 177K 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 BusinessProcesses-PT-18-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591166177697

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 06:36:21] [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 06:36:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 06:36:21] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2020-06-03 06:36:21] [INFO ] Transformed 717 places.
[2020-06-03 06:36:21] [INFO ] Transformed 642 transitions.
[2020-06-03 06:36:21] [INFO ] Found NUPN structural information;
[2020-06-03 06:36:21] [INFO ] Parsed PT model containing 717 places and 642 transitions in 261 ms.
Deduced a syphon composed of 15 places in 21 ms
Reduce places removed 15 places and 15 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 105 ms.
Incomplete random walk after 100000 steps, including 529 resets, run finished after 422 ms. (steps per millisecond=236 ) properties seen :[0, 1, 0, 1, 0, 0, 1, 1, 0, 1]
// Phase 1: matrix 627 rows 702 cols
[2020-06-03 06:36:22] [INFO ] Computed 114 place invariants in 33 ms
[2020-06-03 06:36:23] [INFO ] [Real]Absence check using 73 positive place invariants in 319 ms returned sat
[2020-06-03 06:36:23] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 39 ms returned sat
[2020-06-03 06:36:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:36:25] [INFO ] [Real]Absence check using state equation in 2038 ms returned sat
[2020-06-03 06:36:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:36:26] [INFO ] [Nat]Absence check using 73 positive place invariants in 455 ms returned sat
[2020-06-03 06:36:26] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 40 ms returned sat
[2020-06-03 06:36:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:36:28] [INFO ] [Nat]Absence check using state equation in 1973 ms returned sat
[2020-06-03 06:36:30] [INFO ] Deduced a trap composed of 13 places in 1877 ms
[2020-06-03 06:36:30] [INFO ] Deduced a trap composed of 12 places in 847 ms
[2020-06-03 06:36:31] [INFO ] Deduced a trap composed of 8 places in 534 ms
[2020-06-03 06:36:32] [INFO ] Deduced a trap composed of 14 places in 464 ms
[2020-06-03 06:36:33] [INFO ] Deduced a trap composed of 18 places in 912 ms
[2020-06-03 06:36:33] [INFO ] Deduced a trap composed of 15 places in 326 ms
[2020-06-03 06:36:37] [INFO ] Deduced a trap composed of 19 places in 4476 ms
[2020-06-03 06:36:46] [INFO ] Deduced a trap composed of 23 places in 8311 ms
[2020-06-03 06:36:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s242 s243 s244 s246 s247 s250 s259 s476 s477 s478 s482 s487 s665 s666) 0)") while checking expression at index 0
[2020-06-03 06:36:46] [INFO ] [Real]Absence check using 73 positive place invariants in 283 ms returned sat
[2020-06-03 06:36:46] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 98 ms returned sat
[2020-06-03 06:36:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:36:51] [INFO ] [Real]Absence check using state equation in 4794 ms returned sat
[2020-06-03 06:36:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:36:52] [INFO ] [Nat]Absence check using 73 positive place invariants in 271 ms returned sat
[2020-06-03 06:36:52] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 72 ms returned sat
[2020-06-03 06:36:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:36:57] [INFO ] [Nat]Absence check using state equation in 5031 ms returned sat
[2020-06-03 06:37:01] [INFO ] Deduced a trap composed of 16 places in 4377 ms
[2020-06-03 06:37:05] [INFO ] Deduced a trap composed of 18 places in 3833 ms
[2020-06-03 06:37:09] [INFO ] Deduced a trap composed of 8 places in 3836 ms
[2020-06-03 06:37:13] [INFO ] Deduced a trap composed of 26 places in 3606 ms
[2020-06-03 06:37:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s35 s36 s37 s40 s41 s252 s253 s254 s257 s258 s278 s281 s325 s330 s335 s491 s492 s493 s502 s527 s528 s669 s670) 0)") while checking expression at index 1
[2020-06-03 06:37:13] [INFO ] [Real]Absence check using 73 positive place invariants in 339 ms returned sat
[2020-06-03 06:37:13] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 87 ms returned sat
[2020-06-03 06:37:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:37:18] [INFO ] [Real]Absence check using state equation in 4833 ms returned sat
[2020-06-03 06:37:24] [INFO ] Deduced a trap composed of 15 places in 5797 ms
[2020-06-03 06:37:28] [INFO ] Deduced a trap composed of 13 places in 4034 ms
[2020-06-03 06:37:34] [INFO ] Deduced a trap composed of 8 places in 6284 ms
[2020-06-03 06:37:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s278 s281 s334 s335 s336) 0)") while checking expression at index 2
[2020-06-03 06:37:35] [INFO ] [Real]Absence check using 73 positive place invariants in 389 ms returned sat
[2020-06-03 06:37:35] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 83 ms returned sat
[2020-06-03 06:37:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:37:39] [INFO ] [Real]Absence check using state equation in 4243 ms returned sat
[2020-06-03 06:37:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:37:40] [INFO ] [Nat]Absence check using 73 positive place invariants in 349 ms returned sat
[2020-06-03 06:37:40] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 119 ms returned sat
[2020-06-03 06:37:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:37:45] [INFO ] [Nat]Absence check using state equation in 4965 ms returned sat
[2020-06-03 06:37:51] [INFO ] Deduced a trap composed of 8 places in 5953 ms
[2020-06-03 06:37:57] [INFO ] Deduced a trap composed of 13 places in 5805 ms
[2020-06-03 06:38:02] [INFO ] Deduced a trap composed of 15 places in 5672 ms
[2020-06-03 06:38:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s278 s281 s320 s324 s325 s326 s330 s335 s523 s524 s527 s528) 0)") while checking expression at index 3
[2020-06-03 06:38:03] [INFO ] [Real]Absence check using 73 positive place invariants in 341 ms returned sat
[2020-06-03 06:38:03] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 113 ms returned sat
[2020-06-03 06:38:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:38:08] [INFO ] [Real]Absence check using state equation in 4807 ms returned sat
[2020-06-03 06:38:13] [INFO ] Deduced a trap composed of 8 places in 5569 ms
[2020-06-03 06:38:20] [INFO ] Deduced a trap composed of 14 places in 6547 ms
[2020-06-03 06:38:26] [INFO ] Deduced a trap composed of 14 places in 6064 ms
[2020-06-03 06:38:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s265 s491 s492 s493 s669 s670) 0)") while checking expression at index 4
[2020-06-03 06:38:27] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-03 06:38:27] [INFO ] Flatten gal took : 290 ms
[2020-06-03 06:38:27] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-03 06:38:27] [INFO ] Flatten gal took : 107 ms
FORMULA BusinessProcesses-PT-18-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 06:38:27] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 24 ms.
[2020-06-03 06:38:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ BusinessProcesses-PT-18 @ 3570 seconds

FORMULA BusinessProcesses-PT-18-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-18-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-18-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-18-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-18-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-18-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-18-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-18-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-18-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3345
rslt: Output for CTLCardinality @ BusinessProcesses-PT-18

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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": 2,
"visible_transitions": 0
},
"processed": "EX(AG((((p388 <= 0)) OR ((p695 <= 1) AND (1 <= p695)))))",
"processed_size": 57,
"rewrites": 9
},
"net":
{
"conflict_clusters": 538,
"singleton_clusters": 0
},
"result":
{
"edges": 108,
"markings": 109,
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"result":
{
"edges": 161,
"markings": 161,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "deadlock preserving/insertion"
},
"treads": 1,
"type": "dfs"
},
"type": "deadlock",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((((p208 <= 0)) OR ((1 <= p532)))))",
"processed_size": 41,
"rewrites": 9
},
"result":
{
"edges": 146,
"markings": 147,
"produced_by": "state space",
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p679)) AND ((p532 <= 0)))))",
"processed_size": 41,
"rewrites": 8
},
"result":
{
"edges": 214,
"markings": 215,
"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": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((((p164 <= 0)) OR ((1 <= p117)))))",
"processed_size": 41,
"rewrites": 9
},
"result":
{
"edges": 780,
"markings": 620,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 3,
"aneg": 0,
"comp": 3,
"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": "E (F ((((p624 <= 0)) AND ((1 <= p653)) AND ((p291 <= 0)))))",
"processed_size": 59,
"rewrites": 8
},
"result":
{
"edges": 120,
"markings": 121,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 7,
"adisj": 3,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F (((((1 <= p236)) AND ((p118 <= 0))) OR (((1 <= p334)) AND ((p339 <= 0))) OR (((1 <= p530)) AND ((p257 <= 0))))))",
"processed_size": 119,
"rewrites": 8
},
"result":
{
"edges": 84,
"markings": 85,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 3,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E(EG((((p668 <= 0)) OR ((1 <= p244)))) U (((1 <= p563)) AND ((p410 <= 0)) AND (1 <= p131)))",
"processed_size": 92,
"rewrites": 9
},
"net":
{
"conflict_clusters": 538,
"singleton_clusters": 0
},
"result":
{
"edges": 27037848,
"markings": 2814082,
"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"
}
}
],
"exit":
{
"error": null,
"memory": 28156,
"runtime": 225.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : E((E(G(**)) U **)) : E(X(A(G(**)))) : NODEADLOCK : A(G(**)) : E(F(**)) : E(F(DEADLOCK)) : E(F(*)) : E(F(**))"
},
"net":
{
"arcs": 1830,
"conflict_clusters": 538,
"places": 702,
"places_significant": 588,
"singleton_clusters": 0,
"transitions": 627
},
"result":
{
"preliminary_value": "no yes no yes no yes yes yes yes ",
"value": "no yes no yes no yes yes yes 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: 1329/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 702
lola: finding significant places
lola: 702 places, 627 transitions, 588 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p244 <= 1)
lola: LP says that atomic proposition is always true: (p410 <= 1)
lola: LP says that atomic proposition is always true: (p131 <= 1)
lola: LP says that atomic proposition is always true: (p532 <= 1)
lola: LP says that atomic proposition is always true: (p532 <= 1)
lola: LP says that atomic proposition is always true: (p118 <= 1)
lola: LP says that atomic proposition is always true: (p339 <= 1)
lola: LP says that atomic proposition is always true: (p257 <= 1)
lola: LP says that atomic proposition is always true: (p624 <= 1)
lola: LP says that atomic proposition is always true: (p291 <= 1)
lola: A (G ((((p164 <= 0)) OR ((1 <= p117))))) : E ((E (G ((((p668 <= 0)) OR ((1 <= p244))))) U (((1 <= p563)) AND ((p410 <= 0)) AND (1 <= p131)))) : E (X (A (G ((((p388 <= 0)) OR ((p695 <= 1) AND (1 <= p695))))))) : E (X ((0 <= 0))) : A (G ((((p208 <= 0)) OR ((1 <= p532))))) : E (F ((((1 <= p679)) AND ((p532 <= 0))))) : E (F (A (X ((1 <= 0))))) : NOT(A (G (((((p236 <= 0)) OR ((1 <= p118))) AND (((p334 <= 0)) OR ((1 <= p339))) AND (((p530 <= 0)) OR ((1 <= p257))))))) : E (F ((((p624 <= 0)) AND ((1 <= p653)) AND ((p291 <= 0)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
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 396 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: 7 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((((p388 <= 0)) OR ((p695 <= 1) AND (1 <= p695)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AG((((p388 <= 0)) OR ((p695 <= 1) AND (1 <= p695)))))
lola: processed formula length: 57
lola: 9 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: ========================================
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: 109 markings, 108 edges
lola: ========================================
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking reachability of deadlocks
lola: Planning: workflow for deadlock check: search (--findpath=off,--siphontrap=off)
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 deadlock preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The net has deadlock(s).
lola: 161 markings, 161 edges
lola: ========================================
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p208 <= 0)) OR ((1 <= p532)))))
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 ((((p208 <= 0)) OR ((1 <= p532)))))
lola: processed formula length: 41
lola: 9 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: (((1 <= p208)) AND ((p532 <= 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-3-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 147 markings, 146 edges
lola: subprocess 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p679)) AND ((p532 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p679)) AND ((p532 <= 0)))))
lola: processed formula length: 41
lola: 8 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p679)) AND ((p532 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: state equation: write sara problem file to CTLCardinality-4-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 215 markings, 214 edges
lola: ========================================
lola: subprocess 5 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p164 <= 0)) OR ((1 <= p117)))))
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 ((((p164 <= 0)) OR ((1 <= p117)))))
lola: processed formula length: 41
lola: 9 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 620 markings, 780 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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p164)) AND ((p117 <= 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-5-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 6 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p624 <= 0)) AND ((1 <= p653)) AND ((p291 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((p624 <= 0)) AND ((1 <= p653)) AND ((p291 <= 0)))))
lola: processed formula length: 59
lola: 8 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: (((p624 <= 0)) AND ((1 <= p653)) AND ((p291 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 121 markings, 120 edges
lola: state equation: write sara problem file to CTLCardinality-6-0.sara
sara: try reading problem file CTLCardinality-5-0.sara.
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-6-0.sara.
lola: ========================================
lola: subprocess 7 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((((1 <= p236)) AND ((p118 <= 0))) OR (((1 <= p334)) AND ((p339 <= 0))) OR (((1 <= p530)) AND ((p257 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((((1 <= p236)) AND ((p118 <= 0))) OR (((1 <= p334)) AND ((p339 <= 0))) OR (((1 <= p530)) AND ((p257 <= 0))))))
lola: processed formula length: 119
lola: 8 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 85 markings, 84 edges
lola: ========================================
lola: subprocess 8 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (G ((((p668 <= 0)) OR ((1 <= p244))))) U (((1 <= p563)) AND ((p410 <= 0)) AND (1 <= p131))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EG((((p668 <= 0)) OR ((1 <= p244)))) U (((1 <= p563)) AND ((p410 <= 0)) AND (1 <= p131)))
lola: processed formula length: 92
lola: 9 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).
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: 62855 markings, 480223 edges, 12571 markings/sec, 0 secs
lola: 122250 markings, 963894 edges, 11879 markings/sec, 5 secs
lola: 179442 markings, 1449909 edges, 11438 markings/sec, 10 secs
lola: 230993 markings, 1925763 edges, 10310 markings/sec, 15 secs
lola: 286733 markings, 2402956 edges, 11148 markings/sec, 20 secs
lola: 338981 markings, 2899403 edges, 10450 markings/sec, 25 secs
lola: 397321 markings, 3384730 edges, 11668 markings/sec, 30 secs
lola: 450450 markings, 3875335 edges, 10626 markings/sec, 35 secs
lola: 505037 markings, 4356524 edges, 10917 markings/sec, 40 secs
lola: 553915 markings, 4830097 edges, 9776 markings/sec, 45 secs
lola: 601004 markings, 5315330 edges, 9418 markings/sec, 50 secs
lola: 651349 markings, 5794909 edges, 10069 markings/sec, 55 secs
lola: 698309 markings, 6275650 edges, 9392 markings/sec, 60 secs
lola: 746291 markings, 6749687 edges, 9596 markings/sec, 65 secs
lola: 814355 markings, 7289153 edges, 13613 markings/sec, 70 secs
lola: 895795 markings, 8024279 edges, 16288 markings/sec, 75 secs
lola: 1038053 markings, 9413286 edges, 28452 markings/sec, 80 secs
lola: 1202805 markings, 10882594 edges, 32950 markings/sec, 85 secs
lola: 1347348 markings, 12275022 edges, 28909 markings/sec, 90 secs
lola: 1400922 markings, 12812324 edges, 10715 markings/sec, 95 secs
lola: 1448078 markings, 13294077 edges, 9431 markings/sec, 100 secs
lola: 1503641 markings, 13895660 edges, 11113 markings/sec, 105 secs
lola: 1544400 markings, 14351928 edges, 8152 markings/sec, 110 secs
lola: 1595116 markings, 14819764 edges, 10143 markings/sec, 115 secs
lola: 1690074 markings, 15679186 edges, 18992 markings/sec, 120 secs
lola: 1745834 markings, 16193668 edges, 11152 markings/sec, 125 secs
lola: 1865397 markings, 17363744 edges, 23913 markings/sec, 130 secs
lola: 1939637 markings, 18105038 edges, 14848 markings/sec, 135 secs
lola: 2008878 markings, 18817857 edges, 13848 markings/sec, 140 secs
lola: 2067113 markings, 19477335 edges, 11647 markings/sec, 145 secs
lola: 2115664 markings, 19949058 edges, 9710 markings/sec, 150 secs
lola: 2177055 markings, 20558440 edges, 12278 markings/sec, 155 secs
lola: 2252770 markings, 21334365 edges, 15143 markings/sec, 160 secs
lola: 2306795 markings, 21924661 edges, 10805 markings/sec, 165 secs
lola: 2371842 markings, 22608956 edges, 13009 markings/sec, 170 secs
lola: 2437378 markings, 23320436 edges, 13107 markings/sec, 175 secs
lola: 2480226 markings, 23801290 edges, 8570 markings/sec, 180 secs
lola: 2521920 markings, 24269048 edges, 8339 markings/sec, 185 secs
lola: 2560019 markings, 24732620 edges, 7620 markings/sec, 190 secs
lola: 2597342 markings, 25191153 edges, 7465 markings/sec, 195 secs
lola: 2649858 markings, 25658085 edges, 10503 markings/sec, 200 secs
lola: 2706563 markings, 26132490 edges, 11341 markings/sec, 205 secs
lola: 2765197 markings, 26606427 edges, 11727 markings/sec, 210 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2814082 markings, 27037848 edges
lola: RESULT
lola:
SUMMARY: no yes no yes no yes yes yes yes
lola:
preliminary result: no yes no yes no yes yes yes yes
lola: ========================================
lola: memory consumption: 28156 KB
lola: time consumption: 225 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 3166384 kB
After kill :
MemTotal: 16427332 kB
MemFree: 3164368 kB

--------------------
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="BusinessProcesses-PT-18"
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 BusinessProcesses-PT-18, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r182-oct2-158987914100587"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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