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-158987882200345.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882200345
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1591217948986

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 20:59:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 20:59:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 20:59:13] [INFO ] Load time of PNML (sax parser for PT used): 1360 ms
[2020-06-03 20:59:13] [INFO ] Transformed 1000 places.
[2020-06-03 20:59:13] [INFO ] Transformed 40400 transitions.
[2020-06-03 20:59:13] [INFO ] Found NUPN structural information;
[2020-06-03 20:59:13] [INFO ] Parsed PT model containing 1000 places and 40400 transitions in 1735 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 261 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 5230 ms. (steps per millisecond=19 ) properties seen :[0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1]
[2020-06-03 20:59:19] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 1000 cols
[2020-06-03 20:59:19] [INFO ] Computed 600 place invariants in 45 ms
[2020-06-03 20:59:20] [INFO ] [Real]Absence check using 400 positive place invariants in 357 ms returned sat
[2020-06-03 20:59:20] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 119 ms returned sat
[2020-06-03 20:59:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:59:22] [INFO ] [Real]Absence check using state equation in 2370 ms returned sat
[2020-06-03 20:59:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:59:23] [INFO ] [Nat]Absence check using 400 positive place invariants in 329 ms returned sat
[2020-06-03 20:59:23] [INFO ] [Nat]Absence check using 400 positive and 200 generalized place invariants in 114 ms returned sat
[2020-06-03 20:59:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:59:25] [INFO ] [Nat]Absence check using state equation in 2223 ms returned sat
[2020-06-03 20:59:26] [INFO ] State equation strengthened by 200 read => feed constraints.
[2020-06-03 20:59:26] [INFO ] [Nat]Added 200 Read/Feed constraints in 217 ms returned sat
[2020-06-03 20:59:27] [INFO ] Deduced a trap composed of 4 places in 887 ms
[2020-06-03 20:59:28] [INFO ] Deduced a trap composed of 4 places in 929 ms
[2020-06-03 20:59:29] [INFO ] Deduced a trap composed of 4 places in 631 ms
[2020-06-03 20:59:29] [INFO ] Deduced a trap composed of 4 places in 610 ms
[2020-06-03 20:59:30] [INFO ] Deduced a trap composed of 4 places in 730 ms
[2020-06-03 20:59:31] [INFO ] Deduced a trap composed of 6 places in 751 ms
[2020-06-03 20:59:32] [INFO ] Deduced a trap composed of 4 places in 1068 ms
[2020-06-03 20:59:33] [INFO ] Deduced a trap composed of 4 places in 506 ms
[2020-06-03 20:59:33] [INFO ] Deduced a trap composed of 4 places in 496 ms
[2020-06-03 20:59:34] [INFO ] Deduced a trap composed of 4 places in 642 ms
[2020-06-03 20:59:35] [INFO ] Deduced a trap composed of 4 places in 586 ms
[2020-06-03 20:59:35] [INFO ] Deduced a trap composed of 4 places in 595 ms
[2020-06-03 20:59:36] [INFO ] Deduced a trap composed of 5 places in 616 ms
[2020-06-03 20:59:36] [INFO ] Deduced a trap composed of 4 places in 490 ms
[2020-06-03 20:59:37] [INFO ] Deduced a trap composed of 4 places in 422 ms
[2020-06-03 20:59:37] [INFO ] Deduced a trap composed of 4 places in 396 ms
[2020-06-03 20:59:38] [INFO ] Deduced a trap composed of 4 places in 384 ms
[2020-06-03 20:59:38] [INFO ] Deduced a trap composed of 4 places in 665 ms
[2020-06-03 20:59:39] [INFO ] Deduced a trap composed of 4 places in 510 ms
[2020-06-03 20:59:40] [INFO ] Deduced a trap composed of 4 places in 421 ms
[2020-06-03 20:59:40] [INFO ] Deduced a trap composed of 5 places in 386 ms
[2020-06-03 20:59:40] [INFO ] Deduced a trap composed of 4 places in 386 ms
[2020-06-03 20:59:41] [INFO ] Deduced a trap composed of 4 places in 461 ms
[2020-06-03 20:59:41] [INFO ] Deduced a trap composed of 4 places in 564 ms
[2020-06-03 20:59:42] [INFO ] Deduced a trap composed of 5 places in 540 ms
[2020-06-03 20:59:42] [INFO ] Deduced a trap composed of 6 places in 381 ms
[2020-06-03 20:59:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 20:59:48] [INFO ] Deduced a trap composed of 2 places in 5782 ms
[2020-06-03 20:59: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 (> (+ s188 s189) 0)") while checking expression at index 0
[2020-06-03 20:59:49] [INFO ] [Real]Absence check using 400 positive place invariants in 187 ms returned sat
[2020-06-03 20:59:49] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 117 ms returned sat
[2020-06-03 20:59:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:59:51] [INFO ] [Real]Absence check using state equation in 2070 ms returned sat
[2020-06-03 20:59:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:59:51] [INFO ] [Nat]Absence check using 400 positive place invariants in 237 ms returned sat
[2020-06-03 20:59:51] [INFO ] [Nat]Absence check using 400 positive and 200 generalized place invariants in 157 ms returned sat
[2020-06-03 20:59:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:59:53] [INFO ] [Nat]Absence check using state equation in 2078 ms returned sat
[2020-06-03 20:59:54] [INFO ] [Nat]Added 200 Read/Feed constraints in 105 ms returned sat
[2020-06-03 20:59:54] [INFO ] Deduced a trap composed of 4 places in 697 ms
[2020-06-03 20:59:55] [INFO ] Deduced a trap composed of 4 places in 763 ms
[2020-06-03 20:59:56] [INFO ] Deduced a trap composed of 4 places in 525 ms
[2020-06-03 20:59:56] [INFO ] Deduced a trap composed of 4 places in 541 ms
[2020-06-03 20:59:57] [INFO ] Deduced a trap composed of 4 places in 600 ms
[2020-06-03 20:59:58] [INFO ] Deduced a trap composed of 6 places in 609 ms
[2020-06-03 20:59:58] [INFO ] Deduced a trap composed of 4 places in 594 ms
[2020-06-03 20:59:59] [INFO ] Deduced a trap composed of 4 places in 479 ms
[2020-06-03 20:59:59] [INFO ] Deduced a trap composed of 4 places in 620 ms
[2020-06-03 21:00:00] [INFO ] Deduced a trap composed of 4 places in 645 ms
[2020-06-03 21:00:01] [INFO ] Deduced a trap composed of 4 places in 696 ms
[2020-06-03 21:00:01] [INFO ] Deduced a trap composed of 4 places in 498 ms
[2020-06-03 21:00:02] [INFO ] Deduced a trap composed of 5 places in 451 ms
[2020-06-03 21:00:02] [INFO ] Deduced a trap composed of 4 places in 469 ms
[2020-06-03 21:00:03] [INFO ] Deduced a trap composed of 4 places in 491 ms
[2020-06-03 21:00:04] [INFO ] Deduced a trap composed of 4 places in 593 ms
[2020-06-03 21:00:04] [INFO ] Deduced a trap composed of 4 places in 542 ms
[2020-06-03 21:00:05] [INFO ] Deduced a trap composed of 4 places in 593 ms
[2020-06-03 21:00:05] [INFO ] Deduced a trap composed of 4 places in 654 ms
[2020-06-03 21:00:06] [INFO ] Deduced a trap composed of 4 places in 547 ms
[2020-06-03 21:00:07] [INFO ] Deduced a trap composed of 5 places in 448 ms
[2020-06-03 21:00:07] [INFO ] Deduced a trap composed of 4 places in 454 ms
[2020-06-03 21:00:08] [INFO ] Deduced a trap composed of 4 places in 366 ms
[2020-06-03 21:00:08] [INFO ] Deduced a trap composed of 4 places in 388 ms
[2020-06-03 21:00:09] [INFO ] Deduced a trap composed of 5 places in 533 ms
[2020-06-03 21:00:09] [INFO ] Deduced a trap composed of 6 places in 496 ms
[2020-06-03 21:00:10] [INFO ] Deduced a trap composed of 5 places in 520 ms
[2020-06-03 21:00:10] [INFO ] Deduced a trap composed of 5 places in 501 ms
[2020-06-03 21:00:11] [INFO ] Deduced a trap composed of 4 places in 570 ms
[2020-06-03 21:00: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 (> (+ s52 s132 s479 s599) 0)") while checking expression at index 1
[2020-06-03 21:00:11] [INFO ] [Real]Absence check using 400 positive place invariants in 249 ms returned sat
[2020-06-03 21:00:11] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 130 ms returned sat
[2020-06-03 21:00:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:00:14] [INFO ] [Real]Absence check using state equation in 2165 ms returned sat
[2020-06-03 21:00:14] [INFO ] [Real]Added 200 Read/Feed constraints in 167 ms returned sat
[2020-06-03 21:00:14] [INFO ] Deduced a trap composed of 4 places in 573 ms
[2020-06-03 21:00:15] [INFO ] Deduced a trap composed of 5 places in 510 ms
[2020-06-03 21:00:15] [INFO ] Deduced a trap composed of 4 places in 440 ms
[2020-06-03 21:00:16] [INFO ] Deduced a trap composed of 6 places in 418 ms
[2020-06-03 21:00:16] [INFO ] Deduced a trap composed of 4 places in 480 ms
[2020-06-03 21:00:17] [INFO ] Deduced a trap composed of 5 places in 378 ms
[2020-06-03 21:00:17] [INFO ] Deduced a trap composed of 6 places in 404 ms
[2020-06-03 21:00:18] [INFO ] Deduced a trap composed of 4 places in 460 ms
[2020-06-03 21:00:18] [INFO ] Deduced a trap composed of 4 places in 509 ms
[2020-06-03 21:00:19] [INFO ] Deduced a trap composed of 5 places in 488 ms
[2020-06-03 21:00:20] [INFO ] Deduced a trap composed of 6 places in 560 ms
[2020-06-03 21:00:20] [INFO ] Deduced a trap composed of 4 places in 499 ms
[2020-06-03 21:00:21] [INFO ] Deduced a trap composed of 4 places in 460 ms
[2020-06-03 21:00:21] [INFO ] Deduced a trap composed of 4 places in 373 ms
[2020-06-03 21:00:22] [INFO ] Deduced a trap composed of 4 places in 431 ms
[2020-06-03 21:00:22] [INFO ] Deduced a trap composed of 4 places in 454 ms
[2020-06-03 21:00:23] [INFO ] Deduced a trap composed of 4 places in 410 ms
[2020-06-03 21:00:23] [INFO ] Deduced a trap composed of 4 places in 431 ms
[2020-06-03 21:00:23] [INFO ] Deduced a trap composed of 4 places in 366 ms
[2020-06-03 21:00:24] [INFO ] Deduced a trap composed of 4 places in 391 ms
[2020-06-03 21:00:24] [INFO ] Deduced a trap composed of 4 places in 399 ms
[2020-06-03 21:00:25] [INFO ] Deduced a trap composed of 4 places in 398 ms
[2020-06-03 21:00:25] [INFO ] Deduced a trap composed of 4 places in 368 ms
[2020-06-03 21:00:26] [INFO ] Deduced a trap composed of 4 places in 329 ms
[2020-06-03 21:00:26] [INFO ] Deduced a trap composed of 4 places in 322 ms
[2020-06-03 21:00:26] [INFO ] Deduced a trap composed of 6 places in 309 ms
[2020-06-03 21:00:27] [INFO ] Deduced a trap composed of 6 places in 340 ms
[2020-06-03 21:00:27] [INFO ] Deduced a trap composed of 6 places in 327 ms
[2020-06-03 21:00:28] [INFO ] Deduced a trap composed of 6 places in 288 ms
[2020-06-03 21:00:28] [INFO ] Deduced a trap composed of 6 places in 302 ms
[2020-06-03 21:00:28] [INFO ] Deduced a trap composed of 6 places in 309 ms
[2020-06-03 21:00:29] [INFO ] Deduced a trap composed of 4 places in 286 ms
[2020-06-03 21:00:29] [INFO ] Deduced a trap composed of 6 places in 300 ms
[2020-06-03 21:00:29] [INFO ] Deduced a trap composed of 4 places in 307 ms
[2020-06-03 21:00:30] [INFO ] Deduced a trap composed of 4 places in 252 ms
[2020-06-03 21:00:30] [INFO ] Deduced a trap composed of 6 places in 297 ms
[2020-06-03 21:00:30] [INFO ] Deduced a trap composed of 6 places in 297 ms
[2020-06-03 21:00:31] [INFO ] Deduced a trap composed of 4 places in 278 ms
[2020-06-03 21:00:31] [INFO ] Deduced a trap composed of 4 places in 290 ms
[2020-06-03 21:00:31] [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 (> (+ s12 s44 s419 s467) 0)") while checking expression at index 2
[2020-06-03 21:00:32] [INFO ] [Real]Absence check using 400 positive place invariants in 252 ms returned sat
[2020-06-03 21:00:32] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 165 ms returned sat
[2020-06-03 21:00:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:00:34] [INFO ] [Real]Absence check using state equation in 2110 ms returned sat
[2020-06-03 21:00:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:00:34] [INFO ] [Nat]Absence check using 400 positive place invariants in 263 ms returned sat
[2020-06-03 21:00:34] [INFO ] [Nat]Absence check using 400 positive and 200 generalized place invariants in 181 ms returned sat
[2020-06-03 21:00:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:00:37] [INFO ] [Nat]Absence check using state equation in 2144 ms returned sat
[2020-06-03 21:00:37] [INFO ] [Nat]Added 200 Read/Feed constraints in 102 ms returned sat
[2020-06-03 21:00:37] [INFO ] Deduced a trap composed of 5 places in 711 ms
[2020-06-03 21:00:38] [INFO ] Deduced a trap composed of 4 places in 596 ms
[2020-06-03 21:00:39] [INFO ] Deduced a trap composed of 4 places in 699 ms
[2020-06-03 21:00:39] [INFO ] Deduced a trap composed of 4 places in 600 ms
[2020-06-03 21:00:40] [INFO ] Deduced a trap composed of 5 places in 568 ms
[2020-06-03 21:00:41] [INFO ] Deduced a trap composed of 4 places in 533 ms
[2020-06-03 21:00:41] [INFO ] Deduced a trap composed of 4 places in 577 ms
[2020-06-03 21:00:42] [INFO ] Deduced a trap composed of 4 places in 494 ms
[2020-06-03 21:00:42] [INFO ] Deduced a trap composed of 4 places in 459 ms
[2020-06-03 21:00:43] [INFO ] Deduced a trap composed of 4 places in 456 ms
[2020-06-03 21:00:43] [INFO ] Deduced a trap composed of 4 places in 439 ms
[2020-06-03 21:00:44] [INFO ] Deduced a trap composed of 6 places in 425 ms
[2020-06-03 21:00:44] [INFO ] Deduced a trap composed of 4 places in 421 ms
[2020-06-03 21:00:45] [INFO ] Deduced a trap composed of 4 places in 423 ms
[2020-06-03 21:00:45] [INFO ] Deduced a trap composed of 4 places in 395 ms
[2020-06-03 21:00:46] [INFO ] Deduced a trap composed of 4 places in 375 ms
[2020-06-03 21:00:46] [INFO ] Deduced a trap composed of 4 places in 532 ms
[2020-06-03 21:00:47] [INFO ] Deduced a trap composed of 4 places in 465 ms
[2020-06-03 21:00:47] [INFO ] Deduced a trap composed of 4 places in 381 ms
[2020-06-03 21:00:48] [INFO ] Deduced a trap composed of 4 places in 357 ms
[2020-06-03 21:00:48] [INFO ] Deduced a trap composed of 4 places in 428 ms
[2020-06-03 21:00:49] [INFO ] Deduced a trap composed of 6 places in 406 ms
[2020-06-03 21:00:49] [INFO ] Deduced a trap composed of 4 places in 439 ms
[2020-06-03 21:00:49] [INFO ] Deduced a trap composed of 4 places in 406 ms
[2020-06-03 21:00:50] [INFO ] Deduced a trap composed of 4 places in 398 ms
[2020-06-03 21:00:50] [INFO ] Deduced a trap composed of 4 places in 394 ms
[2020-06-03 21:00:51] [INFO ] Deduced a trap composed of 4 places in 358 ms
[2020-06-03 21:00:51] [INFO ] Deduced a trap composed of 4 places in 410 ms
[2020-06-03 21:00:52] [INFO ] Deduced a trap composed of 4 places in 331 ms
[2020-06-03 21:00:52] [INFO ] Deduced a trap composed of 4 places in 328 ms
[2020-06-03 21:00:52] [INFO ] Deduced a trap composed of 4 places in 314 ms
[2020-06-03 21:00:53] [INFO ] Deduced a trap composed of 4 places in 315 ms
[2020-06-03 21:00:53] [INFO ] Deduced a trap composed of 4 places in 283 ms
[2020-06-03 21:00:53] [INFO ] Deduced a trap composed of 4 places in 346 ms
[2020-06-03 21:00:54] [INFO ] Deduced a trap composed of 4 places in 380 ms
[2020-06-03 21:00:54] [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 (> (+ s126 s134 s590 s602) 0)") while checking expression at index 3
[2020-06-03 21:00:54] [INFO ] [Real]Absence check using 400 positive place invariants in 248 ms returned sat
[2020-06-03 21:00:54] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 169 ms returned sat
[2020-06-03 21:00:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:00:57] [INFO ] [Real]Absence check using state equation in 2217 ms returned sat
[2020-06-03 21:00:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:00:57] [INFO ] [Nat]Absence check using 400 positive place invariants in 24 ms returned unsat
[2020-06-03 21:00:57] [INFO ] [Real]Absence check using 400 positive place invariants in 203 ms returned sat
[2020-06-03 21:00:57] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 137 ms returned sat
[2020-06-03 21:00:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:00:59] [INFO ] [Real]Absence check using state equation in 2035 ms returned sat
[2020-06-03 21:00:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:01:00] [INFO ] [Nat]Absence check using 400 positive place invariants in 19 ms returned unsat
[2020-06-03 21:01:00] [INFO ] [Real]Absence check using 400 positive place invariants in 205 ms returned sat
[2020-06-03 21:01:00] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 128 ms returned sat
[2020-06-03 21:01:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:01:02] [INFO ] [Real]Absence check using state equation in 2080 ms returned sat
[2020-06-03 21:01:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:01:02] [INFO ] [Nat]Absence check using 400 positive place invariants in 242 ms returned sat
[2020-06-03 21:01:03] [INFO ] [Nat]Absence check using 400 positive and 200 generalized place invariants in 164 ms returned sat
[2020-06-03 21:01:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:01:05] [INFO ] [Nat]Absence check using state equation in 2043 ms returned sat
[2020-06-03 21:01:05] [INFO ] [Nat]Added 200 Read/Feed constraints in 94 ms returned sat
[2020-06-03 21:01:05] [INFO ] Deduced a trap composed of 4 places in 531 ms
[2020-06-03 21:01:06] [INFO ] Deduced a trap composed of 4 places in 469 ms
[2020-06-03 21:01:06] [INFO ] Deduced a trap composed of 4 places in 449 ms
[2020-06-03 21:01:07] [INFO ] Deduced a trap composed of 4 places in 482 ms
[2020-06-03 21:01:07] [INFO ] Deduced a trap composed of 5 places in 440 ms
[2020-06-03 21:01:08] [INFO ] Deduced a trap composed of 6 places in 507 ms
[2020-06-03 21:01:08] [INFO ] Deduced a trap composed of 4 places in 455 ms
[2020-06-03 21:01:09] [INFO ] Deduced a trap composed of 4 places in 488 ms
[2020-06-03 21:01:10] [INFO ] Deduced a trap composed of 6 places in 493 ms
[2020-06-03 21:01:10] [INFO ] Deduced a trap composed of 4 places in 445 ms
[2020-06-03 21:01:11] [INFO ] Deduced a trap composed of 4 places in 450 ms
[2020-06-03 21:01:11] [INFO ] Deduced a trap composed of 4 places in 447 ms
[2020-06-03 21:01:12] [INFO ] Deduced a trap composed of 4 places in 406 ms
[2020-06-03 21:01:12] [INFO ] Deduced a trap composed of 4 places in 386 ms
[2020-06-03 21:01:13] [INFO ] Deduced a trap composed of 4 places in 468 ms
[2020-06-03 21:01:13] [INFO ] Deduced a trap composed of 4 places in 475 ms
[2020-06-03 21:01:14] [INFO ] Deduced a trap composed of 4 places in 425 ms
[2020-06-03 21:01:14] [INFO ] Deduced a trap composed of 4 places in 495 ms
[2020-06-03 21:01:15] [INFO ] Deduced a trap composed of 4 places in 415 ms
[2020-06-03 21:01:15] [INFO ] Deduced a trap composed of 4 places in 372 ms
[2020-06-03 21:01:15] [INFO ] Deduced a trap composed of 4 places in 300 ms
[2020-06-03 21:01:16] [INFO ] Deduced a trap composed of 5 places in 302 ms
[2020-06-03 21:01:16] [INFO ] Deduced a trap composed of 4 places in 384 ms
[2020-06-03 21:01:17] [INFO ] Deduced a trap composed of 4 places in 457 ms
[2020-06-03 21:01:17] [INFO ] Deduced a trap composed of 4 places in 405 ms
[2020-06-03 21:01:17] [INFO ] Deduced a trap composed of 4 places in 394 ms
[2020-06-03 21:01:18] [INFO ] Deduced a trap composed of 5 places in 364 ms
[2020-06-03 21:01:18] [INFO ] Deduced a trap composed of 4 places in 344 ms
[2020-06-03 21:01:19] [INFO ] Deduced a trap composed of 4 places in 397 ms
[2020-06-03 21:01:19] [INFO ] Deduced a trap composed of 5 places in 362 ms
[2020-06-03 21:01:20] [INFO ] Deduced a trap composed of 4 places in 387 ms
[2020-06-03 21:01:20] [INFO ] Deduced a trap composed of 4 places in 286 ms
[2020-06-03 21:01:20] [INFO ] Deduced a trap composed of 5 places in 276 ms
[2020-06-03 21:01:20] [INFO ] Deduced a trap composed of 4 places in 277 ms
[2020-06-03 21:01:21] [INFO ] Deduced a trap composed of 5 places in 308 ms
[2020-06-03 21:01:21] [INFO ] Deduced a trap composed of 4 places in 386 ms
[2020-06-03 21:01:22] [INFO ] Deduced a trap composed of 4 places in 386 ms
[2020-06-03 21:01:22] [INFO ] Deduced a trap composed of 5 places in 383 ms
[2020-06-03 21:01:22] [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 (> (+ s150 s330 s625 s626 s896) 0)") while checking expression at index 6
[2020-06-03 21:01:23] [INFO ] [Real]Absence check using 400 positive place invariants in 291 ms returned sat
[2020-06-03 21:01:23] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 186 ms returned sat
[2020-06-03 21:01:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:01:25] [INFO ] [Real]Absence check using state equation in 2180 ms returned sat
[2020-06-03 21:01:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:01:26] [INFO ] [Nat]Absence check using 400 positive place invariants in 243 ms returned sat
[2020-06-03 21:01:26] [INFO ] [Nat]Absence check using 400 positive and 200 generalized place invariants in 162 ms returned sat
[2020-06-03 21:01:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:01:28] [INFO ] [Nat]Absence check using state equation in 2313 ms returned sat
[2020-06-03 21:01:28] [INFO ] [Nat]Added 200 Read/Feed constraints in 107 ms returned sat
[2020-06-03 21:01:29] [INFO ] Deduced a trap composed of 4 places in 478 ms
[2020-06-03 21:01:29] [INFO ] Deduced a trap composed of 4 places in 569 ms
[2020-06-03 21:01:30] [INFO ] Deduced a trap composed of 4 places in 596 ms
[2020-06-03 21:01:30] [INFO ] Deduced a trap composed of 4 places in 603 ms
[2020-06-03 21:01:31] [INFO ] Deduced a trap composed of 5 places in 468 ms
[2020-06-03 21:01:32] [INFO ] Deduced a trap composed of 6 places in 576 ms
[2020-06-03 21:01:32] [INFO ] Deduced a trap composed of 4 places in 441 ms
[2020-06-03 21:01:33] [INFO ] Deduced a trap composed of 4 places in 483 ms
[2020-06-03 21:01:33] [INFO ] Deduced a trap composed of 6 places in 507 ms
[2020-06-03 21:01:34] [INFO ] Deduced a trap composed of 4 places in 422 ms
[2020-06-03 21:01:34] [INFO ] Deduced a trap composed of 4 places in 491 ms
[2020-06-03 21:01:35] [INFO ] Deduced a trap composed of 4 places in 504 ms
[2020-06-03 21:01:35] [INFO ] Deduced a trap composed of 4 places in 476 ms
[2020-06-03 21:01:36] [INFO ] Deduced a trap composed of 4 places in 464 ms
[2020-06-03 21:01:36] [INFO ] Deduced a trap composed of 4 places in 477 ms
[2020-06-03 21:01:37] [INFO ] Deduced a trap composed of 4 places in 451 ms
[2020-06-03 21:01:37] [INFO ] Deduced a trap composed of 4 places in 383 ms
[2020-06-03 21:01:38] [INFO ] Deduced a trap composed of 4 places in 310 ms
[2020-06-03 21:01:38] [INFO ] Deduced a trap composed of 4 places in 354 ms
[2020-06-03 21:01:38] [INFO ] Deduced a trap composed of 4 places in 420 ms
[2020-06-03 21:01:39] [INFO ] Deduced a trap composed of 4 places in 403 ms
[2020-06-03 21:01:39] [INFO ] Deduced a trap composed of 5 places in 361 ms
[2020-06-03 21:01:40] [INFO ] Deduced a trap composed of 4 places in 430 ms
[2020-06-03 21:01:40] [INFO ] Deduced a trap composed of 4 places in 382 ms
[2020-06-03 21:01:41] [INFO ] Deduced a trap composed of 4 places in 313 ms
[2020-06-03 21:01:41] [INFO ] Deduced a trap composed of 4 places in 321 ms
[2020-06-03 21:01:41] [INFO ] Deduced a trap composed of 5 places in 288 ms
[2020-06-03 21:01:42] [INFO ] Deduced a trap composed of 4 places in 283 ms
[2020-06-03 21:01:42] [INFO ] Deduced a trap composed of 4 places in 311 ms
[2020-06-03 21:01:42] [INFO ] Deduced a trap composed of 5 places in 298 ms
[2020-06-03 21:01:43] [INFO ] Deduced a trap composed of 4 places in 311 ms
[2020-06-03 21:01:43] [INFO ] Deduced a trap composed of 4 places in 355 ms
[2020-06-03 21:01:44] [INFO ] Deduced a trap composed of 5 places in 401 ms
[2020-06-03 21:01:44] [INFO ] Deduced a trap composed of 4 places in 382 ms
[2020-06-03 21:01:44] [INFO ] Deduced a trap composed of 5 places in 420 ms
[2020-06-03 21:01:45] [INFO ] Deduced a trap composed of 4 places in 377 ms
[2020-06-03 21:01:45] [INFO ] Deduced a trap composed of 4 places in 444 ms
[2020-06-03 21:01:45] [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 (> (+ s8 s262 s413 s794) 0)") while checking expression at index 7
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-03 21:01:48] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-03 21:01:48] [INFO ] Flatten gal took : 2142 ms
FORMULA Dekker-PT-200-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 21:01:48] [INFO ] Applying decomposition
[2020-06-03 21:01:50] [INFO ] Flatten gal took : 1857 ms
[2020-06-03 21:01:51] [INFO ] Decomposing Gal with order
[2020-06-03 21:01:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 21:01:56] [INFO ] Removed a total of 158600 redundant transitions.
[2020-06-03 21:01:57] [INFO ] Flatten gal took : 3622 ms
[2020-06-03 21:01:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 939 ms.
[2020-06-03 21:01:58] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-03 21:01:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 260 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Dekker-PT-200 @ 3570 seconds

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

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

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

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

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

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

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

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

FORMULA Dekker-PT-200-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3473
rslt: Output for LTLCardinality @ 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=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 21:01:59 2020
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 496
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"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": "X (X (G ((((1 <= p235)) AND ((p793 <= 0))))))",
"processed_size": 45,
"rewrites": 65
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 694
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((((p317 <= 0)) OR ((1 <= p492))) AND (((p467 <= 0)) OR ((1 <= p601))))",
"processed_size": 73,
"rewrites": 66
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1158
},
"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 <= p338)) AND ((p566 <= 0)))",
"processed_size": 33,
"rewrites": 67
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 600
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3474
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": "F (G ((((1 <= p379)) AND ((p488 <= 0)))))",
"processed_size": 41,
"rewrites": 65
},
"result":
{
"edges": 5,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 2501040,
"runtime": 97.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F((* R X(*))) : F(G(((X(G(*)) AND (* AND *)) OR X(*)))) : F(G(*)) : X(X(G(*))) : X(X(F((X(F(**)) OR (** OR **))))) : F(G(**)) : (X(X(G((F(*) AND (F(*) AND (** AND **)))))) AND (** AND **)) : G((F(**) AND (** OR X(**)))) : F(**)"
},
"net":
{
"arcs": 320400,
"conflict_clusters": 1,
"places": 1000,
"places_significant": 400,
"singleton_clusters": 0,
"transitions": 40400
},
"result":
{
"preliminary_value": "no no no no no no no no no ",
"value": "no no no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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 LTLCardinality.xml
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p886 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p764 <= 1)
lola: LP says that atomic proposition is always true: (p488 <= 1)
lola: LP says that atomic proposition is always true: (p793 <= 1)
lola: LP says that atomic proposition is always true: (p290 <= 1)
lola: LP says that atomic proposition is always true: (p358 <= 1)
lola: LP says that atomic proposition is always true: (p917 <= 1)
lola: LP says that atomic proposition is always true: (p492 <= 1)
lola: LP says that atomic proposition is always true: (p570 <= 1)
lola: LP says that atomic proposition is always true: (p570 <= 1)
lola: LP says that atomic proposition is always true: (p492 <= 1)
lola: LP says that atomic proposition is always true: (p601 <= 1)
lola: LP says that atomic proposition is always true: (p301 <= 1)
lola: LP says that atomic proposition is always true: (p301 <= 1)
lola: LP says that atomic proposition is always true: (p566 <= 1)
lola: F (NOT(((((1 <= p936)) AND ((p107 <= 0))) U X ((((p936 <= 0)) OR ((1 <= p107))))))) : F (NOT(F ((((X (F (((1 <= p886)))) OR ((p690 <= 0))) OR ((1 <= p59))) AND X ((((p690 <= 0)) OR ((1 <= p59)))))))) : ((0 <= 0) U X (F (NOT(F ((((1 <= 0) U X ((((p34 <= 0)) OR ((1 <= p764))))) U (((p379 <= 0)) OR ((1 <= p488))))))))) : NOT(X (F (X ((((p235 <= 0)) OR ((1 <= p793))))))) : F (NOT(X (NOT(X (((X (F ((((1 <= p946)) AND ((p290 <= 0))))) OR ((p205 <= 0))) OR ((1 <= p358)))))))) : F (G ((((1 <= p369)) AND ((p917 <= 0))))) : ((G (X (X ((((NOT(G ((((p317 <= 0)) OR ((1 <= p492))))) AND NOT(G ((((p795 <= 0)) OR ((1 <= p570)))))) AND ((1 <= p795))) AND ((p570 <= 0)))))) AND (((p317 <= 0)) OR ((1 <= p492)))) AND (((p467 <= 0)) OR ((1 <= p601)))) : G (((((p206 <= 0)) OR ((1 <= p301))) U X ((((1 <= p206)) AND ((p301 <= 0)))))) : F ((((p338 <= 0)) OR ((1 <= p566))))
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 386 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((((p936 <= 0)) OR ((1 <= p107))) R X ((((1 <= p936)) AND ((p107 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((((p936 <= 0)) OR ((1 <= p107))) R X ((((1 <= p936)) AND ((p107 <= 0))))))
lola: processed formula length: 79
lola: 65 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 1 will run for 434 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((X (G (((p886 <= 0)))) AND (((1 <= p690)) AND ((p59 <= 0)))) OR X ((((1 <= p690)) AND ((p59 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((X (G (((p886 <= 0)))) AND (((1 <= p690)) AND ((p59 <= 0)))) OR X ((((1 <= p690)) AND ((p59 <= 0)))))))
lola: processed formula length: 110
lola: 65 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 6 edges
lola: ========================================
lola: subprocess 2 will run for 496 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((((1 <= p235)) AND ((p793 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((((1 <= p235)) AND ((p793 <= 0))))))
lola: processed formula length: 45
lola: 65 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 3 will run for 579 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((X (F ((((1 <= p946)) AND ((p290 <= 0))))) OR (((p205 <= 0)) OR ((1 <= p358)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((X (F ((((1 <= p946)) AND ((p290 <= 0))))) OR (((p205 <= 0)) OR ((1 <= p358)))))))
lola: processed formula length: 91
lola: 65 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5705 markings, 6170 edges
lola: ========================================
lola: subprocess 4 will run for 694 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (G ((F ((((1 <= p317)) AND ((p492 <= 0)))) AND (F ((((1 <= p795)) AND ((p570 <= 0)))) AND (((1 <= p795)) AND ((p570 <= 0)))))))) AND ((((p317 <= 0)) OR ((1 <= p492))) AND (((p467 <= 0)) OR ((1 <= p601)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 694 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p317 <= 0)) OR ((1 <= p492))) AND (((p467 <= 0)) OR ((1 <= p601))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((((p317 <= 0)) OR ((1 <= p492))) AND (((p467 <= 0)) OR ((1 <= p601))))
lola: processed formula length: 73
lola: 66 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 868 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((F ((((1 <= p317)) AND ((p492 <= 0)))) AND (F ((((1 <= p795)) AND ((p570 <= 0)))) AND (((1 <= p795)) AND ((p570 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((F ((((1 <= p317)) AND ((p492 <= 0)))) AND (F ((((1 <= p795)) AND ((p570 <= 0)))) AND (((1 <= p795)) AND ((p570 <= 0))))))))
lola: processed formula length: 133
lola: 65 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 868 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((((1 <= p206)) AND ((p301 <= 0)))) AND ((((p206 <= 0)) OR ((1 <= p301))) OR X ((((1 <= p206)) AND ((p301 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((((1 <= p206)) AND ((p301 <= 0)))) AND ((((p206 <= 0)) OR ((1 <= p301))) OR X ((((1 <= p206)) AND ((p301 <= 0)))))))
lola: processed formula length: 124
lola: 65 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 30 edges
lola: ========================================
lola: subprocess 6 will run for 1158 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((p338 <= 0)) OR ((1 <= p566))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((1 <= p338)) AND ((p566 <= 0)))
lola: processed formula length: 33
lola: 67 rewrites
lola: closed formula file LTLCardinality.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: RUNNING
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 7 will run for 1737 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((1 <= p369)) AND ((p917 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((1 <= p369)) AND ((p917 <= 0)))))
lola: processed formula length: 41
lola: 65 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 5 edges
lola: ========================================
lola: subprocess 8 will run for 3474 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((1 <= p379)) AND ((p488 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((1 <= p379)) AND ((p488 <= 0)))))
lola: processed formula length: 41
lola: 65 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 5 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no
lola:
preliminary result: no no no no no no no no no
lola: memory consumption: 2501040 KB
lola: time consumption: 97 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Dekker-PT-200"
export BK_EXAMINATION="LTLCardinality"
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 LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-158987882200345"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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