Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
................
/home/mcc/execution
total 180K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.0K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 17 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 21K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is GPPP-PT-C0100N0000000100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-blw7-152732548200089
=====================================================================

--------------------
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 GPPP-PT-C0100N0000000100-LTLCardinality-00
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-01
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-02
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-03
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-04
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-05
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-06
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-07
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-08
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-09
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-10
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-11
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-12
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-13
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-14
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527929154176


BK_STOP 1527929903858

--------------------
content from stderr:

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using GPPP-PT-C0100N0000000100 as instance name.
Using GPPP as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': None, 'Reversible': None, 'Quasi Live': True, 'Live': None}.
Known tools are: [{'Time': 112, 'Memory': 111.98, 'Tool': 'lola'}, {'Time': 190, 'Memory': 112.38, 'Tool': 'lola'}, {'Time': 4436, 'Memory': 360.09, 'Tool': 'itstools'}, {'Time': 4590, 'Memory': 404.4, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola GPPP-PT-C0100N0000000100...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
GPPP-PT-C0100N0000000100: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
GPPP-PT-C0100N0000000100: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ GPPP-PT-C0100N0000000100 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 55/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 33 places, 22 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 30 transition conflict sets
lola: TASK
lola: reading formula from GPPP-PT-C0100N0000000100-LTLCardinality.task
lola: A ((((2 <= GSH) U (1 <= ADP)) U ((3 <= GAP) U (Pyr <= _2PG)))) : A (G (X (G (F ((3 <= DHAP)))))) : A ((3 <= _1_3_BPG)) : A (F ((1 <= F6P))) : A ((2 <= F6P)) : A (F ((X ((3 <= c1)) U G ((1 <= ADP))))) : A (X ((1 <= Xu5P))) : A (G (G ((3 <= start)))) : A (X ((3 <= GSH))) : A (G (X (((1 <= start) U (3 <= ADP))))) : A (G (G (G (X ((2 <= F6P)))))) : A (X (X (X (G ((1 <= Xu5P)))))) : A (((2 <= Pi) U F (F ((_2PG <= a1))))) : A (G (G ((NADplus <= F6P)))) : A (G (G (F (G ((DHAP <= Pyr)))))) : A (((1 <= NADplus) U X (X ((3 <= Pyr)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= GSH) U (1 <= ADP)) U ((3 <= GAP) U (Pyr <= _2PG))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((2 <= GSH) U (1 <= ADP)) U ((3 <= GAP) U (Pyr <= _2PG))))
lola: processed formula: A ((((2 <= GSH) U (1 <= ADP)) U ((3 <= GAP) U (Pyr <= _2PG))))
lola: processed formula length: 62
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (G (F ((3 <= DHAP))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (G (F ((3 <= DHAP))))))
lola: processed formula: A (G (X (G (F ((3 <= DHAP))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
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: 405 markings, 405 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= _1_3_BPG))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= _1_3_BPG)
lola: processed formula length: 15
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= F6P)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((1 <= F6P)))
lola: processed formula: A (F ((1 <= F6P)))
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
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: 802 markings, 801 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= F6P))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= F6P)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((X ((3 <= c1)) U G ((1 <= ADP)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((X ((3 <= c1)) U G ((1 <= ADP)))))
lola: processed formula: A (F ((X ((3 <= c1)) U G ((1 <= ADP)))))
lola: processed formula length: 40
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1448252 markings, 9654435 edges, 289650 markings/sec, 0 secs
lola: 2837586 markings, 19237152 edges, 277867 markings/sec, 5 secs
lola: 4200935 markings, 28656813 edges, 272670 markings/sec, 10 secs
lola: 5568511 markings, 38098859 edges, 273515 markings/sec, 15 secs
lola: 6922179 markings, 47419366 edges, 270734 markings/sec, 20 secs
lola: 8205799 markings, 56262781 edges, 256724 markings/sec, 25 secs
lola: 9546638 markings, 65534826 edges, 268168 markings/sec, 30 secs
lola: 10905073 markings, 74888069 edges, 271687 markings/sec, 35 secs
lola: 12251296 markings, 84157750 edges, 269245 markings/sec, 40 secs
lola: 13570623 markings, 93292496 edges, 263865 markings/sec, 45 secs
lola: 14923226 markings, 102616773 edges, 270521 markings/sec, 50 secs
lola: 16261097 markings, 111815955 edges, 267574 markings/sec, 55 secs
lola: 17564398 markings, 120827433 edges, 260660 markings/sec, 60 secs
lola: 18914478 markings, 130141110 edges, 270016 markings/sec, 65 secs
lola: 20271765 markings, 139480628 edges, 271457 markings/sec, 70 secs
lola: 21603146 markings, 148659995 edges, 266276 markings/sec, 75 secs
lola: 22922789 markings, 157785392 edges, 263929 markings/sec, 80 secs
lola: 24260289 markings, 166993700 edges, 267500 markings/sec, 85 secs
lola: 25583151 markings, 176108181 edges, 264572 markings/sec, 90 secs
lola: 26881000 markings, 185085567 edges, 259570 markings/sec, 95 secs
lola: 28230883 markings, 194367969 edges, 269977 markings/sec, 100 secs
lola: 29555166 markings, 203501188 edges, 264857 markings/sec, 105 secs
lola: 30864981 markings, 212562680 edges, 261963 markings/sec, 110 secs
lola: 32196439 markings, 221714538 edges, 266292 markings/sec, 115 secs
lola: 33496259 markings, 230694277 edges, 259964 markings/sec, 120 secs
lola: 34804794 markings, 239721000 edges, 261707 markings/sec, 125 secs
lola: 36099648 markings, 248640048 edges, 258971 markings/sec, 130 secs
lola: 37453733 markings, 258004062 edges, 270817 markings/sec, 135 secs
lola: 38814226 markings, 267384209 edges, 272099 markings/sec, 140 secs
lola: 40168321 markings, 276694569 edges, 270819 markings/sec, 145 secs
lola: 41508771 markings, 285942104 edges, 268090 markings/sec, 150 secs
lola: 42816152 markings, 294985756 edges, 261476 markings/sec, 155 secs
lola: 44140775 markings, 304090527 edges, 264925 markings/sec, 160 secs
lola: 45435033 markings, 313042178 edges, 258852 markings/sec, 165 secs
lola: 46781464 markings, 322328906 edges, 269286 markings/sec, 170 secs
lola: 48121197 markings, 331542356 edges, 267947 markings/sec, 175 secs
lola: 49412231 markings, 340473543 edges, 258207 markings/sec, 180 secs
lola: 50737379 markings, 349607504 edges, 265030 markings/sec, 185 secs
lola: 52045849 markings, 358609447 edges, 261694 markings/sec, 190 secs
lola: 53340457 markings, 367568522 edges, 258922 markings/sec, 195 secs
lola: 54654443 markings, 376601314 edges, 262797 markings/sec, 200 secs
lola: 55992580 markings, 385829181 edges, 267627 markings/sec, 205 secs
lola: 57182745 markings, 394786497 edges, 238033 markings/sec, 210 secs
lola: 58333039 markings, 403556258 edges, 230059 markings/sec, 215 secs
lola: 59468821 markings, 412220834 edges, 227156 markings/sec, 220 secs
lola: 60600703 markings, 420838625 edges, 226376 markings/sec, 225 secs
lola: 61734267 markings, 429493586 edges, 226713 markings/sec, 230 secs
lola: 62869805 markings, 438129834 edges, 227108 markings/sec, 235 secs
lola: 63991618 markings, 446698721 edges, 224363 markings/sec, 240 secs
lola: 65108665 markings, 455199236 edges, 223409 markings/sec, 245 secs
lola: 66237123 markings, 463814109 edges, 225692 markings/sec, 250 secs
lola: 67368798 markings, 472422538 edges, 226335 markings/sec, 255 secs
lola: 68482815 markings, 480928870 edges, 222803 markings/sec, 260 secs
lola: 69590122 markings, 489361361 edges, 221461 markings/sec, 265 secs
lola: 70708822 markings, 497884075 edges, 223740 markings/sec, 270 secs
lola: 71822478 markings, 506388276 edges, 222731 markings/sec, 275 secs
lola: 72928636 markings, 514799999 edges, 221232 markings/sec, 280 secs
lola: 74027750 markings, 523188320 edges, 219823 markings/sec, 285 secs
lola: 75120376 markings, 531525446 edges, 218525 markings/sec, 290 secs
lola: 76266296 markings, 540244886 edges, 229184 markings/sec, 295 secs
lola: 77395631 markings, 548858920 edges, 225867 markings/sec, 300 secs
lola: 78519881 markings, 557423271 edges, 224850 markings/sec, 305 secs
lola: 79625702 markings, 565866281 edges, 221164 markings/sec, 310 secs
lola: 80751274 markings, 574428894 edges, 225114 markings/sec, 315 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= Xu5P)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((1 <= Xu5P)))
lola: processed formula: A (X ((1 <= Xu5P)))
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
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: 405 markings, 405 edges
lola: ========================================
lola: subprocess 7 will run for 357 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G ((3 <= start))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G ((3 <= start))))
lola: processed formula: A (G (G ((3 <= start))))
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
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: 23 markings, 23 edges
lola: ========================================
lola: subprocess 8 will run for 402 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= GSH)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((3 <= GSH)))
lola: processed formula: A (X ((3 <= GSH)))
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
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: 405 markings, 405 edges
lola: ========================================
lola: subprocess 9 will run for 459 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (((1 <= start) U (3 <= ADP)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (((1 <= start) U (3 <= ADP)))))
lola: processed formula: A (G (X (((1 <= start) U (3 <= ADP)))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1432121 markings, 9270286 edges, 286424 markings/sec, 0 secs
lola: 2852875 markings, 19003024 edges, 284151 markings/sec, 5 secs
lola: 4214627 markings, 28446652 edges, 272350 markings/sec, 10 secs
lola: 5632900 markings, 38182317 edges, 283655 markings/sec, 15 secs
lola: 7023497 markings, 47798145 edges, 278119 markings/sec, 20 secs
lola: 8386097 markings, 57224455 edges, 272520 markings/sec, 25 secs
lola: 9800177 markings, 66925333 edges, 282816 markings/sec, 30 secs
lola: 11141875 markings, 76229461 edges, 268340 markings/sec, 35 secs
lola: 12507825 markings, 85595495 edges, 273190 markings/sec, 40 secs
lola: 13852187 markings, 94895347 edges, 268872 markings/sec, 45 secs
lola: 15200297 markings, 104229042 edges, 269622 markings/sec, 50 secs
lola: 16571563 markings, 113622836 edges, 274253 markings/sec, 55 secs
lola: 17888525 markings, 122755849 edges, 263392 markings/sec, 60 secs
lola: 19289953 markings, 132372802 edges, 280286 markings/sec, 65 secs
lola: 20658923 markings, 141835905 edges, 273794 markings/sec, 70 secs
lola: 22001001 markings, 151133123 edges, 268416 markings/sec, 75 secs
lola: 23392859 markings, 160666030 edges, 278372 markings/sec, 80 secs
lola: 24726703 markings, 169924281 edges, 266769 markings/sec, 85 secs
lola: 26080691 markings, 179209840 edges, 270798 markings/sec, 90 secs
lola: 27434101 markings, 188539378 edges, 270682 markings/sec, 95 secs
lola: 28768941 markings, 197799047 edges, 266968 markings/sec, 100 secs
lola: 30136770 markings, 207176887 edges, 273566 markings/sec, 105 secs
lola: 31461501 markings, 216341477 edges, 264946 markings/sec, 110 secs
lola: 32802095 markings, 225624742 edges, 268119 markings/sec, 115 secs
lola: 34159409 markings, 234911653 edges, 271463 markings/sec, 120 secs
lola: 35482961 markings, 244085313 edges, 264710 markings/sec, 125 secs
lola: 36825117 markings, 253358903 edges, 268431 markings/sec, 130 secs
lola: 38217412 markings, 262912361 edges, 278459 markings/sec, 135 secs
lola: 39559949 markings, 272227459 edges, 268507 markings/sec, 140 secs
lola: 40938827 markings, 281678312 edges, 275776 markings/sec, 145 secs
lola: 42296084 markings, 291063152 edges, 271451 markings/sec, 150 secs
lola: 43627073 markings, 300279581 edges, 266198 markings/sec, 155 secs
lola: 44981603 markings, 309553632 edges, 270906 markings/sec, 160 secs
lola: 46323747 markings, 318863013 edges, 268429 markings/sec, 165 secs
lola: 47652353 markings, 328006634 edges, 265721 markings/sec, 170 secs
lola: 48985890 markings, 337169693 edges, 266707 markings/sec, 175 secs
lola: 50267751 markings, 346045129 edges, 256372 markings/sec, 180 secs
lola: 51542295 markings, 354863616 edges, 254909 markings/sec, 185 secs
lola: 52848257 markings, 363811279 edges, 261192 markings/sec, 190 secs
lola: 54132801 markings, 372671310 edges, 256909 markings/sec, 195 secs
lola: 55411175 markings, 381533703 edges, 255675 markings/sec, 200 secs
lola: 56718233 markings, 390567426 edges, 261412 markings/sec, 205 secs
lola: 58043572 markings, 399632256 edges, 265068 markings/sec, 210 secs
lola: 59341825 markings, 408616557 edges, 259651 markings/sec, 215 secs
lola: 60584733 markings, 417223897 edges, 248582 markings/sec, 220 secs
lola: 61877989 markings, 426110439 edges, 258651 markings/sec, 225 secs
lola: 63170895 markings, 434995364 edges, 258581 markings/sec, 230 secs
lola: 64472477 markings, 444003348 edges, 260316 markings/sec, 235 secs
lola: 65755037 markings, 452880151 edges, 256512 markings/sec, 240 secs
lola: 67055193 markings, 461790311 edges, 260031 markings/sec, 245 secs
lola: 68347179 markings, 470703566 edges, 258397 markings/sec, 250 secs
lola: 69627639 markings, 479577179 edges, 256092 markings/sec, 255 secs
lola: 70898559 markings, 488363683 edges, 254184 markings/sec, 260 secs
lola: 72189591 markings, 497202977 edges, 258206 markings/sec, 265 secs
lola: 73519929 markings, 506379395 edges, 266068 markings/sec, 270 secs
lola: 74841567 markings, 515545431 edges, 264328 markings/sec, 275 secs
lola: 76181607 markings, 524746194 edges, 268008 markings/sec, 280 secs
lola: 77516505 markings, 533951739 edges, 266980 markings/sec, 285 secs
lola: 78837873 markings, 543108342 edges, 264274 markings/sec, 290 secs
lola: 80178953 markings, 552307815 edges, 268216 markings/sec, 295 secs
lola: 81500443 markings, 561430416 edges, 264298 markings/sec, 300 secs
lola: 82814609 markings, 570533023 edges, 262833 markings/sec, 305 secs
lola: 84136270 markings, 579596184 edges, 264332 markings/sec, 310 secs
lola: 85434485 markings, 588546060 edges, 259643 markings/sec, 315 secs
lola: 86710277 markings, 597394264 edges, 255158 markings/sec, 320 secs
lola: 87980357 markings, 606169854 edges, 254016 markings/sec, 325 secs
lola: 89274062 markings, 615033078 edges, 258741 markings/sec, 330 secs
lola: 90558759 markings, 623886590 edges, 256939 markings/sec, 335 secs
lola: 91858883 markings, 632906456 edges, 260025 markings/sec, 340 secs
lola: 93168332 markings, 641903199 edges, 261890 markings/sec, 345 secs
lola: 94480849 markings, 650932090 edges, 262503 markings/sec, 350 secs
lola: 95772801 markings, 659877681 edges, 258390 markings/sec, 355 secs
lola: 97058453 markings, 668779109 edges, 257130 markings/sec, 360 secs
lola: 98363053 markings, 677720872 edges, 260920 markings/sec, 365 secs
lola: 99662161 markings, 686668237 edges, 259822 markings/sec, 370 secs
lola: 100975507 markings, 695787077 edges, 262669 markings/sec, 375 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 472 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (G (X ((2 <= F6P))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (G (X ((2 <= F6P))))))
lola: processed formula: A (G (G (G (X ((2 <= F6P))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
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: 405 markings, 405 edges
lola: ========================================
lola: subprocess 11 will run for 567 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (G ((1 <= Xu5P))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (X (G ((1 <= Xu5P))))))
lola: processed formula: A (X (X (X (G ((1 <= Xu5P))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
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: 405 markings, 405 edges
lola: ========================================
lola: subprocess 12 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= Pi) U F (F ((_2PG <= a1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((2 <= Pi) U F ((_2PG <= a1))))
lola: processed formula: A (((2 <= Pi) U F ((_2PG <= a1))))
lola: processed formula length: 34
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 945 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G ((NADplus <= F6P))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G ((NADplus <= F6P))))
lola: processed formula: A (G (G ((NADplus <= F6P))))
lola: processed formula length: 28
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
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: 2781 markings, 2781 edges
lola: ========================================
lola: subprocess 14 will run for 1417 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (F (G ((DHAP <= Pyr))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((DHAP <= Pyr))))
lola: processed formula: A (F (G ((DHAP <= Pyr))))
lola: processed formula length: 25
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
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: 2802 markings, 2805 edges
lola: ========================================
lola: subprocess 15 will run for 2835 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((1 <= NADplus) U X (X ((3 <= Pyr)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((1 <= NADplus) U X (X ((3 <= Pyr)))))
lola: processed formula: A (((1 <= NADplus) U X (X ((3 <= Pyr)))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
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: 405 markings, 405 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no yes no unknown no no no unknown no no yes no no no
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished 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="GPPP-PT-C0100N0000000100"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="irma4mcc-full"
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

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0100N0000000100.tgz
mv GPPP-PT-C0100N0000000100 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is GPPP-PT-C0100N0000000100, 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 r246-blw7-152732548200089"
echo "====================================================================="
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
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 ;