About the Execution of ITS-Tools for ResAllocation-PT-R100C002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FFFFFFFTFFFF???? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/local/x2003239/mcc2020-input.r193-csrt-159033389000618.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ResAllocation-PT-R100C002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193-csrt-159033389000618
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 3.2K May 14 00:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 14 00:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 17:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 17:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 12 20:53 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 12 20:53 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 14 10:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 14 10:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 13 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 07:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 07:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:53 equiv_col
-rw-r--r-- 1 mcc users 9 May 12 20:53 instance
-rw-r--r-- 1 mcc users 6 May 12 20:53 iscolored
-rw-r--r-- 1 mcc users 422K May 12 20:53 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 ResAllocation-PT-R100C002-00
FORMULA_NAME ResAllocation-PT-R100C002-01
FORMULA_NAME ResAllocation-PT-R100C002-02
FORMULA_NAME ResAllocation-PT-R100C002-03
FORMULA_NAME ResAllocation-PT-R100C002-04
FORMULA_NAME ResAllocation-PT-R100C002-05
FORMULA_NAME ResAllocation-PT-R100C002-06
FORMULA_NAME ResAllocation-PT-R100C002-07
FORMULA_NAME ResAllocation-PT-R100C002-08
FORMULA_NAME ResAllocation-PT-R100C002-09
FORMULA_NAME ResAllocation-PT-R100C002-10
FORMULA_NAME ResAllocation-PT-R100C002-11
FORMULA_NAME ResAllocation-PT-R100C002-12
FORMULA_NAME ResAllocation-PT-R100C002-13
FORMULA_NAME ResAllocation-PT-R100C002-14
FORMULA_NAME ResAllocation-PT-R100C002-15
=== Now, execution of the tool begins
BK_START 1590538568666
[2020-05-27 00:16:11] [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 00:16:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 00:16:11] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2020-05-27 00:16:11] [INFO ] Transformed 400 places.
[2020-05-27 00:16:11] [INFO ] Transformed 202 transitions.
[2020-05-27 00:16:11] [INFO ] Parsed PT model containing 400 places and 202 transitions in 175 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 38 resets, run finished after 783 ms. (steps per millisecond=127 ) properties seen :[0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0]
// Phase 1: matrix 202 rows 400 cols
[2020-05-27 00:16:12] [INFO ] Computed 200 place invariants in 19 ms
[2020-05-27 00:16:12] [INFO ] [Real]Absence check using 200 positive place invariants in 127 ms returned sat
[2020-05-27 00:16:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:16:13] [INFO ] [Real]Absence check using state equation in 461 ms returned sat
[2020-05-27 00:16:13] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 34 ms.
[2020-05-27 00:16:14] [INFO ] Added : 192 causal constraints over 39 iterations in 1340 ms. Result :sat
[2020-05-27 00:16:15] [INFO ] [Real]Absence check using 200 positive place invariants in 185 ms returned sat
[2020-05-27 00:16:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:16:15] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2020-05-27 00:16:15] [INFO ] Deduced a trap composed of 4 places in 111 ms
[2020-05-27 00:16:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2020-05-27 00:16:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 00:16:16] [INFO ] [Nat]Absence check using 200 positive place invariants in 212 ms returned sat
[2020-05-27 00:16:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 00:16:16] [INFO ] [Nat]Absence check using state equation in 509 ms returned sat
[2020-05-27 00:16:16] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2020-05-27 00:16:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2020-05-27 00:16:16] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 57 ms.
[2020-05-27 00:16:17] [INFO ] Added : 177 causal constraints over 36 iterations in 866 ms. Result :sat
[2020-05-27 00:16:17] [INFO ] [Real]Absence check using 200 positive place invariants in 71 ms returned sat
[2020-05-27 00:16:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:16:18] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2020-05-27 00:16:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 00:16:18] [INFO ] [Nat]Absence check using 200 positive place invariants in 230 ms returned sat
[2020-05-27 00:16:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 00:16:18] [INFO ] [Nat]Absence check using state equation in 470 ms returned sat
[2020-05-27 00:16:18] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 37 ms.
[2020-05-27 00:16:19] [INFO ] Added : 99 causal constraints over 20 iterations in 463 ms. Result :sat
[2020-05-27 00:16:19] [INFO ] [Real]Absence check using 200 positive place invariants in 391 ms returned sat
[2020-05-27 00:16:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:16:20] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2020-05-27 00:16:20] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 12 ms.
[2020-05-27 00:16:20] [INFO ] Added : 98 causal constraints over 20 iterations in 531 ms. Result :sat
[2020-05-27 00:16:21] [INFO ] [Real]Absence check using 200 positive place invariants in 77 ms returned sat
[2020-05-27 00:16:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:16:21] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2020-05-27 00:16:21] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 34 ms.
[2020-05-27 00:16:21] [INFO ] Added : 98 causal constraints over 20 iterations in 433 ms. Result :sat
[2020-05-27 00:16:22] [INFO ] [Real]Absence check using 200 positive place invariants in 109 ms returned sat
[2020-05-27 00:16:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:16:22] [INFO ] [Real]Absence check using state equation in 396 ms returned sat
[2020-05-27 00:16:22] [INFO ] Deduced a trap composed of 4 places in 28 ms
[2020-05-27 00:16:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2020-05-27 00:16:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 00:16:22] [INFO ] [Nat]Absence check using 200 positive place invariants in 75 ms returned sat
[2020-05-27 00:16:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 00:16:23] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
[2020-05-27 00:16:23] [INFO ] Deduced a trap composed of 4 places in 31 ms
[2020-05-27 00:16:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2020-05-27 00:16:23] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 14 ms.
[2020-05-27 00:16:23] [INFO ] Added : 127 causal constraints over 26 iterations in 447 ms. Result :sat
[2020-05-27 00:16:23] [INFO ] [Real]Absence check using 200 positive place invariants in 87 ms returned sat
[2020-05-27 00:16:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:16:24] [INFO ] [Real]Absence check using state equation in 405 ms returned sat
[2020-05-27 00:16:24] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 10 ms.
[2020-05-27 00:16:24] [INFO ] Added : 97 causal constraints over 20 iterations in 391 ms. Result :sat
[2020-05-27 00:16:24] [INFO ] [Real]Absence check using 200 positive place invariants in 83 ms returned sat
[2020-05-27 00:16:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:16:25] [INFO ] [Real]Absence check using state equation in 490 ms returned sat
[2020-05-27 00:16:26] [INFO ] Deduced a trap composed of 4 places in 1143 ms
[2020-05-27 00:16:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1186 ms
[2020-05-27 00:16:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 00:16:26] [INFO ] [Nat]Absence check using 200 positive place invariants in 147 ms returned sat
[2020-05-27 00:16:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 00:16:27] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2020-05-27 00:16:27] [INFO ] Deduced a trap composed of 4 places in 163 ms
[2020-05-27 00:16:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2020-05-27 00:16:27] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 27 ms.
[2020-05-27 00:16:28] [INFO ] Added : 165 causal constraints over 33 iterations in 1024 ms. Result :sat
[2020-05-27 00:16:28] [INFO ] [Real]Absence check using 200 positive place invariants in 77 ms returned sat
[2020-05-27 00:16:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:16:29] [INFO ] [Real]Absence check using state equation in 411 ms returned sat
[2020-05-27 00:16:29] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 11 ms.
[2020-05-27 00:16:29] [INFO ] Added : 194 causal constraints over 39 iterations in 917 ms. Result :sat
[2020-05-27 00:16:30] [INFO ] [Real]Absence check using 200 positive place invariants in 76 ms returned sat
[2020-05-27 00:16:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:16:30] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2020-05-27 00:16:30] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 18 ms.
[2020-05-27 00:16:31] [INFO ] Added : 194 causal constraints over 39 iterations in 779 ms. Result :sat
[2020-05-27 00:16:31] [INFO ] [Real]Absence check using 200 positive place invariants in 73 ms returned sat
[2020-05-27 00:16:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:16:31] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2020-05-27 00:16:31] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 10 ms.
[2020-05-27 00:16:32] [INFO ] Added : 98 causal constraints over 20 iterations in 388 ms. Result :sat
[2020-05-27 00:16:32] [INFO ] [Real]Absence check using 200 positive place invariants in 81 ms returned sat
[2020-05-27 00:16:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:16:32] [INFO ] [Real]Absence check using state equation in 387 ms returned sat
[2020-05-27 00:16:32] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 25 ms.
[2020-05-27 00:16:33] [INFO ] Added : 98 causal constraints over 20 iterations in 382 ms. Result :sat
[2020-05-27 00:16:33] [INFO ] [Real]Absence check using 200 positive place invariants in 81 ms returned sat
[2020-05-27 00:16:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:16:33] [INFO ] [Real]Absence check using state equation in 384 ms returned sat
[2020-05-27 00:16:33] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 24 ms.
[2020-05-27 00:16:34] [INFO ] Added : 98 causal constraints over 20 iterations in 395 ms. Result :sat
[2020-05-27 00:16:34] [INFO ] [Real]Absence check using 200 positive place invariants in 107 ms returned sat
[2020-05-27 00:16:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:16:34] [INFO ] [Real]Absence check using state equation in 419 ms returned sat
[2020-05-27 00:16:34] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 29 ms.
[2020-05-27 00:16:35] [INFO ] Added : 169 causal constraints over 34 iterations in 700 ms. Result :sat
[2020-05-27 00:16:35] [INFO ] [Real]Absence check using 200 positive place invariants in 108 ms returned sat
[2020-05-27 00:16:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:16:36] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2020-05-27 00:16:36] [INFO ] Deduced a trap composed of 4 places in 32 ms
[2020-05-27 00:16:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2020-05-27 00:16:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 00:16:36] [INFO ] [Nat]Absence check using 200 positive place invariants in 79 ms returned sat
[2020-05-27 00:16:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 00:16:36] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
[2020-05-27 00:16:36] [INFO ] Deduced a trap composed of 4 places in 41 ms
[2020-05-27 00:16:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2020-05-27 00:16:36] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 15 ms.
[2020-05-27 00:16:37] [INFO ] Added : 160 causal constraints over 32 iterations in 487 ms. Result :sat
[2020-05-27 00:16:37] [INFO ] [Real]Absence check using 200 positive place invariants in 86 ms returned sat
[2020-05-27 00:16:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:16:37] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
[2020-05-27 00:16:37] [INFO ] Deduced a trap composed of 5 places in 60 ms
[2020-05-27 00:16:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2020-05-27 00:16:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 00:16:38] [INFO ] [Nat]Absence check using 200 positive place invariants in 81 ms returned sat
[2020-05-27 00:16:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 00:16:38] [INFO ] [Nat]Absence check using state equation in 455 ms returned sat
[2020-05-27 00:16:38] [INFO ] Deduced a trap composed of 5 places in 112 ms
[2020-05-27 00:16:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2020-05-27 00:16:38] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 9 ms.
[2020-05-27 00:16:39] [INFO ] Added : 197 causal constraints over 40 iterations in 695 ms. Result :sat
[2020-05-27 00:16:39] [INFO ] [Real]Absence check using 200 positive place invariants in 83 ms returned sat
[2020-05-27 00:16:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:16:39] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2020-05-27 00:16:39] [INFO ] Deduced a trap composed of 4 places in 32 ms
[2020-05-27 00:16:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2020-05-27 00:16:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 00:16:39] [INFO ] [Nat]Absence check using 200 positive place invariants in 74 ms returned sat
[2020-05-27 00:16:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 00:16:40] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2020-05-27 00:16:40] [INFO ] Deduced a trap composed of 4 places in 49 ms
[2020-05-27 00:16:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2020-05-27 00:16:40] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 24 ms.
[2020-05-27 00:16:41] [INFO ] Added : 170 causal constraints over 34 iterations in 566 ms. Result :sat
[2020-05-27 00:16:41] [INFO ] [Real]Absence check using 200 positive place invariants in 79 ms returned sat
[2020-05-27 00:16:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:16:41] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2020-05-27 00:16:41] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 30 ms.
[2020-05-27 00:16:41] [INFO ] Added : 98 causal constraints over 20 iterations in 403 ms. Result :sat
[2020-05-27 00:16:42] [INFO ] [Real]Absence check using 200 positive place invariants in 84 ms returned sat
[2020-05-27 00:16:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:16:42] [INFO ] [Real]Absence check using state equation in 389 ms returned sat
[2020-05-27 00:16:42] [INFO ] Deduced a trap composed of 4 places in 23 ms
[2020-05-27 00:16:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2020-05-27 00:16:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 00:16:42] [INFO ] [Nat]Absence check using 200 positive place invariants in 77 ms returned sat
[2020-05-27 00:16:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 00:16:43] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2020-05-27 00:16:43] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2020-05-27 00:16:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2020-05-27 00:16:43] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 23 ms.
[2020-05-27 00:16:43] [INFO ] Added : 181 causal constraints over 37 iterations in 673 ms. Result :sat
[2020-05-27 00:16:43] [INFO ] [Real]Absence check using 200 positive place invariants in 143 ms returned sat
[2020-05-27 00:16:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:16:44] [INFO ] [Real]Absence check using state equation in 377 ms returned sat
[2020-05-27 00:16:44] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 13 ms.
[2020-05-27 00:16:44] [INFO ] Added : 98 causal constraints over 20 iterations in 355 ms. Result :sat
[2020-05-27 00:16:44] [INFO ] [Real]Absence check using 200 positive place invariants in 67 ms returned sat
[2020-05-27 00:16:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:16:45] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2020-05-27 00:16:45] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 9 ms.
[2020-05-27 00:16:45] [INFO ] Added : 98 causal constraints over 20 iterations in 374 ms. Result :sat
[2020-05-27 00:16:45] [INFO ] [Real]Absence check using 200 positive place invariants in 68 ms returned sat
[2020-05-27 00:16:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:16:46] [INFO ] [Real]Absence check using state equation in 401 ms returned sat
[2020-05-27 00:16:46] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 11 ms.
[2020-05-27 00:16:46] [INFO ] Added : 98 causal constraints over 20 iterations in 359 ms. Result :sat
[2020-05-27 00:16:46] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-27 00:16:46] [INFO ] Flatten gal took : 141 ms
FORMULA ResAllocation-PT-R100C002-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 00:16:46] [INFO ] Flatten gal took : 55 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 00:16:47] [INFO ] Applying decomposition
[2020-05-27 00:16:47] [INFO ] Flatten gal took : 24 ms
[2020-05-27 00:16:47] [INFO ] Input system was already deterministic with 202 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/graph10880443912303753449.txt, -o, /tmp/graph10880443912303753449.bin, -w, /tmp/graph10880443912303753449.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/graph10880443912303753449.bin, -l, -1, -v, -w, /tmp/graph10880443912303753449.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 00:16:47] [INFO ] Decomposing Gal with order
[2020-05-27 00:16:47] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 202 rows 400 cols
[2020-05-27 00:16:47] [INFO ] Computed 200 place invariants in 11 ms
inv : p_0_84 + r_0_84 + p_1_84 = 1
inv : p_0_75 + r_0_75 + p_1_75 = 1
inv : p_0_93 + r_0_93 + p_1_93 = 1
inv : p_1_85 + r_1_85 = 1
inv : p_1_95 + r_1_95 = 1
inv : p_1_75 + r_1_75 = 1
inv : p_0_57 + r_0_57 + p_1_57 = 1
inv : p_0_66 + r_0_66 + p_1_66 = 1
inv : p_0_7 + r_0_7 + p_1_7 = 1
inv : p_1_70 + r_1_70 = 1
inv : p_0_21 + r_0_21 + p_1_21 = 1
inv : p_1_90 + r_1_90 = 1
inv : p_1_55 + r_1_55 = 1
inv : p_1_7 + r_1_7 = 1
inv : p_1_65 + r_1_65 = 1
inv : p_0_30 + r_0_30 + p_1_30 = 1
inv : p_0_16 + r_0_16 + p_1_16 = 1
inv : p_0_34 + r_0_34 + p_1_34 = 1
inv : p_1_12 + r_1_12 = 1
inv : p_0_48 + r_0_48 + p_1_48 = 1
inv : p_1_25 + r_1_25 = 1
inv : p_0_61 + r_0_61 + p_1_61 = 1
inv : p_1_17 + r_1_17 = 1
inv : p_1_20 + r_1_20 = 1
inv : p_1_60 + r_1_60 = 1
inv : p_0_3 + r_0_3 + p_1_3 = 1
inv : p_1_42 + r_1_42 = 1
inv : p_1_0 + r_1_0 = 1
inv : p_1_10 + r_1_10 = 1
inv : p_0_53 + r_0_53 + p_1_53 = 1
inv : p_0_89 + r_0_89 + p_1_89 = 1
inv : p_0_79 + r_0_79 + p_1_79 = 1
inv : p_1_57 + r_1_57 = 1
inv : p_1_67 + r_1_67 = 1
inv : p_1_35 + r_1_35 = 1
inv : p_1_22 + r_1_22 = 1
inv : p_0_29 + r_0_29 + p_1_29 = 1
inv : p_0_44 + r_0_44 + p_1_44 = 1
inv : p_1_77 + r_1_77 = 1
inv : p_0_8 + r_0_8 + p_1_8 = 1
inv : p_1_45 + r_1_45 = 1
inv : p_0_38 + r_0_38 + p_1_38 = 1
inv : p_0_12 + r_0_12 + p_1_12 = 1
inv : p_1_93 + r_1_93 = 1
inv : p_0_70 + r_0_70 + p_1_70 = 1
inv : p_0_83 + r_0_83 + p_1_83 = 1
inv : p_0_98 + r_0_98 + p_1_98 = 1
inv : p_0_85 + r_0_85 + p_1_85 = 1
inv : p_1_32 + r_1_32 = 1
inv : p_1_80 + r_1_80 = 1
inv : p_0_25 + r_0_25 + p_1_25 = 1
inv : p_1_63 + r_1_63 = 1
inv : p_1_58 + r_1_58 = 1
inv : p_0_67 + r_0_67 + p_1_67 = 1
inv : p_1_83 + r_1_83 = 1
inv : p_0_49 + r_0_49 + p_1_49 = 1
inv : p_0_15 + r_0_15 + p_1_15 = 1
inv : p_0_94 + r_0_94 + p_1_94 = 1
inv : p_1_43 + r_1_43 = 1
inv : p_0_22 + r_0_22 + p_1_22 = 1
inv : p_0_74 + r_0_74 + p_1_74 = 1
inv : p_1_14 + r_1_14 = 1
inv : p_1_19 + r_1_19 = 1
inv : p_1_78 + r_1_78 = 1
inv : p_1_98 + r_1_98 = 1
inv : p_0_60 + r_0_60 + p_1_60 = 1
inv : p_1_23 + r_1_23 = 1
inv : p_0_78 + r_0_78 + p_1_78 = 1
inv : p_0_90 + r_0_90 + p_1_90 = 1
inv : p_1_49 + r_1_49 = 1
inv : p_1_87 + r_1_87 = 1
inv : p_0_63 + r_0_63 + p_1_63 = 1
inv : p_0_33 + r_0_33 + p_1_33 = 1
inv : p_0_4 + r_0_4 + p_1_4 = 1
inv : p_1_28 + r_1_28 = 1
inv : p_1_52 + r_1_52 = 1
inv : p_1_92 + r_1_92 = 1
inv : p_1_5 + r_1_5 = 1
inv : p_1_37 + r_1_37 = 1
inv : p_1_69 + r_1_69 = 1
inv : p_0_45 + r_0_45 + p_1_45 = 1
inv : p_0_71 + r_0_71 + p_1_71 = 1
inv : p_0_97 + r_0_97 + p_1_97 = 1
inv : p_0_52 + r_0_52 + p_1_52 = 1
inv : p_0_0 + r_0_0 + p_1_0 = 1
inv : p_0_37 + r_0_37 + p_1_37 = 1
inv : p_1_34 + r_1_34 = 1
inv : p_1_2 + r_1_2 = 1
inv : p_1_8 + r_1_8 = 1
inv : p_0_56 + r_0_56 + p_1_56 = 1
inv : p_0_82 + r_0_82 + p_1_82 = 1
inv : p_0_86 + r_0_86 + p_1_86 = 1
inv : p_0_26 + r_0_26 + p_1_26 = 1
inv : p_0_11 + r_0_11 + p_1_11 = 1
inv : p_1_40 + r_1_40 = 1
inv : p_1_72 + r_1_72 = 1
inv : p_1_26 + r_1_26 = 1
inv : p_1_31 + r_1_31 = 1
inv : p_1_21 + r_1_21 = 1
inv : p_1_16 + r_1_16 = 1
inv : p_0_41 + r_0_41 + p_1_41 = 1
inv : p_0_5 + r_0_5 + p_1_5 = 1
inv : p_0_23 + r_0_23 + p_1_23 = 1
inv : p_1_51 + r_1_51 = 1
inv : p_1_46 + r_1_46 = 1
inv : p_1_6 + r_1_6 = 1
inv : p_0_50 + r_0_50 + p_1_50 = 1
inv : p_0_59 + r_0_59 + p_1_59 = 1
inv : p_1_11 + r_1_11 = 1
inv : p_1_66 + r_1_66 = 1
inv : p_0_14 + r_0_14 + p_1_14 = 1
inv : p_1_71 + r_1_71 = 1
inv : p_1_81 + r_1_81 = 1
inv : p_0_64 + r_0_64 + p_1_64 = 1
inv : p_1_1 + r_1_1 = 1
inv : p_1_41 + r_1_41 = 1
inv : p_0_46 + r_0_46 + p_1_46 = 1
inv : p_1_36 + r_1_36 = 1
inv : p_0_32 + r_0_32 + p_1_32 = 1
inv : p_0_77 + r_0_77 + p_1_77 = 1
inv : p_0_18 + r_0_18 + p_1_18 = 1
inv : p_0_91 + r_0_91 + p_1_91 = 1
inv : p_1_76 + r_1_76 = 1
inv : p_1_84 + r_1_84 = 1
inv : p_0_19 + r_0_19 + p_1_19 = 1
inv : p_0_27 + r_0_27 + p_1_27 = 1
inv : p_1_89 + r_1_89 = 1
inv : p_1_99 + r_1_99 = 1
inv : p_0_1 + r_0_1 + p_1_1 = 1
inv : p_0_72 + r_0_72 + p_1_72 = 1
inv : p_0_96 + r_0_96 + p_1_96 = 1
inv : p_1_54 + r_1_54 = 1
inv : p_0_81 + r_0_81 + p_1_81 = 1
inv : p_0_87 + r_0_87 + p_1_87 = 1
inv : p_1_3 + r_1_3 = 1
inv : p_1_74 + r_1_74 = 1
inv : p_1_86 + r_1_86 = 1
inv : p_0_36 + r_0_36 + p_1_36 = 1
inv : p_1_29 + r_1_29 = 1
inv : p_1_13 + r_1_13 = 1
inv : p_0_68 + r_0_68 + p_1_68 = 1
inv : p_0_42 + r_0_42 + p_1_42 = 1
inv : p_1_61 + r_1_61 = 1
inv : p_1_48 + r_1_48 = 1
inv : p_0_55 + r_0_55 + p_1_55 = 1
inv : p_1_64 + r_1_64 = 1
inv : p_0_10 + r_0_10 + p_1_10 = 1
inv : p_0_40 + r_0_40 + p_1_40 = 1
inv : p_1_96 + r_1_96 = 1
inv : p_1_73 + r_1_73 = 1
inv : p_1_53 + r_1_53 = 1
inv : p_0_31 + r_0_31 + p_1_31 = 1
inv : p_1_38 + r_1_38 = 1
inv : p_0_13 + r_0_13 + p_1_13 = 1
inv : p_0_65 + r_0_65 + p_1_65 = 1
inv : p_0_6 + r_0_6 + p_1_6 = 1
inv : p_0_51 + r_0_51 + p_1_51 = 1
inv : p_0_58 + r_0_58 + p_1_58 = 1
inv : p_1_39 + r_1_39 = 1
inv : p_0_20 + r_0_20 + p_1_20 = 1
inv : p_1_97 + r_1_97 = 1
inv : p_1_33 + r_1_33 = 1
inv : p_1_4 + r_1_4 = 1
inv : p_0_76 + r_0_76 + p_1_76 = 1
inv : p_0_2 + r_0_2 + p_1_2 = 1
inv : p_1_9 + r_1_9 = 1
inv : p_1_44 + r_1_44 = 1
inv : p_0_17 + r_0_17 + p_1_17 = 1
inv : p_0_92 + r_0_92 + p_1_92 = 1
inv : p_1_68 + r_1_68 = 1
inv : p_0_47 + r_0_47 + p_1_47 = 1
inv : p_0_62 + r_0_62 + p_1_62 = 1
inv : p_1_79 + r_1_79 = 1
inv : p_1_47 + r_1_47 = 1
inv : p_1_15 + r_1_15 = 1
inv : p_1_30 + r_1_30 = 1
inv : p_1_59 + r_1_59 = 1
inv : p_1_62 + r_1_62 = 1
inv : p_1_27 + r_1_27 = 1
inv : p_0_28 + r_0_28 + p_1_28 = 1
inv : p_0_35 + r_0_35 + p_1_35 = 1
inv : p_0_80 + r_0_80 + p_1_80 = 1
inv : p_0_43 + r_0_43 + p_1_43 = 1
inv : p_0_88 + r_0_88 + p_1_88 = 1
inv : p_0_95 + r_0_95 + p_1_95 = 1
inv : p_1_82 + r_1_82 = 1
inv : p_0_73 + r_0_73 + p_1_73 = 1
inv : p_1_94 + r_1_94 = 1
inv : p_1_50 + r_1_50 = 1
inv : p_1_24 + r_1_24 = 1
inv : p_1_18 + r_1_18 = 1
inv : p_1_91 + r_1_91 = 1
inv : p_0_9 + r_0_9 + p_1_9 = 1
inv : p_0_39 + r_0_39 + p_1_39 = 1
inv : p_0_24 + r_0_24 + p_1_24 = 1
inv : p_0_54 + r_0_54 + p_1_54 = 1
inv : p_1_56 + r_1_56 = 1
inv : p_0_69 + r_0_69 + p_1_69 = 1
inv : p_0_99 + r_0_99 + p_1_99 = 1
inv : p_1_88 + r_1_88 = 1
Total of 200 invariants.
[2020-05-27 00:16:47] [INFO ] Computed 200 place invariants in 27 ms
[2020-05-27 00:16:47] [INFO ] Flatten gal took : 142 ms
[2020-05-27 00:16:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2020-05-27 00:16:47] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 18 ms
[2020-05-27 00:16:47] [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 13 LTL properties
Checking formula 0 : !((G(X((X("((i13.u94.p_0_94>=1)&&(i13.u95.r_0_95>=1))"))||("((i13.u94.p_0_94>=1)&&(i13.u95.r_0_95>=1))")))))
Formula 0 simplified : !GX("((i13.u94.p_0_94>=1)&&(i13.u95.r_0_95>=1))" | X"((i13.u94.p_0_94>=1)&&(i13.u95.r_0_95>=1))")
built 13 ordering constraints for composite.
built 12 ordering constraints for composite.
built 16 ordering constraints for composite.
built 18 ordering constraints for composite.
built 16 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 18 ordering constraints for composite.
built 20 ordering constraints for composite.
built 16 ordering constraints for composite.
built 20 ordering constraints for composite.
built 20 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions i0.t_1_0, i13.u99.t_0_100, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/200/2/202
Computing Next relation with stutter on 99 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
108 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,1.1617,41256,1,0,58909,143,3054,76477,49,173,128214
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R100C002-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((X((X(F("(((i10.u70.r_0_70>=1)&&(i10.u170.r_1_70>=1))&&(i10.u171.p_1_71>=1))")))||(X("(((i10.u70.r_0_70>=1)&&(i10.u170.r_1_70>=1))&&(i10.u171.p_1_71>=1))"))))&&(X(X(G((X("((i11.u79.p_0_79>=1)&&(i11.u80.r_0_80>=1))"))U("((i11.u79.p_0_79>=1)&&(i11.u80.r_0_80>=1))")))))))
Formula 1 simplified : !(X(XF"(((i10.u70.r_0_70>=1)&&(i10.u170.r_1_70>=1))&&(i10.u171.p_1_71>=1))" | X"(((i10.u70.r_0_70>=1)&&(i10.u170.r_1_70>=1))&&(i10.u171.p_1_71>=1))") & XXG(X"((i11.u79.p_0_79>=1)&&(i11.u80.r_0_80>=1))" U "((i11.u79.p_0_79>=1)&&(i11.u80.r_0_80>=1))"))
Computing Next relation with stutter on 99 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
26 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,1.43778,53452,1,0,82212,143,3091,137697,49,173,157567
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ResAllocation-PT-R100C002-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((G("(((i7.u51.r_0_51>=1)&&(i7.u151.r_1_51>=1))&&(i8.i0.i0.u152.p_1_52>=1))"))U(X(G(((((((F("(((i7.u51.r_0_51>=1)&&(i7.u151.r_1_51>=1))&&(i8.i0.i0.u152.p_1_52>=1))"))&&("(i0.u0.r_0_0>=1)"))&&("(i0.u100.r_1_0>=1)"))&&("(i0.u101.p_1_1>=1)"))&&("(i9.u64.r_0_64>=1)"))&&("(i9.u164.r_1_64>=1)"))&&("(i9.u165.p_1_65>=1)"))))))
Formula 2 simplified : !(G"(((i7.u51.r_0_51>=1)&&(i7.u151.r_1_51>=1))&&(i8.i0.i0.u152.p_1_52>=1))" U XG("(i0.u0.r_0_0>=1)" & "(i0.u100.r_1_0>=1)" & "(i0.u101.p_1_1>=1)" & "(i9.u64.r_0_64>=1)" & "(i9.u164.r_1_64>=1)" & "(i9.u165.p_1_65>=1)" & F"(((i7.u51.r_0_51>=1)&&(i7.u151.r_1_51>=1))&&(i8.i0.i0.u152.p_1_52>=1))"))
Computing Next relation with stutter on 99 deadlock states
[2020-05-27 00:16:51] [INFO ] Proved 400 variables to be positive in 3903 ms
[2020-05-27 00:16:51] [INFO ] Computing symmetric may disable matrix : 202 transitions.
[2020-05-27 00:16:51] [INFO ] Computation of disable matrix completed :0/202 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 00:16:51] [INFO ] Computation of Complete disable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 00:16:51] [INFO ] Computing symmetric may enable matrix : 202 transitions.
[2020-05-27 00:16:51] [INFO ] Computation of Complete enable matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 00:16:53] [INFO ] Computing symmetric co enabling matrix : 202 transitions.
[2020-05-27 00:16:54] [INFO ] Computation of co-enabling matrix(64/202) took 1405 ms. Total solver calls (SAT/UNSAT): 259(65/194)
[2020-05-27 00:16:57] [INFO ] Computation of co-enabling matrix(162/202) took 4412 ms. Total solver calls (SAT/UNSAT): 463(100/363)
[2020-05-27 00:16:58] [INFO ] Computation of Finished co-enabling matrix. took 4930 ms. Total solver calls (SAT/UNSAT): 501(100/401)
[2020-05-27 00:16:58] [INFO ] Computing Do-Not-Accords matrix : 202 transitions.
[2020-05-27 00:16:58] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 00:16:58] [INFO ] Built C files in 11090ms 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 3534 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 116 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ([]((LTLAP3==true)))U(X([](( ( ( ( ( ( <>((LTLAP3==true)) ) && ( (LTLAP4==true) ) ) && ( (LTLAP5==true) ) ) && ( (LTLAP6==true) ) ) && ( (LTLAP7==true) ) ) && ( (LTLAP8==true) ) ) && ( (LTLAP9==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, ([]((LTLAP3==true)))U(X([](( ( ( ( ( ( <>((LTLAP3==true)) ) && ( (LTLAP4==true) ) ) && ( (LTLAP5==true) ) ) && ( (LTLAP6==true) ) ) && ( (LTLAP7==true) ) ) && ( (LTLAP8==true) ) ) && ( (LTLAP9==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, ([]((LTLAP3==true)))U(X([](( ( ( ( ( ( <>((LTLAP3==true)) ) && ( (LTLAP4==true) ) ) && ( (LTLAP5==true) ) ) && ( (LTLAP6==true) ) ) && ( (LTLAP7==true) ) ) && ( (LTLAP8==true) ) ) && ( (LTLAP9==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)
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
12266 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,124.114,1866176,1,0,2.9856e+06,143,3253,3.26211e+06,51,173,1929705
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ResAllocation-PT-R100C002-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((F("(((i3.u20.r_0_20>=1)&&(i3.u120.r_1_20>=1))&&(i3.u121.p_1_21>=1))"))U(G((F("(((i3.u20.r_0_20>=1)&&(i3.u120.r_1_20>=1))&&(i3.u121.p_1_21>=1))"))U(F((G("((i4.u30.p_0_30<1)||(i5.u31.r_0_31<1))"))U("(((((i3.u20.r_0_20>=1)&&(i3.u120.r_1_20>=1))&&(i3.u121.p_1_21>=1))&&(i4.u30.p_0_30>=1))&&(i5.u31.r_0_31>=1))")))))))
Formula 3 simplified : !(F"(((i3.u20.r_0_20>=1)&&(i3.u120.r_1_20>=1))&&(i3.u121.p_1_21>=1))" U G(F"(((i3.u20.r_0_20>=1)&&(i3.u120.r_1_20>=1))&&(i3.u121.p_1_21>=1))" U F(G"((i4.u30.p_0_30<1)||(i5.u31.r_0_31<1))" U "(((((i3.u20.r_0_20>=1)&&(i3.u120.r_1_20>=1))&&(i3.u121.p_1_21>=1))&&(i4.u30.p_0_30>=1))&&(i5.u31.r_0_31>=1))")))
Computing Next relation with stutter on 99 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 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,124.123,1866176,1,0,2.98579e+06,143,3306,3.26296e+06,51,173,1929894
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ResAllocation-PT-R100C002-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F((X((G("(((i8.i0.i1.u55.r_0_55>=1)&&(i8.i0.i1.u155.r_1_55>=1))&&(i8.i0.i1.u156.p_1_56>=1))"))||("((i2.u17.p_0_17>=1)&&(i3.u18.r_0_18>=1))")))U(X(X((((G("(((i9.u63.r_0_63>=1)&&(i9.u163.r_1_63>=1))&&(i9.u164.p_1_64>=1))"))&&("(i9.u63.r_0_63>=1)"))&&("(i9.u163.r_1_63>=1)"))&&("(i9.u164.p_1_64>=1)")))))))
Formula 4 simplified : !F(X("((i2.u17.p_0_17>=1)&&(i3.u18.r_0_18>=1))" | G"(((i8.i0.i1.u55.r_0_55>=1)&&(i8.i0.i1.u155.r_1_55>=1))&&(i8.i0.i1.u156.p_1_56>=1))") U XX("(i9.u63.r_0_63>=1)" & "(i9.u163.r_1_63>=1)" & "(i9.u164.p_1_64>=1)" & G"(((i9.u63.r_0_63>=1)&&(i9.u163.r_1_63>=1))&&(i9.u164.p_1_64>=1))"))
Computing Next relation with stutter on 99 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
24 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,124.358,1873040,1,0,3.00111e+06,143,3389,3.28914e+06,55,173,1945500
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ResAllocation-PT-R100C002-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G((F(G("((i10.u69.p_0_69>=1)&&(i10.u70.r_0_70>=1))")))||(((!(X("(((i8.i0.i0.u53.r_0_53>=1)&&(i8.i0.i0.u153.r_1_53>=1))&&(i8.i0.i0.u154.p_1_54>=1))")))&&("(i13.u96.p_0_96>=1)"))&&("(i13.u97.r_0_97>=1)")))))
Formula 5 simplified : !G(FG"((i10.u69.p_0_69>=1)&&(i10.u70.r_0_70>=1))" | ("(i13.u96.p_0_96>=1)" & "(i13.u97.r_0_97>=1)" & !X"(((i8.i0.i0.u53.r_0_53>=1)&&(i8.i0.i0.u153.r_1_53>=1))&&(i8.i0.i0.u154.p_1_54>=1))"))
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
[2020-05-27 00:36:59] [INFO ] Flatten gal took : 35 ms
[2020-05-27 00:36:59] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2020-05-27 00:36:59] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 7 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, --gen-order, FOLLOW], 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 --gen-order FOLLOW
Read 8 LTL properties
Checking formula 0 : !((G((F(G("((p_0_69>=1)&&(r_0_70>=1))")))||(((!(X("(((r_0_53>=1)&&(r_1_53>=1))&&(p_1_54>=1))")))&&("(p_0_96>=1)"))&&("(r_0_97>=1)")))))
Formula 0 simplified : !G(FG"((p_0_69>=1)&&(r_0_70>=1))" | ("(p_0_96>=1)" & "(r_0_97>=1)" & !X"(((r_0_53>=1)&&(r_1_53>=1))&&(p_1_54>=1))"))
Reverse transition relation is NOT exact ! Due to transitions t_0_100, t_1_0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/200/2/202
Computing Next relation with stutter on 99 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
40028 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,400.322,2685900,1,0,9230,1.5867e+07,24,7841,5612,2.37652e+07,15657
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R100C002-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((!((!(X(!((G("((p_0_96>=1)&&(r_0_97>=1))"))U(X("(((r_0_39>=1)&&(r_1_39>=1))&&(p_1_40>=1))"))))))U("((p_0_96>=1)&&(r_0_97>=1))"))))
Formula 1 simplified : !X!(G"((p_0_96>=1)&&(r_0_97>=1))" U X"(((r_0_39>=1)&&(r_1_39>=1))&&(p_1_40>=1))") U "((p_0_96>=1)&&(r_0_97>=1))"
Computing Next relation with stutter on 99 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
9 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,400.411,2686288,1,0,9235,1.5867e+07,38,7846,6917,2.37652e+07,15680
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R100C002-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(((F("((p_0_62>=1)&&(r_0_63>=1))"))||(X(X((!(X("(p_0_99>=1)")))&&(!(G(!(F("((p_0_33>=1)&&(r_0_34>=1))"))))))))))
Formula 2 simplified : !(F"((p_0_62>=1)&&(r_0_63>=1))" | XX(!X"(p_0_99>=1)" & !G!F"((p_0_33>=1)&&(r_0_34>=1))"))
Computing Next relation with stutter on 99 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
10219 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,502.603,2952400,1,0,12335,1.73328e+07,17,10877,5479,2.64982e+07,17673
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ResAllocation-PT-R100C002-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((F("((p_0_84>=1)&&(r_0_85>=1))")))
Formula 3 simplified : !F"((p_0_84>=1)&&(r_0_85>=1))"
Computing Next relation with stutter on 99 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
12861 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,631.209,3245580,1,0,13740,1.95868e+07,17,16639,5576,2.75765e+07,8800
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ResAllocation-PT-R100C002-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(((F(X(X(X(G("((p_0_85<1)||(r_0_86<1))"))))))U("((p_0_36>=1)&&(r_0_37>=1))")))
Formula 4 simplified : !(FXXXG"((p_0_85<1)||(r_0_86<1))" U "((p_0_36>=1)&&(r_0_37>=1))")
Computing Next relation with stutter on 99 deadlock states
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="ResAllocation-PT-R100C002"
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 ResAllocation-PT-R100C002, 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 r193-csrt-159033389000618"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R100C002.tgz
mv ResAllocation-PT-R100C002 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 ;