fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r178-tajo-158987882200347
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for Dekker-PT-200

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15757.860 3600000.00 3732987.00 60432.60 F?TFF?TTFF?TFFFT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987882200347.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is Dekker-PT-200, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882200347
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 25M
-rw-r--r-- 1 mcc users 3.5K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 27 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 14:36 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 27 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 27 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 27 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 27 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 equiv_col
-rw-r--r-- 1 mcc users 4 Apr 27 14:36 instance
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 iscolored
-rw-r--r-- 1 mcc users 25M Apr 27 14:36 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Dekker-PT-200-CTLCardinality-00
FORMULA_NAME Dekker-PT-200-CTLCardinality-01
FORMULA_NAME Dekker-PT-200-CTLCardinality-02
FORMULA_NAME Dekker-PT-200-CTLCardinality-03
FORMULA_NAME Dekker-PT-200-CTLCardinality-04
FORMULA_NAME Dekker-PT-200-CTLCardinality-05
FORMULA_NAME Dekker-PT-200-CTLCardinality-06
FORMULA_NAME Dekker-PT-200-CTLCardinality-07
FORMULA_NAME Dekker-PT-200-CTLCardinality-08
FORMULA_NAME Dekker-PT-200-CTLCardinality-09
FORMULA_NAME Dekker-PT-200-CTLCardinality-10
FORMULA_NAME Dekker-PT-200-CTLCardinality-11
FORMULA_NAME Dekker-PT-200-CTLCardinality-12
FORMULA_NAME Dekker-PT-200-CTLCardinality-13
FORMULA_NAME Dekker-PT-200-CTLCardinality-14
FORMULA_NAME Dekker-PT-200-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591218067038

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 21:01:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 21:01:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 21:01:09] [INFO ] Load time of PNML (sax parser for PT used): 1052 ms
[2020-06-03 21:01:09] [INFO ] Transformed 1000 places.
[2020-06-03 21:01:10] [INFO ] Transformed 40400 transitions.
[2020-06-03 21:01:10] [INFO ] Found NUPN structural information;
[2020-06-03 21:01:10] [INFO ] Parsed PT model containing 1000 places and 40400 transitions in 1311 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 178 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 4706 ms. (steps per millisecond=21 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1]
[2020-06-03 21:01:15] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 1000 cols
[2020-06-03 21:01:15] [INFO ] Computed 600 place invariants in 35 ms
[2020-06-03 21:01:15] [INFO ] [Real]Absence check using 400 positive place invariants in 195 ms returned sat
[2020-06-03 21:01:15] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 119 ms returned sat
[2020-06-03 21:01:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:01:17] [INFO ] [Real]Absence check using state equation in 2037 ms returned sat
[2020-06-03 21:01:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:01:18] [INFO ] [Nat]Absence check using 400 positive place invariants in 267 ms returned sat
[2020-06-03 21:01:18] [INFO ] [Nat]Absence check using 400 positive and 200 generalized place invariants in 123 ms returned sat
[2020-06-03 21:01:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:01:20] [INFO ] [Nat]Absence check using state equation in 2113 ms returned sat
[2020-06-03 21:01:20] [INFO ] State equation strengthened by 200 read => feed constraints.
[2020-06-03 21:01:21] [INFO ] [Nat]Added 200 Read/Feed constraints in 163 ms returned sat
[2020-06-03 21:01:21] [INFO ] Deduced a trap composed of 4 places in 873 ms
[2020-06-03 21:01:22] [INFO ] Deduced a trap composed of 4 places in 561 ms
[2020-06-03 21:01:23] [INFO ] Deduced a trap composed of 4 places in 614 ms
[2020-06-03 21:01:24] [INFO ] Deduced a trap composed of 4 places in 812 ms
[2020-06-03 21:01:24] [INFO ] Deduced a trap composed of 4 places in 609 ms
[2020-06-03 21:01:25] [INFO ] Deduced a trap composed of 6 places in 703 ms
[2020-06-03 21:01:26] [INFO ] Deduced a trap composed of 4 places in 628 ms
[2020-06-03 21:01:26] [INFO ] Deduced a trap composed of 4 places in 502 ms
[2020-06-03 21:01:27] [INFO ] Deduced a trap composed of 4 places in 536 ms
[2020-06-03 21:01:27] [INFO ] Deduced a trap composed of 5 places in 494 ms
[2020-06-03 21:01:28] [INFO ] Deduced a trap composed of 4 places in 485 ms
[2020-06-03 21:01:28] [INFO ] Deduced a trap composed of 6 places in 437 ms
[2020-06-03 21:01:29] [INFO ] Deduced a trap composed of 4 places in 599 ms
[2020-06-03 21:01:30] [INFO ] Deduced a trap composed of 4 places in 527 ms
[2020-06-03 21:01:30] [INFO ] Deduced a trap composed of 5 places in 416 ms
[2020-06-03 21:01:31] [INFO ] Deduced a trap composed of 5 places in 436 ms
[2020-06-03 21:01:31] [INFO ] Deduced a trap composed of 4 places in 436 ms
[2020-06-03 21:01:32] [INFO ] Deduced a trap composed of 4 places in 422 ms
[2020-06-03 21:01:32] [INFO ] Deduced a trap composed of 4 places in 379 ms
[2020-06-03 21:01:32] [INFO ] Deduced a trap composed of 6 places in 384 ms
[2020-06-03 21:01:33] [INFO ] Deduced a trap composed of 4 places in 405 ms
[2020-06-03 21:01:33] [INFO ] Deduced a trap composed of 4 places in 397 ms
[2020-06-03 21:01:34] [INFO ] Deduced a trap composed of 6 places in 443 ms
[2020-06-03 21:01:34] [INFO ] Deduced a trap composed of 5 places in 339 ms
[2020-06-03 21:01:35] [INFO ] Deduced a trap composed of 4 places in 453 ms
[2020-06-03 21:01:35] [INFO ] Deduced a trap composed of 5 places in 440 ms
[2020-06-03 21:01:36] [INFO ] Deduced a trap composed of 4 places in 434 ms
[2020-06-03 21:01:36] [INFO ] Deduced a trap composed of 5 places in 418 ms
[2020-06-03 21:01:37] [INFO ] Deduced a trap composed of 4 places in 509 ms
[2020-06-03 21:01:37] [INFO ] Deduced a trap composed of 6 places in 458 ms
[2020-06-03 21:01:43] [INFO ] Deduced a trap composed of 2 places in 5528 ms
[2020-06-03 21:01:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s188 s189) 0)") while checking expression at index 0
[2020-06-03 21:01:43] [INFO ] [Real]Absence check using 400 positive place invariants in 188 ms returned sat
[2020-06-03 21:01:43] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 127 ms returned sat
[2020-06-03 21:01:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:01:45] [INFO ] [Real]Absence check using state equation in 1927 ms returned sat
[2020-06-03 21:01:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:01:46] [INFO ] [Nat]Absence check using 400 positive place invariants in 245 ms returned sat
[2020-06-03 21:01:46] [INFO ] [Nat]Absence check using 400 positive and 200 generalized place invariants in 164 ms returned sat
[2020-06-03 21:01:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:01:48] [INFO ] [Nat]Absence check using state equation in 2106 ms returned sat
[2020-06-03 21:01:48] [INFO ] [Nat]Added 200 Read/Feed constraints in 110 ms returned sat
[2020-06-03 21:01:49] [INFO ] Deduced a trap composed of 4 places in 764 ms
[2020-06-03 21:01:49] [INFO ] Deduced a trap composed of 4 places in 664 ms
[2020-06-03 21:01:50] [INFO ] Deduced a trap composed of 4 places in 564 ms
[2020-06-03 21:01:51] [INFO ] Deduced a trap composed of 4 places in 585 ms
[2020-06-03 21:01:51] [INFO ] Deduced a trap composed of 4 places in 556 ms
[2020-06-03 21:01:52] [INFO ] Deduced a trap composed of 4 places in 545 ms
[2020-06-03 21:01:52] [INFO ] Deduced a trap composed of 6 places in 503 ms
[2020-06-03 21:01:53] [INFO ] Deduced a trap composed of 4 places in 510 ms
[2020-06-03 21:01:54] [INFO ] Deduced a trap composed of 6 places in 521 ms
[2020-06-03 21:01:54] [INFO ] Deduced a trap composed of 4 places in 509 ms
[2020-06-03 21:01:55] [INFO ] Deduced a trap composed of 4 places in 483 ms
[2020-06-03 21:01:55] [INFO ] Deduced a trap composed of 4 places in 457 ms
[2020-06-03 21:01:56] [INFO ] Deduced a trap composed of 6 places in 464 ms
[2020-06-03 21:01:56] [INFO ] Deduced a trap composed of 4 places in 460 ms
[2020-06-03 21:01:57] [INFO ] Deduced a trap composed of 4 places in 437 ms
[2020-06-03 21:01:57] [INFO ] Deduced a trap composed of 6 places in 463 ms
[2020-06-03 21:01:58] [INFO ] Deduced a trap composed of 4 places in 557 ms
[2020-06-03 21:01:58] [INFO ] Deduced a trap composed of 4 places in 491 ms
[2020-06-03 21:01:59] [INFO ] Deduced a trap composed of 4 places in 439 ms
[2020-06-03 21:01:59] [INFO ] Deduced a trap composed of 4 places in 373 ms
[2020-06-03 21:02:00] [INFO ] Deduced a trap composed of 4 places in 360 ms
[2020-06-03 21:02:00] [INFO ] Deduced a trap composed of 4 places in 354 ms
[2020-06-03 21:02:00] [INFO ] Deduced a trap composed of 4 places in 359 ms
[2020-06-03 21:02:01] [INFO ] Deduced a trap composed of 4 places in 281 ms
[2020-06-03 21:02:01] [INFO ] Deduced a trap composed of 4 places in 330 ms
[2020-06-03 21:02:02] [INFO ] Deduced a trap composed of 4 places in 333 ms
[2020-06-03 21:02:02] [INFO ] Deduced a trap composed of 4 places in 291 ms
[2020-06-03 21:02:02] [INFO ] Deduced a trap composed of 4 places in 309 ms
[2020-06-03 21:02:03] [INFO ] Deduced a trap composed of 4 places in 374 ms
[2020-06-03 21:02:03] [INFO ] Deduced a trap composed of 4 places in 340 ms
[2020-06-03 21:02:03] [INFO ] Deduced a trap composed of 4 places in 330 ms
[2020-06-03 21:02:04] [INFO ] Deduced a trap composed of 4 places in 303 ms
[2020-06-03 21:02:04] [INFO ] Deduced a trap composed of 4 places in 300 ms
[2020-06-03 21:02:05] [INFO ] Deduced a trap composed of 4 places in 305 ms
[2020-06-03 21:02:05] [INFO ] Deduced a trap composed of 4 places in 300 ms
[2020-06-03 21:02:05] [INFO ] Deduced a trap composed of 4 places in 296 ms
[2020-06-03 21:02:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s198 s398 s698 s998) 0)") while checking expression at index 1
[2020-06-03 21:02:06] [INFO ] [Real]Absence check using 400 positive place invariants in 306 ms returned sat
[2020-06-03 21:02:06] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 175 ms returned sat
[2020-06-03 21:02:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:02:08] [INFO ] [Real]Absence check using state equation in 2267 ms returned sat
[2020-06-03 21:02:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:02:09] [INFO ] [Nat]Absence check using 400 positive place invariants in 251 ms returned sat
[2020-06-03 21:02:09] [INFO ] [Nat]Absence check using 400 positive and 200 generalized place invariants in 172 ms returned sat
[2020-06-03 21:02:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:02:11] [INFO ] [Nat]Absence check using state equation in 2107 ms returned sat
[2020-06-03 21:02:11] [INFO ] [Nat]Added 200 Read/Feed constraints in 108 ms returned sat
[2020-06-03 21:02:12] [INFO ] Deduced a trap composed of 4 places in 667 ms
[2020-06-03 21:02:12] [INFO ] Deduced a trap composed of 4 places in 650 ms
[2020-06-03 21:02:13] [INFO ] Deduced a trap composed of 4 places in 572 ms
[2020-06-03 21:02:14] [INFO ] Deduced a trap composed of 4 places in 489 ms
[2020-06-03 21:02:14] [INFO ] Deduced a trap composed of 4 places in 578 ms
[2020-06-03 21:02:15] [INFO ] Deduced a trap composed of 4 places in 576 ms
[2020-06-03 21:02:16] [INFO ] Deduced a trap composed of 4 places in 684 ms
[2020-06-03 21:02:16] [INFO ] Deduced a trap composed of 4 places in 598 ms
[2020-06-03 21:02:17] [INFO ] Deduced a trap composed of 4 places in 605 ms
[2020-06-03 21:02:17] [INFO ] Deduced a trap composed of 4 places in 499 ms
[2020-06-03 21:02:18] [INFO ] Deduced a trap composed of 4 places in 495 ms
[2020-06-03 21:02:19] [INFO ] Deduced a trap composed of 4 places in 471 ms
[2020-06-03 21:02:19] [INFO ] Deduced a trap composed of 4 places in 448 ms
[2020-06-03 21:02:19] [INFO ] Deduced a trap composed of 4 places in 357 ms
[2020-06-03 21:02:20] [INFO ] Deduced a trap composed of 4 places in 486 ms
[2020-06-03 21:02:20] [INFO ] Deduced a trap composed of 4 places in 449 ms
[2020-06-03 21:02:21] [INFO ] Deduced a trap composed of 4 places in 453 ms
[2020-06-03 21:02:21] [INFO ] Deduced a trap composed of 4 places in 414 ms
[2020-06-03 21:02:22] [INFO ] Deduced a trap composed of 4 places in 394 ms
[2020-06-03 21:02:22] [INFO ] Deduced a trap composed of 4 places in 396 ms
[2020-06-03 21:02:23] [INFO ] Deduced a trap composed of 4 places in 377 ms
[2020-06-03 21:02:23] [INFO ] Deduced a trap composed of 4 places in 370 ms
[2020-06-03 21:02:24] [INFO ] Deduced a trap composed of 4 places in 345 ms
[2020-06-03 21:02:24] [INFO ] Deduced a trap composed of 4 places in 332 ms
[2020-06-03 21:02:24] [INFO ] Deduced a trap composed of 4 places in 319 ms
[2020-06-03 21:02:25] [INFO ] Deduced a trap composed of 4 places in 339 ms
[2020-06-03 21:02:25] [INFO ] Deduced a trap composed of 4 places in 369 ms
[2020-06-03 21:02:26] [INFO ] Deduced a trap composed of 4 places in 318 ms
[2020-06-03 21:02:26] [INFO ] Deduced a trap composed of 4 places in 298 ms
[2020-06-03 21:02:26] [INFO ] Deduced a trap composed of 4 places in 287 ms
[2020-06-03 21:02:27] [INFO ] Deduced a trap composed of 5 places in 275 ms
[2020-06-03 21:02:27] [INFO ] Deduced a trap composed of 5 places in 272 ms
[2020-06-03 21:02:27] [INFO ] Deduced a trap composed of 4 places in 300 ms
[2020-06-03 21:02:28] [INFO ] Deduced a trap composed of 4 places in 326 ms
[2020-06-03 21:02:28] [INFO ] Deduced a trap composed of 4 places in 320 ms
[2020-06-03 21:02:28] [INFO ] Deduced a trap composed of 5 places in 283 ms
[2020-06-03 21:02:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s16 s142 s425 s613 s614) 0)") while checking expression at index 2
[2020-06-03 21:02:29] [INFO ] [Real]Absence check using 400 positive place invariants in 249 ms returned sat
[2020-06-03 21:02:29] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 163 ms returned sat
[2020-06-03 21:02:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:02:31] [INFO ] [Real]Absence check using state equation in 2256 ms returned sat
[2020-06-03 21:02:31] [INFO ] [Real]Added 200 Read/Feed constraints in 106 ms returned sat
[2020-06-03 21:02:32] [INFO ] Deduced a trap composed of 4 places in 626 ms
[2020-06-03 21:02:33] [INFO ] Deduced a trap composed of 4 places in 601 ms
[2020-06-03 21:02:33] [INFO ] Deduced a trap composed of 4 places in 536 ms
[2020-06-03 21:02:34] [INFO ] Deduced a trap composed of 6 places in 518 ms
[2020-06-03 21:02:34] [INFO ] Deduced a trap composed of 4 places in 525 ms
[2020-06-03 21:02:35] [INFO ] Deduced a trap composed of 4 places in 489 ms
[2020-06-03 21:02:36] [INFO ] Deduced a trap composed of 4 places in 512 ms
[2020-06-03 21:02:36] [INFO ] Deduced a trap composed of 4 places in 474 ms
[2020-06-03 21:02:37] [INFO ] Deduced a trap composed of 5 places in 484 ms
[2020-06-03 21:02:37] [INFO ] Deduced a trap composed of 6 places in 459 ms
[2020-06-03 21:02:38] [INFO ] Deduced a trap composed of 4 places in 427 ms
[2020-06-03 21:02:38] [INFO ] Deduced a trap composed of 4 places in 406 ms
[2020-06-03 21:02:39] [INFO ] Deduced a trap composed of 4 places in 423 ms
[2020-06-03 21:02:39] [INFO ] Deduced a trap composed of 4 places in 487 ms
[2020-06-03 21:02:39] [INFO ] Deduced a trap composed of 6 places in 379 ms
[2020-06-03 21:02:40] [INFO ] Deduced a trap composed of 4 places in 377 ms
[2020-06-03 21:02:40] [INFO ] Deduced a trap composed of 6 places in 363 ms
[2020-06-03 21:02:41] [INFO ] Deduced a trap composed of 4 places in 364 ms
[2020-06-03 21:02:41] [INFO ] Deduced a trap composed of 4 places in 355 ms
[2020-06-03 21:02:42] [INFO ] Deduced a trap composed of 4 places in 541 ms
[2020-06-03 21:02:42] [INFO ] Deduced a trap composed of 4 places in 351 ms
[2020-06-03 21:02:43] [INFO ] Deduced a trap composed of 4 places in 343 ms
[2020-06-03 21:02:43] [INFO ] Deduced a trap composed of 4 places in 404 ms
[2020-06-03 21:02:44] [INFO ] Deduced a trap composed of 4 places in 386 ms
[2020-06-03 21:02:44] [INFO ] Deduced a trap composed of 4 places in 396 ms
[2020-06-03 21:02:44] [INFO ] Deduced a trap composed of 4 places in 410 ms
[2020-06-03 21:02:45] [INFO ] Deduced a trap composed of 4 places in 341 ms
[2020-06-03 21:02:45] [INFO ] Deduced a trap composed of 4 places in 301 ms
[2020-06-03 21:02:46] [INFO ] Deduced a trap composed of 4 places in 293 ms
[2020-06-03 21:02:46] [INFO ] Deduced a trap composed of 4 places in 266 ms
[2020-06-03 21:02:46] [INFO ] Deduced a trap composed of 4 places in 319 ms
[2020-06-03 21:02:47] [INFO ] Deduced a trap composed of 4 places in 292 ms
[2020-06-03 21:02:47] [INFO ] Deduced a trap composed of 4 places in 283 ms
[2020-06-03 21:02:47] [INFO ] Deduced a trap composed of 4 places in 310 ms
[2020-06-03 21:02:48] [INFO ] Deduced a trap composed of 4 places in 300 ms
[2020-06-03 21:02:48] [INFO ] Deduced a trap composed of 4 places in 322 ms
[2020-06-03 21:02:48] [INFO ] Deduced a trap composed of 4 places in 334 ms
[2020-06-03 21:02:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s98 s378 s548 s968) 0)") while checking expression at index 3
[2020-06-03 21:02:49] [INFO ] [Real]Absence check using 400 positive place invariants in 265 ms returned sat
[2020-06-03 21:02:49] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 168 ms returned sat
[2020-06-03 21:02:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:02:51] [INFO ] [Real]Absence check using state equation in 2045 ms returned sat
[2020-06-03 21:02:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:02:52] [INFO ] [Nat]Absence check using 400 positive place invariants in 255 ms returned sat
[2020-06-03 21:02:52] [INFO ] [Nat]Absence check using 400 positive and 200 generalized place invariants in 171 ms returned sat
[2020-06-03 21:02:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:02:54] [INFO ] [Nat]Absence check using state equation in 2103 ms returned sat
[2020-06-03 21:02:54] [INFO ] [Nat]Added 200 Read/Feed constraints in 107 ms returned sat
[2020-06-03 21:02:55] [INFO ] Deduced a trap composed of 4 places in 706 ms
[2020-06-03 21:02:55] [INFO ] Deduced a trap composed of 4 places in 666 ms
[2020-06-03 21:02:56] [INFO ] Deduced a trap composed of 4 places in 510 ms
[2020-06-03 21:02:56] [INFO ] Deduced a trap composed of 4 places in 521 ms
[2020-06-03 21:02:57] [INFO ] Deduced a trap composed of 4 places in 492 ms
[2020-06-03 21:02:58] [INFO ] Deduced a trap composed of 4 places in 492 ms
[2020-06-03 21:02:58] [INFO ] Deduced a trap composed of 4 places in 542 ms
[2020-06-03 21:02:59] [INFO ] Deduced a trap composed of 4 places in 429 ms
[2020-06-03 21:02:59] [INFO ] Deduced a trap composed of 5 places in 447 ms
[2020-06-03 21:03:00] [INFO ] Deduced a trap composed of 4 places in 413 ms
[2020-06-03 21:03:00] [INFO ] Deduced a trap composed of 4 places in 439 ms
[2020-06-03 21:03:01] [INFO ] Deduced a trap composed of 4 places in 413 ms
[2020-06-03 21:03:01] [INFO ] Deduced a trap composed of 4 places in 421 ms
[2020-06-03 21:03:02] [INFO ] Deduced a trap composed of 4 places in 388 ms
[2020-06-03 21:03:02] [INFO ] Deduced a trap composed of 4 places in 351 ms
[2020-06-03 21:03:02] [INFO ] Deduced a trap composed of 4 places in 369 ms
[2020-06-03 21:03:03] [INFO ] Deduced a trap composed of 6 places in 346 ms
[2020-06-03 21:03:03] [INFO ] Deduced a trap composed of 4 places in 383 ms
[2020-06-03 21:03:04] [INFO ] Deduced a trap composed of 4 places in 318 ms
[2020-06-03 21:03:04] [INFO ] Deduced a trap composed of 4 places in 300 ms
[2020-06-03 21:03:04] [INFO ] Deduced a trap composed of 4 places in 348 ms
[2020-06-03 21:03:05] [INFO ] Deduced a trap composed of 4 places in 312 ms
[2020-06-03 21:03:05] [INFO ] Deduced a trap composed of 4 places in 397 ms
[2020-06-03 21:03:06] [INFO ] Deduced a trap composed of 4 places in 430 ms
[2020-06-03 21:03:06] [INFO ] Deduced a trap composed of 4 places in 419 ms
[2020-06-03 21:03:07] [INFO ] Deduced a trap composed of 4 places in 418 ms
[2020-06-03 21:03:07] [INFO ] Deduced a trap composed of 4 places in 426 ms
[2020-06-03 21:03:08] [INFO ] Deduced a trap composed of 4 places in 454 ms
[2020-06-03 21:03:08] [INFO ] Deduced a trap composed of 4 places in 404 ms
[2020-06-03 21:03:08] [INFO ] Deduced a trap composed of 4 places in 426 ms
[2020-06-03 21:03:09] [INFO ] Deduced a trap composed of 4 places in 369 ms
[2020-06-03 21:03:09] [INFO ] Deduced a trap composed of 4 places in 296 ms
[2020-06-03 21:03:10] [INFO ] Deduced a trap composed of 4 places in 314 ms
[2020-06-03 21:03:10] [INFO ] Deduced a trap composed of 4 places in 398 ms
[2020-06-03 21:03:11] [INFO ] Deduced a trap composed of 4 places in 399 ms
[2020-06-03 21:03:11] [INFO ] Deduced a trap composed of 4 places in 396 ms
[2020-06-03 21:03:11] [INFO ] Deduced a trap composed of 4 places in 391 ms
[2020-06-03 21:03:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s66 s212 s500 s719) 0)") while checking expression at index 4
[2020-06-03 21:03:12] [INFO ] [Real]Absence check using 400 positive place invariants in 254 ms returned sat
[2020-06-03 21:03:12] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 169 ms returned sat
[2020-06-03 21:03:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:03:14] [INFO ] [Real]Absence check using state equation in 2361 ms returned sat
[2020-06-03 21:03:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:03:15] [INFO ] [Nat]Absence check using 400 positive place invariants in 244 ms returned sat
[2020-06-03 21:03:15] [INFO ] [Nat]Absence check using 400 positive and 200 generalized place invariants in 163 ms returned sat
[2020-06-03 21:03:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:03:17] [INFO ] [Nat]Absence check using state equation in 2146 ms returned sat
[2020-06-03 21:03:17] [INFO ] [Nat]Added 200 Read/Feed constraints in 115 ms returned sat
[2020-06-03 21:03:18] [INFO ] Deduced a trap composed of 4 places in 671 ms
[2020-06-03 21:03:19] [INFO ] Deduced a trap composed of 4 places in 585 ms
[2020-06-03 21:03:19] [INFO ] Deduced a trap composed of 4 places in 566 ms
[2020-06-03 21:03:20] [INFO ] Deduced a trap composed of 4 places in 551 ms
[2020-06-03 21:03:20] [INFO ] Deduced a trap composed of 4 places in 524 ms
[2020-06-03 21:03:21] [INFO ] Deduced a trap composed of 4 places in 567 ms
[2020-06-03 21:03:22] [INFO ] Deduced a trap composed of 4 places in 662 ms
[2020-06-03 21:03:22] [INFO ] Deduced a trap composed of 4 places in 549 ms
[2020-06-03 21:03:23] [INFO ] Deduced a trap composed of 6 places in 498 ms
[2020-06-03 21:03:23] [INFO ] Deduced a trap composed of 4 places in 517 ms
[2020-06-03 21:03:24] [INFO ] Deduced a trap composed of 6 places in 487 ms
[2020-06-03 21:03:24] [INFO ] Deduced a trap composed of 6 places in 492 ms
[2020-06-03 21:03:25] [INFO ] Deduced a trap composed of 4 places in 499 ms
[2020-06-03 21:03:25] [INFO ] Deduced a trap composed of 4 places in 465 ms
[2020-06-03 21:03:26] [INFO ] Deduced a trap composed of 4 places in 474 ms
[2020-06-03 21:03:26] [INFO ] Deduced a trap composed of 4 places in 436 ms
[2020-06-03 21:03:27] [INFO ] Deduced a trap composed of 4 places in 407 ms
[2020-06-03 21:03:27] [INFO ] Deduced a trap composed of 4 places in 417 ms
[2020-06-03 21:03:28] [INFO ] Deduced a trap composed of 4 places in 392 ms
[2020-06-03 21:03:28] [INFO ] Deduced a trap composed of 4 places in 420 ms
[2020-06-03 21:03:29] [INFO ] Deduced a trap composed of 4 places in 381 ms
[2020-06-03 21:03:29] [INFO ] Deduced a trap composed of 4 places in 539 ms
[2020-06-03 21:03:30] [INFO ] Deduced a trap composed of 4 places in 464 ms
[2020-06-03 21:03:30] [INFO ] Deduced a trap composed of 4 places in 428 ms
[2020-06-03 21:03:31] [INFO ] Deduced a trap composed of 4 places in 394 ms
[2020-06-03 21:03:31] [INFO ] Deduced a trap composed of 4 places in 430 ms
[2020-06-03 21:03:31] [INFO ] Deduced a trap composed of 4 places in 372 ms
[2020-06-03 21:03:32] [INFO ] Deduced a trap composed of 4 places in 381 ms
[2020-06-03 21:03:32] [INFO ] Deduced a trap composed of 4 places in 375 ms
[2020-06-03 21:03:33] [INFO ] Deduced a trap composed of 4 places in 390 ms
[2020-06-03 21:03:33] [INFO ] Deduced a trap composed of 4 places in 358 ms
[2020-06-03 21:03:34] [INFO ] Deduced a trap composed of 4 places in 479 ms
[2020-06-03 21:03:34] [INFO ] Deduced a trap composed of 4 places in 466 ms
[2020-06-03 21:03:35] [INFO ] Deduced a trap composed of 4 places in 439 ms
[2020-06-03 21:03:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s286 s332 s830 s899) 0)") while checking expression at index 5
[2020-06-03 21:03:37] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-03 21:03:37] [INFO ] Flatten gal took : 1982 ms
[2020-06-03 21:03:39] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-03 21:03:39] [INFO ] Flatten gal took : 1777 ms
FORMULA Dekker-PT-200-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 21:03:39] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2020-06-03 21:03:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 384 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ Dekker-PT-200 @ 3570 seconds

FORMULA Dekker-PT-200-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-200-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-200-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-200-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-200-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-200-CTLCardinality-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-200-CTLCardinality-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-200-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-200-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 757
rslt: Output for CTLCardinality @ Dekker-PT-200

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 436
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "E (G (NOT DEADLOCK))",
"processed_size": 20,
"rewrites": 21
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 40400
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": null,
"problems": null
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1073
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((p28 <= 0)) OR ((1 <= p653)) OR ((p982 <= 0)) OR ((1 <= p147)) OR ((p397 <= 0)) OR ((1 <= p398)))",
"processed_size": 104,
"rewrites": 20
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2146
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (((((1 <= p891)) AND ((p936 <= 0))) R ((p725 <= 0))))",
"processed_size": 55,
"rewrites": 23
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_release",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2145
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G ((((1 <= p799)) AND ((p288 <= 0)) AND ((p100 <= 0)))))",
"processed_size": 59,
"rewrites": 22
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((((p420 <= 0)) OR ((1 <= p72)))))",
"processed_size": 40,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G ((((1 <= p799)) AND ((p288 <= 0)) AND ((p100 <= 0)))))",
"processed_size": 59,
"rewrites": 22
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AF(EG((((p556 <= 0)) OR ((1 <= p591)))))",
"processed_size": 41,
"rewrites": 22
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 6,
"markings": 3,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 11140,
"runtime": 2813.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X(E(F(**)))) : (E((* R *)) AND (** OR A(G(*)))) : (A(G(E(X(**)))) AND E(F(**))) : E(G(**)) : A(F(**)) : A(F(A(G(**)))) : E(G(NODEADLOCK)) : (A(F(E(G(**)))) OR A(G(*))) : TRUE"
},
"net":
{
"arcs": 320400,
"conflict_clusters": 1,
"places": 1000,
"places_significant": 400,
"singleton_clusters": 0,
"transitions": 40400
},
"result":
{
"preliminary_value": "unknown yes unknown yes no unknown yes no yes ",
"value": "unknown yes unknown yes no unknown yes no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 41400/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1000
lola: finding significant places
lola: 1000 places, 40400 transitions, 400 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: LP says that atomic proposition is always true: (p757 <= 1)
lola: LP says that atomic proposition is always true: (p936 <= 1)
lola: LP says that atomic proposition is always true: (p725 <= 1)
lola: LP says that atomic proposition is always true: (p653 <= 1)
lola: LP says that atomic proposition is always true: (p147 <= 1)
lola: LP says that atomic proposition is always true: (p398 <= 1)
lola: LP says that atomic proposition is always true: (p656 <= 1)
lola: LP says that atomic proposition is always true: (p297 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p913 <= 1)
lola: LP says that atomic proposition is always true: (p632 <= 1)
lola: LP says that atomic proposition is always true: (p552 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p591 <= 1)
lola: LP says that atomic proposition is always true: (p288 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: A (X (E (F (((1 <= p757)))))) : (NOT(A (((((p891 <= 0)) OR ((1 <= p936))) U ((1 <= p725))))) AND ((((p28 <= 0)) OR ((1 <= p653)) OR ((p982 <= 0)) OR ((1 <= p147)) OR ((p397 <= 0)) OR ((1 <= p398))) OR NOT(E (F ((((p159 <= 0)) OR ((1 <= p656)))))))) : (A (G (E (X ((((p632 <= 0)) OR ((1 <= p297))))))) AND E (((0 <= 0) U (((p420 <= 0)) OR ((1 <= p72)))))) : E (G ((((p81 <= 0)) OR ((1 <= p913))))) : A (F ((((p883 <= 0)) OR ((1 <= p632))))) : A (F (A (G ((((p639 <= 0)) OR ((1 <= p552)) OR ((1 <= p41))))))) : E (G (NOT(A (X ((1 <= 0)))))) : (A (F (E (G ((((p556 <= 0)) OR ((1 <= p591))))))) OR NOT(E (F ((((p799 <= 0)) OR ((1 <= p288)) OR ((1 <= p100))))))) : E (G (E (G ((0 <= 0)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:285
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 387 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 436 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (X ((((p632 <= 0)) OR ((1 <= p297))))))) AND E (F ((((p420 <= 0)) OR ((1 <= p72))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 436 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p420 <= 0)) OR ((1 <= p72)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((p420 <= 0)) OR ((1 <= p72)))))
lola: processed formula length: 40
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p420 <= 0)) OR ((1 <= p72)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 498 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((((p632 <= 0)) OR ((1 <= p297)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX((((p632 <= 0)) OR ((1 <= p297)))))
lola: processed formula length: 41
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 69784 markings, 178160 edges, 13957 markings/sec, 0 secs
lola: 140590 markings, 359491 edges, 14161 markings/sec, 5 secs
lola: 206910 markings, 529301 edges, 13264 markings/sec, 10 secs
lola: 279059 markings, 714087 edges, 14430 markings/sec, 15 secs
lola: 352266 markings, 901617 edges, 14641 markings/sec, 20 secs
lola: 422063 markings, 1084984 edges, 13959 markings/sec, 25 secs
lola: 487291 markings, 1261163 edges, 13046 markings/sec, 30 secs
lola: 554897 markings, 1443208 edges, 13521 markings/sec, 35 secs
lola: 627435 markings, 1637914 edges, 14508 markings/sec, 40 secs
lola: 701372 markings, 1836769 edges, 14787 markings/sec, 45 secs
lola: 768227 markings, 2017389 edges, 13371 markings/sec, 50 secs
lola: 835192 markings, 2198362 edges, 13393 markings/sec, 55 secs
lola: 900660 markings, 2375066 edges, 13094 markings/sec, 60 secs
lola: 966797 markings, 2553768 edges, 13227 markings/sec, 65 secs
lola: 1029468 markings, 2722700 edges, 12534 markings/sec, 70 secs
lola: 1092568 markings, 2892697 edges, 12620 markings/sec, 75 secs
lola: 1160771 markings, 3077474 edges, 13641 markings/sec, 80 secs
lola: 1231796 markings, 3270192 edges, 14205 markings/sec, 85 secs
lola: 1301952 markings, 3460549 edges, 14031 markings/sec, 90 secs
lola: 1363456 markings, 3626075 edges, 12301 markings/sec, 95 secs
lola: 1430965 markings, 3808816 edges, 13502 markings/sec, 100 secs
lola: 1499188 markings, 3985866 edges, 13645 markings/sec, 105 secs
lola: 1562504 markings, 4150114 edges, 12663 markings/sec, 110 secs
lola: 1627466 markings, 4318667 edges, 12992 markings/sec, 115 secs
lola: 1694302 markings, 4492041 edges, 13367 markings/sec, 120 secs
lola: 1762075 markings, 4660267 edges, 13555 markings/sec, 125 secs
lola: 1829420 markings, 4831169 edges, 13469 markings/sec, 130 secs
lola: 1894925 markings, 4998004 edges, 13101 markings/sec, 135 secs
lola: 1961938 markings, 5167682 edges, 13403 markings/sec, 140 secs
lola: 2030987 markings, 5339940 edges, 13810 markings/sec, 145 secs
lola: 2102140 markings, 5521543 edges, 14231 markings/sec, 150 secs
lola: 2174260 markings, 5703042 edges, 14424 markings/sec, 155 secs
lola: 2245383 markings, 5899005 edges, 14225 markings/sec, 160 secs
lola: 2315313 markings, 6090731 edges, 13986 markings/sec, 165 secs
lola: 2385390 markings, 6281163 edges, 14015 markings/sec, 170 secs
lola: 2456044 markings, 6473525 edges, 14131 markings/sec, 175 secs
lola: 2527444 markings, 6667196 edges, 14280 markings/sec, 180 secs
lola: 2598234 markings, 6859822 edges, 14158 markings/sec, 185 secs
lola: 2670151 markings, 7057511 edges, 14383 markings/sec, 190 secs
lola: 2742940 markings, 7257413 edges, 14558 markings/sec, 195 secs
lola: 2810585 markings, 7442175 edges, 13529 markings/sec, 200 secs
lola: 2879355 markings, 7630340 edges, 13754 markings/sec, 205 secs
lola: 2945472 markings, 7810814 edges, 13223 markings/sec, 210 secs
lola: 3013286 markings, 7995579 edges, 13563 markings/sec, 215 secs
lola: 3077349 markings, 8170111 edges, 12813 markings/sec, 220 secs
lola: 3140623 markings, 8342200 edges, 12655 markings/sec, 225 secs
lola: 3208375 markings, 8520415 edges, 13550 markings/sec, 230 secs
lola: 3274550 markings, 8687578 edges, 13235 markings/sec, 235 secs
lola: 3336822 markings, 8847106 edges, 12454 markings/sec, 240 secs
lola: 3405474 markings, 9022943 edges, 13730 markings/sec, 245 secs
lola: 3471423 markings, 9187150 edges, 13190 markings/sec, 250 secs
lola: 3536230 markings, 9355256 edges, 12961 markings/sec, 255 secs
lola: 3605899 markings, 9546621 edges, 13934 markings/sec, 260 secs
lola: 3669967 markings, 9719412 edges, 12814 markings/sec, 265 secs
lola: 3735242 markings, 9902475 edges, 13055 markings/sec, 270 secs
lola: 3806239 markings, 10094913 edges, 14199 markings/sec, 275 secs
lola: 3878167 markings, 10292305 edges, 14386 markings/sec, 280 secs
lola: 3945821 markings, 10477478 edges, 13531 markings/sec, 285 secs
lola: 4011721 markings, 10657426 edges, 13180 markings/sec, 290 secs
lola: 4079058 markings, 10860477 edges, 13467 markings/sec, 295 secs
lola: 4150003 markings, 11075291 edges, 14189 markings/sec, 300 secs
lola: 4220711 markings, 11289687 edges, 14142 markings/sec, 305 secs
lola: 4291368 markings, 11503842 edges, 14131 markings/sec, 310 secs
lola: 4361246 markings, 11715597 edges, 13976 markings/sec, 315 secs
lola: 4431626 markings, 11928923 edges, 14076 markings/sec, 320 secs
lola: 4498897 markings, 12132486 edges, 13454 markings/sec, 325 secs
lola: 4563650 markings, 12328015 edges, 12951 markings/sec, 330 secs
lola: 4630063 markings, 12528931 edges, 13283 markings/sec, 335 secs
lola: 4697327 markings, 12732489 edges, 13453 markings/sec, 340 secs
lola: 4767101 markings, 12944113 edges, 13955 markings/sec, 345 secs
lola: 4839516 markings, 13162046 edges, 14483 markings/sec, 350 secs
lola: 4902109 markings, 13351712 edges, 12519 markings/sec, 355 secs
lola: 4966347 markings, 13546057 edges, 12848 markings/sec, 360 secs
lola: 5029802 markings, 13738260 edges, 12691 markings/sec, 365 secs
lola: 5093271 markings, 13917465 edges, 12694 markings/sec, 370 secs
lola: 5162454 markings, 14107129 edges, 13837 markings/sec, 375 secs
lola: 5230124 markings, 14294679 edges, 13534 markings/sec, 380 secs
lola: 5300682 markings, 14487523 edges, 14112 markings/sec, 385 secs
lola: 5364401 markings, 14666998 edges, 12744 markings/sec, 390 secs
lola: 5432782 markings, 14859138 edges, 13676 markings/sec, 395 secs
lola: 5500367 markings, 15046667 edges, 13517 markings/sec, 400 secs
lola: 5563708 markings, 15216826 edges, 12668 markings/sec, 405 secs
lola: 5630961 markings, 15404301 edges, 13451 markings/sec, 410 secs
lola: 5699136 markings, 15597887 edges, 13635 markings/sec, 415 secs
lola: 5755135 markings, 15754392 edges, 11200 markings/sec, 420 secs
lola: 5763426 markings, 15776147 edges, 1658 markings/sec, 425 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 2 will run for 436 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (((1 <= p757))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF(((1 <= p757))))
lola: processed formula length: 21
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 27876 markings, 69440 edges, 5575 markings/sec, 0 secs
lola: 125430 markings, 321192 edges, 19511 markings/sec, 5 secs
lola: 219510 markings, 563394 edges, 18816 markings/sec, 10 secs
lola: 320543 markings, 823909 edges, 20207 markings/sec, 15 secs
lola: 430098 markings, 1110382 edges, 21911 markings/sec, 20 secs
lola: 531160 markings, 1383976 edges, 20212 markings/sec, 25 secs
lola: 625133 markings, 1637603 edges, 18795 markings/sec, 30 secs
lola: 731934 markings, 1927145 edges, 21360 markings/sec, 35 secs
lola: 833144 markings, 2197704 edges, 20242 markings/sec, 40 secs
lola: 938773 markings, 2487235 edges, 21126 markings/sec, 45 secs
lola: 1045782 markings, 2773264 edges, 21402 markings/sec, 50 secs
lola: 1148511 markings, 3052471 edges, 20546 markings/sec, 55 secs
lola: 1257176 markings, 3347450 edges, 21733 markings/sec, 60 secs
lola: 1361452 markings, 3625676 edges, 20855 markings/sec, 65 secs
lola: 1473721 markings, 3929244 edges, 22454 markings/sec, 70 secs
lola: 1581086 markings, 4208748 edges, 21473 markings/sec, 75 secs
lola: 1687821 markings, 4487969 edges, 21347 markings/sec, 80 secs
lola: 1793336 markings, 4754384 edges, 21103 markings/sec, 85 secs
lola: 1906194 markings, 5043729 edges, 22572 markings/sec, 90 secs
lola: 2004403 markings, 5292619 edges, 19642 markings/sec, 95 secs
lola: 2095175 markings, 5524077 edges, 18154 markings/sec, 100 secs
lola: 2174551 markings, 5725295 edges, 15875 markings/sec, 105 secs
lola: 2256361 markings, 5951250 edges, 16362 markings/sec, 110 secs
lola: 2333169 markings, 6161297 edges, 15362 markings/sec, 115 secs
lola: 2443368 markings, 6464873 edges, 22040 markings/sec, 120 secs
lola: 2556566 markings, 6773519 edges, 22640 markings/sec, 125 secs
lola: 2670670 markings, 7085170 edges, 22821 markings/sec, 130 secs
lola: 2786107 markings, 7403029 edges, 23087 markings/sec, 135 secs
lola: 2899709 markings, 7715997 edges, 22720 markings/sec, 140 secs
lola: 3010714 markings, 8018886 edges, 22201 markings/sec, 145 secs
lola: 3124540 markings, 8328281 edges, 22765 markings/sec, 150 secs
lola: 3240406 markings, 8639010 edges, 23173 markings/sec, 155 secs
lola: 3345897 markings, 8912476 edges, 21098 markings/sec, 160 secs
lola: 3465086 markings, 9220364 edges, 23838 markings/sec, 165 secs
lola: 3581849 markings, 9526000 edges, 23353 markings/sec, 170 secs
lola: 3686772 markings, 9818052 edges, 20985 markings/sec, 175 secs
lola: 3801215 markings, 10133711 edges, 22889 markings/sec, 180 secs
lola: 3905197 markings, 10417975 edges, 20796 markings/sec, 185 secs
lola: 4019734 markings, 10729418 edges, 22907 markings/sec, 190 secs
lola: 4141224 markings, 11095955 edges, 24298 markings/sec, 195 secs
lola: 4267416 markings, 11476548 edges, 25238 markings/sec, 200 secs
lola: 4392757 markings, 11854552 edges, 25068 markings/sec, 205 secs
lola: 4516628 markings, 12227810 edges, 24774 markings/sec, 210 secs
lola: 4638088 markings, 12593641 edges, 24292 markings/sec, 215 secs
lola: 4746694 markings, 12924040 edges, 21721 markings/sec, 220 secs
lola: 4859616 markings, 13267747 edges, 22584 markings/sec, 225 secs
lola: 4979678 markings, 13629190 edges, 24012 markings/sec, 230 secs
lola: 5103466 markings, 13995655 edges, 24758 markings/sec, 235 secs
lola: 5230874 markings, 14356182 edges, 25482 markings/sec, 240 secs
lola: 5359502 markings, 14710986 edges, 25726 markings/sec, 245 secs
lola: 5485295 markings, 15063930 edges, 25159 markings/sec, 250 secs
lola: 5610608 markings, 15412759 edges, 25063 markings/sec, 255 secs
lola: 5734821 markings, 15761124 edges, 24843 markings/sec, 260 secs
lola: 5860463 markings, 16112336 edges, 25128 markings/sec, 265 secs
lola: 5986224 markings, 16464113 edges, 25152 markings/sec, 270 secs
lola: 6109917 markings, 16829775 edges, 24739 markings/sec, 275 secs
lola: 6221492 markings, 17182530 edges, 22315 markings/sec, 280 secs
lola: 6333610 markings, 17533956 edges, 22424 markings/sec, 285 secs
lola: 6444494 markings, 17881470 edges, 22177 markings/sec, 290 secs
lola: 6558029 markings, 18239200 edges, 22707 markings/sec, 295 secs
lola: 6667710 markings, 18585312 edges, 21936 markings/sec, 300 secs
lola: 6782506 markings, 18946463 edges, 22959 markings/sec, 305 secs
lola: 6905414 markings, 19331662 edges, 24582 markings/sec, 310 secs
lola: 7014399 markings, 19672199 edges, 21797 markings/sec, 315 secs
lola: 7130303 markings, 20001034 edges, 23181 markings/sec, 320 secs
lola: 7244371 markings, 20318761 edges, 22814 markings/sec, 325 secs
lola: 7356369 markings, 20624945 edges, 22400 markings/sec, 330 secs
lola: 7468751 markings, 20935534 edges, 22476 markings/sec, 335 secs
lola: 7589409 markings, 21269197 edges, 24132 markings/sec, 340 secs
lola: 7698558 markings, 21573097 edges, 21830 markings/sec, 345 secs
lola: 7813719 markings, 21886805 edges, 23032 markings/sec, 350 secs
lola: 7930540 markings, 22214679 edges, 23364 markings/sec, 355 secs
lola: 8050298 markings, 22543741 edges, 23952 markings/sec, 360 secs
lola: 8161662 markings, 22882737 edges, 22273 markings/sec, 365 secs
lola: 8275649 markings, 23230053 edges, 22797 markings/sec, 370 secs
lola: 8381659 markings, 23546696 edges, 21202 markings/sec, 375 secs
lola: 8487174 markings, 23867622 edges, 21103 markings/sec, 380 secs
lola: 8591391 markings, 24183330 edges, 20843 markings/sec, 385 secs
lola: 8690048 markings, 24480548 edges, 19731 markings/sec, 390 secs
lola: 8790664 markings, 24787130 edges, 20123 markings/sec, 395 secs
lola: 8889023 markings, 25082650 edges, 19672 markings/sec, 400 secs
lola: 8993018 markings, 25400527 edges, 20799 markings/sec, 405 secs
lola: 9081548 markings, 25665248 edges, 17706 markings/sec, 410 secs
lola: 9167882 markings, 25908086 edges, 17267 markings/sec, 415 secs
lola: 9275092 markings, 26210400 edges, 21442 markings/sec, 420 secs
lola: 9380529 markings, 26503815 edges, 21087 markings/sec, 425 secs
lola: 9492175 markings, 26818575 edges, 22329 markings/sec, 430 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown yes
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 436 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (NOT DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (NOT DEADLOCK))
lola: processed formula length: 20
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:779
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: DEADLOCK
lola: state equation task get result unparse finished id 0
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 3 markings, 3 edges
lola: ========================================
lola: subprocess 4 will run for 523 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p81 <= 0)) OR ((1 <= p913)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p81 <= 0)) OR ((1 <= p913)))))
lola: processed formula length: 40
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p81)) AND ((p913 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 3 markings, 3 edges
lola: ========================================
lola: subprocess 5 will run for 653 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((p883 <= 0)) OR ((1 <= p632)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((1 <= p883)) AND ((p632 <= 0)))
lola: processed formula length: 33
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p883 <= 0)) OR ((1 <= p632)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 3 markings, 3 edges
lola: ========================================
lola: subprocess 6 will run for 871 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((((p639 <= 0)) OR ((1 <= p552)) OR ((1 <= p41)))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((1 <= p639)) AND ((p552 <= 0)) AND ((p41 <= 0)))
lola: processed formula length: 50
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((1 <= p639)) AND ((p552 <= 0)) AND ((p41 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p639 <= 0)) OR ((1 <= p552)) OR ((1 <= p41)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-6-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-6-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-6-0.sara.
sara: try reading problem file CTLCardinality-6-1.sara.
lola: sara is running 0 secs || sara is running 0 secs || 114516 markings, 292770 edges, 22903 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 242611 markings, 620850 edges, 25619 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 376650 markings, 964212 edges, 26808 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 505762 markings, 1309065 edges, 25822 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 637146 markings, 1663659 edges, 26277 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 770634 markings, 2024339 edges, 26698 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 902367 markings, 2379906 edges, 26347 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 1033071 markings, 2732966 edges, 26141 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 1121236 markings, 2974834 edges, 17633 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 1186726 markings, 3151741 edges, 13098 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 1252145 markings, 3328486 edges, 13084 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 1331462 markings, 3541631 edges, 15863 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 1448470 markings, 3855444 edges, 23402 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 1569427 markings, 4168061 edges, 24191 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 1700831 markings, 4508110 edges, 26281 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 1822016 markings, 4812985 edges, 24237 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 1953655 markings, 5146350 edges, 26328 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 2084525 markings, 5475725 edges, 26174 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 2215380 markings, 5812821 edges, 26171 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 2342498 markings, 6160516 edges, 25424 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 2471177 markings, 6512273 edges, 25736 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 2600105 markings, 6864998 edges, 25786 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 2731143 markings, 7223296 edges, 26208 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 2860349 markings, 7575447 edges, 25841 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 2990222 markings, 7929623 edges, 25975 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 3118568 markings, 8279174 edges, 25669 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 3249279 markings, 8622837 edges, 26142 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 3380937 markings, 8960148 edges, 26332 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 3503133 markings, 9264769 edges, 24439 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 3631961 markings, 9617014 edges, 25766 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 3761887 markings, 9970713 edges, 25985 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 3892379 markings, 10333320 edges, 26098 markings/sec, 155 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 160 secs || sara is running 160 secs || 4022244 markings, 10689932 edges, 25973 markings/sec, 160 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 165 secs || sara is running 165 secs || 4149704 markings, 11074285 edges, 25492 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 4277246 markings, 11458885 edges, 25508 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 4390358 markings, 11803222 edges, 22622 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 4505068 markings, 12152106 edges, 22942 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 4623526 markings, 12508108 edges, 23692 markings/sec, 185 secs
lola: state equation:solution unknown
lola: sara is running 190 secs || sara is running 190 secs || 4745461 markings, 12875242 edges, 24387 markings/sec, 190 secs
lola: state equation:solution unknown
lola: sara is running 195 secs || sara is running 195 secs || 4855499 markings, 13207733 edges, 22008 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 4964903 markings, 13541860 edges, 21881 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 5077278 markings, 13870585 edges, 22475 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 5191260 markings, 14191242 edges, 22796 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 5304744 markings, 14498155 edges, 22697 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 5416911 markings, 14812703 edges, 22433 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 5535847 markings, 15140273 edges, 23787 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 5629581 markings, 15400744 edges, 18747 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 5738881 markings, 15708500 edges, 21860 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 5849983 markings, 16014542 edges, 22220 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 5967246 markings, 16341013 edges, 23453 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 6078274 markings, 16668558 edges, 22206 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 6185315 markings, 17003178 edges, 21408 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 6299267 markings, 17358645 edges, 22790 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 6417900 markings, 17729576 edges, 23727 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 6522042 markings, 18056738 edges, 20828 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 6627725 markings, 18389028 edges, 21137 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 6734450 markings, 18719219 edges, 21345 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 6845230 markings, 19061981 edges, 22156 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 6957848 markings, 19413181 edges, 22524 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 7071264 markings, 19745733 edges, 22683 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 7194756 markings, 20084789 edges, 24698 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 7324033 markings, 20439176 edges, 25855 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 7451162 markings, 20789810 edges, 25426 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 7573009 markings, 21109005 edges, 24369 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 7705887 markings, 21454332 edges, 26576 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 7836700 markings, 21798067 edges, 26163 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 7966666 markings, 22154063 edges, 25993 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 8096851 markings, 22510590 edges, 26037 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 8227617 markings, 22868567 edges, 26153 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 8355649 markings, 23219367 edges, 25606 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 8481755 markings, 23566212 edges, 25221 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 8598197 markings, 23885036 edges, 23288 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 8713025 markings, 24198758 edges, 22966 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 8828488 markings, 24514091 edges, 23093 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 8955835 markings, 24845811 edges, 25469 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 9085717 markings, 25182672 edges, 25976 markings/sec, 375 secs
lola: sara is running 380 secs || sara is running 380 secs || 9213221 markings, 25509645 edges, 25501 markings/sec, 380 secs
lola: sara is running 385 secs || sara is running 385 secs || 9328246 markings, 25809274 edges, 23005 markings/sec, 385 secs
lola: sara is running 390 secs || sara is running 390 secs || 9445387 markings, 26116761 edges, 23428 markings/sec, 390 secs
lola: sara is running 395 secs || sara is running 395 secs || 9571136 markings, 26462020 edges, 25150 markings/sec, 395 secs
lola: sara is running 400 secs || sara is running 400 secs || 9694265 markings, 26800820 edges, 24626 markings/sec, 400 secs
lola: sara is running 405 secs || sara is running 405 secs || 9803321 markings, 27103254 edges, 21811 markings/sec, 405 secs
lola: sara is running 410 secs || sara is running 410 secs || 9909459 markings, 27394020 edges, 21228 markings/sec, 410 secs
lola: sara is running 415 secs || sara is running 415 secs || 10021378 markings, 27697227 edges, 22384 markings/sec, 415 secs
lola: sara is running 420 secs || sara is running 420 secs || 10095477 markings, 27901606 edges, 14820 markings/sec, 420 secs
lola: sara is running 425 secs || sara is running 425 secs || 10197205 markings, 28178792 edges, 20346 markings/sec, 425 secs
lola: sara is running 430 secs || sara is running 430 secs || 10304144 markings, 28474420 edges, 21388 markings/sec, 430 secs
lola: sara is running 435 secs || sara is running 435 secs || 10405760 markings, 28748335 edges, 20323 markings/sec, 435 secs
lola: sara is running 440 secs || sara is running 440 secs || 10506808 markings, 29007501 edges, 20210 markings/sec, 440 secs
lola: sara is running 445 secs || sara is running 445 secs || 10605439 markings, 29259714 edges, 19726 markings/sec, 445 secs
lola: sara is running 450 secs || sara is running 450 secs || 10706674 markings, 29519966 edges, 20247 markings/sec, 450 secs
lola: sara is running 455 secs || sara is running 455 secs || 10800122 markings, 29771476 edges, 18690 markings/sec, 455 secs
lola: sara is running 460 secs || sara is running 460 secs || 10922295 markings, 30115148 edges, 24435 markings/sec, 460 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 1073 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((((1 <= p891)) AND ((p936 <= 0))) R ((p725 <= 0)))) AND ((((p28 <= 0)) OR ((1 <= p653)) OR ((p982 <= 0)) OR ((1 <= p147)) OR ((p397 <= 0)) OR ((1 <= p398))) OR A (G ((((1 <= p159)) AND ((p656 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 1073 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p28 <= 0)) OR ((1 <= p653)) OR ((p982 <= 0)) OR ((1 <= p147)) OR ((p397 <= 0)) OR ((1 <= p398)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p28 <= 0)) OR ((1 <= p653)) OR ((p982 <= 0)) OR ((1 <= p147)) OR ((p397 <= 0)) OR ((1 <= p398)))
lola: processed formula length: 104
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 6 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 2146 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((1 <= p891)) AND ((p936 <= 0))) R ((p725 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:576
lola: rewrite Frontend/Parser/formula_rewrite.k:736
lola: rewrite Frontend/Parser/formula_rewrite.k:696
lola: processed formula: E (((((1 <= p891)) AND ((p936 <= 0))) R ((p725 <= 0))))
lola: processed formula length: 55
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p725))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 1
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: There is a path where Predicate Phi releases Predicate Psi.
lola: 3 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 2145 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (E (G ((((p556 <= 0)) OR ((1 <= p591))))))) OR A (G ((((1 <= p799)) AND ((p288 <= 0)) AND ((p100 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 2145 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p799)) AND ((p288 <= 0)) AND ((p100 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((((1 <= p799)) AND ((p288 <= 0)) AND ((p100 <= 0)))))
lola: processed formula length: 59
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p799 <= 0)) OR ((1 <= p288)) OR ((1 <= p100)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (G (E (X ((((p632 <= 0)) OR ((1 <= p297))))))) AND E (F ((((p420 <= 0)) OR ((1 <= p72))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F ((((p420 <= 0)) OR ((1 <= p72)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((p420 <= 0)) OR ((1 <= p72)))))
lola: processed formula length: 40
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p420 <= 0)) OR ((1 <= p72)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((((p632 <= 0)) OR ((1 <= p297)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX((((p632 <= 0)) OR ((1 <= p297)))))
lola: processed formula length: 41
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 18610 markings, 46828 edges, 3722 markings/sec, 0 secs
lola: 53468 markings, 136423 edges, 6972 markings/sec, 5 secs
lola: 119240 markings, 304869 edges, 13154 markings/sec, 10 secs
lola: 178048 markings, 455480 edges, 11762 markings/sec, 15 secs
lola: 231285 markings, 591806 edges, 10647 markings/sec, 20 secs
lola: 291347 markings, 745672 edges, 12012 markings/sec, 25 secs
lola: 352628 markings, 902581 edges, 12256 markings/sec, 30 secs
lola: 414092 markings, 1064730 edges, 12293 markings/sec, 35 secs
lola: 459552 markings, 1187467 edges, 9092 markings/sec, 40 secs
lola: 505787 markings, 1309138 edges, 9247 markings/sec, 45 secs
lola: 566392 markings, 1472348 edges, 12121 markings/sec, 50 secs
lola: 627925 markings, 1639079 edges, 12307 markings/sec, 55 secs
lola: 691011 markings, 1809688 edges, 12617 markings/sec, 60 secs
lola: 749901 markings, 1969690 edges, 11778 markings/sec, 65 secs
lola: 811742 markings, 2137128 edges, 12368 markings/sec, 70 secs
lola: 864874 markings, 2282616 edges, 10626 markings/sec, 75 secs
lola: 927983 markings, 2453219 edges, 12622 markings/sec, 80 secs
lola: 988099 markings, 2614783 edges, 12023 markings/sec, 85 secs
lola: 1037575 markings, 2745890 edges, 9895 markings/sec, 90 secs
lola: 1075707 markings, 2849647 edges, 7626 markings/sec, 95 secs
lola: 1122401 markings, 2978259 edges, 9339 markings/sec, 100 secs
lola: 1179539 markings, 3131170 edges, 11428 markings/sec, 105 secs
lola: 1242141 markings, 3299874 edges, 12520 markings/sec, 110 secs
lola: 1294878 markings, 3440286 edges, 10547 markings/sec, 115 secs
lola: 1333208 markings, 3546054 edges, 7666 markings/sec, 120 secs
lola: 1366308 markings, 3634270 edges, 6620 markings/sec, 125 secs
lola: 1409860 markings, 3751395 edges, 8710 markings/sec, 130 secs
lola: 1437305 markings, 3826481 edges, 5489 markings/sec, 135 secs
lola: 1490305 markings, 3963007 edges, 10600 markings/sec, 140 secs
lola: 1519608 markings, 4038803 edges, 5861 markings/sec, 145 secs
lola: 1577347 markings, 4188587 edges, 11548 markings/sec, 150 secs
lola: 1623669 markings, 4308851 edges, 9264 markings/sec, 155 secs
lola: 1678011 markings, 4449907 edges, 10868 markings/sec, 160 secs
lola: 1731728 markings, 4583766 edges, 10743 markings/sec, 165 secs
lola: 1784349 markings, 4716356 edges, 10524 markings/sec, 170 secs
lola: 1840240 markings, 4858966 edges, 11178 markings/sec, 175 secs
lola: 1902110 markings, 5016016 edges, 12374 markings/sec, 180 secs
lola: 1964354 markings, 5173875 edges, 12449 markings/sec, 185 secs
lola: 2025195 markings, 5325848 edges, 12168 markings/sec, 190 secs
lola: 2085905 markings, 5479394 edges, 12142 markings/sec, 195 secs
lola: 2143112 markings, 5624978 edges, 11441 markings/sec, 200 secs
lola: 2204543 markings, 5785073 edges, 12286 markings/sec, 205 secs
lola: 2267580 markings, 5957294 edges, 12607 markings/sec, 210 secs
lola: 2337127 markings, 6146865 edges, 13909 markings/sec, 215 secs
lola: 2400706 markings, 6320535 edges, 12716 markings/sec, 220 secs
lola: 2465642 markings, 6498162 edges, 12987 markings/sec, 225 secs
lola: 2536217 markings, 6690024 edges, 14115 markings/sec, 230 secs
lola: 2606692 markings, 6884043 edges, 14095 markings/sec, 235 secs
lola: 2678378 markings, 7081523 edges, 14337 markings/sec, 240 secs
lola: 2751210 markings, 7281290 edges, 14566 markings/sec, 245 secs
lola: 2823135 markings, 7478017 edges, 14385 markings/sec, 250 secs
lola: 2895212 markings, 7672582 edges, 14415 markings/sec, 255 secs
lola: 2966560 markings, 7865792 edges, 14270 markings/sec, 260 secs
lola: 3032622 markings, 8044870 edges, 13212 markings/sec, 265 secs
lola: 3099787 markings, 8227499 edges, 13433 markings/sec, 270 secs
lola: 3171607 markings, 8421751 edges, 14364 markings/sec, 275 secs
lola: 3243258 markings, 8607407 edges, 14330 markings/sec, 280 secs
lola: 3312810 markings, 8785607 edges, 13910 markings/sec, 285 secs
lola: 3378415 markings, 8953697 edges, 13121 markings/sec, 290 secs
lola: 3445664 markings, 9124441 edges, 13450 markings/sec, 295 secs
lola: 3518032 markings, 9303280 edges, 14474 markings/sec, 300 secs
lola: 3589508 markings, 9499266 edges, 14295 markings/sec, 305 secs
lola: 3654195 markings, 9678965 edges, 12937 markings/sec, 310 secs
lola: 3719634 markings, 9862306 edges, 13088 markings/sec, 315 secs
lola: 3789253 markings, 10048146 edges, 13924 markings/sec, 320 secs
lola: 3858767 markings, 10236309 edges, 13903 markings/sec, 325 secs
lola: 3926769 markings, 10425070 edges, 13600 markings/sec, 330 secs
lola: 3990934 markings, 10600173 edges, 12833 markings/sec, 335 secs
lola: 4055800 markings, 10794069 edges, 12973 markings/sec, 340 secs
lola: 4121121 markings, 10991367 edges, 13064 markings/sec, 345 secs
lola: 4185208 markings, 11185021 edges, 12817 markings/sec, 350 secs
lola: 4252066 markings, 11386805 edges, 13372 markings/sec, 355 secs
lola: 4317136 markings, 11583293 edges, 13014 markings/sec, 360 secs
lola: 4380974 markings, 11776424 edges, 12768 markings/sec, 365 secs
lola: 4440271 markings, 11956434 edges, 11859 markings/sec, 370 secs
lola: 4506793 markings, 12157216 edges, 13304 markings/sec, 375 secs
lola: 4575100 markings, 12363147 edges, 13661 markings/sec, 380 secs
lola: 4643558 markings, 12569622 edges, 13692 markings/sec, 385 secs
lola: 4713062 markings, 12779037 edges, 13901 markings/sec, 390 secs
lola: 4777673 markings, 12974500 edges, 12922 markings/sec, 395 secs
lola: 4843113 markings, 13172273 edges, 13088 markings/sec, 400 secs
lola: 4913376 markings, 13383922 edges, 14053 markings/sec, 405 secs
lola: 4982754 markings, 13593027 edges, 13876 markings/sec, 410 secs
lola: 5050747 markings, 13796864 edges, 13599 markings/sec, 415 secs
lola: 5115784 markings, 13978385 edges, 13007 markings/sec, 420 secs
lola: 5184410 markings, 14171247 edges, 13725 markings/sec, 425 secs
lola: 5253279 markings, 14362307 edges, 13774 markings/sec, 430 secs
lola: 5322610 markings, 14549635 edges, 13866 markings/sec, 435 secs
lola: 5390361 markings, 14736374 edges, 13550 markings/sec, 440 secs
lola: 5456888 markings, 14924710 edges, 13305 markings/sec, 445 secs
lola: 5524258 markings, 15110194 edges, 13474 markings/sec, 450 secs
lola: 5590286 markings, 15292721 edges, 13206 markings/sec, 455 secs
lola: 5657003 markings, 15478190 edges, 13343 markings/sec, 460 secs
lola: 5691715 markings, 15578373 edges, 6942 markings/sec, 465 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X (E (F (((1 <= p757))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF(((1 <= p757))))
lola: processed formula length: 21
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 26628 markings, 66284 edges, 5326 markings/sec, 0 secs
lola: 115171 markings, 294610 edges, 17709 markings/sec, 5 secs
lola: 214443 markings, 550484 edges, 19854 markings/sec, 10 secs
lola: 310112 markings, 797060 edges, 19134 markings/sec, 15 secs
lola: 409874 markings, 1057885 edges, 19952 markings/sec, 20 secs
lola: 507903 markings, 1318699 edges, 19606 markings/sec, 25 secs
lola: 605247 markings, 1585594 edges, 19469 markings/sec, 30 secs
lola: 711875 markings, 1869639 edges, 21326 markings/sec, 35 secs
lola: 798445 markings, 2107008 edges, 17314 markings/sec, 40 secs
lola: 886545 markings, 2344023 edges, 17620 markings/sec, 45 secs
lola: 985935 markings, 2612269 edges, 19878 markings/sec, 50 secs
lola: 1076152 markings, 2857728 edges, 18043 markings/sec, 55 secs
lola: 1155728 markings, 3070785 edges, 15915 markings/sec, 60 secs
lola: 1273786 markings, 3392141 edges, 23612 markings/sec, 65 secs
lola: 1387546 markings, 3700081 edges, 22752 markings/sec, 70 secs
lola: 1493400 markings, 3979769 edges, 21171 markings/sec, 75 secs
lola: 1586935 markings, 4223988 edges, 18707 markings/sec, 80 secs
lola: 1688164 markings, 4488841 edges, 20246 markings/sec, 85 secs
lola: 1721260 markings, 4572616 edges, 6619 markings/sec, 90 secs
lola: 1828173 markings, 4844672 edges, 21383 markings/sec, 95 secs
lola: 1912348 markings, 5059563 edges, 16835 markings/sec, 100 secs
lola: 2011342 markings, 5310358 edges, 19799 markings/sec, 105 secs
lola: 2098820 markings, 5533588 edges, 17496 markings/sec, 110 secs
lola: 2219175 markings, 5845783 edges, 24071 markings/sec, 115 secs
lola: 2332712 markings, 6160130 edges, 22707 markings/sec, 120 secs
lola: 2426660 markings, 6416021 edges, 18790 markings/sec, 125 secs
lola: 2531247 markings, 6704086 edges, 20917 markings/sec, 130 secs
lola: 2648008 markings, 7026725 edges, 23352 markings/sec, 135 secs
lola: 2762034 markings, 7339661 edges, 22805 markings/sec, 140 secs
lola: 2873344 markings, 7641574 edges, 22262 markings/sec, 145 secs
lola: 2989673 markings, 7958042 edges, 23266 markings/sec, 150 secs
lola: 3069756 markings, 8179814 edges, 16017 markings/sec, 155 secs
lola: 3164282 markings, 8437998 edges, 18905 markings/sec, 160 secs
lola: 3266197 markings, 8705829 edges, 20383 markings/sec, 165 secs
lola: 3392062 markings, 9032375 edges, 25173 markings/sec, 170 secs
lola: 3520163 markings, 9356899 edges, 25620 markings/sec, 175 secs
lola: 3644346 markings, 9702482 edges, 24837 markings/sec, 180 secs
lola: 3765748 markings, 10034827 edges, 24280 markings/sec, 185 secs
lola: 3877676 markings, 10345010 edges, 22386 markings/sec, 190 secs
lola: 3987298 markings, 10645594 edges, 21924 markings/sec, 195 secs
lola: 4093904 markings, 10950187 edges, 21321 markings/sec, 200 secs
lola: 4220162 markings, 11332464 edges, 25252 markings/sec, 205 secs
lola: 4347194 markings, 11717032 edges, 25406 markings/sec, 210 secs
lola: 4474161 markings, 12101437 edges, 25393 markings/sec, 215 secs
lola: 4598707 markings, 12478630 edges, 24909 markings/sec, 220 secs
lola: 4723677 markings, 12855691 edges, 24994 markings/sec, 225 secs
lola: 4849032 markings, 13234059 edges, 25071 markings/sec, 230 secs
lola: 4976240 markings, 13618181 edges, 25442 markings/sec, 235 secs
lola: 5093719 markings, 13966894 edges, 23496 markings/sec, 240 secs
lola: 5221837 markings, 14331487 edges, 25624 markings/sec, 245 secs
lola: 5351482 markings, 14687328 edges, 25929 markings/sec, 250 secs
lola: 5477762 markings, 15044125 edges, 25256 markings/sec, 255 secs
lola: 5603752 markings, 15392381 edges, 25198 markings/sec, 260 secs
lola: 5728839 markings, 15745387 edges, 25017 markings/sec, 265 secs
lola: 5848562 markings, 16078126 edges, 23945 markings/sec, 270 secs
lola: 5974608 markings, 16433571 edges, 25209 markings/sec, 275 secs
lola: 6099371 markings, 16797742 edges, 24953 markings/sec, 280 secs
lola: 6221885 markings, 17183797 edges, 24503 markings/sec, 285 secs
lola: 6343852 markings, 17568070 edges, 24393 markings/sec, 290 secs
lola: 6465758 markings, 17952171 edges, 24381 markings/sec, 295 secs
lola: 6586705 markings, 18332323 edges, 24189 markings/sec, 300 secs
lola: 6710039 markings, 18718840 edges, 24667 markings/sec, 305 secs
lola: 6833997 markings, 19107379 edges, 24792 markings/sec, 310 secs
lola: 6958499 markings, 19497719 edges, 24900 markings/sec, 315 secs
lola: 7083937 markings, 19874024 edges, 25088 markings/sec, 320 secs
lola: 7204399 markings, 20208524 edges, 24092 markings/sec, 325 secs
lola: 7332739 markings, 20561018 edges, 25668 markings/sec, 330 secs
lola: 7458233 markings, 20908333 edges, 25099 markings/sec, 335 secs
lola: 7576619 markings, 21233916 edges, 23677 markings/sec, 340 secs
lola: 7696475 markings, 21567733 edges, 23971 markings/sec, 345 secs
lola: 7816515 markings, 21895018 edges, 24008 markings/sec, 350 secs
lola: 7942828 markings, 22248167 edges, 25263 markings/sec, 355 secs
lola: 8069059 markings, 22603506 edges, 25246 markings/sec, 360 secs
lola: 8192714 markings, 22976353 edges, 24731 markings/sec, 365 secs
lola: 8315967 markings, 23347867 edges, 24651 markings/sec, 370 secs
lola: 8437698 markings, 23715300 edges, 24346 markings/sec, 375 secs
lola: 8557358 markings, 24079107 edges, 23932 markings/sec, 380 secs
lola: 8677103 markings, 24443471 edges, 23949 markings/sec, 385 secs
lola: 8786554 markings, 24774032 edges, 21890 markings/sec, 390 secs
lola: 8892682 markings, 25092998 edges, 21226 markings/sec, 395 secs
lola: 9009913 markings, 25450120 edges, 23446 markings/sec, 400 secs
lola: 9095904 markings, 25703444 edges, 17198 markings/sec, 405 secs
lola: 9176679 markings, 25931270 edges, 16155 markings/sec, 410 secs
lola: 9292546 markings, 26261697 edges, 23173 markings/sec, 415 secs
lola: 9412773 markings, 26594092 edges, 24045 markings/sec, 420 secs
lola: 9530102 markings, 26926355 edges, 23466 markings/sec, 425 secs
lola: 9642751 markings, 27221920 edges, 22530 markings/sec, 430 secs
lola: 9748219 markings, 27498827 edges, 21094 markings/sec, 435 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((((p639 <= 0)) OR ((1 <= p552)) OR ((1 <= p41)))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((1 <= p639)) AND ((p552 <= 0)) AND ((p41 <= 0)))
lola: processed formula length: 50
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((1 <= p639)) AND ((p552 <= 0)) AND ((p41 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation task get result unparse finished++ id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: formula 0: (((p639 <= 0)) OR ((1 <= p552)) OR ((1 <= p41)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-11-0.sara.
lola: state equation: write sara problem file to CTLCardinality-11-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-11-1.sara.
lola: sara is running 0 secs || sara is running 0 secs || 120690 markings, 308577 edges, 24138 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 255550 markings, 653970 edges, 26972 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 388321 markings, 994174 edges, 26554 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 518911 markings, 1346682 edges, 26118 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 650147 markings, 1700889 edges, 26247 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 783514 markings, 2061088 edges, 26673 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 911649 markings, 2406515 edges, 25627 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 1007760 markings, 2666527 edges, 19222 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 1138495 markings, 3019733 edges, 26147 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 1269523 markings, 3373720 edges, 26206 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 1397741 markings, 3720654 edges, 25644 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 1528288 markings, 4061349 edges, 26109 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 1660674 markings, 4404839 edges, 26477 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 1792649 markings, 4737858 edges, 26395 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 1925220 markings, 5074003 edges, 26514 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 2056117 markings, 5403288 edges, 26179 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 2187055 markings, 5740103 edges, 26188 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 2315507 markings, 6091244 edges, 25690 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 2442746 markings, 6439245 edges, 25448 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 2570747 markings, 6789194 edges, 25600 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 2700569 markings, 7143508 edges, 25964 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 2831407 markings, 7499259 edges, 26168 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 2961214 markings, 7852088 edges, 25961 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 3089628 markings, 8201496 edges, 25683 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 3206731 markings, 8516381 edges, 23421 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 3323902 markings, 8814100 edges, 23434 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 3450668 markings, 9136724 edges, 25353 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 3579195 markings, 9470675 edges, 25705 markings/sec, 135 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 140 secs || sara is running 140 secs || 3695994 markings, 9794214 edges, 23360 markings/sec, 140 secs
sara: place or transition ordering is non-deterministic


lola: sara is running 145 secs || sara is running 145 secs || 3813991 markings, 10114866 edges, 23599 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 3926864 markings, 10425332 edges, 22575 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 4042359 markings, 10753924 edges, 23099 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 4154229 markings, 11088710 edges, 22374 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 4265345 markings, 11424682 edges, 22223 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 4378151 markings, 11768369 edges, 22561 markings/sec, 170 secs
lola: state equation:solution unknown
lola: state equation:solution unknown
lola: sara is running 175 secs || sara is running 175 secs || 4489929 markings, 12103936 edges, 22356 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 4598363 markings, 12429762 edges, 21687 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 4709011 markings, 12767431 edges, 22130 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 4818670 markings, 13097647 edges, 21932 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 4924888 markings, 13416801 edges, 21244 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 5034237 markings, 13750865 edges, 21870 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 5158539 markings, 14095614 edges, 24860 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 5289121 markings, 14457644 edges, 26116 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 5416170 markings, 14810553 edges, 25410 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 5536326 markings, 15141446 edges, 24031 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 5646418 markings, 15447209 edges, 22018 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 5762044 markings, 15772618 edges, 23125 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 5889132 markings, 16121868 edges, 25418 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 5993694 markings, 16418498 edges, 20912 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 6111118 markings, 16768868 edges, 23485 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 6228487 markings, 17135576 edges, 23474 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 6339419 markings, 17484324 edges, 22186 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 6438965 markings, 17799248 edges, 19909 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 6539888 markings, 18111264 edges, 20185 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 6648303 markings, 18449423 edges, 21683 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 6763700 markings, 18810160 edges, 23079 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 6883793 markings, 19184696 edges, 24019 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 7008686 markings, 19573347 edges, 24979 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 7136197 markings, 19925084 edges, 25502 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 7248561 markings, 20233792 edges, 22473 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 7360118 markings, 20536883 edges, 22311 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 7469210 markings, 20842074 edges, 21818 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 7582121 markings, 21132639 edges, 22582 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 7701110 markings, 21441938 edges, 23798 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 7815820 markings, 21737548 edges, 22942 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 7930377 markings, 22051878 edges, 22911 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 8060489 markings, 22407358 edges, 26022 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 8191068 markings, 22763929 edges, 26116 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 8319920 markings, 23116382 edges, 25770 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 8447925 markings, 23468142 edges, 25601 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 8576137 markings, 23820769 edges, 25642 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 8703656 markings, 24171446 edges, 25504 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 8828926 markings, 24515211 edges, 25054 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 8955469 markings, 24844836 edges, 25309 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 9069479 markings, 25141930 edges, 22802 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 9183543 markings, 25432318 edges, 22813 markings/sec, 375 secs
lola: sara is running 380 secs || sara is running 380 secs || 9305308 markings, 25749701 edges, 24353 markings/sec, 380 secs
lola: sara is running 385 secs || sara is running 385 secs || 9432784 markings, 26084141 edges, 25495 markings/sec, 385 secs
lola: sara is running 390 secs || sara is running 390 secs || 9560099 markings, 26433650 edges, 25463 markings/sec, 390 secs
lola: sara is running 395 secs || sara is running 395 secs || 9675503 markings, 26752500 edges, 23081 markings/sec, 395 secs
lola: sara is running 400 secs || sara is running 400 secs || 9785641 markings, 27054556 edges, 22028 markings/sec, 400 secs
lola: sara is running 405 secs || sara is running 405 secs || 9899355 markings, 27364667 edges, 22743 markings/sec, 405 secs
lola: sara is running 410 secs || sara is running 410 secs || 10002195 markings, 27646434 edges, 20568 markings/sec, 410 secs
lola: sara is running 415 secs || sara is running 415 secs || 10096075 markings, 27903407 edges, 18776 markings/sec, 415 secs
lola: sara is running 420 secs || sara is running 420 secs || 10198796 markings, 28182955 edges, 20544 markings/sec, 420 secs
lola: sara is running 425 secs || sara is running 425 secs || 10314467 markings, 28500961 edges, 23134 markings/sec, 425 secs
lola: sara is running 430 secs || sara is running 430 secs || 10428718 markings, 28810074 edges, 22850 markings/sec, 430 secs
lola: sara is running 435 secs || sara is running 435 secs || 10506623 markings, 29007044 edges, 15581 markings/sec, 435 secs
lola: sara is running 440 secs || sara is running 440 secs || 10611525 markings, 29275429 edges, 20980 markings/sec, 440 secs
lola: sara is running 445 secs || sara is running 445 secs || 10733904 markings, 29591561 edges, 24476 markings/sec, 445 secs
lola: sara is running 450 secs || sara is running 450 secs || 10823850 markings, 29838756 edges, 17989 markings/sec, 450 secs
lola: sara is running 455 secs || sara is running 455 secs || 10930213 markings, 30138419 edges, 21273 markings/sec, 455 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (A (F (E (G ((((p556 <= 0)) OR ((1 <= p591))))))) OR A (G ((((1 <= p799)) AND ((p288 <= 0)) AND ((p100 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p799)) AND ((p288 <= 0)) AND ((p100 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((((1 <= p799)) AND ((p288 <= 0)) AND ((p100 <= 0)))))
lola: processed formula length: 59
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p799 <= 0)) OR ((1 <= p288)) OR ((1 <= p100)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((((p556 <= 0)) OR ((1 <= p591)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG((((p556 <= 0)) OR ((1 <= p591)))))
lola: processed formula length: 41
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 3 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: unknown yes unknown yes no unknown yes no yes
lola:
preliminary result: unknown yes unknown yes no unknown yes no yes
lola: memory consumption: 11140 KB
lola: time consumption: 2813 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Dekker-PT-200"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is Dekker-PT-200, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-158987882200347"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-200.tgz
mv Dekker-PT-200 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;