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

About the Execution of ITS-Tools for ShieldIIPt-PT-020B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15780.150 3600000.00 3441041.00 220365.50 TF?F?F???F??FF?? normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r210-tajo-159033475500323.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 itstools
Input is ShieldIIPt-PT-020B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033475500323
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 3.3K May 14 01:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 01:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 14 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 14 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 14 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.4K May 13 13:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 13:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 08:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 08:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 338K May 12 20:42 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 ShieldIIPt-PT-020B-CTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1590582861542

[2020-05-27 12:34:23] [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, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-27 12:34:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 12:34:23] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2020-05-27 12:34:23] [INFO ] Transformed 1403 places.
[2020-05-27 12:34:23] [INFO ] Transformed 1303 transitions.
[2020-05-27 12:34:23] [INFO ] Found NUPN structural information;
[2020-05-27 12:34:23] [INFO ] Parsed PT model containing 1403 places and 1303 transitions in 185 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 38 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 565 ms. (steps per millisecond=176 ) properties seen :[0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1]
// Phase 1: matrix 1303 rows 1403 cols
[2020-05-27 12:34:23] [INFO ] Computed 181 place invariants in 36 ms
[2020-05-27 12:34:24] [INFO ] [Real]Absence check using 181 positive place invariants in 176 ms returned sat
[2020-05-27 12:34:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:34:27] [INFO ] [Real]Absence check using state equation in 3457 ms returned sat
[2020-05-27 12:34:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:34:28] [INFO ] [Nat]Absence check using 181 positive place invariants in 299 ms returned sat
[2020-05-27 12:34:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:34:32] [INFO ] [Nat]Absence check using state equation in 3415 ms returned sat
[2020-05-27 12:34:32] [INFO ] Deduced a trap composed of 18 places in 777 ms
[2020-05-27 12:34:33] [INFO ] Deduced a trap composed of 15 places in 769 ms
[2020-05-27 12:34:34] [INFO ] Deduced a trap composed of 30 places in 537 ms
[2020-05-27 12:34:34] [INFO ] Deduced a trap composed of 24 places in 534 ms
[2020-05-27 12:34:35] [INFO ] Deduced a trap composed of 21 places in 602 ms
[2020-05-27 12:34:36] [INFO ] Deduced a trap composed of 36 places in 601 ms
[2020-05-27 12:34:36] [INFO ] Deduced a trap composed of 25 places in 499 ms
[2020-05-27 12:34:37] [INFO ] Deduced a trap composed of 31 places in 459 ms
[2020-05-27 12:34:37] [INFO ] Deduced a trap composed of 22 places in 546 ms
[2020-05-27 12:34:38] [INFO ] Deduced a trap composed of 19 places in 554 ms
[2020-05-27 12:34:39] [INFO ] Deduced a trap composed of 23 places in 615 ms
[2020-05-27 12:34:39] [INFO ] Deduced a trap composed of 38 places in 602 ms
[2020-05-27 12:34:40] [INFO ] Deduced a trap composed of 46 places in 581 ms
[2020-05-27 12:34:41] [INFO ] Deduced a trap composed of 24 places in 606 ms
[2020-05-27 12:34:41] [INFO ] Deduced a trap composed of 32 places in 507 ms
[2020-05-27 12:34:42] [INFO ] Deduced a trap composed of 28 places in 493 ms
[2020-05-27 12:34:42] [INFO ] Deduced a trap composed of 32 places in 550 ms
[2020-05-27 12:34:43] [INFO ] Deduced a trap composed of 39 places in 551 ms
[2020-05-27 12:34:44] [INFO ] Deduced a trap composed of 32 places in 505 ms
[2020-05-27 12:34:44] [INFO ] Deduced a trap composed of 33 places in 404 ms
[2020-05-27 12:34:45] [INFO ] Deduced a trap composed of 32 places in 474 ms
[2020-05-27 12:34:45] [INFO ] Deduced a trap composed of 31 places in 485 ms
[2020-05-27 12:34:46] [INFO ] Deduced a trap composed of 34 places in 470 ms
[2020-05-27 12:34:46] [INFO ] Deduced a trap composed of 25 places in 449 ms
[2020-05-27 12:34:47] [INFO ] Deduced a trap composed of 39 places in 473 ms
[2020-05-27 12:34:47] [INFO ] Deduced a trap composed of 20 places in 406 ms
[2020-05-27 12:34:48] [INFO ] Deduced a trap composed of 22 places in 411 ms
[2020-05-27 12:34:48] [INFO ] Deduced a trap composed of 33 places in 407 ms
[2020-05-27 12:34: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 (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s437 s438 s439 s440 s441 s461 s462 s463 s465 s466 s467 s468 s469 s470 s471 s472 s524 s525 s526) 0)") while checking expression at index 0
[2020-05-27 12:34:48] [INFO ] [Real]Absence check using 181 positive place invariants in 183 ms returned sat
[2020-05-27 12:34:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:34:52] [INFO ] [Real]Absence check using state equation in 3699 ms returned sat
[2020-05-27 12:34:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:34:53] [INFO ] [Nat]Absence check using 181 positive place invariants in 290 ms returned sat
[2020-05-27 12:34:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:34:56] [INFO ] [Nat]Absence check using state equation in 3099 ms returned sat
[2020-05-27 12:34:57] [INFO ] Deduced a trap composed of 18 places in 688 ms
[2020-05-27 12:34:57] [INFO ] Deduced a trap composed of 27 places in 529 ms
[2020-05-27 12:34:58] [INFO ] Deduced a trap composed of 32 places in 477 ms
[2020-05-27 12:34:58] [INFO ] Deduced a trap composed of 22 places in 501 ms
[2020-05-27 12:34:59] [INFO ] Deduced a trap composed of 35 places in 565 ms
[2020-05-27 12:34:59] [INFO ] Deduced a trap composed of 28 places in 448 ms
[2020-05-27 12:35:00] [INFO ] Deduced a trap composed of 31 places in 420 ms
[2020-05-27 12:35:00] [INFO ] Deduced a trap composed of 24 places in 456 ms
[2020-05-27 12:35:01] [INFO ] Deduced a trap composed of 21 places in 433 ms
[2020-05-27 12:35:02] [INFO ] Deduced a trap composed of 32 places in 1044 ms
[2020-05-27 12:35:02] [INFO ] Deduced a trap composed of 32 places in 586 ms
[2020-05-27 12:35:03] [INFO ] Deduced a trap composed of 20 places in 472 ms
[2020-05-27 12:35:04] [INFO ] Deduced a trap composed of 36 places in 506 ms
[2020-05-27 12:35:04] [INFO ] Deduced a trap composed of 36 places in 478 ms
[2020-05-27 12:35:05] [INFO ] Deduced a trap composed of 23 places in 456 ms
[2020-05-27 12:35:05] [INFO ] Deduced a trap composed of 34 places in 468 ms
[2020-05-27 12:35:06] [INFO ] Deduced a trap composed of 23 places in 388 ms
[2020-05-27 12:35:06] [INFO ] Deduced a trap composed of 34 places in 540 ms
[2020-05-27 12:35:07] [INFO ] Deduced a trap composed of 32 places in 494 ms
[2020-05-27 12:35:07] [INFO ] Deduced a trap composed of 33 places in 399 ms
[2020-05-27 12:35:07] [INFO ] Deduced a trap composed of 30 places in 390 ms
[2020-05-27 12:35:08] [INFO ] Deduced a trap composed of 20 places in 419 ms
[2020-05-27 12:35:08] [INFO ] Deduced a trap composed of 47 places in 427 ms
[2020-05-27 12:35:09] [INFO ] Deduced a trap composed of 35 places in 383 ms
[2020-05-27 12:35:09] [INFO ] Deduced a trap composed of 49 places in 452 ms
[2020-05-27 12:35:10] [INFO ] Deduced a trap composed of 30 places in 449 ms
[2020-05-27 12:35:10] [INFO ] Deduced a trap composed of 34 places in 442 ms
[2020-05-27 12:35:11] [INFO ] Deduced a trap composed of 32 places in 435 ms
[2020-05-27 12:35:11] [INFO ] Deduced a trap composed of 42 places in 433 ms
[2020-05-27 12:35:12] [INFO ] Deduced a trap composed of 35 places in 414 ms
[2020-05-27 12:35:12] [INFO ] Deduced a trap composed of 35 places in 380 ms
[2020-05-27 12:35:12] [INFO ] Deduced a trap composed of 32 places in 328 ms
[2020-05-27 12:35: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 (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s299 s300 s301 s302 s303 s304 s320 s415 s416 s417 s418 s419 s420 s421 s422 s423) 0)") while checking expression at index 1
[2020-05-27 12:35:13] [INFO ] [Real]Absence check using 181 positive place invariants in 203 ms returned sat
[2020-05-27 12:35:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:35:16] [INFO ] [Real]Absence check using state equation in 3467 ms returned sat
[2020-05-27 12:35:17] [INFO ] Deduced a trap composed of 21 places in 607 ms
[2020-05-27 12:35:18] [INFO ] Deduced a trap composed of 17 places in 733 ms
[2020-05-27 12:35:19] [INFO ] Deduced a trap composed of 22 places in 703 ms
[2020-05-27 12:35:19] [INFO ] Deduced a trap composed of 22 places in 683 ms
[2020-05-27 12:35:20] [INFO ] Deduced a trap composed of 13 places in 704 ms
[2020-05-27 12:35:21] [INFO ] Deduced a trap composed of 30 places in 549 ms
[2020-05-27 12:35:21] [INFO ] Deduced a trap composed of 21 places in 543 ms
[2020-05-27 12:35:22] [INFO ] Deduced a trap composed of 18 places in 502 ms
[2020-05-27 12:35:23] [INFO ] Deduced a trap composed of 31 places in 580 ms
[2020-05-27 12:35:23] [INFO ] Deduced a trap composed of 22 places in 535 ms
[2020-05-27 12:35:24] [INFO ] Deduced a trap composed of 22 places in 521 ms
[2020-05-27 12:35:24] [INFO ] Deduced a trap composed of 15 places in 545 ms
[2020-05-27 12:35:25] [INFO ] Deduced a trap composed of 15 places in 483 ms
[2020-05-27 12:35:25] [INFO ] Deduced a trap composed of 31 places in 467 ms
[2020-05-27 12:35:26] [INFO ] Deduced a trap composed of 23 places in 431 ms
[2020-05-27 12:35:26] [INFO ] Deduced a trap composed of 25 places in 526 ms
[2020-05-27 12:35:27] [INFO ] Deduced a trap composed of 34 places in 558 ms
[2020-05-27 12:35:28] [INFO ] Deduced a trap composed of 33 places in 612 ms
[2020-05-27 12:35:28] [INFO ] Deduced a trap composed of 29 places in 615 ms
[2020-05-27 12:35:29] [INFO ] Deduced a trap composed of 31 places in 558 ms
[2020-05-27 12:35:30] [INFO ] Deduced a trap composed of 30 places in 538 ms
[2020-05-27 12:35:30] [INFO ] Deduced a trap composed of 32 places in 568 ms
[2020-05-27 12:35:31] [INFO ] Deduced a trap composed of 32 places in 480 ms
[2020-05-27 12:35:31] [INFO ] Deduced a trap composed of 32 places in 502 ms
[2020-05-27 12:35:32] [INFO ] Deduced a trap composed of 33 places in 504 ms
[2020-05-27 12:35:32] [INFO ] Deduced a trap composed of 24 places in 446 ms
[2020-05-27 12:35:33] [INFO ] Deduced a trap composed of 25 places in 480 ms
[2020-05-27 12:35:33] [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 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s437 s438 s455 s456 s457 s458 s459 s460 s495 s504 s505) 0)") while checking expression at index 2
[2020-05-27 12:35:33] [INFO ] [Real]Absence check using 181 positive place invariants in 197 ms returned sat
[2020-05-27 12:35:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:35:37] [INFO ] [Real]Absence check using state equation in 3752 ms returned sat
[2020-05-27 12:35:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:35:38] [INFO ] [Nat]Absence check using 181 positive place invariants in 293 ms returned sat
[2020-05-27 12:35:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:35:41] [INFO ] [Nat]Absence check using state equation in 3443 ms returned sat
[2020-05-27 12:35:42] [INFO ] Deduced a trap composed of 26 places in 499 ms
[2020-05-27 12:35:42] [INFO ] Deduced a trap composed of 24 places in 493 ms
[2020-05-27 12:35:43] [INFO ] Deduced a trap composed of 20 places in 500 ms
[2020-05-27 12:35:43] [INFO ] Deduced a trap composed of 23 places in 490 ms
[2020-05-27 12:35:44] [INFO ] Deduced a trap composed of 27 places in 484 ms
[2020-05-27 12:35:44] [INFO ] Deduced a trap composed of 18 places in 520 ms
[2020-05-27 12:35:45] [INFO ] Deduced a trap composed of 23 places in 473 ms
[2020-05-27 12:35:45] [INFO ] Deduced a trap composed of 20 places in 484 ms
[2020-05-27 12:35:46] [INFO ] Deduced a trap composed of 25 places in 466 ms
[2020-05-27 12:35:46] [INFO ] Deduced a trap composed of 25 places in 490 ms
[2020-05-27 12:35:47] [INFO ] Deduced a trap composed of 19 places in 510 ms
[2020-05-27 12:35:48] [INFO ] Deduced a trap composed of 19 places in 468 ms
[2020-05-27 12:35:48] [INFO ] Deduced a trap composed of 19 places in 484 ms
[2020-05-27 12:35:49] [INFO ] Deduced a trap composed of 20 places in 461 ms
[2020-05-27 12:35:49] [INFO ] Deduced a trap composed of 18 places in 557 ms
[2020-05-27 12:35:50] [INFO ] Deduced a trap composed of 18 places in 589 ms
[2020-05-27 12:35:50] [INFO ] Deduced a trap composed of 23 places in 536 ms
[2020-05-27 12:35:51] [INFO ] Deduced a trap composed of 32 places in 473 ms
[2020-05-27 12:35:51] [INFO ] Deduced a trap composed of 34 places in 408 ms
[2020-05-27 12:35:52] [INFO ] Deduced a trap composed of 31 places in 380 ms
[2020-05-27 12:35:52] [INFO ] Deduced a trap composed of 17 places in 431 ms
[2020-05-27 12:35:53] [INFO ] Deduced a trap composed of 30 places in 436 ms
[2020-05-27 12:35:53] [INFO ] Deduced a trap composed of 35 places in 402 ms
[2020-05-27 12:35:54] [INFO ] Deduced a trap composed of 34 places in 456 ms
[2020-05-27 12:35:54] [INFO ] Deduced a trap composed of 33 places in 450 ms
[2020-05-27 12:35:55] [INFO ] Deduced a trap composed of 43 places in 457 ms
[2020-05-27 12:35:55] [INFO ] Deduced a trap composed of 34 places in 490 ms
[2020-05-27 12:35:56] [INFO ] Deduced a trap composed of 45 places in 518 ms
[2020-05-27 12:35:57] [INFO ] Deduced a trap composed of 32 places in 438 ms
[2020-05-27 12:35:57] [INFO ] Deduced a trap composed of 36 places in 432 ms
[2020-05-27 12:35:57] [INFO ] Deduced a trap composed of 41 places in 362 ms
[2020-05-27 12:35:57] [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 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s517 s518 s519 s520 s521 s532 s533 s534 s535 s536 s537 s538 s539 s575 s576 s577 s578 s579 s586 s587 s588 s589 s590 s593 s594 s599 s608 s609 s610) 0)") while checking expression at index 3
[2020-05-27 12:35:58] [INFO ] [Real]Absence check using 181 positive place invariants in 201 ms returned sat
[2020-05-27 12:35:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:36:02] [INFO ] [Real]Absence check using state equation in 3660 ms returned sat
[2020-05-27 12:36:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:36:02] [INFO ] [Nat]Absence check using 181 positive place invariants in 312 ms returned sat
[2020-05-27 12:36:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:36:06] [INFO ] [Nat]Absence check using state equation in 3881 ms returned sat
[2020-05-27 12:36:07] [INFO ] Deduced a trap composed of 18 places in 515 ms
[2020-05-27 12:36:07] [INFO ] Deduced a trap composed of 22 places in 639 ms
[2020-05-27 12:36:08] [INFO ] Deduced a trap composed of 24 places in 630 ms
[2020-05-27 12:36:09] [INFO ] Deduced a trap composed of 26 places in 563 ms
[2020-05-27 12:36:09] [INFO ] Deduced a trap composed of 34 places in 508 ms
[2020-05-27 12:36:10] [INFO ] Deduced a trap composed of 20 places in 584 ms
[2020-05-27 12:36:10] [INFO ] Deduced a trap composed of 21 places in 535 ms
[2020-05-27 12:36:11] [INFO ] Deduced a trap composed of 24 places in 515 ms
[2020-05-27 12:36:12] [INFO ] Deduced a trap composed of 27 places in 535 ms
[2020-05-27 12:36:12] [INFO ] Deduced a trap composed of 21 places in 448 ms
[2020-05-27 12:36:13] [INFO ] Deduced a trap composed of 15 places in 452 ms
[2020-05-27 12:36:13] [INFO ] Deduced a trap composed of 18 places in 507 ms
[2020-05-27 12:36:14] [INFO ] Deduced a trap composed of 22 places in 428 ms
[2020-05-27 12:36:14] [INFO ] Deduced a trap composed of 32 places in 489 ms
[2020-05-27 12:36:15] [INFO ] Deduced a trap composed of 28 places in 481 ms
[2020-05-27 12:36:15] [INFO ] Deduced a trap composed of 34 places in 475 ms
[2020-05-27 12:36:16] [INFO ] Deduced a trap composed of 30 places in 499 ms
[2020-05-27 12:36:16] [INFO ] Deduced a trap composed of 30 places in 491 ms
[2020-05-27 12:36:17] [INFO ] Deduced a trap composed of 22 places in 452 ms
[2020-05-27 12:36:17] [INFO ] Deduced a trap composed of 24 places in 402 ms
[2020-05-27 12:36:18] [INFO ] Deduced a trap composed of 31 places in 478 ms
[2020-05-27 12:36:19] [INFO ] Deduced a trap composed of 25 places in 526 ms
[2020-05-27 12:36:19] [INFO ] Deduced a trap composed of 28 places in 501 ms
[2020-05-27 12:36:20] [INFO ] Deduced a trap composed of 27 places in 479 ms
[2020-05-27 12:36:20] [INFO ] Deduced a trap composed of 22 places in 440 ms
[2020-05-27 12:36:21] [INFO ] Deduced a trap composed of 32 places in 458 ms
[2020-05-27 12:36:21] [INFO ] Deduced a trap composed of 31 places in 428 ms
[2020-05-27 12:36:22] [INFO ] Deduced a trap composed of 33 places in 352 ms
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2020-05-27 12:36:23] [INFO ] Deduced a trap composed of 14 places in 1004 ms
[2020-05-27 12:36:23] [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 s1 s2 s1196 s1197 s1198 s1199 s1200 s1201 s1202 s1203 s1204 s1205 s1206) 0)") while checking expression at index 4
[2020-05-27 12:36:23] [INFO ] [Real]Absence check using 181 positive place invariants in 229 ms returned sat
[2020-05-27 12:36:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:36:26] [INFO ] [Real]Absence check using state equation in 3428 ms returned sat
[2020-05-27 12:36:27] [INFO ] Deduced a trap composed of 25 places in 557 ms
[2020-05-27 12:36:28] [INFO ] Deduced a trap composed of 22 places in 603 ms
[2020-05-27 12:36:28] [INFO ] Deduced a trap composed of 34 places in 584 ms
[2020-05-27 12:36:29] [INFO ] Deduced a trap composed of 35 places in 542 ms
[2020-05-27 12:36:30] [INFO ] Deduced a trap composed of 23 places in 513 ms
[2020-05-27 12:36:30] [INFO ] Deduced a trap composed of 19 places in 528 ms
[2020-05-27 12:36:31] [INFO ] Deduced a trap composed of 27 places in 459 ms
[2020-05-27 12:36:31] [INFO ] Deduced a trap composed of 23 places in 500 ms
[2020-05-27 12:36:32] [INFO ] Deduced a trap composed of 20 places in 494 ms
[2020-05-27 12:36:32] [INFO ] Deduced a trap composed of 20 places in 617 ms
[2020-05-27 12:36:33] [INFO ] Deduced a trap composed of 28 places in 510 ms
[2020-05-27 12:36:33] [INFO ] Deduced a trap composed of 27 places in 533 ms
[2020-05-27 12:36:34] [INFO ] Deduced a trap composed of 18 places in 489 ms
[2020-05-27 12:36:35] [INFO ] Deduced a trap composed of 20 places in 565 ms
[2020-05-27 12:36:35] [INFO ] Deduced a trap composed of 26 places in 543 ms
[2020-05-27 12:36:36] [INFO ] Deduced a trap composed of 21 places in 530 ms
[2020-05-27 12:36:36] [INFO ] Deduced a trap composed of 25 places in 461 ms
[2020-05-27 12:36:37] [INFO ] Deduced a trap composed of 30 places in 454 ms
[2020-05-27 12:36:37] [INFO ] Deduced a trap composed of 34 places in 543 ms
[2020-05-27 12:36:38] [INFO ] Deduced a trap composed of 31 places in 436 ms
[2020-05-27 12:36:38] [INFO ] Deduced a trap composed of 32 places in 394 ms
[2020-05-27 12:36:39] [INFO ] Deduced a trap composed of 32 places in 421 ms
[2020-05-27 12:36:39] [INFO ] Deduced a trap composed of 35 places in 348 ms
[2020-05-27 12:36:40] [INFO ] Deduced a trap composed of 37 places in 366 ms
[2020-05-27 12:36:40] [INFO ] Deduced a trap composed of 18 places in 365 ms
[2020-05-27 12:36:40] [INFO ] Deduced a trap composed of 37 places in 399 ms
[2020-05-27 12:36:41] [INFO ] Deduced a trap composed of 38 places in 361 ms
[2020-05-27 12:36:41] [INFO ] Deduced a trap composed of 39 places in 382 ms
[2020-05-27 12:36:42] [INFO ] Deduced a trap composed of 36 places in 308 ms
[2020-05-27 12:36:42] [INFO ] Deduced a trap composed of 33 places in 305 ms
[2020-05-27 12:36:42] [INFO ] Deduced a trap composed of 34 places in 403 ms
[2020-05-27 12:36:43] [INFO ] Deduced a trap composed of 34 places in 416 ms
[2020-05-27 12:36: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 (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s437 s438 s439 s440 s441 s442 s443 s444 s448 s450 s453 s484 s485 s486 s487 s488 s489 s490 s491 s492) 0)") while checking expression at index 5
[2020-05-27 12:36:43] [INFO ] [Real]Absence check using 181 positive place invariants in 157 ms returned sat
[2020-05-27 12:36:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:36:47] [INFO ] [Real]Absence check using state equation in 3356 ms returned sat
[2020-05-27 12:36:47] [INFO ] Deduced a trap composed of 28 places in 659 ms
[2020-05-27 12:36:48] [INFO ] Deduced a trap composed of 30 places in 573 ms
[2020-05-27 12:36:48] [INFO ] Deduced a trap composed of 18 places in 518 ms
[2020-05-27 12:36:49] [INFO ] Deduced a trap composed of 18 places in 523 ms
[2020-05-27 12:36:50] [INFO ] Deduced a trap composed of 20 places in 576 ms
[2020-05-27 12:36:50] [INFO ] Deduced a trap composed of 23 places in 484 ms
[2020-05-27 12:36:51] [INFO ] Deduced a trap composed of 18 places in 545 ms
[2020-05-27 12:36:51] [INFO ] Deduced a trap composed of 38 places in 414 ms
[2020-05-27 12:36:52] [INFO ] Deduced a trap composed of 24 places in 418 ms
[2020-05-27 12:36:52] [INFO ] Deduced a trap composed of 19 places in 431 ms
[2020-05-27 12:36:53] [INFO ] Deduced a trap composed of 25 places in 382 ms
[2020-05-27 12:36:53] [INFO ] Deduced a trap composed of 33 places in 498 ms
[2020-05-27 12:36:54] [INFO ] Deduced a trap composed of 24 places in 421 ms
[2020-05-27 12:36:54] [INFO ] Deduced a trap composed of 20 places in 359 ms
[2020-05-27 12:36:54] [INFO ] Deduced a trap composed of 36 places in 321 ms
[2020-05-27 12:36:55] [INFO ] Deduced a trap composed of 37 places in 479 ms
[2020-05-27 12:36:55] [INFO ] Deduced a trap composed of 20 places in 447 ms
[2020-05-27 12:36:56] [INFO ] Deduced a trap composed of 34 places in 449 ms
[2020-05-27 12:36:56] [INFO ] Deduced a trap composed of 36 places in 465 ms
[2020-05-27 12:36:57] [INFO ] Deduced a trap composed of 36 places in 460 ms
[2020-05-27 12:36:58] [INFO ] Deduced a trap composed of 31 places in 473 ms
[2020-05-27 12:36:58] [INFO ] Deduced a trap composed of 43 places in 442 ms
[2020-05-27 12:36:58] [INFO ] Deduced a trap composed of 35 places in 340 ms
[2020-05-27 12:36:59] [INFO ] Deduced a trap composed of 37 places in 369 ms
[2020-05-27 12:36:59] [INFO ] Deduced a trap composed of 35 places in 280 ms
[2020-05-27 12:36:59] [INFO ] Deduced a trap composed of 33 places in 274 ms
[2020-05-27 12:37:00] [INFO ] Deduced a trap composed of 32 places in 293 ms
[2020-05-27 12:37:00] [INFO ] Deduced a trap composed of 32 places in 284 ms
[2020-05-27 12:37:00] [INFO ] Deduced a trap composed of 33 places in 262 ms
[2020-05-27 12:37:01] [INFO ] Deduced a trap composed of 32 places in 264 ms
[2020-05-27 12:37:01] [INFO ] Deduced a trap composed of 32 places in 250 ms
[2020-05-27 12:37:01] [INFO ] Deduced a trap composed of 32 places in 217 ms
[2020-05-27 12:37:02] [INFO ] Deduced a trap composed of 39 places in 265 ms
[2020-05-27 12:37:02] [INFO ] Deduced a trap composed of 30 places in 245 ms
[2020-05-27 12:37:02] [INFO ] Deduced a trap composed of 42 places in 216 ms
[2020-05-27 12:37:02] [INFO ] Deduced a trap composed of 30 places in 212 ms
[2020-05-27 12:37:03] [INFO ] Deduced a trap composed of 36 places in 206 ms
[2020-05-27 12:37:03] [INFO ] Deduced a trap composed of 30 places in 193 ms
[2020-05-27 12:37:03] [INFO ] Deduced a trap composed of 32 places in 177 ms
[2020-05-27 12:37:03] [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 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s22 s43 s82 s83 s84 s85 s86 s87 s88 s89 s90) 0)") while checking expression at index 6
[2020-05-27 12:37:03] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-05-27 12:37:03] [INFO ] Flatten gal took : 172 ms
[2020-05-27 12:37:03] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-05-27 12:37:04] [INFO ] Flatten gal took : 83 ms
FORMULA ShieldIIPt-PT-020B-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 12:37:04] [INFO ] Applying decomposition
[2020-05-27 12:37:04] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph18115763417604056112.txt, -o, /tmp/graph18115763417604056112.bin, -w, /tmp/graph18115763417604056112.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph18115763417604056112.bin, -l, -1, -v, -w, /tmp/graph18115763417604056112.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 12:37:04] [INFO ] Decomposing Gal with order
[2020-05-27 12:37:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 12:37:04] [INFO ] Removed a total of 120 redundant transitions.
[2020-05-27 12:37:05] [INFO ] Flatten gal took : 208 ms
[2020-05-27 12:37:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2020-05-27 12:37:05] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 34 ms
[2020-05-27 12:37:05] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLCardinality.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLCardinality.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLCardinality.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLCardinality.ctl
No direction supplied, using forward translation only.
Parsed 9 CTL formulae.
built 28 ordering constraints for composite.
built 19 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 21 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 19 ordering constraints for composite.
built 5 ordering constraints for composite.
built 12 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 21 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 19 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 24 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 19 ordering constraints for composite.
built 5 ordering constraints for composite.
built 12 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 20 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 5 ordering constraints for composite.
built 24 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 19 ordering constraints for composite.
built 5 ordering constraints for composite.
built 12 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 19 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 19 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 21 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 26 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 19 ordering constraints for composite.
built 5 ordering constraints for composite.
built 12 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 19 ordering constraints for composite.
built 11 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 20 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 19 ordering constraints for composite.
built 7 ordering constraints for composite.
built 11 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 21 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 4 ordering constraints for composite.
built 16 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
Detected timeout of ITS tools.
[2020-05-27 12:58:00] [INFO ] Applying decomposition
[2020-05-27 12:58:00] [INFO ] Flatten gal took : 378 ms
[2020-05-27 12:58:00] [INFO ] Decomposing Gal with order
[2020-05-27 12:58:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 12:58:02] [INFO ] Flatten gal took : 784 ms
[2020-05-27 12:58:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2020-05-27 12:58:02] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 79 ms
[2020-05-27 12:58:02] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLCardinality.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLCardinality.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLCardinality.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLCardinality.ctl
No direction supplied, using forward translation only.
Parsed 9 CTL formulae.
built 2 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
Detected timeout of ITS tools.
[2020-05-27 13:18:57] [INFO ] Flatten gal took : 638 ms
[2020-05-27 13:18:59] [INFO ] Input system was already deterministic with 1303 transitions.
[2020-05-27 13:18:59] [INFO ] Transformed 1403 places.
[2020-05-27 13:18:59] [INFO ] Transformed 1303 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-27 13:18:59] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 12 ms
[2020-05-27 13:18:59] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 8 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLCardinality.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLCardinality.ctl, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLCardinality.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLCardinality.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 9 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="ShieldIIPt-PT-020B"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldIIPt-PT-020B, 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 r210-tajo-159033475500323"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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