About the Execution of ITS-Tools for ShieldPPPt-PT-020B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15774.200 | 3600000.00 | 3405190.00 | 227605.10 | [undef] | Time out reached |
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-159033476100676.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 ShieldPPPt-PT-020B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033476100676
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 3.4K May 14 01:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 14 01:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 13 19:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 19:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.4K May 13 14:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 14:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 08:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 08:52 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 376K 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 ShieldPPPt-PT-020B-CTLFireability-00
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-01
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-02
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-03
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-04
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-05
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-06
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-07
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-08
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-09
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-10
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-11
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-12
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-13
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-14
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1590611456893
[2020-05-27 20:30:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -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 20:30:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 20:30:58] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2020-05-27 20:30:58] [INFO ] Transformed 1563 places.
[2020-05-27 20:30:58] [INFO ] Transformed 1423 transitions.
[2020-05-27 20:30:58] [INFO ] Found NUPN structural information;
[2020-05-27 20:30:58] [INFO ] Parsed PT model containing 1563 places and 1423 transitions in 169 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 37 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 545 ms. (steps per millisecond=183 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 1423 rows 1563 cols
[2020-05-27 20:30:59] [INFO ] Computed 221 place invariants in 44 ms
[2020-05-27 20:31:00] [INFO ] [Real]Absence check using 221 positive place invariants in 252 ms returned sat
[2020-05-27 20:31:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:31:04] [INFO ] [Real]Absence check using state equation in 4413 ms returned sat
[2020-05-27 20:31:05] [INFO ] Deduced a trap composed of 16 places in 796 ms
[2020-05-27 20:31:06] [INFO ] Deduced a trap composed of 21 places in 525 ms
[2020-05-27 20:31:06] [INFO ] Deduced a trap composed of 31 places in 556 ms
[2020-05-27 20:31:07] [INFO ] Deduced a trap composed of 25 places in 626 ms
[2020-05-27 20:31:08] [INFO ] Deduced a trap composed of 23 places in 711 ms
[2020-05-27 20:31:08] [INFO ] Deduced a trap composed of 22 places in 695 ms
[2020-05-27 20:31:09] [INFO ] Deduced a trap composed of 25 places in 899 ms
[2020-05-27 20:31:10] [INFO ] Deduced a trap composed of 29 places in 971 ms
[2020-05-27 20:31:11] [INFO ] Deduced a trap composed of 21 places in 633 ms
[2020-05-27 20:31:12] [INFO ] Deduced a trap composed of 34 places in 641 ms
[2020-05-27 20:31:13] [INFO ] Deduced a trap composed of 21 places in 650 ms
[2020-05-27 20:31:13] [INFO ] Deduced a trap composed of 27 places in 653 ms
[2020-05-27 20:31:14] [INFO ] Deduced a trap composed of 19 places in 651 ms
[2020-05-27 20:31:15] [INFO ] Deduced a trap composed of 24 places in 640 ms
[2020-05-27 20:31:15] [INFO ] Deduced a trap composed of 18 places in 587 ms
[2020-05-27 20:31:16] [INFO ] Deduced a trap composed of 25 places in 550 ms
[2020-05-27 20:31:17] [INFO ] Deduced a trap composed of 30 places in 542 ms
[2020-05-27 20:31:17] [INFO ] Deduced a trap composed of 26 places in 531 ms
[2020-05-27 20:31:18] [INFO ] Deduced a trap composed of 30 places in 564 ms
[2020-05-27 20:31:18] [INFO ] Deduced a trap composed of 29 places in 510 ms
[2020-05-27 20:31:19] [INFO ] Deduced a trap composed of 34 places in 663 ms
[2020-05-27 20:31:20] [INFO ] Deduced a trap composed of 31 places in 528 ms
[2020-05-27 20:31:20] [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 s639 s640 s647 s648 s649 s657 s658 s659 s662 s663 s705 s707 s709 s710 s711 s712 s713 s714 s715) 0)") while checking expression at index 0
[2020-05-27 20:31:20] [INFO ] [Real]Absence check using 221 positive place invariants in 395 ms returned sat
[2020-05-27 20:31:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:31:24] [INFO ] [Real]Absence check using state equation in 3944 ms returned sat
[2020-05-27 20:31:25] [INFO ] Deduced a trap composed of 25 places in 573 ms
[2020-05-27 20:31:26] [INFO ] Deduced a trap composed of 23 places in 663 ms
[2020-05-27 20:31:26] [INFO ] Deduced a trap composed of 24 places in 621 ms
[2020-05-27 20:31:27] [INFO ] Deduced a trap composed of 33 places in 633 ms
[2020-05-27 20:31:28] [INFO ] Deduced a trap composed of 21 places in 602 ms
[2020-05-27 20:31:28] [INFO ] Deduced a trap composed of 29 places in 601 ms
[2020-05-27 20:31:29] [INFO ] Deduced a trap composed of 27 places in 593 ms
[2020-05-27 20:31:30] [INFO ] Deduced a trap composed of 21 places in 653 ms
[2020-05-27 20:31:30] [INFO ] Deduced a trap composed of 25 places in 471 ms
[2020-05-27 20:31:31] [INFO ] Deduced a trap composed of 21 places in 467 ms
[2020-05-27 20:31:31] [INFO ] Deduced a trap composed of 22 places in 508 ms
[2020-05-27 20:31:32] [INFO ] Deduced a trap composed of 45 places in 473 ms
[2020-05-27 20:31:32] [INFO ] Deduced a trap composed of 24 places in 492 ms
[2020-05-27 20:31:33] [INFO ] Deduced a trap composed of 34 places in 458 ms
[2020-05-27 20:31:33] [INFO ] Deduced a trap composed of 19 places in 499 ms
[2020-05-27 20:31:34] [INFO ] Deduced a trap composed of 30 places in 447 ms
[2020-05-27 20:31:34] [INFO ] Deduced a trap composed of 24 places in 411 ms
[2020-05-27 20:31:35] [INFO ] Deduced a trap composed of 27 places in 435 ms
[2020-05-27 20:31:35] [INFO ] Deduced a trap composed of 39 places in 431 ms
[2020-05-27 20:31:36] [INFO ] Deduced a trap composed of 29 places in 429 ms
[2020-05-27 20:31:36] [INFO ] Deduced a trap composed of 29 places in 402 ms
[2020-05-27 20:31:37] [INFO ] Deduced a trap composed of 27 places in 379 ms
[2020-05-27 20:31:37] [INFO ] Deduced a trap composed of 26 places in 354 ms
[2020-05-27 20:31:38] [INFO ] Deduced a trap composed of 30 places in 339 ms
[2020-05-27 20:31:38] [INFO ] Deduced a trap composed of 36 places in 354 ms
[2020-05-27 20:31:38] [INFO ] Deduced a trap composed of 35 places in 359 ms
[2020-05-27 20:31:39] [INFO ] Deduced a trap composed of 34 places in 362 ms
[2020-05-27 20:31:39] [INFO ] Deduced a trap composed of 35 places in 348 ms
[2020-05-27 20:31:40] [INFO ] Deduced a trap composed of 37 places in 327 ms
[2020-05-27 20:31:40] [INFO ] Deduced a trap composed of 25 places in 275 ms
[2020-05-27 20:31:40] [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 s1101 s1102 s1103 s1104 s1105 s1112 s1113 s1114 s1115 s1116 s1119 s1120 s1121 s1122 s1123 s1133 s1142 s1143 s1144) 0)") while checking expression at index 1
[2020-05-27 20:31:40] [INFO ] [Real]Absence check using 221 positive place invariants in 236 ms returned sat
[2020-05-27 20:31:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:31:44] [INFO ] [Real]Absence check using state equation in 4093 ms returned sat
[2020-05-27 20:31:45] [INFO ] Deduced a trap composed of 21 places in 729 ms
[2020-05-27 20:31:46] [INFO ] Deduced a trap composed of 18 places in 562 ms
[2020-05-27 20:31:47] [INFO ] Deduced a trap composed of 20 places in 564 ms
[2020-05-27 20:31:47] [INFO ] Deduced a trap composed of 19 places in 567 ms
[2020-05-27 20:31:48] [INFO ] Deduced a trap composed of 21 places in 560 ms
[2020-05-27 20:31:48] [INFO ] Deduced a trap composed of 18 places in 579 ms
[2020-05-27 20:31:49] [INFO ] Deduced a trap composed of 27 places in 704 ms
[2020-05-27 20:31:50] [INFO ] Deduced a trap composed of 28 places in 620 ms
[2020-05-27 20:31:51] [INFO ] Deduced a trap composed of 25 places in 620 ms
[2020-05-27 20:31:51] [INFO ] Deduced a trap composed of 28 places in 625 ms
[2020-05-27 20:31:52] [INFO ] Deduced a trap composed of 23 places in 584 ms
[2020-05-27 20:31:53] [INFO ] Deduced a trap composed of 26 places in 555 ms
[2020-05-27 20:31:53] [INFO ] Deduced a trap composed of 31 places in 545 ms
[2020-05-27 20:31:54] [INFO ] Deduced a trap composed of 26 places in 526 ms
[2020-05-27 20:31:54] [INFO ] Deduced a trap composed of 40 places in 488 ms
[2020-05-27 20:31:55] [INFO ] Deduced a trap composed of 36 places in 470 ms
[2020-05-27 20:31:55] [INFO ] Deduced a trap composed of 34 places in 490 ms
[2020-05-27 20:31:56] [INFO ] Deduced a trap composed of 21 places in 478 ms
[2020-05-27 20:31:57] [INFO ] Deduced a trap composed of 27 places in 457 ms
[2020-05-27 20:31:57] [INFO ] Deduced a trap composed of 22 places in 416 ms
[2020-05-27 20:31:57] [INFO ] Deduced a trap composed of 31 places in 369 ms
[2020-05-27 20:31:58] [INFO ] Deduced a trap composed of 43 places in 368 ms
[2020-05-27 20:31:58] [INFO ] Deduced a trap composed of 32 places in 335 ms
[2020-05-27 20:31:59] [INFO ] Deduced a trap composed of 39 places in 376 ms
[2020-05-27 20:31:59] [INFO ] Deduced a trap composed of 34 places in 406 ms
[2020-05-27 20:32:00] [INFO ] Deduced a trap composed of 37 places in 433 ms
[2020-05-27 20:32:00] [INFO ] Deduced a trap composed of 29 places in 423 ms
[2020-05-27 20:32:00] [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 s562 s563 s564 s565 s566 s567 s587 s694 s695 s696 s697 s698 s699 s700 s701 s702) 0)") while checking expression at index 2
[2020-05-27 20:32:01] [INFO ] [Real]Absence check using 221 positive place invariants in 248 ms returned sat
[2020-05-27 20:32:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:32:05] [INFO ] [Real]Absence check using state equation in 4044 ms returned sat
[2020-05-27 20:32:06] [INFO ] Deduced a trap composed of 24 places in 799 ms
[2020-05-27 20:32:06] [INFO ] Deduced a trap composed of 19 places in 655 ms
[2020-05-27 20:32:07] [INFO ] Deduced a trap composed of 21 places in 613 ms
[2020-05-27 20:32:08] [INFO ] Deduced a trap composed of 28 places in 793 ms
[2020-05-27 20:32:08] [INFO ] Deduced a trap composed of 33 places in 616 ms
[2020-05-27 20:32:09] [INFO ] Deduced a trap composed of 29 places in 610 ms
[2020-05-27 20:32:10] [INFO ] Deduced a trap composed of 29 places in 519 ms
[2020-05-27 20:32:10] [INFO ] Deduced a trap composed of 24 places in 456 ms
[2020-05-27 20:32:11] [INFO ] Deduced a trap composed of 27 places in 452 ms
[2020-05-27 20:32:11] [INFO ] Deduced a trap composed of 37 places in 481 ms
[2020-05-27 20:32:12] [INFO ] Deduced a trap composed of 25 places in 683 ms
[2020-05-27 20:32:13] [INFO ] Deduced a trap composed of 32 places in 683 ms
[2020-05-27 20:32:13] [INFO ] Deduced a trap composed of 27 places in 676 ms
[2020-05-27 20:32:14] [INFO ] Deduced a trap composed of 26 places in 662 ms
[2020-05-27 20:32:15] [INFO ] Deduced a trap composed of 26 places in 620 ms
[2020-05-27 20:32:15] [INFO ] Deduced a trap composed of 22 places in 612 ms
[2020-05-27 20:32:15] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 10759 ms
[2020-05-27 20:32:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:32:16] [INFO ] [Nat]Absence check using 221 positive place invariants in 324 ms returned sat
[2020-05-27 20:32:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:32:20] [INFO ] [Nat]Absence check using state equation in 4099 ms returned sat
[2020-05-27 20:32:21] [INFO ] Deduced a trap composed of 25 places in 840 ms
[2020-05-27 20:32:22] [INFO ] Deduced a trap composed of 15 places in 858 ms
[2020-05-27 20:32:23] [INFO ] Deduced a trap composed of 30 places in 679 ms
[2020-05-27 20:32:24] [INFO ] Deduced a trap composed of 23 places in 819 ms
[2020-05-27 20:32:24] [INFO ] Deduced a trap composed of 21 places in 640 ms
[2020-05-27 20:32:25] [INFO ] Deduced a trap composed of 21 places in 641 ms
[2020-05-27 20:32:26] [INFO ] Deduced a trap composed of 22 places in 603 ms
[2020-05-27 20:32:26] [INFO ] Deduced a trap composed of 17 places in 785 ms
[2020-05-27 20:32:27] [INFO ] Deduced a trap composed of 28 places in 624 ms
[2020-05-27 20:32:28] [INFO ] Deduced a trap composed of 25 places in 676 ms
[2020-05-27 20:32:29] [INFO ] Deduced a trap composed of 24 places in 793 ms
[2020-05-27 20:32:30] [INFO ] Deduced a trap composed of 21 places in 753 ms
[2020-05-27 20:32:30] [INFO ] Deduced a trap composed of 38 places in 660 ms
[2020-05-27 20:32:31] [INFO ] Deduced a trap composed of 31 places in 750 ms
[2020-05-27 20:32:32] [INFO ] Deduced a trap composed of 27 places in 755 ms
[2020-05-27 20:32:33] [INFO ] Deduced a trap composed of 21 places in 643 ms
[2020-05-27 20:32:33] [INFO ] Deduced a trap composed of 29 places in 638 ms
[2020-05-27 20:32:34] [INFO ] Deduced a trap composed of 27 places in 739 ms
[2020-05-27 20:32:35] [INFO ] Deduced a trap composed of 34 places in 714 ms
[2020-05-27 20:32:36] [INFO ] Deduced a trap composed of 26 places in 583 ms
[2020-05-27 20:32:36] [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 s947 s948 s949 s950 s951 s952 s972 s974 s977 s1002 s1003 s1004 s1005 s1006 s1007 s1008 s1009 s1010) 0)") while checking expression at index 3
[2020-05-27 20:32:36] [INFO ] [Real]Absence check using 221 positive place invariants in 190 ms returned sat
[2020-05-27 20:32:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:32:40] [INFO ] [Real]Absence check using state equation in 4287 ms returned sat
[2020-05-27 20:32:41] [INFO ] Deduced a trap composed of 23 places in 643 ms
[2020-05-27 20:32:42] [INFO ] Deduced a trap composed of 20 places in 620 ms
[2020-05-27 20:32:42] [INFO ] Deduced a trap composed of 23 places in 637 ms
[2020-05-27 20:32:43] [INFO ] Deduced a trap composed of 16 places in 609 ms
[2020-05-27 20:32:44] [INFO ] Deduced a trap composed of 23 places in 580 ms
[2020-05-27 20:32:44] [INFO ] Deduced a trap composed of 29 places in 578 ms
[2020-05-27 20:32:45] [INFO ] Deduced a trap composed of 25 places in 483 ms
[2020-05-27 20:32:46] [INFO ] Deduced a trap composed of 21 places in 575 ms
[2020-05-27 20:32:46] [INFO ] Deduced a trap composed of 19 places in 603 ms
[2020-05-27 20:32:47] [INFO ] Deduced a trap composed of 27 places in 435 ms
[2020-05-27 20:32:47] [INFO ] Deduced a trap composed of 30 places in 546 ms
[2020-05-27 20:32:48] [INFO ] Deduced a trap composed of 46 places in 462 ms
[2020-05-27 20:32:48] [INFO ] Deduced a trap composed of 25 places in 415 ms
[2020-05-27 20:32:49] [INFO ] Deduced a trap composed of 19 places in 369 ms
[2020-05-27 20:32:49] [INFO ] Deduced a trap composed of 23 places in 350 ms
[2020-05-27 20:32:50] [INFO ] Deduced a trap composed of 38 places in 345 ms
[2020-05-27 20:32:50] [INFO ] Deduced a trap composed of 29 places in 329 ms
[2020-05-27 20:32:50] [INFO ] Deduced a trap composed of 32 places in 376 ms
[2020-05-27 20:32:51] [INFO ] Deduced a trap composed of 35 places in 316 ms
[2020-05-27 20:32:51] [INFO ] Deduced a trap composed of 29 places in 334 ms
[2020-05-27 20:32:52] [INFO ] Deduced a trap composed of 25 places in 299 ms
[2020-05-27 20:32:52] [INFO ] Deduced a trap composed of 34 places in 314 ms
[2020-05-27 20:32:52] [INFO ] Deduced a trap composed of 25 places in 317 ms
[2020-05-27 20:32:53] [INFO ] Deduced a trap composed of 29 places in 381 ms
[2020-05-27 20:32:53] [INFO ] Deduced a trap composed of 29 places in 307 ms
[2020-05-27 20:32:53] [INFO ] Deduced a trap composed of 26 places in 269 ms
[2020-05-27 20:32:54] [INFO ] Deduced a trap composed of 31 places in 267 ms
[2020-05-27 20:32:54] [INFO ] Deduced a trap composed of 30 places in 286 ms
[2020-05-27 20:32:54] [INFO ] Deduced a trap composed of 33 places in 263 ms
[2020-05-27 20:32:55] [INFO ] Deduced a trap composed of 32 places in 287 ms
[2020-05-27 20:32:55] [INFO ] Deduced a trap composed of 36 places in 251 ms
[2020-05-27 20:32:55] [INFO ] Deduced a trap composed of 36 places in 246 ms
[2020-05-27 20:32:56] [INFO ] Deduced a trap composed of 35 places in 288 ms
[2020-05-27 20:32:56] [INFO ] Deduced a trap composed of 33 places in 237 ms
[2020-05-27 20:32:56] [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 s254 s255 s256 s257 s258 s259 s260 s261 s265 s299 s300 s301 s302 s303 s304 s305) 0)") while checking expression at index 4
[2020-05-27 20:32:56] [INFO ] [Real]Absence check using 221 positive place invariants in 163 ms returned sat
[2020-05-27 20:32:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:33:01] [INFO ] [Real]Absence check using state equation in 5208 ms returned sat
[2020-05-27 20:33:02] [INFO ] Deduced a trap composed of 19 places in 632 ms
[2020-05-27 20:33:03] [INFO ] Deduced a trap composed of 20 places in 478 ms
[2020-05-27 20:33:03] [INFO ] Deduced a trap composed of 31 places in 445 ms
[2020-05-27 20:33:04] [INFO ] Deduced a trap composed of 19 places in 417 ms
[2020-05-27 20:33:04] [INFO ] Deduced a trap composed of 21 places in 406 ms
[2020-05-27 20:33:05] [INFO ] Deduced a trap composed of 34 places in 442 ms
[2020-05-27 20:33:05] [INFO ] Deduced a trap composed of 23 places in 447 ms
[2020-05-27 20:33:06] [INFO ] Deduced a trap composed of 25 places in 400 ms
[2020-05-27 20:33:06] [INFO ] Deduced a trap composed of 23 places in 407 ms
[2020-05-27 20:33:06] [INFO ] Deduced a trap composed of 16 places in 354 ms
[2020-05-27 20:33:07] [INFO ] Deduced a trap composed of 29 places in 366 ms
[2020-05-27 20:33:07] [INFO ] Deduced a trap composed of 25 places in 397 ms
[2020-05-27 20:33:08] [INFO ] Deduced a trap composed of 33 places in 539 ms
[2020-05-27 20:33:08] [INFO ] Deduced a trap composed of 25 places in 544 ms
[2020-05-27 20:33:09] [INFO ] Deduced a trap composed of 25 places in 510 ms
[2020-05-27 20:33:10] [INFO ] Deduced a trap composed of 34 places in 475 ms
[2020-05-27 20:33:10] [INFO ] Deduced a trap composed of 30 places in 446 ms
[2020-05-27 20:33:11] [INFO ] Deduced a trap composed of 34 places in 455 ms
[2020-05-27 20:33:11] [INFO ] Deduced a trap composed of 38 places in 445 ms
[2020-05-27 20:33:12] [INFO ] Deduced a trap composed of 29 places in 421 ms
[2020-05-27 20:33:12] [INFO ] Deduced a trap composed of 36 places in 403 ms
[2020-05-27 20:33:12] [INFO ] Deduced a trap composed of 33 places in 358 ms
[2020-05-27 20:33:13] [INFO ] Deduced a trap composed of 31 places in 344 ms
[2020-05-27 20:33:13] [INFO ] Deduced a trap composed of 38 places in 282 ms
[2020-05-27 20:33:14] [INFO ] Deduced a trap composed of 32 places in 364 ms
[2020-05-27 20:33:14] [INFO ] Deduced a trap composed of 31 places in 322 ms
[2020-05-27 20:33:14] [INFO ] Deduced a trap composed of 32 places in 350 ms
[2020-05-27 20:33:15] [INFO ] Deduced a trap composed of 34 places in 348 ms
[2020-05-27 20:33:15] [INFO ] Deduced a trap composed of 33 places in 313 ms
[2020-05-27 20:33:16] [INFO ] Deduced a trap composed of 33 places in 305 ms
[2020-05-27 20:33:16] [INFO ] Deduced a trap composed of 32 places in 283 ms
[2020-05-27 20:33:17] [INFO ] Deduced a trap composed of 15 places in 992 ms
[2020-05-27 20:33:17] [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 s1255 s1256 s1257 s1258 s1259 s1260 s1280 s1281 s1282 s1283 s1284) 0)") while checking expression at index 5
[2020-05-27 20:33:17] [INFO ] [Real]Absence check using 221 positive place invariants in 174 ms returned sat
[2020-05-27 20:33:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:33:21] [INFO ] [Real]Absence check using state equation in 4077 ms returned sat
[2020-05-27 20:33:22] [INFO ] Deduced a trap composed of 28 places in 688 ms
[2020-05-27 20:33:23] [INFO ] Deduced a trap composed of 16 places in 680 ms
[2020-05-27 20:33:24] [INFO ] Deduced a trap composed of 21 places in 631 ms
[2020-05-27 20:33:24] [INFO ] Deduced a trap composed of 20 places in 626 ms
[2020-05-27 20:33:25] [INFO ] Deduced a trap composed of 21 places in 645 ms
[2020-05-27 20:33:26] [INFO ] Deduced a trap composed of 27 places in 641 ms
[2020-05-27 20:33:26] [INFO ] Deduced a trap composed of 26 places in 629 ms
[2020-05-27 20:33:27] [INFO ] Deduced a trap composed of 20 places in 545 ms
[2020-05-27 20:33:28] [INFO ] Deduced a trap composed of 22 places in 546 ms
[2020-05-27 20:33:28] [INFO ] Deduced a trap composed of 28 places in 539 ms
[2020-05-27 20:33:29] [INFO ] Deduced a trap composed of 27 places in 491 ms
[2020-05-27 20:33:29] [INFO ] Deduced a trap composed of 27 places in 436 ms
[2020-05-27 20:33:30] [INFO ] Deduced a trap composed of 29 places in 484 ms
[2020-05-27 20:33:30] [INFO ] Deduced a trap composed of 34 places in 466 ms
[2020-05-27 20:33:31] [INFO ] Deduced a trap composed of 34 places in 343 ms
[2020-05-27 20:33:31] [INFO ] Deduced a trap composed of 42 places in 353 ms
[2020-05-27 20:33:31] [INFO ] Deduced a trap composed of 27 places in 314 ms
[2020-05-27 20:33:32] [INFO ] Deduced a trap composed of 37 places in 470 ms
[2020-05-27 20:33:32] [INFO ] Deduced a trap composed of 35 places in 320 ms
[2020-05-27 20:33:33] [INFO ] Deduced a trap composed of 34 places in 378 ms
[2020-05-27 20:33:33] [INFO ] Deduced a trap composed of 38 places in 287 ms
[2020-05-27 20:33:33] [INFO ] Deduced a trap composed of 30 places in 287 ms
[2020-05-27 20:33:34] [INFO ] Deduced a trap composed of 32 places in 280 ms
[2020-05-27 20:33:34] [INFO ] Deduced a trap composed of 42 places in 274 ms
[2020-05-27 20:33:34] [INFO ] Deduced a trap composed of 34 places in 322 ms
[2020-05-27 20:33:35] [INFO ] Deduced a trap composed of 33 places in 336 ms
[2020-05-27 20:33:35] [INFO ] Deduced a trap composed of 29 places in 279 ms
[2020-05-27 20:33:35] [INFO ] Deduced a trap composed of 35 places in 254 ms
[2020-05-27 20:33:36] [INFO ] Deduced a trap composed of 25 places in 245 ms
[2020-05-27 20:33:36] [INFO ] Deduced a trap composed of 29 places in 348 ms
[2020-05-27 20:33:36] [INFO ] Deduced a trap composed of 36 places in 276 ms
[2020-05-27 20:33:37] [INFO ] Deduced a trap composed of 36 places in 300 ms
[2020-05-27 20:33:37] [INFO ] Deduced a trap composed of 30 places in 280 ms
[2020-05-27 20:33:37] [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 s78 s79 s80 s81 s82 s83 s84 s85 s86) 0)") while checking expression at index 6
[2020-05-27 20:33:38] [INFO ] [Real]Absence check using 221 positive place invariants in 285 ms returned sat
[2020-05-27 20:33:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:33:43] [INFO ] [Real]Absence check using state equation in 5355 ms returned sat
[2020-05-27 20:33:44] [INFO ] Deduced a trap composed of 21 places in 571 ms
[2020-05-27 20:33:44] [INFO ] Deduced a trap composed of 29 places in 554 ms
[2020-05-27 20:33:45] [INFO ] Deduced a trap composed of 19 places in 459 ms
[2020-05-27 20:33:45] [INFO ] Deduced a trap composed of 23 places in 417 ms
[2020-05-27 20:33:46] [INFO ] Deduced a trap composed of 23 places in 456 ms
[2020-05-27 20:33:46] [INFO ] Deduced a trap composed of 24 places in 464 ms
[2020-05-27 20:33:47] [INFO ] Deduced a trap composed of 23 places in 426 ms
[2020-05-27 20:33:47] [INFO ] Deduced a trap composed of 26 places in 447 ms
[2020-05-27 20:33:48] [INFO ] Deduced a trap composed of 21 places in 421 ms
[2020-05-27 20:33:48] [INFO ] Deduced a trap composed of 29 places in 451 ms
[2020-05-27 20:33:49] [INFO ] Deduced a trap composed of 24 places in 374 ms
[2020-05-27 20:33:49] [INFO ] Deduced a trap composed of 24 places in 395 ms
[2020-05-27 20:33:49] [INFO ] Deduced a trap composed of 21 places in 398 ms
[2020-05-27 20:33:50] [INFO ] Deduced a trap composed of 35 places in 365 ms
[2020-05-27 20:33:50] [INFO ] Deduced a trap composed of 33 places in 363 ms
[2020-05-27 20:33:51] [INFO ] Deduced a trap composed of 29 places in 325 ms
[2020-05-27 20:33:51] [INFO ] Deduced a trap composed of 34 places in 349 ms
[2020-05-27 20:33:51] [INFO ] Deduced a trap composed of 26 places in 324 ms
[2020-05-27 20:33:52] [INFO ] Deduced a trap composed of 25 places in 283 ms
[2020-05-27 20:33:52] [INFO ] Deduced a trap composed of 32 places in 283 ms
[2020-05-27 20:33:52] [INFO ] Deduced a trap composed of 35 places in 293 ms
[2020-05-27 20:33:53] [INFO ] Deduced a trap composed of 27 places in 281 ms
[2020-05-27 20:33:53] [INFO ] Deduced a trap composed of 34 places in 248 ms
[2020-05-27 20:33:53] [INFO ] Deduced a trap composed of 29 places in 250 ms
[2020-05-27 20:33:54] [INFO ] Deduced a trap composed of 26 places in 299 ms
[2020-05-27 20:33:54] [INFO ] Deduced a trap composed of 37 places in 227 ms
[2020-05-27 20:33:54] [INFO ] Deduced a trap composed of 38 places in 245 ms
[2020-05-27 20:33:54] [INFO ] Deduced a trap composed of 36 places in 229 ms
[2020-05-27 20:33:55] [INFO ] Deduced a trap composed of 33 places in 212 ms
[2020-05-27 20:33:55] [INFO ] Deduced a trap composed of 36 places in 197 ms
[2020-05-27 20:33:55] [INFO ] Deduced a trap composed of 39 places in 181 ms
[2020-05-27 20:33:55] [INFO ] Deduced a trap composed of 36 places in 200 ms
[2020-05-27 20:33:56] [INFO ] Deduced a trap composed of 40 places in 282 ms
[2020-05-27 20:33:56] [INFO ] Deduced a trap composed of 35 places in 169 ms
[2020-05-27 20:33:56] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 13008 ms
[2020-05-27 20:33:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:33:56] [INFO ] [Nat]Absence check using 221 positive place invariants in 206 ms returned sat
[2020-05-27 20:33:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:34:00] [INFO ] [Nat]Absence check using state equation in 3673 ms returned sat
[2020-05-27 20:34:01] [INFO ] Deduced a trap composed of 21 places in 523 ms
[2020-05-27 20:34:01] [INFO ] Deduced a trap composed of 25 places in 628 ms
[2020-05-27 20:34:02] [INFO ] Deduced a trap composed of 16 places in 640 ms
[2020-05-27 20:34:03] [INFO ] Deduced a trap composed of 22 places in 582 ms
[2020-05-27 20:34:03] [INFO ] Deduced a trap composed of 21 places in 421 ms
[2020-05-27 20:34:04] [INFO ] Deduced a trap composed of 25 places in 400 ms
[2020-05-27 20:34:04] [INFO ] Deduced a trap composed of 25 places in 503 ms
[2020-05-27 20:34:05] [INFO ] Deduced a trap composed of 34 places in 394 ms
[2020-05-27 20:34:05] [INFO ] Deduced a trap composed of 26 places in 355 ms
[2020-05-27 20:34:05] [INFO ] Deduced a trap composed of 25 places in 345 ms
[2020-05-27 20:34:06] [INFO ] Deduced a trap composed of 30 places in 406 ms
[2020-05-27 20:34:06] [INFO ] Deduced a trap composed of 24 places in 421 ms
[2020-05-27 20:34:07] [INFO ] Deduced a trap composed of 29 places in 471 ms
[2020-05-27 20:34:07] [INFO ] Deduced a trap composed of 23 places in 451 ms
[2020-05-27 20:34:08] [INFO ] Deduced a trap composed of 29 places in 416 ms
[2020-05-27 20:34:08] [INFO ] Deduced a trap composed of 20 places in 319 ms
[2020-05-27 20:34:09] [INFO ] Deduced a trap composed of 37 places in 299 ms
[2020-05-27 20:34:09] [INFO ] Deduced a trap composed of 25 places in 353 ms
[2020-05-27 20:34:09] [INFO ] Deduced a trap composed of 32 places in 301 ms
[2020-05-27 20:34:10] [INFO ] Deduced a trap composed of 20 places in 287 ms
[2020-05-27 20:34:10] [INFO ] Deduced a trap composed of 34 places in 391 ms
[2020-05-27 20:34:11] [INFO ] Deduced a trap composed of 32 places in 365 ms
[2020-05-27 20:34:11] [INFO ] Deduced a trap composed of 22 places in 361 ms
[2020-05-27 20:34:11] [INFO ] Deduced a trap composed of 23 places in 346 ms
[2020-05-27 20:34:12] [INFO ] Deduced a trap composed of 36 places in 359 ms
[2020-05-27 20:34:12] [INFO ] Deduced a trap composed of 40 places in 271 ms
[2020-05-27 20:34:13] [INFO ] Deduced a trap composed of 27 places in 284 ms
[2020-05-27 20:34:13] [INFO ] Deduced a trap composed of 34 places in 248 ms
[2020-05-27 20:34:13] [INFO ] Deduced a trap composed of 33 places in 227 ms
[2020-05-27 20:34:13] [INFO ] Deduced a trap composed of 33 places in 233 ms
[2020-05-27 20:34:14] [INFO ] Deduced a trap composed of 35 places in 290 ms
[2020-05-27 20:34:14] [INFO ] Deduced a trap composed of 39 places in 284 ms
[2020-05-27 20:34:14] [INFO ] Deduced a trap composed of 30 places in 270 ms
[2020-05-27 20:34:15] [INFO ] Deduced a trap composed of 34 places in 294 ms
[2020-05-27 20:34:15] [INFO ] Deduced a trap composed of 36 places in 281 ms
[2020-05-27 20:34:16] [INFO ] Deduced a trap composed of 36 places in 264 ms
[2020-05-27 20:34:16] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 15451 ms
[2020-05-27 20:34:16] [INFO ] Computed and/alt/rep : 1422/2123/1422 causal constraints in 119 ms.
[2020-05-27 20:34:16] [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 (=> (> t40 0) (and (and (> t1300 0) (< o1300 o40)) (and (> t1305 0) (< o1305 o40))))") while checking expression at index 7
[2020-05-27 20:34:17] [INFO ] Flatten gal took : 301 ms
[2020-05-27 20:34:17] [INFO ] Flatten gal took : 118 ms
[2020-05-27 20:34:17] [INFO ] Applying decomposition
[2020-05-27 20:34:17] [INFO ] Flatten gal took : 72 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/graph15713904023383494844.txt, -o, /tmp/graph15713904023383494844.bin, -w, /tmp/graph15713904023383494844.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/graph15713904023383494844.bin, -l, -1, -v, -w, /tmp/graph15713904023383494844.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 20:34:18] [INFO ] Decomposing Gal with order
[2020-05-27 20:34:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 20:34:18] [INFO ] Removed a total of 120 redundant transitions.
[2020-05-27 20:34:18] [INFO ] Flatten gal took : 205 ms
[2020-05-27 20:34:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2020-05-27 20:34:18] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 47 ms
[2020-05-27 20:34:18] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 2 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/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.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/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
built 28 ordering constraints for composite.
built 39 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 14 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 20 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 18 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 39 ordering constraints for composite.
built 39 ordering constraints for composite.
built 17 ordering constraints for composite.
built 18 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 16 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 39 ordering constraints for composite.
built 39 ordering constraints for composite.
built 39 ordering constraints for composite.
built 41 ordering constraints for composite.
built 39 ordering constraints for composite.
built 42 ordering constraints for composite.
built 39 ordering constraints for composite.
built 39 ordering constraints for composite.
built 11 ordering constraints for composite.
built 18 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 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 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 39 ordering constraints for composite.
built 44 ordering constraints for composite.
built 39 ordering constraints for composite.
built 39 ordering constraints for composite.
built 36 ordering constraints for composite.
Detected timeout of ITS tools.
[2020-05-27 20:55:26] [INFO ] Applying decomposition
[2020-05-27 20:55:26] [INFO ] Flatten gal took : 283 ms
[2020-05-27 20:55:27] [INFO ] Decomposing Gal with order
[2020-05-27 20:55:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 20:55:28] [INFO ] Flatten gal took : 269 ms
[2020-05-27 20:55:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2020-05-27 20:55:29] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 33 ms
[2020-05-27 20:55:29] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.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/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.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/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 16 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 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 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 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 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 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 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 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 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 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 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 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 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 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 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 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 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 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 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 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 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 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 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 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 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 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 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 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 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 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 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 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 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 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 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 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 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 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 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 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
Detected timeout of ITS tools.
[2020-05-27 21:16:37] [INFO ] Flatten gal took : 297 ms
[2020-05-27 21:16:38] [INFO ] Input system was already deterministic with 1423 transitions.
[2020-05-27 21:16:38] [INFO ] Transformed 1563 places.
[2020-05-27 21:16:38] [INFO ] Transformed 1423 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 21:16:38] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 4 ms
[2020-05-27 21:16:38] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.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/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.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/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.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 16 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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="ShieldPPPt-PT-020B"
export BK_EXAMINATION="CTLFireability"
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 ShieldPPPt-PT-020B, examination is CTLFireability"
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-159033476100676"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-020B.tgz
mv ShieldPPPt-PT-020B execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;