About the Execution of ITS-LoLa for Peterson-PT-5
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15744.710 | 3600000.00 | 4038628.00 | 773.60 | ????T?F???F?TFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853600731.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is Peterson-PT-5, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853600731
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 63K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 170K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 72K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 245K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 54K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 30K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 99K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 49K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 50K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 169K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 22K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 2 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 911K Apr 27 15:14 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 Peterson-PT-5-CTLCardinality-00
FORMULA_NAME Peterson-PT-5-CTLCardinality-01
FORMULA_NAME Peterson-PT-5-CTLCardinality-02
FORMULA_NAME Peterson-PT-5-CTLCardinality-03
FORMULA_NAME Peterson-PT-5-CTLCardinality-04
FORMULA_NAME Peterson-PT-5-CTLCardinality-05
FORMULA_NAME Peterson-PT-5-CTLCardinality-06
FORMULA_NAME Peterson-PT-5-CTLCardinality-07
FORMULA_NAME Peterson-PT-5-CTLCardinality-08
FORMULA_NAME Peterson-PT-5-CTLCardinality-09
FORMULA_NAME Peterson-PT-5-CTLCardinality-10
FORMULA_NAME Peterson-PT-5-CTLCardinality-11
FORMULA_NAME Peterson-PT-5-CTLCardinality-12
FORMULA_NAME Peterson-PT-5-CTLCardinality-13
FORMULA_NAME Peterson-PT-5-CTLCardinality-14
FORMULA_NAME Peterson-PT-5-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1591165007441
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 06:16:49] [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 06:16:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 06:16:49] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2020-06-03 06:16:49] [INFO ] Transformed 834 places.
[2020-06-03 06:16:49] [INFO ] Transformed 1242 transitions.
[2020-06-03 06:16:49] [INFO ] Parsed PT model containing 834 places and 1242 transitions in 197 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 65 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 492 ms. (steps per millisecond=203 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0]
[2020-06-03 06:16:50] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2020-06-03 06:16:50] [INFO ] Computed 23 place invariants in 51 ms
[2020-06-03 06:16:50] [INFO ] [Real]Absence check using 17 positive place invariants in 47 ms returned sat
[2020-06-03 06:16:50] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 10 ms returned sat
[2020-06-03 06:16:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:16:52] [INFO ] [Real]Absence check using state equation in 1780 ms returned sat
[2020-06-03 06:16:52] [INFO ] State equation strengthened by 230 read => feed constraints.
[2020-06-03 06:16:52] [INFO ] [Real]Added 230 Read/Feed constraints in 50 ms returned sat
[2020-06-03 06:16:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:16:53] [INFO ] [Nat]Absence check using 17 positive place invariants in 37 ms returned sat
[2020-06-03 06:16:53] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2020-06-03 06:16:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:16:54] [INFO ] [Nat]Absence check using state equation in 1957 ms returned sat
[2020-06-03 06:16:55] [INFO ] [Nat]Added 230 Read/Feed constraints in 74 ms returned sat
[2020-06-03 06:16:55] [INFO ] Computed and/alt/rep : 1236/4722/1116 causal constraints in 81 ms.
[2020-06-03 06:17:12] [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 (=> (> t897 0) (and (> t492 0) (< o492 o897)))") while checking expression at index 0
[2020-06-03 06:17:13] [INFO ] [Real]Absence check using 17 positive place invariants in 29 ms returned sat
[2020-06-03 06:17:13] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-06-03 06:17:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:17:14] [INFO ] [Real]Absence check using state equation in 1856 ms returned sat
[2020-06-03 06:17:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:17:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 33 ms returned sat
[2020-06-03 06:17:15] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2020-06-03 06:17:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:17:16] [INFO ] [Nat]Absence check using state equation in 1710 ms returned sat
[2020-06-03 06:17:16] [INFO ] [Nat]Added 230 Read/Feed constraints in 124 ms returned sat
[2020-06-03 06:17:17] [INFO ] Deduced a trap composed of 11 places in 656 ms
[2020-06-03 06:17:18] [INFO ] Deduced a trap composed of 63 places in 543 ms
[2020-06-03 06:17:18] [INFO ] Deduced a trap composed of 127 places in 488 ms
[2020-06-03 06:17:19] [INFO ] Deduced a trap composed of 11 places in 464 ms
[2020-06-03 06:17:19] [INFO ] Deduced a trap composed of 28 places in 441 ms
[2020-06-03 06:17:20] [INFO ] Deduced a trap composed of 11 places in 514 ms
[2020-06-03 06:17:20] [INFO ] Deduced a trap composed of 11 places in 483 ms
[2020-06-03 06:17:21] [INFO ] Deduced a trap composed of 28 places in 532 ms
[2020-06-03 06:17:22] [INFO ] Deduced a trap composed of 28 places in 531 ms
[2020-06-03 06:17:22] [INFO ] Deduced a trap composed of 28 places in 531 ms
[2020-06-03 06:17:23] [INFO ] Deduced a trap composed of 28 places in 514 ms
[2020-06-03 06:17:23] [INFO ] Deduced a trap composed of 166 places in 551 ms
[2020-06-03 06:17:24] [INFO ] Deduced a trap composed of 165 places in 563 ms
[2020-06-03 06:17:25] [INFO ] Deduced a trap composed of 173 places in 582 ms
[2020-06-03 06:17:25] [INFO ] Deduced a trap composed of 166 places in 541 ms
[2020-06-03 06:17:26] [INFO ] Deduced a trap composed of 165 places in 547 ms
[2020-06-03 06:17:26] [INFO ] Deduced a trap composed of 41 places in 505 ms
[2020-06-03 06:17:27] [INFO ] Deduced a trap composed of 41 places in 552 ms
[2020-06-03 06:17:28] [INFO ] Deduced a trap composed of 41 places in 531 ms
[2020-06-03 06:17:28] [INFO ] Deduced a trap composed of 41 places in 527 ms
[2020-06-03 06:17:29] [INFO ] Deduced a trap composed of 52 places in 517 ms
[2020-06-03 06:17:29] [INFO ] Deduced a trap composed of 35 places in 535 ms
[2020-06-03 06:17:30] [INFO ] Deduced a trap composed of 27 places in 548 ms
[2020-06-03 06:17:31] [INFO ] Deduced a trap composed of 16 places in 538 ms
[2020-06-03 06:17:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 24 trap constraints in 14237 ms
[2020-06-03 06:17:31] [INFO ] [Real]Absence check using 17 positive place invariants in 33 ms returned sat
[2020-06-03 06:17:31] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-06-03 06:17:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:17:33] [INFO ] [Real]Absence check using state equation in 1745 ms returned sat
[2020-06-03 06:17:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:17:33] [INFO ] [Nat]Absence check using 17 positive place invariants in 32 ms returned sat
[2020-06-03 06:17:33] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-06-03 06:17:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:17:34] [INFO ] [Nat]Absence check using state equation in 1665 ms returned sat
[2020-06-03 06:17:34] [INFO ] [Nat]Added 230 Read/Feed constraints in 69 ms returned sat
[2020-06-03 06:17:35] [INFO ] Deduced a trap composed of 15 places in 428 ms
[2020-06-03 06:17:35] [INFO ] Deduced a trap composed of 13 places in 457 ms
[2020-06-03 06:17:36] [INFO ] Deduced a trap composed of 17 places in 439 ms
[2020-06-03 06:17:36] [INFO ] Deduced a trap composed of 13 places in 470 ms
[2020-06-03 06:17:37] [INFO ] Deduced a trap composed of 17 places in 456 ms
[2020-06-03 06:17:37] [INFO ] Deduced a trap composed of 56 places in 351 ms
[2020-06-03 06:17:38] [INFO ] Deduced a trap composed of 56 places in 366 ms
[2020-06-03 06:17:38] [INFO ] Deduced a trap composed of 32 places in 370 ms
[2020-06-03 06:17:39] [INFO ] Deduced a trap composed of 89 places in 357 ms
[2020-06-03 06:17:39] [INFO ] Deduced a trap composed of 49 places in 351 ms
[2020-06-03 06:17:39] [INFO ] Deduced a trap composed of 49 places in 347 ms
[2020-06-03 06:17:40] [INFO ] Deduced a trap composed of 71 places in 317 ms
[2020-06-03 06:17:40] [INFO ] Deduced a trap composed of 70 places in 343 ms
[2020-06-03 06:17:41] [INFO ] Deduced a trap composed of 51 places in 324 ms
[2020-06-03 06:17:41] [INFO ] Deduced a trap composed of 71 places in 324 ms
[2020-06-03 06:17:41] [INFO ] Deduced a trap composed of 71 places in 316 ms
[2020-06-03 06:17:42] [INFO ] Deduced a trap composed of 70 places in 326 ms
[2020-06-03 06:17:42] [INFO ] Deduced a trap composed of 37 places in 368 ms
[2020-06-03 06:17:43] [INFO ] Deduced a trap composed of 37 places in 371 ms
[2020-06-03 06:17:43] [INFO ] Deduced a trap composed of 16 places in 511 ms
[2020-06-03 06:17:43] [INFO ] Deduced a trap composed of 52 places in 192 ms
[2020-06-03 06:17:44] [INFO ] Deduced a trap composed of 44 places in 192 ms
[2020-06-03 06:17:44] [INFO ] Deduced a trap composed of 89 places in 283 ms
[2020-06-03 06:17:44] [INFO ] Deduced a trap composed of 89 places in 242 ms
[2020-06-03 06:17:45] [INFO ] Deduced a trap composed of 70 places in 254 ms
[2020-06-03 06:17:45] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 10285 ms
[2020-06-03 06:17:45] [INFO ] Computed and/alt/rep : 1236/4722/1116 causal constraints in 80 ms.
[2020-06-03 06:17:53] [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 (=> (> t458 0) (and (and (> t845 0) (< o845 o458)) (and (> t884 0) (< o884 o458))))") while checking expression at index 2
[2020-06-03 06:17:53] [INFO ] [Real]Absence check using 17 positive place invariants in 37 ms returned sat
[2020-06-03 06:17:53] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2020-06-03 06:17:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:17:54] [INFO ] [Real]Absence check using state equation in 1754 ms returned sat
[2020-06-03 06:17:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:17:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 31 ms returned sat
[2020-06-03 06:17:55] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-06-03 06:17:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:17:56] [INFO ] [Nat]Absence check using state equation in 1606 ms returned sat
[2020-06-03 06:17:56] [INFO ] [Nat]Added 230 Read/Feed constraints in 106 ms returned sat
[2020-06-03 06:17:57] [INFO ] Deduced a trap composed of 29 places in 478 ms
[2020-06-03 06:17:57] [INFO ] Deduced a trap composed of 16 places in 477 ms
[2020-06-03 06:17:58] [INFO ] Deduced a trap composed of 56 places in 470 ms
[2020-06-03 06:17:59] [INFO ] Deduced a trap composed of 41 places in 571 ms
[2020-06-03 06:17:59] [INFO ] Deduced a trap composed of 39 places in 516 ms
[2020-06-03 06:18:00] [INFO ] Deduced a trap composed of 39 places in 507 ms
[2020-06-03 06:18:00] [INFO ] Deduced a trap composed of 68 places in 470 ms
[2020-06-03 06:18:01] [INFO ] Deduced a trap composed of 27 places in 495 ms
[2020-06-03 06:18:01] [INFO ] Deduced a trap composed of 29 places in 478 ms
[2020-06-03 06:18:02] [INFO ] Deduced a trap composed of 39 places in 525 ms
[2020-06-03 06:18:02] [INFO ] Deduced a trap composed of 51 places in 502 ms
[2020-06-03 06:18:03] [INFO ] Deduced a trap composed of 11 places in 522 ms
[2020-06-03 06:18:03] [INFO ] Deduced a trap composed of 27 places in 448 ms
[2020-06-03 06:18:04] [INFO ] Deduced a trap composed of 32 places in 570 ms
[2020-06-03 06:18:05] [INFO ] Deduced a trap composed of 136 places in 524 ms
[2020-06-03 06:18:05] [INFO ] Deduced a trap composed of 40 places in 494 ms
[2020-06-03 06:18:06] [INFO ] Deduced a trap composed of 79 places in 542 ms
[2020-06-03 06:18:06] [INFO ] Deduced a trap composed of 131 places in 575 ms
[2020-06-03 06:18:07] [INFO ] Deduced a trap composed of 93 places in 558 ms
[2020-06-03 06:18:08] [INFO ] Deduced a trap composed of 130 places in 536 ms
[2020-06-03 06:18:08] [INFO ] Deduced a trap composed of 11 places in 529 ms
[2020-06-03 06:18:09] [INFO ] Deduced a trap composed of 52 places in 393 ms
[2020-06-03 06:18:09] [INFO ] Deduced a trap composed of 41 places in 359 ms
[2020-06-03 06:18:09] [INFO ] Deduced a trap composed of 52 places in 410 ms
[2020-06-03 06:18:10] [INFO ] Deduced a trap composed of 52 places in 375 ms
[2020-06-03 06:18:10] [INFO ] Deduced a trap composed of 75 places in 314 ms
[2020-06-03 06:18:11] [INFO ] Deduced a trap composed of 75 places in 314 ms
[2020-06-03 06:18:11] [INFO ] Deduced a trap composed of 74 places in 345 ms
[2020-06-03 06:18:11] [INFO ] Deduced a trap composed of 74 places in 302 ms
[2020-06-03 06:18:12] [INFO ] Deduced a trap composed of 105 places in 290 ms
[2020-06-03 06:18:12] [INFO ] Deduced a trap composed of 104 places in 306 ms
[2020-06-03 06:18:12] [INFO ] Deduced a trap composed of 104 places in 315 ms
[2020-06-03 06:18:13] [INFO ] Deduced a trap composed of 104 places in 304 ms
[2020-06-03 06:18:13] [INFO ] Deduced a trap composed of 130 places in 385 ms
[2020-06-03 06:18:14] [INFO ] Deduced a trap composed of 130 places in 274 ms
[2020-06-03 06:18:14] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 17233 ms
[2020-06-03 06:18:14] [INFO ] Computed and/alt/rep : 1236/4722/1116 causal constraints in 56 ms.
[2020-06-03 06:18:15] [INFO ] Added : 70 causal constraints over 14 iterations in 945 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-03 06:18:15] [INFO ] [Real]Absence check using 17 positive place invariants in 25 ms returned unsat
[2020-06-03 06:18:15] [INFO ] [Real]Absence check using 17 positive place invariants in 36 ms returned sat
[2020-06-03 06:18:15] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2020-06-03 06:18:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:18:16] [INFO ] [Real]Absence check using state equation in 1701 ms returned sat
[2020-06-03 06:18:17] [INFO ] [Real]Added 230 Read/Feed constraints in 66 ms returned sat
[2020-06-03 06:18:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:18:17] [INFO ] [Nat]Absence check using 17 positive place invariants in 53 ms returned sat
[2020-06-03 06:18:17] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 9 ms returned sat
[2020-06-03 06:18:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:18:19] [INFO ] [Nat]Absence check using state equation in 1757 ms returned sat
[2020-06-03 06:18:19] [INFO ] [Nat]Added 230 Read/Feed constraints in 90 ms returned sat
[2020-06-03 06:18:19] [INFO ] Deduced a trap composed of 32 places in 540 ms
[2020-06-03 06:18:20] [INFO ] Deduced a trap composed of 32 places in 543 ms
[2020-06-03 06:18:20] [INFO ] Deduced a trap composed of 32 places in 586 ms
[2020-06-03 06:18:21] [INFO ] Deduced a trap composed of 32 places in 564 ms
[2020-06-03 06:18:22] [INFO ] Deduced a trap composed of 51 places in 588 ms
[2020-06-03 06:18:22] [INFO ] Deduced a trap composed of 51 places in 568 ms
[2020-06-03 06:18:23] [INFO ] Deduced a trap composed of 51 places in 599 ms
[2020-06-03 06:18:24] [INFO ] Deduced a trap composed of 51 places in 581 ms
[2020-06-03 06:18:24] [INFO ] Deduced a trap composed of 51 places in 584 ms
[2020-06-03 06:18:25] [INFO ] Deduced a trap composed of 11 places in 558 ms
[2020-06-03 06:18:25] [INFO ] Deduced a trap composed of 142 places in 522 ms
[2020-06-03 06:18:26] [INFO ] Deduced a trap composed of 11 places in 513 ms
[2020-06-03 06:18:27] [INFO ] Deduced a trap composed of 11 places in 547 ms
[2020-06-03 06:18:27] [INFO ] Deduced a trap composed of 11 places in 593 ms
[2020-06-03 06:18:28] [INFO ] Deduced a trap composed of 11 places in 564 ms
[2020-06-03 06:18:28] [INFO ] Deduced a trap composed of 52 places in 352 ms
[2020-06-03 06:18:29] [INFO ] Deduced a trap composed of 52 places in 341 ms
[2020-06-03 06:18:29] [INFO ] Deduced a trap composed of 52 places in 366 ms
[2020-06-03 06:18:30] [INFO ] Deduced a trap composed of 78 places in 366 ms
[2020-06-03 06:18:30] [INFO ] Deduced a trap composed of 82 places in 367 ms
[2020-06-03 06:18:30] [INFO ] Deduced a trap composed of 104 places in 327 ms
[2020-06-03 06:18:31] [INFO ] Deduced a trap composed of 49 places in 367 ms
[2020-06-03 06:18:31] [INFO ] Deduced a trap composed of 49 places in 382 ms
[2020-06-03 06:18:32] [INFO ] Deduced a trap composed of 104 places in 292 ms
[2020-06-03 06:18:32] [INFO ] Deduced a trap composed of 101 places in 329 ms
[2020-06-03 06:18:32] [INFO ] Deduced a trap composed of 103 places in 336 ms
[2020-06-03 06:18:33] [INFO ] Deduced a trap composed of 78 places in 304 ms
[2020-06-03 06:18:33] [INFO ] Deduced a trap composed of 78 places in 340 ms
[2020-06-03 06:18:33] [INFO ] Deduced a trap composed of 79 places in 326 ms
[2020-06-03 06:18:34] [INFO ] Deduced a trap composed of 14 places in 501 ms
[2020-06-03 06:18:34] [INFO ] Deduced a trap composed of 101 places in 261 ms
[2020-06-03 06:18:35] [INFO ] Deduced a trap composed of 104 places in 272 ms
[2020-06-03 06:18:35] [INFO ] Deduced a trap composed of 101 places in 207 ms
[2020-06-03 06:18:35] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 16318 ms
[2020-06-03 06:18:35] [INFO ] Computed and/alt/rep : 1236/4722/1116 causal constraints in 87 ms.
[2020-06-03 06:18:37] [INFO ] Added : 130 causal constraints over 26 iterations in 1682 ms. Result :unknown
[2020-06-03 06:18:37] [INFO ] [Real]Absence check using 17 positive place invariants in 27 ms returned unsat
[2020-06-03 06:18:37] [INFO ] [Real]Absence check using 17 positive place invariants in 25 ms returned unsat
[2020-06-03 06:18:37] [INFO ] [Real]Absence check using 17 positive place invariants in 28 ms returned sat
[2020-06-03 06:18:37] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-06-03 06:18:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:18:39] [INFO ] [Real]Absence check using state equation in 1764 ms returned sat
[2020-06-03 06:18:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:18:39] [INFO ] [Nat]Absence check using 17 positive place invariants in 31 ms returned sat
[2020-06-03 06:18:39] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-06-03 06:18:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:18:41] [INFO ] [Nat]Absence check using state equation in 1670 ms returned sat
[2020-06-03 06:18:41] [INFO ] [Nat]Added 230 Read/Feed constraints in 83 ms returned sat
[2020-06-03 06:18:41] [INFO ] Deduced a trap composed of 32 places in 527 ms
[2020-06-03 06:18:42] [INFO ] Deduced a trap composed of 29 places in 527 ms
[2020-06-03 06:18:42] [INFO ] Deduced a trap composed of 29 places in 515 ms
[2020-06-03 06:18:43] [INFO ] Deduced a trap composed of 18 places in 541 ms
[2020-06-03 06:18:43] [INFO ] Deduced a trap composed of 29 places in 515 ms
[2020-06-03 06:18:44] [INFO ] Deduced a trap composed of 152 places in 509 ms
[2020-06-03 06:18:45] [INFO ] Deduced a trap composed of 71 places in 468 ms
[2020-06-03 06:18:45] [INFO ] Deduced a trap composed of 107 places in 497 ms
[2020-06-03 06:18:46] [INFO ] Deduced a trap composed of 32 places in 475 ms
[2020-06-03 06:18:46] [INFO ] Deduced a trap composed of 32 places in 482 ms
[2020-06-03 06:18:47] [INFO ] Deduced a trap composed of 90 places in 507 ms
[2020-06-03 06:18:47] [INFO ] Deduced a trap composed of 76 places in 511 ms
[2020-06-03 06:18:48] [INFO ] Deduced a trap composed of 77 places in 498 ms
[2020-06-03 06:18:48] [INFO ] Deduced a trap composed of 77 places in 494 ms
[2020-06-03 06:18:49] [INFO ] Deduced a trap composed of 11 places in 505 ms
[2020-06-03 06:18:50] [INFO ] Deduced a trap composed of 70 places in 478 ms
[2020-06-03 06:18:50] [INFO ] Deduced a trap composed of 30 places in 474 ms
[2020-06-03 06:18:51] [INFO ] Deduced a trap composed of 111 places in 502 ms
[2020-06-03 06:18:51] [INFO ] Deduced a trap composed of 71 places in 545 ms
[2020-06-03 06:18:52] [INFO ] Deduced a trap composed of 28 places in 501 ms
[2020-06-03 06:18:52] [INFO ] Deduced a trap composed of 90 places in 555 ms
[2020-06-03 06:18:53] [INFO ] Deduced a trap composed of 32 places in 536 ms
[2020-06-03 06:18:53] [INFO ] Deduced a trap composed of 90 places in 514 ms
[2020-06-03 06:18:54] [INFO ] Deduced a trap composed of 99 places in 565 ms
[2020-06-03 06:18:55] [INFO ] Deduced a trap composed of 108 places in 565 ms
[2020-06-03 06:18:55] [INFO ] Deduced a trap composed of 69 places in 494 ms
[2020-06-03 06:18:56] [INFO ] Deduced a trap composed of 69 places in 514 ms
[2020-06-03 06:18:56] [INFO ] Deduced a trap composed of 37 places in 545 ms
[2020-06-03 06:18:57] [INFO ] Deduced a trap composed of 39 places in 517 ms
[2020-06-03 06:18:58] [INFO ] Deduced a trap composed of 43 places in 546 ms
[2020-06-03 06:18:58] [INFO ] Deduced a trap composed of 89 places in 555 ms
[2020-06-03 06:18:59] [INFO ] Deduced a trap composed of 11 places in 491 ms
[2020-06-03 06:18:59] [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 (> (+ s209 s394 s401 s517 s617 s724 s786 s798 s803 s814 s817) 0)") while checking expression at index 8
[2020-06-03 06:18:59] [INFO ] [Real]Absence check using 17 positive place invariants in 34 ms returned sat
[2020-06-03 06:18:59] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2020-06-03 06:18:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:19:01] [INFO ] [Real]Absence check using state equation in 1613 ms returned sat
[2020-06-03 06:19:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:19:01] [INFO ] [Nat]Absence check using 17 positive place invariants in 35 ms returned sat
[2020-06-03 06:19:01] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2020-06-03 06:19:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:19:02] [INFO ] [Nat]Absence check using state equation in 1629 ms returned sat
[2020-06-03 06:19:03] [INFO ] [Nat]Added 230 Read/Feed constraints in 83 ms returned sat
[2020-06-03 06:19:03] [INFO ] Deduced a trap composed of 18 places in 489 ms
[2020-06-03 06:19:04] [INFO ] Deduced a trap composed of 19 places in 481 ms
[2020-06-03 06:19:04] [INFO ] Deduced a trap composed of 19 places in 462 ms
[2020-06-03 06:19:05] [INFO ] Deduced a trap composed of 79 places in 466 ms
[2020-06-03 06:19:05] [INFO ] Deduced a trap composed of 32 places in 463 ms
[2020-06-03 06:19:06] [INFO ] Deduced a trap composed of 39 places in 457 ms
[2020-06-03 06:19:06] [INFO ] Deduced a trap composed of 32 places in 473 ms
[2020-06-03 06:19:07] [INFO ] Deduced a trap composed of 32 places in 468 ms
[2020-06-03 06:19:07] [INFO ] Deduced a trap composed of 32 places in 415 ms
[2020-06-03 06:19:08] [INFO ] Deduced a trap composed of 32 places in 443 ms
[2020-06-03 06:19:08] [INFO ] Deduced a trap composed of 44 places in 527 ms
[2020-06-03 06:19:09] [INFO ] Deduced a trap composed of 68 places in 519 ms
[2020-06-03 06:19:09] [INFO ] Deduced a trap composed of 68 places in 472 ms
[2020-06-03 06:19:10] [INFO ] Deduced a trap composed of 68 places in 475 ms
[2020-06-03 06:19:11] [INFO ] Deduced a trap composed of 80 places in 594 ms
[2020-06-03 06:19:11] [INFO ] Deduced a trap composed of 63 places in 552 ms
[2020-06-03 06:19:12] [INFO ] Deduced a trap composed of 63 places in 532 ms
[2020-06-03 06:19:12] [INFO ] Deduced a trap composed of 63 places in 501 ms
[2020-06-03 06:19:13] [INFO ] Deduced a trap composed of 15 places in 463 ms
[2020-06-03 06:19:13] [INFO ] Deduced a trap composed of 15 places in 501 ms
[2020-06-03 06:19:14] [INFO ] Deduced a trap composed of 39 places in 515 ms
[2020-06-03 06:19:14] [INFO ] Deduced a trap composed of 11 places in 459 ms
[2020-06-03 06:19:15] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 12013 ms
[2020-06-03 06:19:15] [INFO ] Computed and/alt/rep : 1236/4722/1116 causal constraints in 70 ms.
[2020-06-03 06:19:21] [INFO ] Added : 410 causal constraints over 82 iterations in 6152 ms. Result :unknown
[2020-06-03 06:19:21] [INFO ] [Real]Absence check using 17 positive place invariants in 27 ms returned sat
[2020-06-03 06:19:21] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2020-06-03 06:19:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:19:22] [INFO ] [Real]Absence check using state equation in 1671 ms returned sat
[2020-06-03 06:19:23] [INFO ] [Real]Added 230 Read/Feed constraints in 26 ms returned sat
[2020-06-03 06:19:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:19:23] [INFO ] [Nat]Absence check using 17 positive place invariants in 38 ms returned sat
[2020-06-03 06:19:23] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2020-06-03 06:19:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:19:24] [INFO ] [Nat]Absence check using state equation in 1617 ms returned sat
[2020-06-03 06:19:24] [INFO ] [Nat]Added 230 Read/Feed constraints in 75 ms returned sat
[2020-06-03 06:19:25] [INFO ] Deduced a trap composed of 28 places in 459 ms
[2020-06-03 06:19:25] [INFO ] Deduced a trap composed of 28 places in 469 ms
[2020-06-03 06:19:26] [INFO ] Deduced a trap composed of 28 places in 458 ms
[2020-06-03 06:19:27] [INFO ] Deduced a trap composed of 28 places in 542 ms
[2020-06-03 06:19:27] [INFO ] Deduced a trap composed of 28 places in 447 ms
[2020-06-03 06:19:28] [INFO ] Deduced a trap composed of 11 places in 437 ms
[2020-06-03 06:19:28] [INFO ] Deduced a trap composed of 11 places in 446 ms
[2020-06-03 06:19:28] [INFO ] Deduced a trap composed of 11 places in 445 ms
[2020-06-03 06:19:29] [INFO ] Deduced a trap composed of 64 places in 457 ms
[2020-06-03 06:19:29] [INFO ] Deduced a trap composed of 110 places in 383 ms
[2020-06-03 06:19:30] [INFO ] Deduced a trap composed of 59 places in 450 ms
[2020-06-03 06:19:30] [INFO ] Deduced a trap composed of 59 places in 431 ms
[2020-06-03 06:19:31] [INFO ] Deduced a trap composed of 59 places in 472 ms
[2020-06-03 06:19:31] [INFO ] Deduced a trap composed of 11 places in 444 ms
[2020-06-03 06:19:32] [INFO ] Deduced a trap composed of 136 places in 393 ms
[2020-06-03 06:19:32] [INFO ] Deduced a trap composed of 26 places in 495 ms
[2020-06-03 06:19:33] [INFO ] Deduced a trap composed of 14 places in 467 ms
[2020-06-03 06:19:33] [INFO ] Deduced a trap composed of 73 places in 501 ms
[2020-06-03 06:19:34] [INFO ] Deduced a trap composed of 67 places in 367 ms
[2020-06-03 06:19:34] [INFO ] Deduced a trap composed of 58 places in 277 ms
[2020-06-03 06:19:35] [INFO ] Deduced a trap composed of 79 places in 290 ms
[2020-06-03 06:19:35] [INFO ] Deduced a trap composed of 18 places in 434 ms
[2020-06-03 06:19:35] [INFO ] Deduced a trap composed of 44 places in 392 ms
[2020-06-03 06:19:36] [INFO ] Deduced a trap composed of 17 places in 416 ms
[2020-06-03 06:19:36] [INFO ] Deduced a trap composed of 17 places in 410 ms
[2020-06-03 06:19:37] [INFO ] Deduced a trap composed of 17 places in 405 ms
[2020-06-03 06:19:37] [INFO ] Deduced a trap composed of 170 places in 382 ms
[2020-06-03 06:19:38] [INFO ] Deduced a trap composed of 105 places in 357 ms
[2020-06-03 06:19:38] [INFO ] Deduced a trap composed of 157 places in 351 ms
[2020-06-03 06:19:39] [INFO ] Deduced a trap composed of 76 places in 400 ms
[2020-06-03 06:19:39] [INFO ] Deduced a trap composed of 49 places in 324 ms
[2020-06-03 06:19:39] [INFO ] Deduced a trap composed of 102 places in 316 ms
[2020-06-03 06:19:40] [INFO ] Deduced a trap composed of 94 places in 298 ms
[2020-06-03 06:19:40] [INFO ] Deduced a trap composed of 102 places in 324 ms
[2020-06-03 06:19:40] [INFO ] Deduced a trap composed of 45 places in 334 ms
[2020-06-03 06:19:41] [INFO ] Deduced a trap composed of 44 places in 362 ms
[2020-06-03 06:19:41] [INFO ] Deduced a trap composed of 40 places in 364 ms
[2020-06-03 06:19:42] [INFO ] Deduced a trap composed of 96 places in 254 ms
[2020-06-03 06:19:42] [INFO ] Deduced a trap composed of 93 places in 275 ms
[2020-06-03 06:19:42] [INFO ] Deduced a trap composed of 146 places in 278 ms
[2020-06-03 06:19:43] [INFO ] Deduced a trap composed of 173 places in 279 ms
[2020-06-03 06:19:43] [INFO ] Deduced a trap composed of 123 places in 251 ms
[2020-06-03 06:19: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 (> (+ s2 s8 s13 s19 s28 s30 s40 s42 s51 s60 s64 s66 s70 s83 s87 s96 s106 s115 s119 s125 s131 s135 s144 s163 s167 s169 s176 s178 s195 s197 s206 s216 s227 s233 s242 s248 s251 s253 s263 s265 s272 s274 s281 s285 s291 s297 s306 s313 s319 s329 s338 s342 s355 s359 s361 s370 s374 s382 s392 s393 s414 s419 s425 s431 s435 s438 s441 s448 s472 s484 s490 s494 s503 s508 s514 s520 s529 s533 s539 s542 s545 s555 s558 s568 s569 s579 s584 s586 s595 s597 s611 s616 s621 s627 s633 s641 s647 s652 s662 s668 s669 s679 s684 s690 s700 s707 s711 s713 s726 s733 s739 s743 s762 s765 s779 s788 s792 s794 s799 s810 s813 s820 s826) 0)") while checking expression at index 10
[2020-06-03 06:19:43] [INFO ] [Real]Absence check using 17 positive place invariants in 36 ms returned sat
[2020-06-03 06:19:43] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2020-06-03 06:19:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:19:45] [INFO ] [Real]Absence check using state equation in 1686 ms returned sat
[2020-06-03 06:19:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:19:45] [INFO ] [Nat]Absence check using 17 positive place invariants in 34 ms returned sat
[2020-06-03 06:19:45] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-06-03 06:19:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:19:46] [INFO ] [Nat]Absence check using state equation in 1665 ms returned sat
[2020-06-03 06:19:47] [INFO ] [Nat]Added 230 Read/Feed constraints in 106 ms returned sat
[2020-06-03 06:19:47] [INFO ] Deduced a trap composed of 68 places in 539 ms
[2020-06-03 06:19:48] [INFO ] Deduced a trap composed of 68 places in 545 ms
[2020-06-03 06:19:48] [INFO ] Deduced a trap composed of 68 places in 528 ms
[2020-06-03 06:19:49] [INFO ] Deduced a trap composed of 31 places in 542 ms
[2020-06-03 06:19:50] [INFO ] Deduced a trap composed of 48 places in 533 ms
[2020-06-03 06:19:50] [INFO ] Deduced a trap composed of 39 places in 548 ms
[2020-06-03 06:19:51] [INFO ] Deduced a trap composed of 13 places in 524 ms
[2020-06-03 06:19:51] [INFO ] Deduced a trap composed of 11 places in 508 ms
[2020-06-03 06:19:52] [INFO ] Deduced a trap composed of 52 places in 362 ms
[2020-06-03 06:19:52] [INFO ] Deduced a trap composed of 84 places in 364 ms
[2020-06-03 06:19:53] [INFO ] Deduced a trap composed of 39 places in 546 ms
[2020-06-03 06:19:53] [INFO ] Deduced a trap composed of 39 places in 572 ms
[2020-06-03 06:19:54] [INFO ] Deduced a trap composed of 48 places in 500 ms
[2020-06-03 06:19:54] [INFO ] Deduced a trap composed of 14 places in 586 ms
[2020-06-03 06:19:55] [INFO ] Deduced a trap composed of 75 places in 503 ms
[2020-06-03 06:19:56] [INFO ] Deduced a trap composed of 128 places in 493 ms
[2020-06-03 06:19:56] [INFO ] Deduced a trap composed of 63 places in 488 ms
[2020-06-03 06:19:57] [INFO ] Deduced a trap composed of 131 places in 376 ms
[2020-06-03 06:19:57] [INFO ] Deduced a trap composed of 104 places in 357 ms
[2020-06-03 06:19:58] [INFO ] Deduced a trap composed of 11 places in 464 ms
[2020-06-03 06:19:58] [INFO ] Deduced a trap composed of 82 places in 243 ms
[2020-06-03 06:19:58] [INFO ] Deduced a trap composed of 105 places in 213 ms
[2020-06-03 06:19:58] [INFO ] Deduced a trap composed of 104 places in 188 ms
[2020-06-03 06:19:58] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 11776 ms
[2020-06-03 06:19:58] [INFO ] Computed and/alt/rep : 1236/4722/1116 causal constraints in 88 ms.
[2020-06-03 06:20:05] [INFO ] Added : 350 causal constraints over 70 iterations in 6337 ms. Result :unknown
[2020-06-03 06:20:05] [INFO ] [Real]Absence check using 17 positive place invariants in 43 ms returned sat
[2020-06-03 06:20:05] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 7 ms returned sat
[2020-06-03 06:20:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:20:07] [INFO ] [Real]Absence check using state equation in 1774 ms returned sat
[2020-06-03 06:20:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:20:07] [INFO ] [Nat]Absence check using 17 positive place invariants in 37 ms returned sat
[2020-06-03 06:20:07] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2020-06-03 06:20:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:20:08] [INFO ] [Nat]Absence check using state equation in 1624 ms returned sat
[2020-06-03 06:20:08] [INFO ] [Nat]Added 230 Read/Feed constraints in 62 ms returned sat
[2020-06-03 06:20:09] [INFO ] Deduced a trap composed of 62 places in 614 ms
[2020-06-03 06:20:10] [INFO ] Deduced a trap composed of 45 places in 566 ms
[2020-06-03 06:20:10] [INFO ] Deduced a trap composed of 226 places in 612 ms
[2020-06-03 06:20:11] [INFO ] Deduced a trap composed of 229 places in 587 ms
[2020-06-03 06:20:12] [INFO ] Deduced a trap composed of 105 places in 521 ms
[2020-06-03 06:20:12] [INFO ] Deduced a trap composed of 118 places in 528 ms
[2020-06-03 06:20:13] [INFO ] Deduced a trap composed of 76 places in 524 ms
[2020-06-03 06:20:13] [INFO ] Deduced a trap composed of 77 places in 514 ms
[2020-06-03 06:20:14] [INFO ] Deduced a trap composed of 77 places in 485 ms
[2020-06-03 06:20:14] [INFO ] Deduced a trap composed of 19 places in 472 ms
[2020-06-03 06:20:15] [INFO ] Deduced a trap composed of 52 places in 480 ms
[2020-06-03 06:20:15] [INFO ] Deduced a trap composed of 45 places in 450 ms
[2020-06-03 06:20:16] [INFO ] Deduced a trap composed of 18 places in 569 ms
[2020-06-03 06:20:17] [INFO ] Deduced a trap composed of 51 places in 553 ms
[2020-06-03 06:20:17] [INFO ] Deduced a trap composed of 19 places in 575 ms
[2020-06-03 06:20:18] [INFO ] Deduced a trap composed of 11 places in 571 ms
[2020-06-03 06:20:19] [INFO ] Deduced a trap composed of 11 places in 577 ms
[2020-06-03 06:20:19] [INFO ] Deduced a trap composed of 61 places in 569 ms
[2020-06-03 06:20:20] [INFO ] Deduced a trap composed of 45 places in 664 ms
[2020-06-03 06:20:21] [INFO ] Deduced a trap composed of 89 places in 498 ms
[2020-06-03 06:20:21] [INFO ] Deduced a trap composed of 32 places in 552 ms
[2020-06-03 06:20:22] [INFO ] Deduced a trap composed of 11 places in 562 ms
[2020-06-03 06:20:22] [INFO ] Deduced a trap composed of 79 places in 500 ms
[2020-06-03 06:20:23] [INFO ] Deduced a trap composed of 51 places in 472 ms
[2020-06-03 06:20:23] [INFO ] Deduced a trap composed of 99 places in 505 ms
[2020-06-03 06:20:24] [INFO ] Deduced a trap composed of 70 places in 516 ms
[2020-06-03 06:20:24] [INFO ] Deduced a trap composed of 82 places in 494 ms
[2020-06-03 06:20:25] [INFO ] Deduced a trap composed of 104 places in 521 ms
[2020-06-03 06:20:26] [INFO ] Deduced a trap composed of 130 places in 517 ms
[2020-06-03 06:20:26] [INFO ] Deduced a trap composed of 97 places in 381 ms
[2020-06-03 06:20:26] [INFO ] Deduced a trap composed of 70 places in 361 ms
[2020-06-03 06:20:27] [INFO ] Deduced a trap composed of 70 places in 320 ms
[2020-06-03 06:20:27] [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 (> (+ s0 s6 s12 s32 s34 s44 s176 s178 s180 s186 s197 s203 s206 s212 s214 s216 s227 s233 s235 s238 s244 s250 s255 s257 s267 s382 s392 s393 s401 s413 s424 s436 s438 s441 s460 s464 s469 s520 s522 s525 s529 s531 s533 s539 s578 s588 s589 s614 s616 s620 s621 s625 s627 s633 s675 s677 s698 s765 s771 s784 s786 s788 s790 s792 s794 s800 s811 s816 s819 s822) 0)") while checking expression at index 12
[2020-06-03 06:20:27] [INFO ] [Real]Absence check using 17 positive place invariants in 18 ms returned unsat
[2020-06-03 06:20:27] [INFO ] [Real]Absence check using 17 positive place invariants in 28 ms returned sat
[2020-06-03 06:20:27] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-06-03 06:20:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:20:29] [INFO ] [Real]Absence check using state equation in 1668 ms returned sat
[2020-06-03 06:20:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:20:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 31 ms returned sat
[2020-06-03 06:20:29] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-06-03 06:20:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:20:30] [INFO ] [Nat]Absence check using state equation in 1639 ms returned sat
[2020-06-03 06:20:31] [INFO ] [Nat]Added 230 Read/Feed constraints in 90 ms returned sat
[2020-06-03 06:20:31] [INFO ] Deduced a trap composed of 32 places in 381 ms
[2020-06-03 06:20:31] [INFO ] Deduced a trap composed of 41 places in 365 ms
[2020-06-03 06:20:32] [INFO ] Deduced a trap composed of 32 places in 386 ms
[2020-06-03 06:20:32] [INFO ] Deduced a trap composed of 53 places in 438 ms
[2020-06-03 06:20:33] [INFO ] Deduced a trap composed of 41 places in 439 ms
[2020-06-03 06:20:33] [INFO ] Deduced a trap composed of 52 places in 442 ms
[2020-06-03 06:20:34] [INFO ] Deduced a trap composed of 11 places in 416 ms
[2020-06-03 06:20:34] [INFO ] Deduced a trap composed of 11 places in 425 ms
[2020-06-03 06:20:35] [INFO ] Deduced a trap composed of 11 places in 452 ms
[2020-06-03 06:20:35] [INFO ] Deduced a trap composed of 16 places in 456 ms
[2020-06-03 06:20:36] [INFO ] Deduced a trap composed of 11 places in 466 ms
[2020-06-03 06:20:36] [INFO ] Deduced a trap composed of 11 places in 444 ms
[2020-06-03 06:20:37] [INFO ] Deduced a trap composed of 28 places in 421 ms
[2020-06-03 06:20:37] [INFO ] Deduced a trap composed of 43 places in 336 ms
[2020-06-03 06:20:37] [INFO ] Deduced a trap composed of 28 places in 343 ms
[2020-06-03 06:20:38] [INFO ] Deduced a trap composed of 41 places in 311 ms
[2020-06-03 06:20:38] [INFO ] Deduced a trap composed of 72 places in 282 ms
[2020-06-03 06:20:38] [INFO ] Deduced a trap composed of 72 places in 318 ms
[2020-06-03 06:20:39] [INFO ] Deduced a trap composed of 96 places in 321 ms
[2020-06-03 06:20:39] [INFO ] Deduced a trap composed of 86 places in 303 ms
[2020-06-03 06:20:40] [INFO ] Deduced a trap composed of 93 places in 299 ms
[2020-06-03 06:20:40] [INFO ] Deduced a trap composed of 63 places in 275 ms
[2020-06-03 06:20:40] [INFO ] Deduced a trap composed of 63 places in 296 ms
[2020-06-03 06:20:41] [INFO ] Deduced a trap composed of 66 places in 304 ms
[2020-06-03 06:20:41] [INFO ] Deduced a trap composed of 39 places in 398 ms
[2020-06-03 06:20:41] [INFO ] Deduced a trap composed of 67 places in 365 ms
[2020-06-03 06:20:42] [INFO ] Deduced a trap composed of 119 places in 368 ms
[2020-06-03 06:20:42] [INFO ] Deduced a trap composed of 67 places in 333 ms
[2020-06-03 06:20:43] [INFO ] Deduced a trap composed of 89 places in 323 ms
[2020-06-03 06:20:43] [INFO ] Deduced a trap composed of 93 places in 365 ms
[2020-06-03 06:20:43] [INFO ] Deduced a trap composed of 93 places in 334 ms
[2020-06-03 06:20:44] [INFO ] Deduced a trap composed of 121 places in 359 ms
[2020-06-03 06:20:44] [INFO ] Deduced a trap composed of 86 places in 405 ms
[2020-06-03 06:20:45] [INFO ] Deduced a trap composed of 109 places in 353 ms
[2020-06-03 06:20:45] [INFO ] Deduced a trap composed of 86 places in 318 ms
[2020-06-03 06:20:46] [INFO ] Deduced a trap composed of 126 places in 353 ms
[2020-06-03 06:20:46] [INFO ] Deduced a trap composed of 86 places in 337 ms
[2020-06-03 06:20:46] [INFO ] Deduced a trap composed of 72 places in 392 ms
[2020-06-03 06:20:47] [INFO ] Deduced a trap composed of 97 places in 338 ms
[2020-06-03 06:20:47] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 16286 ms
[2020-06-03 06:20:47] [INFO ] Computed and/alt/rep : 1236/4722/1116 causal constraints in 59 ms.
[2020-06-03 06:20:49] [INFO ] Added : 140 causal constraints over 28 iterations in 1869 ms. Result :(error "Failed to check-sat")
[2020-06-03 06:20:49] [INFO ] [Real]Absence check using 17 positive place invariants in 22 ms returned unsat
[2020-06-03 06:20:49] [INFO ] [Real]Absence check using 17 positive place invariants in 21 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 7 simplifications.
[2020-06-03 06:20:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 06:20:49] [INFO ] Flatten gal took : 195 ms
[2020-06-03 06:20:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 06:20:49] [INFO ] Flatten gal took : 74 ms
FORMULA Peterson-PT-5-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 06:20:49] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 16 ms.
[2020-06-03 06:20:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 11 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ Peterson-PT-5 @ 3570 seconds
FORMULA Peterson-PT-5-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Peterson-PT-5-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Peterson-PT-5-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Peterson-PT-5-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Peterson-PT-5-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Peterson-PT-5-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 2611988 kB
After kill :
MemTotal: 16427332 kB
MemFree: 2640916 kB
--------------------
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="Peterson-PT-5"
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 Peterson-PT-5, 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 r174-csrt-158987853600731"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-5.tgz
mv Peterson-PT-5 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 '
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 ;