About the Execution of ITS-Tools for ShieldPPPt-PT-030A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15747.930 | 1543589.00 | 1605529.00 | 10914.50 | FFFFFFFFFFFTFTFF | 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-159033476100682.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-030A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033476100682
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users 3.4K May 14 01:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 14 01:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 19:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 19:23 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 17K 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.7K May 13 14:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 13 14:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 08:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 08:53 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 201K 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-030A-00
FORMULA_NAME ShieldPPPt-PT-030A-01
FORMULA_NAME ShieldPPPt-PT-030A-02
FORMULA_NAME ShieldPPPt-PT-030A-03
FORMULA_NAME ShieldPPPt-PT-030A-04
FORMULA_NAME ShieldPPPt-PT-030A-05
FORMULA_NAME ShieldPPPt-PT-030A-06
FORMULA_NAME ShieldPPPt-PT-030A-07
FORMULA_NAME ShieldPPPt-PT-030A-08
FORMULA_NAME ShieldPPPt-PT-030A-09
FORMULA_NAME ShieldPPPt-PT-030A-10
FORMULA_NAME ShieldPPPt-PT-030A-11
FORMULA_NAME ShieldPPPt-PT-030A-12
FORMULA_NAME ShieldPPPt-PT-030A-13
FORMULA_NAME ShieldPPPt-PT-030A-14
FORMULA_NAME ShieldPPPt-PT-030A-15
=== Now, execution of the tool begins
BK_START 1590611879076
[2020-05-27 20:38:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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:38:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 20:38:00] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2020-05-27 20:38:00] [INFO ] Transformed 753 places.
[2020-05-27 20:38:00] [INFO ] Transformed 543 transitions.
[2020-05-27 20:38:00] [INFO ] Found NUPN structural information;
[2020-05-27 20:38:00] [INFO ] Parsed PT model containing 753 places and 543 transitions in 151 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 691 ms. (steps per millisecond=144 ) properties seen :[0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1]
// Phase 1: matrix 542 rows 753 cols
[2020-05-27 20:38:01] [INFO ] Computed 331 place invariants in 20 ms
[2020-05-27 20:38:02] [INFO ] [Real]Absence check using 331 positive place invariants in 211 ms returned sat
[2020-05-27 20:38:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:38:03] [INFO ] [Real]Absence check using state equation in 910 ms returned sat
[2020-05-27 20:38:03] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 43 ms.
[2020-05-27 20:38:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:38:03] [INFO ] [Nat]Absence check using 331 positive place invariants in 191 ms returned sat
[2020-05-27 20:38:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:38:04] [INFO ] [Nat]Absence check using state equation in 993 ms returned sat
[2020-05-27 20:38:04] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 53 ms.
[2020-05-27 20:38:12] [INFO ] Added : 535 causal constraints over 108 iterations in 7733 ms. Result :sat
[2020-05-27 20:38:12] [INFO ] [Real]Absence check using 331 positive place invariants in 186 ms returned sat
[2020-05-27 20:38:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:38:14] [INFO ] [Real]Absence check using state equation in 1189 ms returned sat
[2020-05-27 20:38:14] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 54 ms.
[2020-05-27 20:38:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:38:15] [INFO ] [Nat]Absence check using 331 positive place invariants in 997 ms returned sat
[2020-05-27 20:38:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:38:16] [INFO ] [Nat]Absence check using state equation in 981 ms returned sat
[2020-05-27 20:38:16] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 40 ms.
[2020-05-27 20:38:23] [INFO ] Added : 530 causal constraints over 106 iterations in 6356 ms. Result :sat
[2020-05-27 20:38:23] [INFO ] [Real]Absence check using 331 positive place invariants in 181 ms returned sat
[2020-05-27 20:38:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:38:24] [INFO ] [Real]Absence check using state equation in 1235 ms returned sat
[2020-05-27 20:38:24] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 44 ms.
[2020-05-27 20:38:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:38:25] [INFO ] [Nat]Absence check using 331 positive place invariants in 215 ms returned sat
[2020-05-27 20:38:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:38:26] [INFO ] [Nat]Absence check using state equation in 1242 ms returned sat
[2020-05-27 20:38:26] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 49 ms.
[2020-05-27 20:38:34] [INFO ] Added : 525 causal constraints over 109 iterations in 7803 ms. Result :sat
[2020-05-27 20:38:34] [INFO ] [Real]Absence check using 331 positive place invariants in 180 ms returned sat
[2020-05-27 20:38:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:38:35] [INFO ] [Real]Absence check using state equation in 934 ms returned sat
[2020-05-27 20:38:35] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 41 ms.
[2020-05-27 20:38:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:38:36] [INFO ] [Nat]Absence check using 331 positive place invariants in 217 ms returned sat
[2020-05-27 20:38:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:38:37] [INFO ] [Nat]Absence check using state equation in 1109 ms returned sat
[2020-05-27 20:38:37] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 27 ms.
[2020-05-27 20:38:43] [INFO ] Added : 521 causal constraints over 107 iterations in 6277 ms. Result :sat
[2020-05-27 20:38:43] [INFO ] [Real]Absence check using 331 positive place invariants in 182 ms returned sat
[2020-05-27 20:38:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:38:45] [INFO ] [Real]Absence check using state equation in 1220 ms returned sat
[2020-05-27 20:38:45] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 28 ms.
[2020-05-27 20:38:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:38:45] [INFO ] [Nat]Absence check using 331 positive place invariants in 127 ms returned sat
[2020-05-27 20:38:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:38:46] [INFO ] [Nat]Absence check using state equation in 1077 ms returned sat
[2020-05-27 20:38:46] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 46 ms.
[2020-05-27 20:38:54] [INFO ] Added : 536 causal constraints over 108 iterations in 7544 ms. Result :sat
[2020-05-27 20:38:54] [INFO ] [Real]Absence check using 331 positive place invariants in 187 ms returned sat
[2020-05-27 20:38:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:38:55] [INFO ] [Real]Absence check using state equation in 1053 ms returned sat
[2020-05-27 20:38:55] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 50 ms.
[2020-05-27 20:38:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:38:56] [INFO ] [Nat]Absence check using 331 positive place invariants in 134 ms returned sat
[2020-05-27 20:38:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:38:57] [INFO ] [Nat]Absence check using state equation in 957 ms returned sat
[2020-05-27 20:38:57] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 44 ms.
[2020-05-27 20:39:02] [INFO ] Added : 502 causal constraints over 101 iterations in 5606 ms. Result :sat
[2020-05-27 20:39:03] [INFO ] [Real]Absence check using 331 positive place invariants in 185 ms returned sat
[2020-05-27 20:39:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:39:04] [INFO ] [Real]Absence check using state equation in 1056 ms returned sat
[2020-05-27 20:39:04] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 39 ms.
[2020-05-27 20:39:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:39:04] [INFO ] [Nat]Absence check using 331 positive place invariants in 196 ms returned sat
[2020-05-27 20:39:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:39:05] [INFO ] [Nat]Absence check using state equation in 1103 ms returned sat
[2020-05-27 20:39:05] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 52 ms.
[2020-05-27 20:39:13] [INFO ] Added : 510 causal constraints over 104 iterations in 7666 ms. Result :sat
[2020-05-27 20:39:13] [INFO ] [Real]Absence check using 331 positive place invariants in 195 ms returned sat
[2020-05-27 20:39:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:39:14] [INFO ] [Real]Absence check using state equation in 1031 ms returned sat
[2020-05-27 20:39:15] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 37 ms.
[2020-05-27 20:39:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:39:15] [INFO ] [Nat]Absence check using 331 positive place invariants in 180 ms returned sat
[2020-05-27 20:39:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:39:16] [INFO ] [Nat]Absence check using state equation in 1118 ms returned sat
[2020-05-27 20:39:16] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 51 ms.
[2020-05-27 20:39:26] [INFO ] Added : 530 causal constraints over 108 iterations in 9386 ms. Result :sat
[2020-05-27 20:39:26] [INFO ] [Real]Absence check using 331 positive place invariants in 192 ms returned sat
[2020-05-27 20:39:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:39:27] [INFO ] [Real]Absence check using state equation in 1036 ms returned sat
[2020-05-27 20:39:27] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 43 ms.
[2020-05-27 20:39:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:39:28] [INFO ] [Nat]Absence check using 331 positive place invariants in 178 ms returned sat
[2020-05-27 20:39:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:39:29] [INFO ] [Nat]Absence check using state equation in 1019 ms returned sat
[2020-05-27 20:39:29] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 55 ms.
[2020-05-27 20:39:38] [INFO ] Added : 530 causal constraints over 108 iterations in 9139 ms. Result :sat
[2020-05-27 20:39:38] [INFO ] [Real]Absence check using 331 positive place invariants in 186 ms returned sat
[2020-05-27 20:39:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:39:39] [INFO ] [Real]Absence check using state equation in 1062 ms returned sat
[2020-05-27 20:39:39] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 26 ms.
[2020-05-27 20:39:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:39:40] [INFO ] [Nat]Absence check using 331 positive place invariants in 131 ms returned sat
[2020-05-27 20:39:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:39:40] [INFO ] [Nat]Absence check using state equation in 889 ms returned sat
[2020-05-27 20:39:41] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 53 ms.
[2020-05-27 20:39:47] [INFO ] Added : 527 causal constraints over 107 iterations in 6748 ms. Result :sat
[2020-05-27 20:39:48] [INFO ] [Real]Absence check using 331 positive place invariants in 196 ms returned sat
[2020-05-27 20:39:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:39:49] [INFO ] [Real]Absence check using state equation in 1112 ms returned sat
[2020-05-27 20:39:49] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 34 ms.
[2020-05-27 20:39:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:39:49] [INFO ] [Nat]Absence check using 331 positive place invariants in 127 ms returned sat
[2020-05-27 20:39:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:39:50] [INFO ] [Nat]Absence check using state equation in 1147 ms returned sat
[2020-05-27 20:39:50] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 44 ms.
[2020-05-27 20:39:57] [INFO ] Added : 530 causal constraints over 108 iterations in 6284 ms. Result :sat
[2020-05-27 20:39:57] [INFO ] [Real]Absence check using 331 positive place invariants in 129 ms returned sat
[2020-05-27 20:39:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:39:58] [INFO ] [Real]Absence check using state equation in 929 ms returned sat
[2020-05-27 20:39:58] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 40 ms.
[2020-05-27 20:39:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:39:58] [INFO ] [Nat]Absence check using 331 positive place invariants in 135 ms returned sat
[2020-05-27 20:39:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:39:59] [INFO ] [Nat]Absence check using state equation in 850 ms returned sat
[2020-05-27 20:39:59] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 34 ms.
[2020-05-27 20:40:06] [INFO ] Added : 529 causal constraints over 107 iterations in 6966 ms. Result :sat
[2020-05-27 20:40:07] [INFO ] [Real]Absence check using 331 positive place invariants in 180 ms returned sat
[2020-05-27 20:40:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:40:08] [INFO ] [Real]Absence check using state equation in 1027 ms returned sat
[2020-05-27 20:40:08] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 35 ms.
[2020-05-27 20:40:08] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:40:08] [INFO ] [Nat]Absence check using 331 positive place invariants in 167 ms returned sat
[2020-05-27 20:40:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:40:09] [INFO ] [Nat]Absence check using state equation in 934 ms returned sat
[2020-05-27 20:40:09] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 44 ms.
[2020-05-27 20:40:17] [INFO ] Added : 533 causal constraints over 108 iterations in 7995 ms. Result :sat
[2020-05-27 20:40:17] [INFO ] [Real]Absence check using 331 positive place invariants in 168 ms returned sat
[2020-05-27 20:40:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:40:18] [INFO ] [Real]Absence check using state equation in 905 ms returned sat
[2020-05-27 20:40:18] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 42 ms.
[2020-05-27 20:40:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:40:19] [INFO ] [Nat]Absence check using 331 positive place invariants in 132 ms returned sat
[2020-05-27 20:40:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:40:20] [INFO ] [Nat]Absence check using state equation in 1055 ms returned sat
[2020-05-27 20:40:20] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 32 ms.
[2020-05-27 20:40:27] [INFO ] Added : 532 causal constraints over 108 iterations in 7047 ms. Result :sat
[2020-05-27 20:40:27] [INFO ] [Real]Absence check using 331 positive place invariants in 177 ms returned sat
[2020-05-27 20:40:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:40:29] [INFO ] [Real]Absence check using state equation in 1172 ms returned sat
[2020-05-27 20:40:29] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 37 ms.
[2020-05-27 20:40:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:40:29] [INFO ] [Nat]Absence check using 331 positive place invariants in 172 ms returned sat
[2020-05-27 20:40:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:40:30] [INFO ] [Nat]Absence check using state equation in 1138 ms returned sat
[2020-05-27 20:40:30] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 32 ms.
[2020-05-27 20:40:36] [INFO ] Added : 509 causal constraints over 102 iterations in 5953 ms. Result :sat
[2020-05-27 20:40:37] [INFO ] [Real]Absence check using 331 positive place invariants in 135 ms returned sat
[2020-05-27 20:40:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:40:38] [INFO ] [Real]Absence check using state equation in 1015 ms returned sat
[2020-05-27 20:40:38] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 37 ms.
[2020-05-27 20:40:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:40:38] [INFO ] [Nat]Absence check using 331 positive place invariants in 202 ms returned sat
[2020-05-27 20:40:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:40:39] [INFO ] [Nat]Absence check using state equation in 1042 ms returned sat
[2020-05-27 20:40:39] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 33 ms.
[2020-05-27 20:40:46] [INFO ] Added : 531 causal constraints over 109 iterations in 6977 ms. Result :sat
[2020-05-27 20:40:47] [INFO ] [Real]Absence check using 331 positive place invariants in 174 ms returned sat
[2020-05-27 20:40:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:40:48] [INFO ] [Real]Absence check using state equation in 1088 ms returned sat
[2020-05-27 20:40:48] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 50 ms.
[2020-05-27 20:40:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:40:48] [INFO ] [Nat]Absence check using 331 positive place invariants in 192 ms returned sat
[2020-05-27 20:40:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:40:49] [INFO ] [Nat]Absence check using state equation in 1047 ms returned sat
[2020-05-27 20:40:49] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 42 ms.
[2020-05-27 20:40:55] [INFO ] Added : 499 causal constraints over 100 iterations in 5535 ms. Result :sat
[2020-05-27 20:40:55] [INFO ] [Real]Absence check using 331 positive place invariants in 176 ms returned sat
[2020-05-27 20:40:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:40:56] [INFO ] [Real]Absence check using state equation in 1148 ms returned sat
[2020-05-27 20:40:56] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 49 ms.
[2020-05-27 20:40:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:40:57] [INFO ] [Nat]Absence check using 331 positive place invariants in 139 ms returned sat
[2020-05-27 20:40:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:40:58] [INFO ] [Nat]Absence check using state equation in 1110 ms returned sat
[2020-05-27 20:40:58] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 40 ms.
[2020-05-27 20:41:04] [INFO ] Added : 499 causal constraints over 100 iterations in 6329 ms. Result :sat
[2020-05-27 20:41:05] [INFO ] [Real]Absence check using 331 positive place invariants in 177 ms returned sat
[2020-05-27 20:41:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:41:06] [INFO ] [Real]Absence check using state equation in 1017 ms returned sat
[2020-05-27 20:41:06] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 33 ms.
[2020-05-27 20:41:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:41:06] [INFO ] [Nat]Absence check using 331 positive place invariants in 125 ms returned sat
[2020-05-27 20:41:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:41:07] [INFO ] [Nat]Absence check using state equation in 1068 ms returned sat
[2020-05-27 20:41:07] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 38 ms.
[2020-05-27 20:41:13] [INFO ] Added : 507 causal constraints over 104 iterations in 6313 ms. Result :sat
[2020-05-27 20:41:14] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-27 20:41:14] [INFO ] Flatten gal took : 161 ms
FORMULA ShieldPPPt-PT-030A-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 20:41:14] [INFO ] Flatten gal took : 66 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 20:41:14] [INFO ] Applying decomposition
[2020-05-27 20:41:14] [INFO ] Flatten gal took : 90 ms
[2020-05-27 20:41:14] [INFO ] Input system was already deterministic with 542 transitions.
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/graph5901178202070051436.txt, -o, /tmp/graph5901178202070051436.bin, -w, /tmp/graph5901178202070051436.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/graph5901178202070051436.bin, -l, -1, -v, -w, /tmp/graph5901178202070051436.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 20:41:15] [INFO ] Decomposing Gal with order
[2020-05-27 20:41:15] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 542 rows 753 cols
[2020-05-27 20:41:15] [INFO ] Computed 331 place invariants in 5 ms
inv : p0 + p622 + p623 = 1
inv : p0 + p45 + p46 = 1
inv : p0 + p710 + p713 + p714 = 1
inv : p0 + p185 + p186 + p187 = 1
inv : p0 + p335 + p338 + p339 = 1
inv : p0 + p597 + p598 = 1
inv : p0 + p560 + p561 + p562 = 1
inv : p0 + p20 + p21 = 1
inv : p0 + p95 + p96 = 1
inv : p0 + p565 + p566 + p567 = 1
inv : p0 + p547 + p548 = 1
inv : p0 + p715 + p718 + p719 = 1
inv : p0 + p555 + p556 + p557 = 1
inv : p0 + p120 + p121 = 1
inv : p0 + p155 + p158 + p159 = 1
inv : p0 + p330 + p333 + p334 = 1
inv : p0 + p180 + p181 + p182 = 1
inv : p0 + p522 + p523 = 1
inv : p0 + p497 + p498 = 1
inv : p0 + p190 + p191 + p192 = 1
inv : p0 + p672 + p673 = 1
inv : p0 + p515 + p518 + p519 = 1
inv : p0 + p145 + p146 = 1
inv : p0 + p647 + p648 = 1
inv : p0 + p10 + p11 + p12 = 1
inv : p0 + p530 + p533 + p534 = 1
inv : p0 + p160 + p163 + p164 = 1
inv : p0 + p535 + p538 + p539 = 1
inv : p0 + p195 + p196 = 1
inv : p0 + p422 + p423 = 1
inv : p0 + p472 + p473 = 1
inv : p0 + p740 + p741 + p742 = 1
inv : p0 + p245 + p246 = 1
inv : p0 + p5 + p6 + p7 = 1
inv : p0 + p380 + p381 + p382 = 1
inv : p0 + p355 + p358 + p359 = 1
inv : p0 + p505 + p508 + p509 = 1
inv : p0 + p297 + p298 = 1
inv : p0 + p365 + p366 + p367 = 1
inv : p0 + p340 + p343 + p344 = 1
inv : p0 + p130 + p133 + p134 = 1
inv : p0 + p722 + p723 = 1
inv : p0 + p70 + p71 = 1
inv : p0 + p735 + p738 + p739 = 1
inv : p0 + p247 + p248 = 1
inv : p0 + p445 + p446 = 1
inv : p0 + p535 + p536 + p537 = 1
inv : p0 + p315 + p318 + p319 = 1
inv : p0 + p580 + p581 + p582 = 1
inv : p0 + p360 + p363 + p364 = 1
inv : p0 + p355 + p356 + p357 = 1
inv : p0 + p165 + p168 + p169 = 1
inv : p0 + p724 + p725 = 1
inv : p0 + p180 + p183 + p184 = 1
inv : p0 + p205 + p206 + p207 = 1
inv : p0 + p160 + p161 + p162 = 1
inv : p0 + p270 + p271 = 1
inv : p0 + p222 + p223 = 1
inv : p0 + p420 + p421 = 1
inv : p0 + p385 + p386 + p387 = 1
inv : p0 + p624 + p625 = 1
inv : p0 + p72 + p73 = 1
inv : p0 + p135 + p138 + p139 = 1
inv : p0 + p715 + p716 + p717 = 1
inv : p0 + p170 + p171 = 1
inv : p0 + p555 + p558 + p559 = 1
inv : p0 + p520 + p521 = 1
inv : p0 + p397 + p398 = 1
inv : p0 + p340 + p341 + p342 = 1
inv : p0 + p510 + p513 + p514 = 1
inv : p0 + p595 + p596 = 1
inv : p0 + p705 + p708 + p709 = 1
inv : p0 + p540 + p543 + p544 = 1
inv : p0 + p322 + p323 = 1
inv : p0 + p147 + p148 = 1
inv : p0 + p747 + p748 = 1
inv : p0 + p549 + p550 = 1
inv : p0 + p730 + p731 + p732 = 1
inv : p0 + p572 + p573 = 1
inv : p0 + p690 + p693 + p694 = 1
inv : p0 + p345 + p346 = 1
inv : p0 + p153 + p154 = 1
inv : p0 + p474 + p475 = 1
inv : p0 + p665 + p668 + p669 = 1
inv : p0 + p10 + p13 + p14 = 1
inv : p0 + p203 + p204 = 1
inv : p0 + p515 + p516 + p517 = 1
inv : p0 + p449 + p450 = 1
inv : p0 + p235 + p236 + p237 = 1
inv : p0 + p330 + p331 + p332 = 1
inv : p0 + p605 + p606 + p607 = 1
inv : p0 + p128 + p129 = 1
inv : p0 + p480 + p483 + p484 = 1
inv : p0 + p5 + p8 + p9 = 1
inv : p0 + p415 + p416 + p417 = 1
inv : p0 + p240 + p241 + p242 = 1
inv : p0 + p720 + p721 = 1
inv : p0 + p55 + p56 + p57 = 1
inv : p0 + p485 + p488 + p489 = 1
inv : p0 + p510 + p511 + p512 = 1
inv : p0 + p599 + p600 = 1
inv : p0 + p324 + p325 = 1
inv : p0 + p78 + p79 = 1
inv : p0 + p690 + p691 + p692 = 1
inv : p0 + p3 + p4 = 1
inv : p0 + p353 + p354 = 1
inv : p0 + p570 + p571 = 1
inv : p0 + p490 + p493 + p494 = 1
inv : p0 + p35 + p36 + p37 = 1
inv : p0 + p53 + p54 = 1
inv : p0 + p580 + p583 + p584 = 1
inv : p0 + p495 + p496 = 1
inv : p0 + p190 + p193 + p194 = 1
inv : p0 + p172 + p173 = 1
inv : p0 + p215 + p216 + p217 = 1
inv : p0 + p399 + p400 = 1
inv : p0 + p65 + p66 + p67 = 1
inv : p0 + p460 + p463 + p464 = 1
inv : p0 + p310 + p313 + p314 = 1
inv : p0 + p280 + p283 + p284 = 1
inv : p0 + p751 + p752 = 1
inv : p0 + p155 + p156 + p157 = 1
inv : p0 + p524 + p525 = 1
inv : p0 + p428 + p429 = 1
inv : p0 + p335 + p336 + p337 = 1
inv : p0 + p305 + p306 + p307 = 1
inv : p0 + p210 + p211 + p212 = 1
inv : p0 + p640 + p643 + p644 = 1
inv : p0 + p99 + p100 = 1
inv : p0 + p370 + p371 = 1
inv : p0 + p553 + p554 = 1
inv : p0 + p35 + p38 + p39 = 1
inv : p0 + p730 + p733 + p734 = 1
inv : p0 + p635 + p638 + p639 = 1
inv : p0 + p365 + p368 + p369 = 1
inv : p0 + p749 + p750 = 1
inv : p0 + p215 + p218 + p219 = 1
inv : p0 + p295 + p296 = 1
inv : p0 + p628 + p629 = 1
inv : p0 + p390 + p391 + p392 = 1
inv : p0 + p305 + p308 + p309 = 1
inv : p0 + p540 + p541 + p542 = 1
inv : p0 + p455 + p458 + p459 = 1
inv : p0 + p97 + p98 = 1
inv : p0 + p174 + p175 = 1
inv : p0 + p126 + p127 = 1
inv : p0 + p551 + p552 = 1
inv : p0 + p372 + p373 = 1
inv : p0 + p630 + p631 + p632 = 1
inv : p0 + p447 + p448 = 1
inv : p0 + p220 + p221 = 1
inv : p0 + p185 + p188 + p189 = 1
inv : p0 + p480 + p481 + p482 = 1
inv : p0 + p360 + p361 + p362 = 1
inv : p0 + p60 + p61 + p62 = 1
inv : p0 + p30 + p31 + p32 = 1
inv : p0 + p65 + p68 + p69 = 1
inv : p0 + p51 + p52 = 1
inv : p0 + p278 + p279 = 1
inv : p0 + p22 + p23 = 1
inv : p0 + p476 + p477 = 1
inv : p0 + p645 + p646 = 1
inv : p0 + p703 + p704 = 1
inv : p0 + p249 + p250 = 1
inv : p0 + p674 + p675 = 1
inv : p0 + p326 + p327 = 1
inv : p0 + p430 + p433 + p434 = 1
inv : p0 + p55 + p58 + p59 = 1
inv : p0 + p280 + p281 + p282 = 1
inv : p0 + p655 + p656 + p657 = 1
inv : p0 + p351 + p352 = 1
inv : p0 + p615 + p618 + p619 = 1
inv : p0 + p90 + p91 + p92 = 1
inv : p0 + p240 + p243 + p244 = 1
inv : p0 + p301 + p302 = 1
inv : p0 + p435 + p438 + p439 = 1
inv : p0 + p376 + p377 = 1
inv : p0 + p660 + p661 + p662 = 1
inv : p0 + p285 + p286 + p287 = 1
inv : p0 + p401 + p402 = 1
inv : p0 + p60 + p63 + p64 = 1
inv : p0 + p426 + p427 = 1
inv : p0 + p251 + p252 = 1
inv : p0 + p276 + p277 = 1
inv : p0 + p465 + p466 + p467 = 1
inv : p0 + p85 + p86 + p87 = 1
inv : p0 + p440 + p443 + p444 = 1
inv : p0 + p605 + p608 + p609 = 1
inv : p0 + p728 + p729 = 1
inv : p0 + p151 + p152 = 1
inv : p0 + p455 + p456 + p457 = 1
inv : p0 + p665 + p666 + p667 = 1
inv : p0 + p80 + p81 + p82 = 1
inv : p0 + p501 + p502 = 1
inv : p0 + p451 + p452 = 1
inv : p0 + p678 + p679 = 1
inv : p0 + p110 + p111 + p112 = 1
inv : p0 + p485 + p486 + p487 = 1
inv : p0 + p610 + p613 + p614 = 1
inv : p0 + p635 + p636 + p637 = 1
inv : p0 + p76 + p77 = 1
inv : p0 + p415 + p418 + p419 = 1
inv : p0 + p40 + p43 + p44 = 1
inv : p0 + p626 + p627 = 1
inv : p0 + p290 + p291 + p292 = 1
inv : p0 + p265 + p268 + p269 = 1
inv : p0 + p201 + p202 = 1
inv : p0 + p260 + p261 + p262 = 1
inv : p0 + p235 + p238 + p239 = 1
inv : p0 + p115 + p116 + p117 = 1
inv : p0 + p701 + p702 = 1
inv : p0 + p124 + p125 = 1
inv : p0 + p676 + p677 = 1
inv : p0 + p26 + p27 = 1
inv : p0 + p405 + p408 + p409 = 1
inv : p0 + p490 + p491 + p492 = 1
inv : p0 + p199 + p200 = 1
inv : p0 + p653 + p654 = 1
inv : p0 + p310 + p311 + p312 = 1
inv : p0 + p478 + p479 = 1
inv : p0 + p24 + p25 = 1
inv : p0 + p503 + p504 = 1
inv : p0 + p1 + p2 = 1
inv : p0 + p49 + p50 = 1
inv : p0 + p30 + p33 + p34 = 1
inv : p0 + p465 + p468 + p469 = 1
inv : p0 + p90 + p93 + p94 = 1
inv : p0 + p299 + p300 = 1
inv : p0 + p255 + p258 + p259 = 1
inv : p0 + p526 + p527 = 1
inv : p0 + p630 + p633 + p634 = 1
inv : p0 + p585 + p588 + p589 = 1
inv : p0 + p505 + p506 + p507 = 1
inv : p0 + p210 + p213 + p214 = 1
inv : p0 + p265 + p266 + p267 = 1
inv : p0 + p640 + p641 + p642 = 1
inv : p0 + p176 + p177 = 1
inv : p0 + p101 + p102 = 1
inv : p0 + p403 + p404 = 1
inv : p0 + p328 + p329 = 1
inv : p0 + p430 + p431 + p432 = 1
inv : p0 + p460 + p461 + p462 = 1
inv : p0 + p390 + p393 + p394 = 1
inv : p0 + p601 + p602 = 1
inv : p0 + p685 + p686 + p687 = 1
inv : p0 + p660 + p663 + p664 = 1
inv : p0 + p374 + p375 = 1
inv : p0 + p578 + p579 = 1
inv : p0 + p178 + p179 = 1
inv : p0 + p140 + p141 + p142 = 1
inv : p0 + p290 + p293 + p294 = 1
inv : p0 + p424 + p425 = 1
inv : p0 + p610 + p611 + p612 = 1
inv : p0 + p285 + p288 + p289 = 1
inv : p0 + p745 + p746 = 1
inv : p0 + p499 + p500 = 1
inv : p0 + p253 + p254 = 1
inv : p0 + p135 + p136 + p137 = 1
inv : p0 + p40 + p41 + p42 = 1
inv : p0 + p574 + p575 = 1
inv : p0 + p103 + p104 = 1
inv : p0 + p695 + p696 = 1
inv : p0 + p15 + p18 + p19 = 1
inv : p0 + p380 + p383 + p384 = 1
inv : p0 + p105 + p108 + p109 = 1
inv : p0 + p130 + p131 + p132 = 1
inv : p0 + p228 + p229 = 1
inv : p0 + p560 + p563 + p564 = 1
inv : p0 + p615 + p616 + p617 = 1
inv : p0 + p705 + p706 + p707 = 1
inv : p0 + p274 + p275 = 1
inv : p0 + p649 + p650 = 1
inv : p0 + p115 + p118 + p119 = 1
inv : p0 + p620 + p621 = 1
inv : p0 + p545 + p546 = 1
inv : p0 + p378 + p379 = 1
inv : p0 + p710 + p711 + p712 = 1
inv : p0 + p655 + p658 + p659 = 1
inv : p0 + p349 + p350 = 1
inv : p0 + p699 + p700 = 1
inv : p0 + p224 + p225 = 1
inv : p0 + p47 + p48 = 1
inv : p0 + p122 + p123 = 1
inv : p0 + p670 + p671 = 1
inv : p0 + p590 + p591 + p592 = 1
inv : p0 + p565 + p568 + p569 = 1
inv : p0 + p85 + p88 + p89 = 1
inv : p0 + p530 + p531 + p532 = 1
inv : p0 + p303 + p304 = 1
inv : p0 + p230 + p231 + p232 = 1
inv : p0 + p440 + p441 + p442 = 1
inv : p0 + p385 + p388 + p389 = 1
inv : p0 + p410 + p411 + p412 = 1
inv : p0 + p205 + p208 + p209 = 1
inv : p0 + p395 + p396 = 1
inv : p0 + p528 + p529 = 1
inv : p0 + p651 + p652 = 1
inv : p0 + p149 + p150 = 1
inv : p0 + p603 + p604 = 1
inv : p0 + p680 + p681 + p682 = 1
inv : p0 + p255 + p256 + p257 = 1
inv : p0 + p80 + p83 + p84 = 1
inv : p0 + p272 + p273 = 1
inv : p0 + p320 + p321 = 1
inv : p0 + p197 + p198 = 1
inv : p0 + p726 + p727 = 1
inv : p0 + p165 + p166 + p167 = 1
inv : p0 + p685 + p688 + p689 = 1
inv : p0 + p74 + p75 = 1
inv : p0 + p260 + p263 + p264 = 1
inv : p0 + p347 + p348 = 1
inv : p0 + p740 + p743 + p744 = 1
inv : p0 + p680 + p683 + p684 = 1
inv : p0 + p576 + p577 = 1
inv : p0 + p405 + p406 + p407 = 1
inv : p0 + p435 + p436 + p437 = 1
inv : p0 + p410 + p413 + p414 = 1
inv : p0 + p735 + p736 + p737 = 1
inv : p0 + p590 + p593 + p594 = 1
inv : p0 + p585 + p586 + p587 = 1
inv : p0 + p315 + p316 + p317 = 1
inv : p0 + p230 + p233 + p234 = 1
inv : p0 + p28 + p29 = 1
inv : p0 + p140 + p143 + p144 = 1
inv : p0 + p15 + p16 + p17 = 1
inv : p0 + p110 + p113 + p114 = 1
inv : p0 + p105 + p106 + p107 = 1
inv : p0 + p453 + p454 = 1
inv : p0 + p697 + p698 = 1
inv : p0 + p226 + p227 = 1
inv : p0 + p470 + p471 = 1
Total of 331 invariants.
[2020-05-27 20:41:15] [INFO ] Computed 331 place invariants in 20 ms
[2020-05-27 20:41:15] [INFO ] Removed a total of 90 redundant transitions.
[2020-05-27 20:41:15] [INFO ] Flatten gal took : 139 ms
[2020-05-27 20:41:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 39 ms.
[2020-05-27 20:41:15] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 11 ms
[2020-05-27 20:41:15] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 15 LTL properties
Checking formula 0 : !(((G(!(("((i3.i1.i2.u41.p129==1)&&(i3.i1.i2.u46.p148==1))")U(F(("(i11.u128.p401==1)")U("((i6.i0.i0.u75.p236==1)&&(i6.i1.i1.u77.p246==1))"))))))||((G(X("((i18.i0.i1.u219.p687==1)&&(i18.i0.i1.u219.p689==1))")))&&(X("((i6.i0.i0.u75.p236==1)&&(i6.i1.i1.u77.p246==1))")))))
Formula 0 simplified : !(G!("((i3.i1.i2.u41.p129==1)&&(i3.i1.i2.u46.p148==1))" U F("(i11.u128.p401==1)" U "((i6.i0.i0.u75.p236==1)&&(i6.i1.i1.u77.p246==1))")) | (GX"((i18.i0.i1.u219.p687==1)&&(i18.i0.i1.u219.p689==1))" & X"((i6.i0.i0.u75.p236==1)&&(i6.i1.i1.u77.p246==1))"))
built 29 ordering constraints for composite.
built 19 ordering constraints for composite.
built 16 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 11 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 22 ordering constraints for composite.
built 17 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 23 ordering constraints for composite.
built 17 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 17 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 25 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 17 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 24 ordering constraints for composite.
built 28 ordering constraints for composite.
built 11 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 14 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 21 ordering constraints for composite.
built 11 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 24 ordering constraints for composite.
built 19 ordering constraints for composite.
built 16 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 21 ordering constraints for composite.
built 18 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 19 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 23 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 18 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 21 ordering constraints for composite.
built 18 ordering constraints for composite.
built 26 ordering constraints for composite.
built 16 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 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 22 ordering constraints for composite.
built 17 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 15 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 18 ordering constraints for composite.
built 22 ordering constraints for composite.
[2020-05-27 20:41:19] [INFO ] Proved 753 variables to be positive in 3859 ms
[2020-05-27 20:41:19] [INFO ] Computing symmetric may disable matrix : 542 transitions.
[2020-05-27 20:41:19] [INFO ] Computation of disable matrix completed :0/542 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 20:41:19] [INFO ] Computation of Complete disable matrix. took 57 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 20:41:19] [INFO ] Computing symmetric may enable matrix : 542 transitions.
[2020-05-27 20:41:19] [INFO ] Computation of Complete enable matrix. took 40 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 20:41:28] [INFO ] Computing symmetric co enabling matrix : 542 transitions.
[2020-05-27 20:41:28] [INFO ] Computation of co-enabling matrix(0/542) took 18 ms. Total solver calls (SAT/UNSAT): 4(0/4)
[2020-05-27 20:41:31] [INFO ] Computation of co-enabling matrix(61/542) took 3025 ms. Total solver calls (SAT/UNSAT): 248(0/248)
[2020-05-27 20:41:34] [INFO ] Computation of co-enabling matrix(148/542) took 6056 ms. Total solver calls (SAT/UNSAT): 970(58/912)
[2020-05-27 20:41:37] [INFO ] Computation of co-enabling matrix(425/542) took 9063 ms. Total solver calls (SAT/UNSAT): 1534(171/1363)
[2020-05-27 20:41:40] [INFO ] Computation of Finished co-enabling matrix. took 11937 ms. Total solver calls (SAT/UNSAT): 1649(209/1440)
[2020-05-27 20:41:40] [INFO ] Computing Do-Not-Accords matrix : 542 transitions.
[2020-05-27 20:41:41] [INFO ] Computation of Completed DNA matrix. took 152 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 20:41:41] [INFO ] Built C files in 26580ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 6854 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 93 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( [](!( ((LTLAP0==true))U(<>(((LTLAP1==true))U((LTLAP2==true))))) )) || ( ( [](X((LTLAP3==true))) ) && ( X((LTLAP2==true)) )) , --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( [](!( ((LTLAP0==true))U(<>(((LTLAP1==true))U((LTLAP2==true))))) )) || ( ( [](X((LTLAP3==true))) ) && ( X((LTLAP2==true)) )) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( [](!( ((LTLAP0==true))U(<>(((LTLAP1==true))U((LTLAP2==true))))) )) || ( ( [](X((LTLAP3==true))) ) && ( X((LTLAP2==true)) )) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2020-05-27 21:02:20] [INFO ] Applying decomposition
[2020-05-27 21:02:21] [INFO ] Flatten gal took : 294 ms
[2020-05-27 21:02:21] [INFO ] Decomposing Gal with order
[2020-05-27 21:02:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 21:02:21] [INFO ] Removed a total of 180 redundant transitions.
[2020-05-27 21:02:21] [INFO ] Flatten gal took : 257 ms
[2020-05-27 21:02:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 50 ms.
[2020-05-27 21:02:22] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 87 ms
[2020-05-27 21:02:22] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 15 LTL properties
Checking formula 0 : !(((G(!(("((u72.p129==1)&&(u83.p148==1))")U(F(("(u225.p401==1)")U("((i75.u133.p236==1)&&(u138.p246==1))"))))))||((G(X("((i219.u385.p687==1)&&(i219.u386.p689==1))")))&&(X("((i75.u133.p236==1)&&(u138.p246==1))")))))
Formula 0 simplified : !(G!("((u72.p129==1)&&(u83.p148==1))" U F("(u225.p401==1)" U "((i75.u133.p236==1)&&(u138.p246==1))")) | (GX"((i219.u385.p687==1)&&(i219.u386.p689==1))" & X"((i75.u133.p236==1)&&(u138.p246==1))"))
built 331 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
1096 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,11.0592,249748,1,0,503266,830,7444,741086,45,638,1041358
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-030A-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((("(u42.p74==1)")U((X(!(F("(u195.p347!=1)"))))||(F("(u42.p74==1)")))))
Formula 1 simplified : !("(u42.p74==1)" U (X!F"(u195.p347!=1)" | F"(u42.p74==1)"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
420 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,15.2623,378220,1,0,796204,830,7943,1.17796e+06,46,638,1634327
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-030A-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(G(F(((X("((u380.p679==1)&&(u391.p698==1))"))&&(F(G(F("((i26.u46.p81==1)&&(u54.p96==1))")))))&&(G("((i171.u301.p536==1)&&(u306.p546==1))")))))))
Formula 2 simplified : GF(X"((u380.p679==1)&&(u391.p698==1))" & FGF"((i26.u46.p81==1)&&(u54.p96==1))" & G"((i171.u301.p536==1)&&(u306.p546==1))")
5 unique states visited
4 strongly connected components in search stack
7 transitions explored
5 items max in DFS search stack
242 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,17.6785,427580,1,0,901983,830,8621,1.31845e+06,46,638,1849379
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-030A-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(F(G((((!(G("((i132.u234.p417==1)&&(i132.u235.p419==1))")))||(G("((i132.u234.p417==1)&&(i132.u235.p419==1))")))U(G("((i20.u38.p67==1)&&(i20.u39.p69==1))")))&&(F("((i20.u38.p67==1)&&(i20.u39.p69==1))")))))))
Formula 3 simplified : FG(((G"((i132.u234.p417==1)&&(i132.u235.p419==1))" | !G"((i132.u234.p417==1)&&(i132.u235.p419==1))") U G"((i20.u38.p67==1)&&(i20.u39.p69==1))") & F"((i20.u38.p67==1)&&(i20.u39.p69==1))")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
52 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,18.1981,432860,1,0,906007,830,9096,1.32399e+06,46,638,1854908
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-030A-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(G((X(((!(G(X("((u156.p279==1)&&(u167.p298==1))"))))||("((u198.p353==1)&&(u211.p376==1))"))&&("(u126.p224==1)")))&&("(u139.p247!=1)")))))
Formula 4 simplified : !FG("(u139.p247!=1)" & X("(u126.p224==1)" & ("((u198.p353==1)&&(u211.p376==1))" | !GX"((u156.p279==1)&&(u167.p298==1))")))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
107 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,19.2685,468500,1,0,987528,830,9416,1.43327e+06,46,638,2017172
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-030A-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((X(F(G(F(X(G(X("((i116.u207.p368==1)&&(u210.p375==1))"))))))))U("((u210.p374==1)||((i116.u207.p368==1)&&(u210.p375==1)))")))
Formula 5 simplified : !(XFGFXGX"((i116.u207.p368==1)&&(u210.p375==1))" U "((u210.p374==1)||((i116.u207.p368==1)&&(u210.p375==1)))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
58 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,19.8539,492260,1,0,1.0393e+06,830,9698,1.50352e+06,46,638,2121362
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-030A-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((((G(X("((i196.u346.p616==1)&&(u351.p627==1))")))||(F(!(G(F("(u139.p247==1)"))))))||(X("((i130.u443.p405==1)&&(u237.p422==1))"))))
Formula 6 simplified : !(GX"((i196.u346.p616==1)&&(u351.p627==1))" | F!GF"(u139.p247==1)" | X"((i130.u443.p405==1)&&(u237.p422==1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
988 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,29.7347,896940,1,0,1.9105e+06,830,9727,3.20362e+06,46,638,3092319
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-030A-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(X((!(("((i35.u64.p113==1)&&(u71.p127==1))")U(!(F("((i35.u64.p113==1)&&(u71.p127==1))")))))&&(G(X("((u58.p104==1)&&(u69.p123==1))")))))))
Formula 7 simplified : !XX(!("((i35.u64.p113==1)&&(u71.p127==1))" U !F"((i35.u64.p113==1)&&(u71.p127==1))") & GX"((u58.p104==1)&&(u69.p123==1))")
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,29.7568,897468,1,0,1.91112e+06,830,9755,3.20424e+06,46,638,3095812
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-030A-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(X(!(X((F(("((i59.u105.p186==1)&&(u110.p196==1))")U(G("((i36.u66.p117==1)&&(i36.u67.p119==1))"))))||("((i36.u66.p117==1)&&(i36.u67.p119==1))")))))))
Formula 8 simplified : !GX!X("((i36.u66.p117==1)&&(i36.u67.p119==1))" | F("((i59.u105.p186==1)&&(u110.p196==1))" U G"((i36.u66.p117==1)&&(i36.u67.p119==1))"))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
356 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,33.3187,989272,1,0,2.11986e+06,830,10198,3.48408e+06,46,638,3508019
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-030A-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X((G(X("(u113.p201==1)")))U("(u113.p201==1)"))))
Formula 9 simplified : !X(GX"(u113.p201==1)" U "(u113.p201==1)")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,33.3386,989800,1,0,2.11988e+06,830,10214,3.48414e+06,46,638,3508654
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-030A-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((F(!(("(u167.p297==1)")U((X("(u167.p297==1)"))||("(u322.p574!=1)")))))U("((u322.p574==1)||((i211.u371.p662==1)&&(i211.u372.p664==1)))")))
Formula 10 simplified : !(F!("(u167.p297==1)" U ("(u322.p574!=1)" | X"(u167.p297==1)")) U "((u322.p574==1)||((i211.u371.p662==1)&&(i211.u372.p664==1)))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
53 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,33.8675,1014352,1,0,2.17498e+06,830,10399,3.56607e+06,46,638,3608001
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-030A-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((F(!(F("((i179.u315.p562==1)&&(i179.u316.p564==1))"))))U("(((((i27.u50.p88==1)&&(u57.p102==1))&&(i179.u315.p562==1))&&(i179.u316.p564==1))&&((i34.u61.p108!=1)||(u70.p125!=1)))")))
Formula 11 simplified : !(F!F"((i179.u315.p562==1)&&(i179.u316.p564==1))" U "(((((i27.u50.p88==1)&&(u57.p102==1))&&(i179.u315.p562==1))&&(i179.u316.p564==1))&&((i34.u61.p108!=1)||(u70.p125!=1)))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
2981 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,63.6783,2137280,1,0,4.81784e+06,830,11025,7.59065e+06,47,638,7238094
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-030A-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(!((((G("((i146.u257.p458==1)&&(u266.p475==1))"))||("((i146.u257.p458==1)&&(u266.p475==1))"))&&(X(F("(u238.p424==1)"))))U(G("(u238.p424==1)"))))))
Formula 12 simplified : !X!((("((i146.u257.p458==1)&&(u266.p475==1))" | G"((i146.u257.p458==1)&&(u266.p475==1))") & XF"(u238.p424==1)") U G"(u238.p424==1)")
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,63.689,2138072,1,0,4.81784e+06,830,11049,7.59065e+06,47,638,7238310
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA ShieldPPPt-PT-030A-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(((("((i44.u496.p140!=1)||(u98.p174!=1))")U(("((u338.p604==1)&&(u349.p623==1))")U("((i44.u496.p140==1)&&(u98.p174==1))")))&&(!(X(F(X("((i74.u130.p231==1)&&(u138.p246==1))")))))))
Formula 13 simplified : !(("((i44.u496.p140!=1)||(u98.p174!=1))" U ("((u338.p604==1)&&(u349.p623==1))" U "((i44.u496.p140==1)&&(u98.p174==1))")) & !XFX"((i74.u130.p231==1)&&(u138.p246==1))")
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,63.7191,2138600,1,0,4.82042e+06,830,11100,7.59325e+06,47,638,7242270
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-030A-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((F(!(G(!(("((u72.p129==1)&&(u83.p148==1))")U("(u250.p445==1)")))))))
Formula 14 simplified : !F!G!("((u72.p129==1)&&(u83.p148==1))" U "(u250.p445==1)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
47 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,64.1824,2158136,1,0,4.8632e+06,830,11322,7.65162e+06,47,638,7327425
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-030A-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
BK_STOP 1590613422665
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-030A"
export BK_EXAMINATION="LTLFireability"
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-030A, examination is LTLFireability"
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-159033476100682"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-030A.tgz
mv ShieldPPPt-PT-030A execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;