Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r132-tall-162075428600389.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 gold2020
Input is MAPK-PT-10240, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-162075428600389
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 145K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 06:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 06:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 07:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 25 07:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 25K May 5 16:51 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 MAPK-PT-10240-00
FORMULA_NAME MAPK-PT-10240-01
FORMULA_NAME MAPK-PT-10240-02
FORMULA_NAME MAPK-PT-10240-03
FORMULA_NAME MAPK-PT-10240-04
FORMULA_NAME MAPK-PT-10240-05
FORMULA_NAME MAPK-PT-10240-06
FORMULA_NAME MAPK-PT-10240-07
FORMULA_NAME MAPK-PT-10240-08
FORMULA_NAME MAPK-PT-10240-09
FORMULA_NAME MAPK-PT-10240-10
FORMULA_NAME MAPK-PT-10240-11
FORMULA_NAME MAPK-PT-10240-12
FORMULA_NAME MAPK-PT-10240-13
FORMULA_NAME MAPK-PT-10240-14
FORMULA_NAME MAPK-PT-10240-15

=== Now, execution of the tool begins

BK_START 1620937299076

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 20:21:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 20:21:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 20:21:43] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2021-05-13 20:21:43] [INFO ] Transformed 22 places.
[2021-05-13 20:21:43] [INFO ] Transformed 30 transitions.
[2021-05-13 20:21:43] [INFO ] Parsed PT model containing 22 places and 30 transitions in 62 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 102432 steps, including 0 resets, run finished after 53 ms. (steps per millisecond=1932 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1]
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 20:21:43] [INFO ] Computed 7 place invariants in 5 ms
[2021-05-13 20:21:43] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2021-05-13 20:21:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:21:43] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-13 20:21:43] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 9 ms.
[2021-05-13 20:21:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:21:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2021-05-13 20:21:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:21:43] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-13 20:21:43] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 9 ms.
[2021-05-13 20:21:43] [INFO ] Added : 26 causal constraints over 6 iterations in 54 ms. Result :sat
[2021-05-13 20:21:43] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 20:21:43] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 20:21:43] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:21:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:21:43] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-13 20:21:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:21:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 20:21:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:21:43] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 20:21:43] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 3 ms.
[2021-05-13 20:21:43] [INFO ] Added : 26 causal constraints over 6 iterations in 28 ms. Result :sat
[2021-05-13 20:21:43] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-13 20:21:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:21:43] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-13 20:21:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:21:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 20:21:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:21:43] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 20:21:43] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:21:43] [INFO ] Added : 26 causal constraints over 6 iterations in 24 ms. Result :sat
[2021-05-13 20:21:43] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-13 20:21:43] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:21:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:21:43] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 20:21:43] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:21:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:21:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 20:21:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:21:43] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-13 20:21:43] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:21:43] [INFO ] Added : 26 causal constraints over 6 iterations in 22 ms. Result :sat
[2021-05-13 20:21:43] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:21:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:21:43] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-13 20:21:43] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:21:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:21:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:21:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:21:43] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 20:21:43] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:21:43] [INFO ] Added : 26 causal constraints over 6 iterations in 21 ms. Result :sat
[2021-05-13 20:21:43] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-13 20:21:43] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 20:21:43] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:21:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:21:43] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 20:21:43] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 4 ms.
[2021-05-13 20:21:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:21:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 20:21:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:21:43] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-13 20:21:43] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 3 ms.
[2021-05-13 20:21:43] [INFO ] Added : 26 causal constraints over 6 iterations in 25 ms. Result :sat
[2021-05-13 20:21:43] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 20:21:43] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-13 20:21:43] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-13 20:21:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:21:44] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 20:21:44] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 3 ms.
[2021-05-13 20:21:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:21:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 20:21:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:21:44] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 20:21:44] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:21:44] [INFO ] Added : 26 causal constraints over 7 iterations in 23 ms. Result :sat
[2021-05-13 20:21:44] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-13 20:21:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:21:44] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 20:21:44] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 3 ms.
[2021-05-13 20:21:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:21:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:21:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:21:44] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-13 20:21:44] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 5 ms.
[2021-05-13 20:21:44] [INFO ] Added : 27 causal constraints over 6 iterations in 24 ms. Result :sat
[2021-05-13 20:21:44] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:21:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:21:44] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 20:21:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:21:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:21:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:21:44] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 20:21:44] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:21:44] [INFO ] Added : 27 causal constraints over 7 iterations in 21 ms. Result :sat
[2021-05-13 20:21:44] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 20:21:44] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-13 20:21:44] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-13 20:21:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:21:44] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 20:21:44] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:21:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:21:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:21:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:21:44] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 20:21:44] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 1 ms.
[2021-05-13 20:21:44] [INFO ] Added : 25 causal constraints over 7 iterations in 20 ms. Result :sat
[2021-05-13 20:21:44] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-13 20:21:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:21:44] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 20:21:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:21:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 20:21:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:21:44] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-13 20:21:44] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 1 ms.
[2021-05-13 20:21:44] [INFO ] Added : 27 causal constraints over 7 iterations in 21 ms. Result :sat
[2021-05-13 20:21:44] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:21:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:21:44] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 20:21:44] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:21:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:21:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 20:21:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:21:44] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 20:21:44] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 6 ms.
[2021-05-13 20:21:44] [INFO ] Added : 26 causal constraints over 6 iterations in 29 ms. Result :sat
[2021-05-13 20:21:44] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:21:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:21:44] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 20:21:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:21:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:21:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:21:44] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 20:21:44] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:21:44] [INFO ] Added : 26 causal constraints over 6 iterations in 21 ms. Result :sat
[2021-05-13 20:21:44] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-13 20:21:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:21:44] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 20:21:44] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:21:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:21:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 20:21:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:21:44] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 20:21:44] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 1 ms.
[2021-05-13 20:21:44] [INFO ] Added : 26 causal constraints over 6 iterations in 18 ms. Result :sat
Successfully simplified 9 atomic propositions for a total of 11 simplifications.
[2021-05-13 20:21:44] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-13 20:21:44] [INFO ] Flatten gal took : 77 ms
FORMULA MAPK-PT-10240-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-10240-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-10240-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-10240-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-10240-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-10240-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-10240-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 20:21:44] [INFO ] Flatten gal took : 5 ms
[2021-05-13 20:21:44] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-13 20:21:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ MAPK-PT-10240 @ 3570 seconds

FORMULA MAPK-PT-10240-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-10240-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-10240-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-10240-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-10240-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-10240-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-10240-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-10240-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-10240-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2674
rslt: Output for LTLCardinality @ MAPK-PT-10240

{
"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=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 13 20:21:46 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 5,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((X (X ((p11 + 1 <= p1))) AND (F ((p6 + 1 <= p4)) OR X (X (G ((p11 + 1 <= p1)))))))",
"processed_size": 85,
"rewrites": 62
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"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": 3,
"visible_transitions": 0
},
"processed": "X (G (((p10 + 1 <= p5) AND (p7 + 1 <= p5))))",
"processed_size": 44,
"rewrites": 62
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(F ((X (G ((2 <= p16))) AND (1 <= p5))) U G (((2 <= p16) AND (p9 <= p4))))",
"processed_size": 74,
"rewrites": 62
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 611
},
"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": "(p10 <= p3)",
"processed_size": 11,
"rewrites": 62
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 764
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((G ((p6 <= 2)) OR (F ((p18 <= p16)) OR (1 <= p18))))",
"processed_size": 55,
"rewrites": 62
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 764
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 6,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((X ((X (G ((p13 <= 0))) AND (p18 + 1 <= p13))) AND (F ((p16 + 1 <= p19)) OR X (G ((X (G ((p13 <= 0))) AND (p18 + 1 <= p13)))))) R (p13 <= 0))",
"processed_size": 142,
"rewrites": 62
},
"result":
{
"edges": 78,
"markings": 39,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 25
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1019
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((F ((X ((1 <= p7)) OR (3 <= p7))) AND ((F ((1 <= p7)) AND (p11 <= 1)) OR (X ((1 <= p7)) OR (3 <= p7))))))",
"processed_size": 111,
"rewrites": 62
},
"result":
{
"edges": 9,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1528
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((p9 <= p13)))",
"processed_size": 19,
"rewrites": 62
},
"result":
{
"edges": 20482,
"markings": 20482,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3057
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 5,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((F ((G ((2 <= p1)) OR G (F ((p1 <= p5))))) AND ((p15 + 1 <= p9) OR (G ((2 <= p1)) OR G (F ((p1 <= p5)))))))",
"processed_size": 110,
"rewrites": 62
},
"result":
{
"edges": 151051,
"markings": 94727,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 3232,
"runtime": 896.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F(**)) : X((X(X(*)) AND (F(*) OR X(X(G(*)))))) : X(G(*)) : X(X(G((** OR F((X(**) OR F(**))))))) : (F((X(G(**)) AND **)) U G(**)) : (X((G(**) OR (F(**) OR **))) AND **) : ((X((X(G(*)) AND *)) AND (F(*) OR X(G((X(G(*)) AND *))))) R *) : G((F((G(*) OR G(F(*)))) AND (** OR (G(*) OR G(F(*)))))) : F(G((F((X(**) OR **)) AND ((F(**) AND **) OR (X(**) OR **)))))"
},
"net":
{
"arcs": 90,
"conflict_clusters": 12,
"places": 22,
"places_significant": 15,
"singleton_clusters": 0,
"transitions": 30
},
"result":
{
"preliminary_value": "no no no unknown no yes no no no ",
"value": "no no no unknown no yes no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 52/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 30 transitions, 15 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 LTLCardinality.xml
lola: X (X (G (F ((p9 <= p13))))) : NOT(X ((G ((p4 <= p6)) U X (X ((p1 <= p11)))))) : NOT(F (X (((p5 <= p10) OR (p5 <= p7))))) : G (X (G ((X ((1 <= p4)) OR X (F ((X ((3 <= p15)) OR F ((2 <= p3))))))))) : (F ((G (X ((2 <= p16))) AND (1 <= p5))) U G (((2 <= p16) AND (p9 <= p4)))) : (X (((G ((p6 <= 2)) OR F ((p18 <= p16))) OR (1 <= p18))) AND (p10 <= p3)) : NOT(((G (((1 <= 0) U (p19 <= p16))) U X ((F (X ((1 <= p13))) OR (p13 <= p18)))) U (1 <= p13))) : G (((p15 + 1 <= p9) U (NOT(F ((p1 <= 1))) OR NOT(F (G ((p5 + 1 <= p1))))))) : X (F (G (((F ((1 <= p7)) AND (p11 <= 1)) U (X ((1 <= p7)) OR (3 <= p7))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (X ((p11 + 1 <= p1))) AND (F ((p6 + 1 <= p4)) OR X (X (G ((p11 + 1 <= p1)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X ((p11 + 1 <= p1))) AND (F ((p6 + 1 <= p4)) OR X (X (G ((p11 + 1 <= p1)))))))
lola: processed formula length: 85
lola: 62 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p10 + 1 <= p5) AND (p7 + 1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p10 + 1 <= p5) AND (p7 + 1 <= p5))))
lola: processed formula length: 44
lola: 62 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((1 <= p4) OR F ((X ((3 <= p15)) OR F ((2 <= p3))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((1 <= p4) OR F ((X ((3 <= p15)) OR F ((2 <= p3))))))))
lola: processed formula length: 64
lola: 62 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2645907 markings, 4765272 edges, 529181 markings/sec, 0 secs
lola: 4731612 markings, 8520397 edges, 417141 markings/sec, 5 secs
lola: 6700584 markings, 12065755 edges, 393794 markings/sec, 10 secs
lola: 8621620 markings, 15522232 edges, 384207 markings/sec, 15 secs
lola: 10472552 markings, 18855180 edges, 370186 markings/sec, 20 secs
lola: 12173024 markings, 21915784 edges, 340094 markings/sec, 25 secs
lola: 13905725 markings, 25036445 edges, 346540 markings/sec, 30 secs
lola: 15591525 markings, 28070238 edges, 337160 markings/sec, 35 secs
lola: 17260583 markings, 31074590 edges, 333812 markings/sec, 40 secs
lola: 18881663 markings, 33992531 edges, 324216 markings/sec, 45 secs
lola: 20497504 markings, 36902494 edges, 323168 markings/sec, 50 secs
lola: 22091557 markings, 39771030 edges, 318811 markings/sec, 55 secs
lola: 23664909 markings, 42604320 edges, 314670 markings/sec, 60 secs
lola: 25229230 markings, 45418681 edges, 312864 markings/sec, 65 secs
lola: 26780609 markings, 48211809 edges, 310276 markings/sec, 70 secs
lola: 28329601 markings, 50999895 edges, 309798 markings/sec, 75 secs
lola: 29873999 markings, 53780608 edges, 308880 markings/sec, 80 secs
lola: 31420099 markings, 56565188 edges, 309220 markings/sec, 85 secs
lola: 32956038 markings, 59328482 edges, 307188 markings/sec, 90 secs
lola: 34477370 markings, 62066755 edges, 304266 markings/sec, 95 secs
lola: 35998371 markings, 64805899 edges, 304200 markings/sec, 100 secs
lola: 37512139 markings, 67528997 edges, 302754 markings/sec, 105 secs
lola: 39023407 markings, 70252101 edges, 302254 markings/sec, 110 secs
lola: 40519524 markings, 72945038 edges, 299223 markings/sec, 115 secs
lola: 42011358 markings, 75631217 edges, 298367 markings/sec, 120 secs
lola: 43494452 markings, 78300672 edges, 296619 markings/sec, 125 secs
lola: 44974727 markings, 80963047 edges, 296055 markings/sec, 130 secs
lola: 46445157 markings, 83612212 edges, 294086 markings/sec, 135 secs
lola: 47908089 markings, 86246014 edges, 292586 markings/sec, 140 secs
lola: 49364189 markings, 88862599 edges, 291220 markings/sec, 145 secs
lola: 50826320 markings, 91495793 edges, 292426 markings/sec, 150 secs
lola: 52280019 markings, 94116493 edges, 290740 markings/sec, 155 secs
lola: 53724578 markings, 96713720 edges, 288912 markings/sec, 160 secs
lola: 55150548 markings, 99280591 edges, 285194 markings/sec, 165 secs
lola: 56593923 markings, 101879301 edges, 288675 markings/sec, 170 secs
lola: 58035733 markings, 104474052 edges, 288362 markings/sec, 175 secs
lola: 59479548 markings, 107072456 edges, 288763 markings/sec, 180 secs
lola: 60919527 markings, 109667380 edges, 287996 markings/sec, 185 secs
lola: 62351279 markings, 112242411 edges, 286350 markings/sec, 190 secs
lola: 63780917 markings, 114819660 edges, 285928 markings/sec, 195 secs
lola: 65205504 markings, 117381000 edges, 284917 markings/sec, 200 secs
lola: 66607962 markings, 119905419 edges, 280492 markings/sec, 205 secs
lola: 68019900 markings, 122447819 edges, 282388 markings/sec, 210 secs
lola: 69417954 markings, 124961593 edges, 279611 markings/sec, 215 secs
lola: 70823803 markings, 127498507 edges, 281170 markings/sec, 220 secs
lola: 72223048 markings, 130017409 edges, 279849 markings/sec, 225 secs
lola: 73618740 markings, 132524514 edges, 279138 markings/sec, 230 secs
lola: 75011251 markings, 135031289 edges, 278502 markings/sec, 235 secs
lola: 76374316 markings, 137484127 edges, 272613 markings/sec, 240 secs
lola: 77751187 markings, 139965996 edges, 275374 markings/sec, 245 secs
lola: 79134252 markings, 142452235 edges, 276613 markings/sec, 250 secs
lola: 80519442 markings, 144946768 edges, 277038 markings/sec, 255 secs
lola: 81869307 markings, 147378253 edges, 269973 markings/sec, 260 secs
lola: 83222837 markings, 149815605 edges, 270706 markings/sec, 265 secs
lola: 84576565 markings, 152252284 edges, 270746 markings/sec, 270 secs
lola: 85790564 markings, 154436641 edges, 242800 markings/sec, 275 secs
lola: 86443659 markings, 155610842 edges, 130619 markings/sec, 280 secs
lola: 87320950 markings, 157190060 edges, 175458 markings/sec, 285 secs
lola: 87471342 markings, 157465636 edges, 30078 markings/sec, 290 secs
lola: 88154852 markings, 158690714 edges, 136702 markings/sec, 295 secs
lola: 88852046 markings, 159946611 edges, 139439 markings/sec, 300 secs
lola: 90113711 markings, 162216609 edges, 252333 markings/sec, 305 secs
lola: 90949182 markings, 163720948 edges, 167094 markings/sec, 310 secs
lola: 92020132 markings, 165649048 edges, 214190 markings/sec, 315 secs
lola: 92965569 markings, 167350744 edges, 189087 markings/sec, 320 secs
lola: 93940557 markings, 169107202 edges, 194998 markings/sec, 325 secs
lola: 95026796 markings, 171061896 edges, 217248 markings/sec, 330 secs
lola: 95860113 markings, 172565770 edges, 166663 markings/sec, 335 secs
lola: 97015912 markings, 174641026 edges, 231160 markings/sec, 340 secs
lola: 97850876 markings, 176146985 edges, 166993 markings/sec, 345 secs
lola: 98597967 markings, 177492488 edges, 149418 markings/sec, 350 secs
lola: 99584413 markings, 179266973 edges, 197289 markings/sec, 355 secs
lola: 100234877 markings, 180438850 edges, 130093 markings/sec, 360 secs
lola: 101104525 markings, 182004040 edges, 173930 markings/sec, 365 secs
lola: 102136688 markings, 183862964 edges, 206433 markings/sec, 370 secs
lola: 103161290 markings, 185703213 edges, 204920 markings/sec, 375 secs
lola: 104117834 markings, 187424682 edges, 191309 markings/sec, 380 secs
lola: 105061979 markings, 189124668 edges, 188829 markings/sec, 385 secs
lola: 105414627 markings, 189765231 edges, 70530 markings/sec, 390 secs
lola: 105539673 markings, 189985280 edges, 25009 markings/sec, 395 secs
lola: 105539728 markings, 189985444 edges, 11 markings/sec, 400 secs
lola: 105539816 markings, 189985707 edges, 18 markings/sec, 405 secs
lola: 105539899 markings, 189985957 edges, 17 markings/sec, 410 secs
lola: 105540685 markings, 189988314 edges, 157 markings/sec, 415 secs
lola: 105541622 markings, 189991126 edges, 187 markings/sec, 420 secs
lola: 105541730 markings, 189991452 edges, 22 markings/sec, 425 secs
lola: 105541786 markings, 189991620 edges, 11 markings/sec, 430 secs
lola: 105541850 markings, 189991811 edges, 13 markings/sec, 435 secs
lola: 105541940 markings, 189992081 edges, 18 markings/sec, 440 secs
lola: 105542012 markings, 189992298 edges, 14 markings/sec, 445 secs
lola: 105544461 markings, 189996122 edges, 490 markings/sec, 450 secs
lola: 105544584 markings, 189996246 edges, 25 markings/sec, 455 secs
lola: 105545859 markings, 189997520 edges, 255 markings/sec, 460 secs
lola: 105545975 markings, 189997636 edges, 23 markings/sec, 465 secs
lola: 105546077 markings, 189997738 edges, 20 markings/sec, 470 secs
lola: 105547749 markings, 190000315 edges, 334 markings/sec, 475 secs
lola: 105547807 markings, 190000492 edges, 12 markings/sec, 480 secs
lola: 105548990 markings, 190004041 edges, 237 markings/sec, 485 secs
lola: local time limit reached - aborting
lola: 105549074 markings, 190004292 edges, 17 markings/sec, 490 secs
lola:
preliminary result: unknown no no unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((X (G ((2 <= p16))) AND (1 <= p5))) U G (((2 <= p16) AND (p9 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((X (G ((2 <= p16))) AND (1 <= p5))) U G (((2 <= p16) AND (p9 <= p4))))
lola: processed formula length: 74
lola: 62 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 4 will run for 611 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((G ((p6 <= 2)) OR (F ((p18 <= p16)) OR (1 <= p18)))) AND (p10 <= p3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 611 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p10 <= p3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p10 <= p3)
lola: processed formula length: 11
lola: 62 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 764 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((p6 <= 2)) OR (F ((p18 <= p16)) OR (1 <= p18))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((p6 <= 2)) OR (F ((p18 <= p16)) OR (1 <= p18))))
lola: processed formula length: 55
lola: 62 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 764 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X ((X (G ((p13 <= 0))) AND (p18 + 1 <= p13))) AND (F ((p16 + 1 <= p19)) OR X (G ((X (G ((p13 <= 0))) AND (p18 + 1 <= p13)))))) R (p13 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X ((X (G ((p13 <= 0))) AND (p18 + 1 <= p13))) AND (F ((p16 + 1 <= p19)) OR X (G ((X (G ((p13 <= 0))) AND (p18 + 1 <= p13)))))) R (p13 <= 0))
lola: processed formula length: 142
lola: 62 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 25 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 39 markings, 78 edges
lola: ========================================
lola: subprocess 6 will run for 1019 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((X ((1 <= p7)) OR (3 <= p7))) AND ((F ((1 <= p7)) AND (p11 <= 1)) OR (X ((1 <= p7)) OR (3 <= p7))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((X ((1 <= p7)) OR (3 <= p7))) AND ((F ((1 <= p7)) AND (p11 <= 1)) OR (X ((1 <= p7)) OR (3 <= p7))))))
lola: processed formula length: 111
lola: 62 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 9 edges
lola: ========================================
lola: subprocess 7 will run for 1528 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p9 <= p13)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p9 <= p13)))
lola: processed formula length: 19
lola: 62 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 20482 markings, 20482 edges
lola: ========================================
lola: subprocess 8 will run for 3057 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((G ((2 <= p1)) OR G (F ((p1 <= p5))))) AND ((p15 + 1 <= p9) OR (G ((2 <= p1)) OR G (F ((p1 <= p5)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((G ((2 <= p1)) OR G (F ((p1 <= p5))))) AND ((p15 + 1 <= p9) OR (G ((2 <= p1)) OR G (F ((p1 <= p5)))))))
lola: processed formula length: 110
lola: 62 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 94727 markings, 151051 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (X (G (((1 <= p4) OR F ((X ((3 <= p15)) OR F ((2 <= p3))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((1 <= p4) OR F ((X ((3 <= p15)) OR F ((2 <= p3))))))))
lola: processed formula length: 64
lola: 62 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2931589 markings, 5279536 edges, 586318 markings/sec, 0 secs
lola: 5133668 markings, 9243566 edges, 440416 markings/sec, 5 secs
lola: 7102098 markings, 12788097 edges, 393686 markings/sec, 10 secs
lola: 8951745 markings, 16116893 edges, 369929 markings/sec, 15 secs
lola: 10752002 markings, 19359047 edges, 360051 markings/sec, 20 secs
lola: 12514591 markings, 22530391 edges, 352518 markings/sec, 25 secs
lola: 14215940 markings, 25593804 edges, 340270 markings/sec, 30 secs
lola: 15884467 markings, 28598347 edges, 333705 markings/sec, 35 secs
lola: 17534028 markings, 31568573 edges, 329912 markings/sec, 40 secs
lola: 19161915 markings, 34499086 edges, 325577 markings/sec, 45 secs
lola: 20770154 markings, 37391709 edges, 321648 markings/sec, 50 secs
lola: 22360435 markings, 40256118 edges, 318056 markings/sec, 55 secs
lola: 23961900 markings, 43137438 edges, 320293 markings/sec, 60 secs
lola: 25543884 markings, 45985741 edges, 316397 markings/sec, 65 secs
lola: 27157374 markings, 48891602 edges, 322698 markings/sec, 70 secs
lola: 28741137 markings, 51742435 edges, 316753 markings/sec, 75 secs
lola: 30291320 markings, 54532247 edges, 310037 markings/sec, 80 secs
lola: 31834226 markings, 57309115 edges, 308581 markings/sec, 85 secs
lola: 33388136 markings, 60104530 edges, 310782 markings/sec, 90 secs
lola: 34932376 markings, 62886951 edges, 308848 markings/sec, 95 secs
lola: 36467970 markings, 65652431 edges, 307119 markings/sec, 100 secs
lola: 37961190 markings, 68340538 edges, 298644 markings/sec, 105 secs
lola: 39464309 markings, 71046056 edges, 300624 markings/sec, 110 secs
lola: 40961439 markings, 73740082 edges, 299426 markings/sec, 115 secs
lola: 42441756 markings, 76404584 edges, 296063 markings/sec, 120 secs
lola: 43916552 markings, 79060856 edges, 294959 markings/sec, 125 secs
lola: 45382999 markings, 81699894 edges, 293289 markings/sec, 130 secs
lola: 47263590 markings, 85084562 edges, 376118 markings/sec, 135 secs
lola: 48724841 markings, 87715655 edges, 292250 markings/sec, 140 secs
lola: 50155817 markings, 90291157 edges, 286195 markings/sec, 145 secs
lola: 51617261 markings, 92920534 edges, 292289 markings/sec, 150 secs
lola: 53067940 markings, 95532870 edges, 290136 markings/sec, 155 secs
lola: 54522154 markings, 98150414 edges, 290843 markings/sec, 160 secs
lola: 55937276 markings, 100698918 edges, 283024 markings/sec, 165 secs
lola: 57350173 markings, 103242136 edges, 282579 markings/sec, 170 secs
lola: 58779276 markings, 105815026 edges, 285821 markings/sec, 175 secs
lola: 60216340 markings, 108400022 edges, 287413 markings/sec, 180 secs
lola: 61625751 markings, 110938438 edges, 281882 markings/sec, 185 secs
lola: 63023968 markings, 113453228 edges, 279643 markings/sec, 190 secs
lola: 64407380 markings, 115941988 edges, 276682 markings/sec, 195 secs
lola: 65812681 markings, 118473258 edges, 281060 markings/sec, 200 secs
lola: 67218995 markings, 121008522 edges, 281263 markings/sec, 205 secs
lola: 68629094 markings, 123544761 edges, 282020 markings/sec, 210 secs
lola: 70027678 markings, 126063780 edges, 279717 markings/sec, 215 secs
lola: 71437362 markings, 128598679 edges, 281937 markings/sec, 220 secs
lola: 72836179 markings, 131118148 edges, 279763 markings/sec, 225 secs
lola: 74216842 markings, 133603498 edges, 276133 markings/sec, 230 secs
lola: 75615031 markings, 136120251 edges, 279638 markings/sec, 235 secs
lola: 77005960 markings, 138624693 edges, 278186 markings/sec, 240 secs
lola: 78389268 markings, 141113712 edges, 276662 markings/sec, 245 secs
lola: 79773161 markings, 143603145 edges, 276779 markings/sec, 250 secs
lola: 81169000 markings, 146113855 edges, 279168 markings/sec, 255 secs
lola: 82546838 markings, 148596638 edges, 275568 markings/sec, 260 secs
lola: 83907138 markings, 151046077 edges, 272060 markings/sec, 265 secs
lola: 84876244 markings, 152786865 edges, 193821 markings/sec, 270 secs
lola: 86033819 markings, 154870052 edges, 231515 markings/sec, 275 secs
lola: 87193383 markings, 156961069 edges, 231913 markings/sec, 280 secs
lola: 88223552 markings, 158817925 edges, 206034 markings/sec, 285 secs
lola: 89298945 markings, 160748083 edges, 215079 markings/sec, 290 secs
lola: 90369712 markings, 162678751 edges, 214153 markings/sec, 295 secs
lola: 91455986 markings, 164635614 edges, 217255 markings/sec, 300 secs
lola: 92560664 markings, 166625730 edges, 220936 markings/sec, 305 secs
lola: 93562715 markings, 168428467 edges, 200410 markings/sec, 310 secs
lola: 94120687 markings, 169432865 edges, 111594 markings/sec, 315 secs
lola: 95146855 markings, 171276999 edges, 205234 markings/sec, 320 secs
lola: 95830648 markings, 172507560 edges, 136759 markings/sec, 325 secs
lola: 96904252 markings, 174442602 edges, 214721 markings/sec, 330 secs
lola: 98016269 markings, 176445421 edges, 222403 markings/sec, 335 secs
lola: 98992283 markings, 178201766 edges, 195203 markings/sec, 340 secs
lola: 99830117 markings, 179707611 edges, 167567 markings/sec, 345 secs
lola: 100998550 markings, 181814312 edges, 233687 markings/sec, 350 secs
lola: 102238862 markings, 184042822 edges, 248062 markings/sec, 355 secs
lola: 103199586 markings, 185770082 edges, 192145 markings/sec, 360 secs
lola: 104304103 markings, 187762679 edges, 220903 markings/sec, 365 secs
lola: 105313060 markings, 189580937 edges, 201791 markings/sec, 370 secs
lola: 105611657 markings, 190113899 edges, 59719 markings/sec, 375 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no unknown no yes no no no
lola:
preliminary result: no no no unknown no yes no no no
lola: memory consumption: 3232 KB
lola: time consumption: 896 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.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="MAPK-PT-10240"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is MAPK-PT-10240, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-162075428600389"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MAPK-PT-10240.tgz
mv MAPK-PT-10240 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;