fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r043-smll-152646359600257
Last Updated
June 26, 2018

About the Execution of Irma.struct for CloudDeployment-PT-6b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10659.200 1105434.00 2129326.00 3674.50 FFFF?FFTFT?TTTFF normal

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 5.0M
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.6K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 4.8M May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is CloudDeployment-PT-6b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-152646359600257
=====================================================================


--------------------
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 CloudDeployment-PT-6b-ReachabilityCardinality-00
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityCardinality-01
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityCardinality-02
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityCardinality-03
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityCardinality-04
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityCardinality-05
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityCardinality-06
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityCardinality-07
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityCardinality-08
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityCardinality-09
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityCardinality-10
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityCardinality-11
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityCardinality-12
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityCardinality-13
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityCardinality-14
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1526487380522


BK_STOP 1526488485956

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using CloudDeployment-PT-6b as instance name.
Using CloudDeployment as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': None, 'Source Transition': False, 'Sink Transition': True, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 1314694, 'Memory': 4116.84, 'Tool': 'lola'}, {'Time': 1320043, 'Memory': 4112.24, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola CloudDeployment-PT-6b...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
CloudDeployment-PT-6b: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
CloudDeployment-PT-6b: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityCardinality @ CloudDeployment-PT-6b @ 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: 8692/65536 symbol table entries, 2115 collisions
lola: preprocessing...
lola: finding significant places
lola: 1888 places, 6804 transitions, 1863 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2833 transition conflict sets
lola: TASK
lola: reading formula from CloudDeployment-PT-6b-ReachabilityCardinality.task
lola: A (G (((p178 <= p1828) OR (3 <= p1498) OR (p196 + 1 <= p1728) OR (2 <= p1442)))) : A (G ((p1383 <= p807))) : E (F (((2 <= p125) AND (p1444 <= p1432) AND (p1141 <= p1049) AND (1 <= p1501)))) : E (F ((3 <= p339))) : E (F (((p703 + 1 <= p225) AND (p1821 + 1 <= p724) AND ((p827 + 1 <= p1818) OR (p916 + 1 <= p1459))))) : A (G ((((p1629 + 1 <= p751) AND ((p657 <= p1843) OR (p689 <= p1660))) OR (((p893 <= p981) OR (p77 <= p1240)) AND (p1482 <= 2))))) : E (F ((((3 <= p745) AND (p1145 <= p1672)) OR ((p1129 <= p771) AND (3 <= p1855)) OR ((2 <= p1469) AND (p1500 <= p980))))) : E (F (((p1379 + 1 <= p1883) AND (p1121 + 1 <= p1180) AND (p262 <= p1134)))) : E (F (((2 <= p536) AND (p230 <= p174) AND (p534 <= p167) AND ((p461 <= 2) OR (p794 + 1 <= p861))))) : E (F (((3 <= p1834) OR ((p393 + 1 <= p1453) AND (p546 <= 0))))) : E (F (((p1556 + 1 <= p445) AND (p466 + 1 <= p178) AND (p179 <= p1746)))) : E (F (((1 <= p245) OR (((p1167 <= p851) OR (p207 <= p21)) AND ((1 <= p322) OR (2 <= p577)))))) : E (F ((((p1204 + 1 <= p528) AND (p886 <= 0)) OR ((p1186 <= p1793) AND (1 <= p21) AND (1 <= p491))))) : E (F ((((p507 <= p1025) OR (1 <= p48)) AND (p1029 <= p1403) AND (1 <= p327)))) : A (G ((p866 <= p21))) : A (G ((p1165 <= p748)))
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 (G (((p178 <= p1828) OR (3 <= p1498) OR (p196 + 1 <= p1728) OR (2 <= p1442))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 236 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-6b-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-6b-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 81343 markings, 106699 edges, 16269 markings/sec, 0 secs
lola: sara is running 5 secs || 144798 markings, 209386 edges, 12691 markings/sec, 5 secs
lola: sara is running 10 secs || 208149 markings, 323309 edges, 12670 markings/sec, 10 secs
lola: sara is running 15 secs || 266243 markings, 451882 edges, 11619 markings/sec, 15 secs
lola: sara is running 20 secs || 329767 markings, 544546 edges, 12705 markings/sec, 20 secs
lola: sara is running 25 secs || 392164 markings, 657376 edges, 12479 markings/sec, 25 secs
lola: sara is running 30 secs || 451346 markings, 786482 edges, 11836 markings/sec, 30 secs
lola: sara is running 35 secs || 512531 markings, 889496 edges, 12237 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 40 secs || 573798 markings, 1002848 edges, 12253 markings/sec, 40 secs

lola: sara is running 45 secs || 637015 markings, 1115428 edges, 12643 markings/sec, 45 secs
lola: sara is running 50 secs || 697651 markings, 1232997 edges, 12127 markings/sec, 50 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 232 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p1383 <= p807)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 236 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-6b-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-6b-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 272 markings, 271 edges
lola: ========================================
lola: subprocess 2 will run for 248 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p125) AND (p1444 <= p1432) AND (p1141 <= p1049) AND (1 <= p1501))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 236 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-6b-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-6b-ReachabilityCardinality-2.sara.
lola: sara is running 0 secs || 124274 markings, 162613 edges, 24855 markings/sec, 0 secs
lola: sara is running 5 secs || 251066 markings, 305323 edges, 25358 markings/sec, 5 secs
lola: sara is running 10 secs || 374702 markings, 453674 edges, 24727 markings/sec, 10 secs
lola: sara is running 15 secs || 489127 markings, 637159 edges, 22885 markings/sec, 15 secs
lola: sara is running 20 secs || 606853 markings, 825267 edges, 23545 markings/sec, 20 secs
lola: sara is running 25 secs || 732797 markings, 994037 edges, 25189 markings/sec, 25 secs
lola: sara is running 30 secs || 859827 markings, 1138835 edges, 25406 markings/sec, 30 secs
lola: sara is running 35 secs || 986344 markings, 1290123 edges, 25303 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 40 secs || 1103372 markings, 1479308 edges, 23406 markings/sec, 40 secs
lola: sara is running 45 secs || 1223435 markings, 1669070 edges, 24013 markings/sec, 45 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 3 will run for 263 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p339)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 236 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-6b-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-6b-ReachabilityCardinality-3.sara.
lola: sara is running 0 secs || 128506 markings, 178247 edges, 25701 markings/sec, 0 secs
lola: sara is running 5 secs || 248179 markings, 376068 edges, 23935 markings/sec, 5 secs
lola: sara is running 10 secs || 363431 markings, 542492 edges, 23050 markings/sec, 10 secs
lola: sara is running 15 secs || 479046 markings, 725430 edges, 23123 markings/sec, 15 secs
lola: sara is running 20 secs || 595680 markings, 918966 edges, 23327 markings/sec, 20 secs
lola: sara is running 25 secs || 708687 markings, 1114963 edges, 22601 markings/sec, 25 secs
lola: sara is running 30 secs || 838501 markings, 1274948 edges, 25963 markings/sec, 30 secs
lola: sara is running 35 secs || 963415 markings, 1442270 edges, 24983 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 40 secs || 1079337 markings, 1618025 edges, 23184 markings/sec, 40 secs
lola: sara is running 45 secs || 1201255 markings, 1801818 edges, 24384 markings/sec, 45 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 4 will run for 281 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p703 + 1 <= p225) AND (p1821 + 1 <= p724) AND ((p827 + 1 <= p1818) OR (p916 + 1 <= p1459)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 236 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-6b-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-6b-ReachabilityCardinality-4.sara.
lola: sara is running 0 secs || 19434 markings, 20560 edges, 3887 markings/sec, 0 secs
lola: sara is running 5 secs || 39511 markings, 41813 edges, 4015 markings/sec, 5 secs
lola: sara is running 10 secs || 57339 markings, 61383 edges, 3566 markings/sec, 10 secs
lola: sara is running 15 secs || 73528 markings, 80141 edges, 3238 markings/sec, 15 secs
lola: sara is running 20 secs || 89843 markings, 97864 edges, 3263 markings/sec, 20 secs
lola: sara is running 25 secs || 106118 markings, 115237 edges, 3255 markings/sec, 25 secs
lola: sara is running 30 secs || 122313 markings, 132524 edges, 3239 markings/sec, 30 secs
lola: sara is running 35 secs || 138580 markings, 149894 edges, 3253 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 40 secs || 155015 markings, 167441 edges, 3287 markings/sec, 40 secs
lola: sara is running 45 secs || 171572 markings, 185117 edges, 3311 markings/sec, 45 secs
lola: sara is running 50 secs || 188032 markings, 202719 edges, 3292 markings/sec, 50 secs
lola: sara is running 55 secs || 204492 markings, 220778 edges, 3292 markings/sec, 55 secs
lola: sara is running 60 secs || 220127 markings, 242443 edges, 3127 markings/sec, 60 secs
lola: sara is running 65 secs || 236294 markings, 260992 edges, 3233 markings/sec, 65 secs
lola: sara is running 70 secs || 252826 markings, 278691 edges, 3306 markings/sec, 70 secs
lola: sara is running 75 secs || 269397 markings, 296433 edges, 3314 markings/sec, 75 secs
lola: sara is running 80 secs || 285917 markings, 314156 edges, 3304 markings/sec, 80 secs
lola: sara is running 85 secs || 302410 markings, 331824 edges, 3299 markings/sec, 85 secs
lola: sara is running 90 secs || 318929 markings, 349522 edges, 3304 markings/sec, 90 secs
lola: sara is running 95 secs || 335400 markings, 367202 edges, 3294 markings/sec, 95 secs
lola: sara is running 100 secs || 352028 markings, 385106 edges, 3326 markings/sec, 100 secs
lola: sara is running 105 secs || 367814 markings, 403688 edges, 3157 markings/sec, 105 secs
lola: sara is running 110 secs || 383650 markings, 421776 edges, 3167 markings/sec, 110 secs
lola: sara is running 115 secs || 400057 markings, 439432 edges, 3281 markings/sec, 115 secs
lola: sara is running 120 secs || 416619 markings, 457110 edges, 3312 markings/sec, 120 secs
lola: sara is running 125 secs || 433170 markings, 474774 edges, 3310 markings/sec, 125 secs
lola: sara is running 130 secs || 449670 markings, 492392 edges, 3300 markings/sec, 130 secs
lola: sara is running 135 secs || 466214 markings, 510062 edges, 3309 markings/sec, 135 secs
lola: sara is running 140 secs || 482531 markings, 527480 edges, 3263 markings/sec, 140 secs
lola: sara is running 145 secs || 499158 markings, 545258 edges, 3325 markings/sec, 145 secs
lola: sara is running 150 secs || 515330 markings, 564748 edges, 3234 markings/sec, 150 secs
lola: sara is running 155 secs || 530952 markings, 588654 edges, 3124 markings/sec, 155 secs
lola: sara is running 160 secs || 547229 markings, 607283 edges, 3255 markings/sec, 160 secs
lola: sara is running 165 secs || 563760 markings, 625006 edges, 3306 markings/sec, 165 secs
lola: sara is running 170 secs || 580289 markings, 642753 edges, 3306 markings/sec, 170 secs
lola: sara is running 175 secs || 596814 markings, 660556 edges, 3305 markings/sec, 175 secs
lola: sara is running 180 secs || 613345 markings, 678336 edges, 3306 markings/sec, 180 secs
lola: sara is running 185 secs || 629903 markings, 696142 edges, 3312 markings/sec, 185 secs
lola: sara is running 190 secs || 646427 markings, 714040 edges, 3305 markings/sec, 190 secs
lola: sara is running 195 secs || 662897 markings, 732898 edges, 3294 markings/sec, 195 secs
lola: sara is running 200 secs || 678347 markings, 753895 edges, 3090 markings/sec, 200 secs
lola: sara is running 205 secs || 694124 markings, 772511 edges, 3155 markings/sec, 205 secs
lola: sara is running 210 secs || 710378 markings, 789913 edges, 3251 markings/sec, 210 secs
lola: sara is running 215 secs || 726637 markings, 807319 edges, 3252 markings/sec, 215 secs
lola: sara is running 220 secs || 742880 markings, 824738 edges, 3249 markings/sec, 220 secs
lola: sara is running 225 secs || 759112 markings, 842133 edges, 3246 markings/sec, 225 secs
lola: sara is running 230 secs || 775363 markings, 859539 edges, 3250 markings/sec, 230 secs
lola: sara is running 235 secs || 791607 markings, 876949 edges, 3249 markings/sec, 235 secs
lola: sara is running 240 secs || 807985 markings, 894585 edges, 3276 markings/sec, 240 secs
lola: sara is running 245 secs || 823644 markings, 913884 edges, 3132 markings/sec, 245 secs
lola: sara is running 250 secs || 839025 markings, 934144 edges, 3076 markings/sec, 250 secs
lola: sara is running 255 secs || 855039 markings, 951923 edges, 3203 markings/sec, 255 secs
lola: sara is running 260 secs || 871284 markings, 969296 edges, 3249 markings/sec, 260 secs
lola: sara is running 265 secs || 887539 markings, 986703 edges, 3251 markings/sec, 265 secs
lola: sara is running 270 secs || 903785 markings, 1004128 edges, 3249 markings/sec, 270 secs
lola: sara is running 275 secs || 920019 markings, 1021522 edges, 3247 markings/sec, 275 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 281 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p1629 + 1 <= p751) AND ((p657 <= p1843) OR (p689 <= p1660))) OR (((p893 <= p981) OR (p77 <= p1240)) AND (p1482 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 236 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-6b-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-6b-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 155 markings, 159 edges
lola: ========================================
lola: subprocess 6 will run for 309 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((3 <= p745) AND (p1145 <= p1672)) OR ((p1129 <= p771) AND (3 <= p1855)) OR ((2 <= p1469) AND (p1500 <= p980)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 236 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-6b-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-6b-ReachabilityCardinality-6.sara.
lola: sara is running 0 secs || 82080 markings, 135548 edges, 16416 markings/sec, 0 secs
lola: sara is running 5 secs || 159098 markings, 289379 edges, 15404 markings/sec, 5 secs
lola: sara is running 10 secs || 233412 markings, 482022 edges, 14863 markings/sec, 10 secs
lola: sara is running 15 secs || 315435 markings, 607155 edges, 16405 markings/sec, 15 secs
lola: sara is running 20 secs || 388582 markings, 807634 edges, 14629 markings/sec, 20 secs
lola: sara is running 25 secs || 472343 markings, 947106 edges, 16752 markings/sec, 25 secs
lola: sara is running 30 secs || 556231 markings, 1093254 edges, 16778 markings/sec, 30 secs
lola: sara is running 35 secs || 635534 markings, 1256894 edges, 15861 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 40 secs || 713216 markings, 1416293 edges, 15536 markings/sec, 40 secs

lola: sara is running 45 secs || 792020 markings, 1555269 edges, 15761 markings/sec, 45 secs
lola: sara is running 50 secs || 872648 markings, 1696992 edges, 16126 markings/sec, 50 secs
lola: sara is running 55 secs || 951153 markings, 1863353 edges, 15701 markings/sec, 55 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 337 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p1379 + 1 <= p1883) AND (p1121 + 1 <= p1180) AND (p262 <= p1134))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 236 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-6b-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-6b-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 32 markings, 31 edges
lola: ========================================
lola: subprocess 8 will run for 379 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p536) AND (p230 <= p174) AND (p534 <= p167) AND ((p461 <= 2) OR (p794 + 1 <= p861)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 236 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-6b-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-6b-ReachabilityCardinality-8.sara.
lola: sara is running 0 secs || 66961 markings, 169292 edges, 13392 markings/sec, 0 secs
lola: sara is running 5 secs || 126548 markings, 367222 edges, 11917 markings/sec, 5 secs
lola: sara is running 10 secs || 184693 markings, 589581 edges, 11629 markings/sec, 10 secs
lola: sara is running 15 secs || 242556 markings, 823196 edges, 11573 markings/sec, 15 secs
lola: sara is running 20 secs || 295399 markings, 1076760 edges, 10569 markings/sec, 20 secs
lola: sara is running 25 secs || 353153 markings, 1229433 edges, 11551 markings/sec, 25 secs
lola: sara is running 30 secs || 405832 markings, 1403489 edges, 10536 markings/sec, 30 secs
lola: sara is running 35 secs || 458031 markings, 1630853 edges, 10440 markings/sec, 35 secs
lola: sara is running 40 secs || 514643 markings, 1894872 edges, 11322 markings/sec, 40 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 45 secs || 566142 markings, 2171214 edges, 10300 markings/sec, 45 secs

lola: sara is running 50 secs || 620012 markings, 2417624 edges, 10774 markings/sec, 50 secs
lola: sara is running 55 secs || 675018 markings, 2639015 edges, 11001 markings/sec, 55 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 9 will run for 425 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p1834) OR ((p393 + 1 <= p1453) AND (p546 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 236 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-6b-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-6b-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 177 markings, 184 edges
lola: ========================================
lola: subprocess 10 will run for 496 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p1556 + 1 <= p445) AND (p466 + 1 <= p178) AND (p179 <= p1746))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 236 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-6b-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-6b-ReachabilityCardinality-10.sara.
lola: sara is running 0 secs || 24475 markings, 58123 edges, 4895 markings/sec, 0 secs
lola: sara is running 5 secs || 46264 markings, 135624 edges, 4358 markings/sec, 5 secs
lola: sara is running 10 secs || 67927 markings, 199225 edges, 4333 markings/sec, 10 secs
lola: sara is running 15 secs || 89679 markings, 256390 edges, 4350 markings/sec, 15 secs
lola: sara is running 20 secs || 111511 markings, 301468 edges, 4366 markings/sec, 20 secs
lola: sara is running 25 secs || 132342 markings, 371104 edges, 4166 markings/sec, 25 secs
lola: sara is running 30 secs || 154147 markings, 416883 edges, 4361 markings/sec, 30 secs
lola: sara is running 35 secs || 175802 markings, 465493 edges, 4331 markings/sec, 35 secs
lola: sara is running 40 secs || 197680 markings, 519700 edges, 4376 markings/sec, 40 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 45 secs || 218821 markings, 601153 edges, 4228 markings/sec, 45 secs
lola: sara is running 50 secs || 240040 markings, 681817 edges, 4244 markings/sec, 50 secs
lola: sara is running 55 secs || 261356 markings, 761398 edges, 4263 markings/sec, 55 secs
lola: sara is running 60 secs || 282310 markings, 850074 edges, 4191 markings/sec, 60 secs
lola: sara is running 65 secs || 302595 markings, 959944 edges, 4057 markings/sec, 65 secs
lola: sara is running 70 secs || 322382 markings, 1076212 edges, 3957 markings/sec, 70 secs
lola: sara is running 75 secs || 343358 markings, 1146167 edges, 4195 markings/sec, 75 secs
lola: sara is running 80 secs || 364572 markings, 1212319 edges, 4243 markings/sec, 80 secs
lola: sara is running 85 secs || 385482 markings, 1287034 edges, 4182 markings/sec, 85 secs
lola: sara is running 90 secs || 406808 markings, 1336445 edges, 4265 markings/sec, 90 secs
lola: sara is running 95 secs || 427909 markings, 1399343 edges, 4220 markings/sec, 95 secs
lola: sara is running 100 secs || 448829 markings, 1472315 edges, 4184 markings/sec, 100 secs
lola: sara is running 105 secs || 469170 markings, 1545348 edges, 4068 markings/sec, 105 secs
lola: sara is running 110 secs || 489815 markings, 1619724 edges, 4129 markings/sec, 110 secs
lola: sara is running 115 secs || 510503 markings, 1687600 edges, 4138 markings/sec, 115 secs
lola: sara is running 120 secs || 531570 markings, 1751788 edges, 4213 markings/sec, 120 secs
lola: sara is running 125 secs || 551672 markings, 1836254 edges, 4020 markings/sec, 125 secs
lola: sara is running 130 secs || 571862 markings, 1909292 edges, 4038 markings/sec, 130 secs
lola: sara is running 135 secs || 592386 markings, 1977012 edges, 4105 markings/sec, 135 secs
lola: sara is running 140 secs || 613336 markings, 2043572 edges, 4190 markings/sec, 140 secs
lola: sara is running 145 secs || 633257 markings, 2125698 edges, 3984 markings/sec, 145 secs
lola: sara is running 150 secs || 653322 markings, 2195420 edges, 4013 markings/sec, 150 secs
lola: sara is running 155 secs || 673996 markings, 2259425 edges, 4135 markings/sec, 155 secs
lola: sara is running 160 secs || 693939 markings, 2332579 edges, 3989 markings/sec, 160 secs
lola: sara is running 165 secs || 714202 markings, 2397428 edges, 4053 markings/sec, 165 secs
lola: sara is running 170 secs || 735982 markings, 2471774 edges, 4356 markings/sec, 170 secs
lola: sara is running 175 secs || 760215 markings, 2552802 edges, 4847 markings/sec, 175 secs
lola: sara is running 180 secs || 784219 markings, 2631953 edges, 4801 markings/sec, 180 secs
lola: sara is running 185 secs || 808586 markings, 2695744 edges, 4873 markings/sec, 185 secs
lola: sara is running 190 secs || 833147 markings, 2744213 edges, 4912 markings/sec, 190 secs
lola: sara is running 195 secs || 855505 markings, 2818573 edges, 4472 markings/sec, 195 secs
lola: sara is running 200 secs || 879934 markings, 2869170 edges, 4886 markings/sec, 200 secs
lola: sara is running 205 secs || 904304 markings, 2924502 edges, 4874 markings/sec, 205 secs
lola: sara is running 210 secs || 928537 markings, 2992165 edges, 4847 markings/sec, 210 secs
lola: sara is running 215 secs || 952170 markings, 3085802 edges, 4727 markings/sec, 215 secs
lola: sara is running 220 secs || 975860 markings, 3171505 edges, 4738 markings/sec, 220 secs
lola: sara is running 225 secs || 999082 markings, 3273362 edges, 4644 markings/sec, 225 secs
lola: sara is running 230 secs || 1022027 markings, 3389349 edges, 4589 markings/sec, 230 secs
lola: sara is running 235 secs || 1043955 markings, 3518740 edges, 4386 markings/sec, 235 secs
lola: sara is running 240 secs || 1067207 markings, 3596097 edges, 4650 markings/sec, 240 secs
lola: sara is running 245 secs || 1090769 markings, 3669720 edges, 4712 markings/sec, 245 secs
lola: sara is running 250 secs || 1113798 markings, 3752121 edges, 4606 markings/sec, 250 secs
lola: sara is running 255 secs || 1137460 markings, 3803928 edges, 4732 markings/sec, 255 secs
lola: sara is running 260 secs || 1160998 markings, 3878141 edges, 4708 markings/sec, 260 secs
lola: sara is running 265 secs || 1183530 markings, 3963911 edges, 4506 markings/sec, 265 secs
lola: sara is running 270 secs || 1206088 markings, 4043483 edges, 4512 markings/sec, 270 secs
lola: sara is running 275 secs || 1229021 markings, 4119307 edges, 4587 markings/sec, 275 secs
lola: sara is running 280 secs || 1252193 markings, 4189764 edges, 4634 markings/sec, 280 secs
lola: sara is running 285 secs || 1274323 markings, 4282025 edges, 4426 markings/sec, 285 secs
lola: sara is running 290 secs || 1296319 markings, 4366324 edges, 4399 markings/sec, 290 secs
lola: sara is running 295 secs || 1319198 markings, 4430669 edges, 4576 markings/sec, 295 secs
lola: sara is running 300 secs || 1341706 markings, 4518602 edges, 4502 markings/sec, 300 secs
lola: sara is running 305 secs || 1363640 markings, 4597942 edges, 4387 markings/sec, 305 secs
lola: sara is running 310 secs || 1386042 markings, 4673542 edges, 4480 markings/sec, 310 secs
lola: sara is running 315 secs || 1407933 markings, 4749784 edges, 4378 markings/sec, 315 secs
lola: sara is running 320 secs || 1429897 markings, 4820852 edges, 4393 markings/sec, 320 secs
lola: sara is running 325 secs || 1452866 markings, 4897972 edges, 4594 markings/sec, 325 secs
lola: sara is running 330 secs || 1484772 markings, 4933883 edges, 6381 markings/sec, 330 secs
lola: sara is running 335 secs || 1512847 markings, 4984129 edges, 5615 markings/sec, 335 secs
lola: sara is running 340 secs || 1543860 markings, 5026866 edges, 6203 markings/sec, 340 secs
lola: sara is running 345 secs || 1570466 markings, 5075592 edges, 5321 markings/sec, 345 secs
lola: sara is running 350 secs || 1600137 markings, 5122729 edges, 5934 markings/sec, 350 secs
lola: sara is running 355 secs || 1628119 markings, 5176324 edges, 5596 markings/sec, 355 secs
lola: sara is running 360 secs || 1655823 markings, 5229720 edges, 5541 markings/sec, 360 secs
lola: sara is running 365 secs || 1682203 markings, 5281156 edges, 5276 markings/sec, 365 secs
lola: sara is running 370 secs || 1710063 markings, 5332602 edges, 5572 markings/sec, 370 secs
lola: sara is running 375 secs || 1742673 markings, 5372679 edges, 6522 markings/sec, 375 secs
lola: sara is running 380 secs || 1771406 markings, 5420867 edges, 5747 markings/sec, 380 secs
lola: sara is running 385 secs || 1801527 markings, 5466881 edges, 6024 markings/sec, 385 secs
lola: sara is running 390 secs || 1832615 markings, 5511397 edges, 6218 markings/sec, 390 secs
lola: sara is running 395 secs || 1862031 markings, 5562122 edges, 5883 markings/sec, 395 secs
lola: sara is running 400 secs || 1895230 markings, 5603141 edges, 6640 markings/sec, 400 secs
lola: sara is running 405 secs || 1922031 markings, 5654086 edges, 5360 markings/sec, 405 secs
lola: sara is running 410 secs || 1950834 markings, 5711772 edges, 5761 markings/sec, 410 secs
lola: sara is running 415 secs || 1976518 markings, 5762952 edges, 5137 markings/sec, 415 secs
lola: sara is running 420 secs || 2006100 markings, 5800802 edges, 5916 markings/sec, 420 secs
lola: sara is running 425 secs || 2031957 markings, 5852840 edges, 5171 markings/sec, 425 secs
lola: sara is running 430 secs || 2062445 markings, 5892927 edges, 6098 markings/sec, 430 secs
lola: sara is running 435 secs || 2092606 markings, 5934319 edges, 6032 markings/sec, 435 secs
lola: sara is running 440 secs || 2122608 markings, 5975751 edges, 6000 markings/sec, 440 secs
lola: sara is running 445 secs || 2152208 markings, 6017642 edges, 5920 markings/sec, 445 secs
lola: sara is running 450 secs || 2181371 markings, 6060052 edges, 5833 markings/sec, 450 secs
lola: sara is running 455 secs || 2210261 markings, 6103940 edges, 5778 markings/sec, 455 secs
lola: sara is running 460 secs || 2237506 markings, 6160113 edges, 5449 markings/sec, 460 secs
lola: sara is running 465 secs || 2264433 markings, 6204845 edges, 5385 markings/sec, 465 secs
lola: sara is running 470 secs || 2292041 markings, 6260776 edges, 5522 markings/sec, 470 secs
lola: sara is running 475 secs || 2319241 markings, 6310445 edges, 5440 markings/sec, 475 secs
lola: sara is running 480 secs || 2346306 markings, 6363322 edges, 5413 markings/sec, 480 secs
lola: sara is running 485 secs || 2371668 markings, 6436112 edges, 5072 markings/sec, 485 secs
lola: sara is running 490 secs || 2398217 markings, 6505013 edges, 5310 markings/sec, 490 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 496 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p245) OR (((p1167 <= p851) OR (p207 <= p21)) AND ((1 <= p322) OR (2 <= p577))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 236 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 9 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-6b-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-6b-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 31 markings, 30 edges
lola: ========================================
lola: subprocess 12 will run for 620 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p1204 + 1 <= p528) AND (p886 <= 0)) OR ((p1186 <= p1793) AND (1 <= p21) AND (1 <= p491)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 236 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-6b-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-6b-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 190 markings, 190 edges
lola: ========================================
lola: subprocess 13 will run for 826 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p507 <= p1025) OR (1 <= p48)) AND (p1029 <= p1403) AND (1 <= p327))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 236 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-6b-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-6b-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 163 markings, 162 edges
lola: ========================================
lola: subprocess 14 will run for 1239 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p866 <= p21)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 236 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-6b-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-6b-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 123 markings, 128 edges
lola: ========================================
lola: subprocess 15 will run for 2479 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p1165 <= p748)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 236 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-6b-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-6b-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 40 markings, 39 edges
lola: RESULT
lola:
SUMMARY: no no no no unknown no no yes no yes unknown yes yes yes no no
lola: ========================================
FORMULA CloudDeployment-PT-6b-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-6b-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-6b-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-6b-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-6b-ReachabilityCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-6b-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-6b-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-6b-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-6b-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-6b-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-6b-ReachabilityCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-6b-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-6b-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-6b-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-6b-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-6b-ReachabilityCardinality-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="CloudDeployment-PT-6b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="irma4mcc-structural"
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/CloudDeployment-PT-6b.tgz
mv CloudDeployment-PT-6b 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-structural"
echo " Input is CloudDeployment-PT-6b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r043-smll-152646359600257"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;