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.r180-ebro-158987900000298.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 itslola
Input is DES-PT-40b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900000298
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 284K
-rw-r--r-- 1 mcc users 2.9K Mar 30 01:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 30 01:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 08:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 08:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 26 08:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 26 08:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 115K Mar 24 05:37 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 DES-PT-40b-00
FORMULA_NAME DES-PT-40b-01
FORMULA_NAME DES-PT-40b-02
FORMULA_NAME DES-PT-40b-03
FORMULA_NAME DES-PT-40b-04
FORMULA_NAME DES-PT-40b-05
FORMULA_NAME DES-PT-40b-06
FORMULA_NAME DES-PT-40b-07
FORMULA_NAME DES-PT-40b-08
FORMULA_NAME DES-PT-40b-09
FORMULA_NAME DES-PT-40b-10
FORMULA_NAME DES-PT-40b-11
FORMULA_NAME DES-PT-40b-12
FORMULA_NAME DES-PT-40b-13
FORMULA_NAME DES-PT-40b-14
FORMULA_NAME DES-PT-40b-15

=== Now, execution of the tool begins

BK_START 1591192695783

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 13:58:19] [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, -timeout, 3600, -rebuildPNML]
[2020-06-03 13:58:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 13:58:19] [INFO ] Load time of PNML (sax parser for PT used): 200 ms
[2020-06-03 13:58:19] [INFO ] Transformed 439 places.
[2020-06-03 13:58:19] [INFO ] Transformed 390 transitions.
[2020-06-03 13:58:19] [INFO ] Found NUPN structural information;
[2020-06-03 13:58:19] [INFO ] Parsed PT model containing 439 places and 390 transitions in 299 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 64 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 850 resets, run finished after 577 ms. (steps per millisecond=173 ) properties seen :[0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 390 rows 439 cols
[2020-06-03 13:58:20] [INFO ] Computed 65 place invariants in 78 ms
[2020-06-03 13:58:20] [INFO ] [Real]Absence check using 39 positive place invariants in 83 ms returned sat
[2020-06-03 13:58:20] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 48 ms returned sat
[2020-06-03 13:58:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:58:21] [INFO ] [Real]Absence check using state equation in 1108 ms returned sat
[2020-06-03 13:58:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:58:22] [INFO ] [Nat]Absence check using 39 positive place invariants in 100 ms returned sat
[2020-06-03 13:58:22] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 113 ms returned sat
[2020-06-03 13:58:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:58:23] [INFO ] [Nat]Absence check using state equation in 1138 ms returned sat
[2020-06-03 13:58:23] [INFO ] Deduced a trap composed of 8 places in 280 ms
[2020-06-03 13:58:23] [INFO ] Deduced a trap composed of 19 places in 102 ms
[2020-06-03 13:58:23] [INFO ] Deduced a trap composed of 20 places in 85 ms
[2020-06-03 13:58:24] [INFO ] Deduced a trap composed of 21 places in 91 ms
[2020-06-03 13:58:24] [INFO ] Deduced a trap composed of 18 places in 135 ms
[2020-06-03 13:58:24] [INFO ] Deduced a trap composed of 17 places in 136 ms
[2020-06-03 13:58:24] [INFO ] Deduced a trap composed of 16 places in 147 ms
[2020-06-03 13:58:24] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1343 ms
[2020-06-03 13:58:24] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 53 ms.
[2020-06-03 13:58:30] [INFO ] Added : 326 causal constraints over 66 iterations in 5500 ms. Result :sat
[2020-06-03 13:58:30] [INFO ] Deduced a trap composed of 57 places in 268 ms
[2020-06-03 13:58:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 407 ms
[2020-06-03 13:58:30] [INFO ] [Real]Absence check using 39 positive place invariants in 59 ms returned sat
[2020-06-03 13:58:30] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 46 ms returned sat
[2020-06-03 13:58:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:58:31] [INFO ] [Real]Absence check using state equation in 1044 ms returned sat
[2020-06-03 13:58:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:58:32] [INFO ] [Nat]Absence check using 39 positive place invariants in 91 ms returned sat
[2020-06-03 13:58:32] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 50 ms returned sat
[2020-06-03 13:58:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:58:33] [INFO ] [Nat]Absence check using state equation in 1058 ms returned sat
[2020-06-03 13:58:33] [INFO ] Deduced a trap composed of 20 places in 401 ms
[2020-06-03 13:58:33] [INFO ] Deduced a trap composed of 18 places in 263 ms
[2020-06-03 13:58:34] [INFO ] Deduced a trap composed of 15 places in 208 ms
[2020-06-03 13:58:34] [INFO ] Deduced a trap composed of 12 places in 193 ms
[2020-06-03 13:58:34] [INFO ] Deduced a trap composed of 14 places in 158 ms
[2020-06-03 13:58:34] [INFO ] Deduced a trap composed of 13 places in 148 ms
[2020-06-03 13:58:35] [INFO ] Deduced a trap composed of 16 places in 150 ms
[2020-06-03 13:58:35] [INFO ] Deduced a trap composed of 20 places in 151 ms
[2020-06-03 13:58:35] [INFO ] Deduced a trap composed of 21 places in 166 ms
[2020-06-03 13:58:35] [INFO ] Deduced a trap composed of 18 places in 382 ms
[2020-06-03 13:58:36] [INFO ] Deduced a trap composed of 17 places in 293 ms
[2020-06-03 13:58:36] [INFO ] Deduced a trap composed of 14 places in 135 ms
[2020-06-03 13:58:36] [INFO ] Deduced a trap composed of 24 places in 130 ms
[2020-06-03 13:58:36] [INFO ] Deduced a trap composed of 24 places in 191 ms
[2020-06-03 13:58:36] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3609 ms
[2020-06-03 13:58:36] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 46 ms.
[2020-06-03 13:58:42] [INFO ] Added : 320 causal constraints over 64 iterations in 5465 ms. Result :sat
[2020-06-03 13:58:42] [INFO ] [Real]Absence check using 39 positive place invariants in 48 ms returned sat
[2020-06-03 13:58:42] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 32 ms returned unsat
[2020-06-03 13:58:42] [INFO ] [Real]Absence check using 39 positive place invariants in 72 ms returned sat
[2020-06-03 13:58:42] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 71 ms returned sat
[2020-06-03 13:58:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:58:44] [INFO ] [Real]Absence check using state equation in 1122 ms returned sat
[2020-06-03 13:58:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:58:44] [INFO ] [Nat]Absence check using 39 positive place invariants in 89 ms returned sat
[2020-06-03 13:58:44] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 47 ms returned sat
[2020-06-03 13:58:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:58:45] [INFO ] [Nat]Absence check using state equation in 1010 ms returned sat
[2020-06-03 13:58:45] [INFO ] Deduced a trap composed of 8 places in 340 ms
[2020-06-03 13:58:46] [INFO ] Deduced a trap composed of 24 places in 226 ms
[2020-06-03 13:58:46] [INFO ] Deduced a trap composed of 14 places in 178 ms
[2020-06-03 13:58:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 918 ms
[2020-06-03 13:58:46] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 57 ms.
[2020-06-03 13:58:52] [INFO ] Added : 295 causal constraints over 60 iterations in 5801 ms. Result :sat
[2020-06-03 13:58:52] [INFO ] Deduced a trap composed of 33 places in 224 ms
[2020-06-03 13:58:52] [INFO ] Deduced a trap composed of 54 places in 189 ms
[2020-06-03 13:58:52] [INFO ] Deduced a trap composed of 52 places in 199 ms
[2020-06-03 13:58:53] [INFO ] Deduced a trap composed of 28 places in 201 ms
[2020-06-03 13:58:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1267 ms
[2020-06-03 13:58:53] [INFO ] [Real]Absence check using 39 positive place invariants in 49 ms returned sat
[2020-06-03 13:58:53] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 44 ms returned sat
[2020-06-03 13:58:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:58:54] [INFO ] [Real]Absence check using state equation in 1156 ms returned sat
[2020-06-03 13:58:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:58:54] [INFO ] [Nat]Absence check using 39 positive place invariants in 86 ms returned sat
[2020-06-03 13:58:55] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 133 ms returned sat
[2020-06-03 13:58:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:58:56] [INFO ] [Nat]Absence check using state equation in 1694 ms returned sat
[2020-06-03 13:58:57] [INFO ] Deduced a trap composed of 8 places in 255 ms
[2020-06-03 13:58:57] [INFO ] Deduced a trap composed of 32 places in 259 ms
[2020-06-03 13:58:57] [INFO ] Deduced a trap composed of 22 places in 263 ms
[2020-06-03 13:58:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 917 ms
[2020-06-03 13:58:57] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 42 ms.
[2020-06-03 13:59:03] [INFO ] Added : 353 causal constraints over 71 iterations in 5355 ms. Result :sat
[2020-06-03 13:59:03] [INFO ] Deduced a trap composed of 57 places in 229 ms
[2020-06-03 13:59:03] [INFO ] Deduced a trap composed of 56 places in 184 ms
[2020-06-03 13:59:04] [INFO ] Deduced a trap composed of 35 places in 168 ms
[2020-06-03 13:59:04] [INFO ] Deduced a trap composed of 28 places in 219 ms
[2020-06-03 13:59:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1363 ms
[2020-06-03 13:59:04] [INFO ] [Real]Absence check using 39 positive place invariants in 61 ms returned sat
[2020-06-03 13:59:04] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 43 ms returned sat
[2020-06-03 13:59:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:59:05] [INFO ] [Real]Absence check using state equation in 1021 ms returned sat
[2020-06-03 13:59:05] [INFO ] Deduced a trap composed of 16 places in 261 ms
[2020-06-03 13:59:06] [INFO ] Deduced a trap composed of 20 places in 375 ms
[2020-06-03 13:59:06] [INFO ] Deduced a trap composed of 35 places in 237 ms
[2020-06-03 13:59:06] [INFO ] Deduced a trap composed of 24 places in 113 ms
[2020-06-03 13:59:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1212 ms
[2020-06-03 13:59:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:59:07] [INFO ] [Nat]Absence check using 39 positive place invariants in 77 ms returned sat
[2020-06-03 13:59:07] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 38 ms returned sat
[2020-06-03 13:59:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:59:08] [INFO ] [Nat]Absence check using state equation in 1150 ms returned sat
[2020-06-03 13:59:08] [INFO ] Deduced a trap composed of 19 places in 314 ms
[2020-06-03 13:59:08] [INFO ] Deduced a trap composed of 22 places in 217 ms
[2020-06-03 13:59:09] [INFO ] Deduced a trap composed of 34 places in 209 ms
[2020-06-03 13:59:09] [INFO ] Deduced a trap composed of 23 places in 107 ms
[2020-06-03 13:59:09] [INFO ] Deduced a trap composed of 21 places in 104 ms
[2020-06-03 13:59:09] [INFO ] Deduced a trap composed of 23 places in 125 ms
[2020-06-03 13:59:09] [INFO ] Deduced a trap composed of 24 places in 139 ms
[2020-06-03 13:59:09] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1486 ms
[2020-06-03 13:59:09] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 41 ms.
[2020-06-03 13:59:16] [INFO ] Added : 355 causal constraints over 72 iterations in 6509 ms. Result :sat
[2020-06-03 13:59:16] [INFO ] Deduced a trap composed of 53 places in 257 ms
[2020-06-03 13:59:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 392 ms
[2020-06-03 13:59:16] [INFO ] [Real]Absence check using 39 positive place invariants in 53 ms returned sat
[2020-06-03 13:59:16] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 44 ms returned sat
[2020-06-03 13:59:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:59:17] [INFO ] [Real]Absence check using state equation in 1098 ms returned sat
[2020-06-03 13:59:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:59:18] [INFO ] [Nat]Absence check using 39 positive place invariants in 94 ms returned sat
[2020-06-03 13:59:18] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 77 ms returned sat
[2020-06-03 13:59:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:59:19] [INFO ] [Nat]Absence check using state equation in 1144 ms returned sat
[2020-06-03 13:59:19] [INFO ] Deduced a trap composed of 8 places in 262 ms
[2020-06-03 13:59:20] [INFO ] Deduced a trap composed of 12 places in 218 ms
[2020-06-03 13:59:20] [INFO ] Deduced a trap composed of 15 places in 148 ms
[2020-06-03 13:59:20] [INFO ] Deduced a trap composed of 28 places in 151 ms
[2020-06-03 13:59:20] [INFO ] Deduced a trap composed of 17 places in 138 ms
[2020-06-03 13:59:20] [INFO ] Deduced a trap composed of 29 places in 114 ms
[2020-06-03 13:59:20] [INFO ] Deduced a trap composed of 30 places in 110 ms
[2020-06-03 13:59:21] [INFO ] Deduced a trap composed of 18 places in 141 ms
[2020-06-03 13:59:21] [INFO ] Deduced a trap composed of 20 places in 142 ms
[2020-06-03 13:59:21] [INFO ] Deduced a trap composed of 32 places in 94 ms
[2020-06-03 13:59:21] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1966 ms
[2020-06-03 13:59:21] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 37 ms.
[2020-06-03 13:59:26] [INFO ] Added : 320 causal constraints over 65 iterations in 5134 ms. Result :sat
[2020-06-03 13:59:26] [INFO ] [Real]Absence check using 39 positive place invariants in 47 ms returned sat
[2020-06-03 13:59:26] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 44 ms returned sat
[2020-06-03 13:59:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:59:27] [INFO ] [Real]Absence check using state equation in 1137 ms returned sat
[2020-06-03 13:59:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:59:28] [INFO ] [Nat]Absence check using 39 positive place invariants in 89 ms returned sat
[2020-06-03 13:59:28] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 76 ms returned sat
[2020-06-03 13:59:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:59:29] [INFO ] [Nat]Absence check using state equation in 1180 ms returned sat
[2020-06-03 13:59:29] [INFO ] Deduced a trap composed of 8 places in 261 ms
[2020-06-03 13:59:29] [INFO ] Deduced a trap composed of 12 places in 225 ms
[2020-06-03 13:59:30] [INFO ] Deduced a trap composed of 15 places in 131 ms
[2020-06-03 13:59:30] [INFO ] Deduced a trap composed of 28 places in 160 ms
[2020-06-03 13:59:30] [INFO ] Deduced a trap composed of 17 places in 126 ms
[2020-06-03 13:59:30] [INFO ] Deduced a trap composed of 29 places in 129 ms
[2020-06-03 13:59:30] [INFO ] Deduced a trap composed of 30 places in 121 ms
[2020-06-03 13:59:31] [INFO ] Deduced a trap composed of 18 places in 153 ms
[2020-06-03 13:59:31] [INFO ] Deduced a trap composed of 20 places in 110 ms
[2020-06-03 13:59:31] [INFO ] Deduced a trap composed of 32 places in 80 ms
[2020-06-03 13:59:31] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1909 ms
[2020-06-03 13:59:31] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 35 ms.
[2020-06-03 13:59:36] [INFO ] Added : 320 causal constraints over 65 iterations in 5218 ms. Result :sat
[2020-06-03 13:59:36] [INFO ] [Real]Absence check using 39 positive place invariants in 47 ms returned sat
[2020-06-03 13:59:36] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 50 ms returned sat
[2020-06-03 13:59:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:59:37] [INFO ] [Real]Absence check using state equation in 1038 ms returned sat
[2020-06-03 13:59:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:59:38] [INFO ] [Nat]Absence check using 39 positive place invariants in 81 ms returned sat
[2020-06-03 13:59:38] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 86 ms returned sat
[2020-06-03 13:59:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:59:39] [INFO ] [Nat]Absence check using state equation in 1062 ms returned sat
[2020-06-03 13:59:39] [INFO ] Deduced a trap composed of 8 places in 242 ms
[2020-06-03 13:59:39] [INFO ] Deduced a trap composed of 28 places in 117 ms
[2020-06-03 13:59:39] [INFO ] Deduced a trap composed of 19 places in 84 ms
[2020-06-03 13:59:39] [INFO ] Deduced a trap composed of 18 places in 73 ms
[2020-06-03 13:59:39] [INFO ] Deduced a trap composed of 24 places in 69 ms
[2020-06-03 13:59:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 799 ms
[2020-06-03 13:59:40] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 38 ms.
[2020-06-03 13:59:45] [INFO ] Added : 346 causal constraints over 70 iterations in 5188 ms. Result :sat
[2020-06-03 13:59:45] [INFO ] [Real]Absence check using 39 positive place invariants in 45 ms returned sat
[2020-06-03 13:59:45] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 38 ms returned sat
[2020-06-03 13:59:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:59:46] [INFO ] [Real]Absence check using state equation in 992 ms returned sat
[2020-06-03 13:59:46] [INFO ] Deduced a trap composed of 8 places in 160 ms
[2020-06-03 13:59:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
[2020-06-03 13:59:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:59:46] [INFO ] [Nat]Absence check using 39 positive place invariants in 106 ms returned sat
[2020-06-03 13:59:46] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 40 ms returned sat
[2020-06-03 13:59:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:59:47] [INFO ] [Nat]Absence check using state equation in 967 ms returned sat
[2020-06-03 13:59:48] [INFO ] Deduced a trap composed of 8 places in 264 ms
[2020-06-03 13:59:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 345 ms
[2020-06-03 13:59:48] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 42 ms.
[2020-06-03 13:59:54] [INFO ] Added : 371 causal constraints over 75 iterations in 5876 ms. Result :sat
[2020-06-03 13:59:54] [INFO ] [Real]Absence check using 39 positive place invariants in 56 ms returned sat
[2020-06-03 13:59:54] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 42 ms returned sat
[2020-06-03 13:59:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:59:55] [INFO ] [Real]Absence check using state equation in 1164 ms returned sat
[2020-06-03 13:59:55] [INFO ] Deduced a trap composed of 12 places in 297 ms
[2020-06-03 13:59:56] [INFO ] Deduced a trap composed of 8 places in 279 ms
[2020-06-03 13:59:56] [INFO ] Deduced a trap composed of 24 places in 200 ms
[2020-06-03 13:59:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 926 ms
[2020-06-03 13:59:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:59:56] [INFO ] [Nat]Absence check using 39 positive place invariants in 78 ms returned sat
[2020-06-03 13:59:56] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 54 ms returned sat
[2020-06-03 13:59:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:59:57] [INFO ] [Nat]Absence check using state equation in 1032 ms returned sat
[2020-06-03 13:59:58] [INFO ] Deduced a trap composed of 8 places in 354 ms
[2020-06-03 13:59:58] [INFO ] Deduced a trap composed of 15 places in 163 ms
[2020-06-03 13:59:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 633 ms
[2020-06-03 13:59:58] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 39 ms.
[2020-06-03 14:00:03] [INFO ] Added : 282 causal constraints over 58 iterations in 5294 ms. Result :sat
[2020-06-03 14:00:03] [INFO ] Deduced a trap composed of 49 places in 176 ms
[2020-06-03 14:00:04] [INFO ] Deduced a trap composed of 65 places in 162 ms
[2020-06-03 14:00:04] [INFO ] Deduced a trap composed of 53 places in 156 ms
[2020-06-03 14:00:04] [INFO ] Deduced a trap composed of 65 places in 156 ms
[2020-06-03 14:00:04] [INFO ] Deduced a trap composed of 51 places in 182 ms
[2020-06-03 14:00:05] [INFO ] Deduced a trap composed of 27 places in 198 ms
[2020-06-03 14:00:05] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1629 ms
[2020-06-03 14:00:05] [INFO ] [Real]Absence check using 39 positive place invariants in 56 ms returned sat
[2020-06-03 14:00:05] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 40 ms returned sat
[2020-06-03 14:00:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:00:06] [INFO ] [Real]Absence check using state equation in 1037 ms returned sat
[2020-06-03 14:00:06] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 38 ms.
[2020-06-03 14:00:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:00:06] [INFO ] [Nat]Absence check using 39 positive place invariants in 85 ms returned sat
[2020-06-03 14:00:07] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 39 ms returned sat
[2020-06-03 14:00:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:00:08] [INFO ] [Nat]Absence check using state equation in 986 ms returned sat
[2020-06-03 14:00:08] [INFO ] Deduced a trap composed of 12 places in 285 ms
[2020-06-03 14:00:08] [INFO ] Deduced a trap composed of 20 places in 223 ms
[2020-06-03 14:00:08] [INFO ] Deduced a trap composed of 22 places in 226 ms
[2020-06-03 14:00:09] [INFO ] Deduced a trap composed of 37 places in 207 ms
[2020-06-03 14:00:09] [INFO ] Deduced a trap composed of 23 places in 203 ms
[2020-06-03 14:00:09] [INFO ] Deduced a trap composed of 34 places in 210 ms
[2020-06-03 14:00:09] [INFO ] Deduced a trap composed of 35 places in 188 ms
[2020-06-03 14:00:10] [INFO ] Deduced a trap composed of 13 places in 170 ms
[2020-06-03 14:00:10] [INFO ] Deduced a trap composed of 14 places in 163 ms
[2020-06-03 14:00:10] [INFO ] Deduced a trap composed of 23 places in 165 ms
[2020-06-03 14:00:10] [INFO ] Deduced a trap composed of 24 places in 179 ms
[2020-06-03 14:00:10] [INFO ] Deduced a trap composed of 17 places in 160 ms
[2020-06-03 14:00:10] [INFO ] Deduced a trap composed of 21 places in 117 ms
[2020-06-03 14:00:10] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2988 ms
[2020-06-03 14:00:11] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 39 ms.
[2020-06-03 14:00:15] [INFO ] Added : 276 causal constraints over 56 iterations in 4091 ms. Result :sat
[2020-06-03 14:00:15] [INFO ] Deduced a trap composed of 36 places in 230 ms
[2020-06-03 14:00:15] [INFO ] Deduced a trap composed of 30 places in 239 ms
[2020-06-03 14:00:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 978 ms
[2020-06-03 14:00:16] [INFO ] [Real]Absence check using 39 positive place invariants in 45 ms returned sat
[2020-06-03 14:00:16] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 39 ms returned sat
[2020-06-03 14:00:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:00:17] [INFO ] [Real]Absence check using state equation in 1024 ms returned sat
[2020-06-03 14:00:17] [INFO ] Deduced a trap composed of 15 places in 241 ms
[2020-06-03 14:00:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 330 ms
[2020-06-03 14:00:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:00:17] [INFO ] [Nat]Absence check using 39 positive place invariants in 120 ms returned sat
[2020-06-03 14:00:17] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 44 ms returned sat
[2020-06-03 14:00:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:00:18] [INFO ] [Nat]Absence check using state equation in 1026 ms returned sat
[2020-06-03 14:00:19] [INFO ] Deduced a trap composed of 9 places in 270 ms
[2020-06-03 14:00:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 345 ms
[2020-06-03 14:00:19] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 168 ms.
[2020-06-03 14:00:24] [INFO ] Added : 346 causal constraints over 70 iterations in 5070 ms. Result :sat
[2020-06-03 14:00:24] [INFO ] Deduced a trap composed of 39 places in 207 ms
[2020-06-03 14:00:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 337 ms
[2020-06-03 14:00:24] [INFO ] [Real]Absence check using 39 positive place invariants in 49 ms returned sat
[2020-06-03 14:00:24] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 46 ms returned sat
[2020-06-03 14:00:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:00:25] [INFO ] [Real]Absence check using state equation in 1007 ms returned sat
[2020-06-03 14:00:26] [INFO ] Deduced a trap composed of 8 places in 184 ms
[2020-06-03 14:00:26] [INFO ] Deduced a trap composed of 22 places in 145 ms
[2020-06-03 14:00:26] [INFO ] Deduced a trap composed of 41 places in 135 ms
[2020-06-03 14:00:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 637 ms
[2020-06-03 14:00:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:00:26] [INFO ] [Nat]Absence check using 39 positive place invariants in 121 ms returned sat
[2020-06-03 14:00:26] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 46 ms returned sat
[2020-06-03 14:00:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:00:28] [INFO ] [Nat]Absence check using state equation in 1158 ms returned sat
[2020-06-03 14:00:28] [INFO ] Deduced a trap composed of 8 places in 197 ms
[2020-06-03 14:00:28] [INFO ] Deduced a trap composed of 20 places in 102 ms
[2020-06-03 14:00:28] [INFO ] Deduced a trap composed of 12 places in 61 ms
[2020-06-03 14:00:28] [INFO ] Deduced a trap composed of 12 places in 64 ms
[2020-06-03 14:00:28] [INFO ] Deduced a trap composed of 10 places in 62 ms
[2020-06-03 14:00:28] [INFO ] Deduced a trap composed of 9 places in 71 ms
[2020-06-03 14:00:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 783 ms
[2020-06-03 14:00:28] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 37 ms.
[2020-06-03 14:00:34] [INFO ] Added : 360 causal constraints over 73 iterations in 5192 ms. Result :sat
[2020-06-03 14:00:34] [INFO ] Deduced a trap composed of 44 places in 229 ms
[2020-06-03 14:00:34] [INFO ] Deduced a trap composed of 67 places in 192 ms
[2020-06-03 14:00:34] [INFO ] Deduced a trap composed of 76 places in 208 ms
[2020-06-03 14:00:35] [INFO ] Deduced a trap composed of 79 places in 196 ms
[2020-06-03 14:00:35] [INFO ] Deduced a trap composed of 63 places in 203 ms
[2020-06-03 14:00:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1487 ms
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-03 14:00:36] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 14:00:36] [INFO ] Flatten gal took : 162 ms
FORMULA DES-PT-40b-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 14:00:36] [INFO ] Applying decomposition
[2020-06-03 14:00:36] [INFO ] Flatten gal took : 65 ms
[2020-06-03 14:00:36] [INFO ] Decomposing Gal with order
[2020-06-03 14:00:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 14:00:36] [INFO ] Removed a total of 177 redundant transitions.
[2020-06-03 14:00:36] [INFO ] Flatten gal took : 202 ms
[2020-06-03 14:00:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 622 labels/synchronizations in 73 ms.
[2020-06-03 14:00:36] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 9 ms.
[2020-06-03 14:00:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 11 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ DES-PT-40b @ 3570 seconds

FORMULA DES-PT-40b-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40b-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40b-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40b-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40b-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40b-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40b-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40b-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40b-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40b-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427456 kB
MemFree: 6234908 kB
After kill :
MemTotal: 16427456 kB
MemFree: 6598212 kB

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-40b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is DES-PT-40b, 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 r180-ebro-158987900000298"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-40b.tgz
mv DES-PT-40b 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;