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-158987900000327.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-60a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900000327
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 288K
-rw-r--r-- 1 mcc users 3.7K Mar 30 01:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 30 01:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:21 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 25K 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.2K 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:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 26 08:19 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 110K 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-60a-ReachabilityFireability-00
FORMULA_NAME DES-PT-60a-ReachabilityFireability-01
FORMULA_NAME DES-PT-60a-ReachabilityFireability-02
FORMULA_NAME DES-PT-60a-ReachabilityFireability-03
FORMULA_NAME DES-PT-60a-ReachabilityFireability-04
FORMULA_NAME DES-PT-60a-ReachabilityFireability-05
FORMULA_NAME DES-PT-60a-ReachabilityFireability-06
FORMULA_NAME DES-PT-60a-ReachabilityFireability-07
FORMULA_NAME DES-PT-60a-ReachabilityFireability-08
FORMULA_NAME DES-PT-60a-ReachabilityFireability-09
FORMULA_NAME DES-PT-60a-ReachabilityFireability-10
FORMULA_NAME DES-PT-60a-ReachabilityFireability-11
FORMULA_NAME DES-PT-60a-ReachabilityFireability-12
FORMULA_NAME DES-PT-60a-ReachabilityFireability-13
FORMULA_NAME DES-PT-60a-ReachabilityFireability-14
FORMULA_NAME DES-PT-60a-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591200683609

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 16:11:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 16:11:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 16:11:26] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2020-06-03 16:11:27] [INFO ] Transformed 354 places.
[2020-06-03 16:11:27] [INFO ] Transformed 311 transitions.
[2020-06-03 16:11:27] [INFO ] Found NUPN structural information;
[2020-06-03 16:11:27] [INFO ] Parsed PT model containing 354 places and 311 transitions in 232 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 46 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 222 resets, run finished after 236 ms. (steps per millisecond=42 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 59 ms. (steps per millisecond=169 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 41 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 51 ms. (steps per millisecond=196 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 124 ms. (steps per millisecond=80 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 74 ms. (steps per millisecond=135 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 137 ms. (steps per millisecond=73 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 53 ms. (steps per millisecond=188 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 81 ms. (steps per millisecond=123 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 7268547 steps, run timeout after 30001 ms. (steps per millisecond=242 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 7268547 steps, saw 882986 distinct states, run finished after 30001 ms. (steps per millisecond=242 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 297 rows 354 cols
[2020-06-03 16:11:58] [INFO ] Computed 59 place invariants in 69 ms
[2020-06-03 16:11:58] [INFO ] [Real]Absence check using 34 positive place invariants in 64 ms returned sat
[2020-06-03 16:11:58] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 47 ms returned sat
[2020-06-03 16:11:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:11:59] [INFO ] [Real]Absence check using state equation in 935 ms returned sat
[2020-06-03 16:11:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:11:59] [INFO ] [Nat]Absence check using 34 positive place invariants in 53 ms returned sat
[2020-06-03 16:12:00] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 136 ms returned sat
[2020-06-03 16:12:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:12:01] [INFO ] [Nat]Absence check using state equation in 1276 ms returned sat
[2020-06-03 16:12:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 16:12:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2020-06-03 16:12:01] [INFO ] Computed and/alt/rep : 296/1259/296 causal constraints in 57 ms.
[2020-06-03 16:12:04] [INFO ] Added : 265 causal constraints over 53 iterations in 3300 ms. Result :unknown
[2020-06-03 16:12:04] [INFO ] [Real]Absence check using 34 positive place invariants in 47 ms returned sat
[2020-06-03 16:12:04] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 44 ms returned sat
[2020-06-03 16:12:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:12:06] [INFO ] [Real]Absence check using state equation in 1059 ms returned sat
[2020-06-03 16:12:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:12:06] [INFO ] [Nat]Absence check using 34 positive place invariants in 43 ms returned sat
[2020-06-03 16:12:06] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 138 ms returned sat
[2020-06-03 16:12:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:12:07] [INFO ] [Nat]Absence check using state equation in 1047 ms returned sat
[2020-06-03 16:12:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 10 ms returned sat
[2020-06-03 16:12:07] [INFO ] Computed and/alt/rep : 296/1259/296 causal constraints in 49 ms.
[2020-06-03 16:12:09] [INFO ] Added : 116 causal constraints over 24 iterations in 2206 ms. Result :sat
[2020-06-03 16:12:09] [INFO ] Deduced a trap composed of 12 places in 140 ms
[2020-06-03 16:12:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 337 ms
Attempting to minimize the solution found.
Minimization took 28 ms.
[2020-06-03 16:12:10] [INFO ] [Real]Absence check using 34 positive place invariants in 36 ms returned sat
[2020-06-03 16:12:10] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 52 ms returned sat
[2020-06-03 16:12:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:12:10] [INFO ] [Real]Absence check using state equation in 165 ms returned unsat
[2020-06-03 16:12:10] [INFO ] [Real]Absence check using 34 positive place invariants in 35 ms returned sat
[2020-06-03 16:12:10] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 52 ms returned sat
[2020-06-03 16:12:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:12:11] [INFO ] [Real]Absence check using state equation in 1294 ms returned sat
[2020-06-03 16:12:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:12:12] [INFO ] [Nat]Absence check using 34 positive place invariants in 44 ms returned sat
[2020-06-03 16:12:12] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 112 ms returned sat
[2020-06-03 16:12:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:12:14] [INFO ] [Nat]Absence check using state equation in 2666 ms returned sat
[2020-06-03 16:12:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 15 ms returned sat
[2020-06-03 16:12:14] [INFO ] Computed and/alt/rep : 296/1259/296 causal constraints in 49 ms.
[2020-06-03 16:12:16] [INFO ] Added : 190 causal constraints over 38 iterations in 2017 ms. Result :unknown
[2020-06-03 16:12:17] [INFO ] [Real]Absence check using 34 positive place invariants in 36 ms returned sat
[2020-06-03 16:12:17] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 52 ms returned sat
[2020-06-03 16:12:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:12:17] [INFO ] [Real]Absence check using state equation in 595 ms returned unsat
[2020-06-03 16:12:17] [INFO ] [Real]Absence check using 34 positive place invariants in 46 ms returned sat
[2020-06-03 16:12:17] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 52 ms returned sat
[2020-06-03 16:12:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:12:19] [INFO ] [Real]Absence check using state equation in 1195 ms returned sat
[2020-06-03 16:12:19] [INFO ] [Real]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-06-03 16:12:19] [INFO ] Computed and/alt/rep : 296/1259/296 causal constraints in 42 ms.
[2020-06-03 16:12:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:12:19] [INFO ] [Nat]Absence check using 34 positive place invariants in 36 ms returned sat
[2020-06-03 16:12:19] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 90 ms returned sat
[2020-06-03 16:12:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:12:20] [INFO ] [Nat]Absence check using state equation in 903 ms returned sat
[2020-06-03 16:12:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2020-06-03 16:12:20] [INFO ] Computed and/alt/rep : 296/1259/296 causal constraints in 35 ms.
[2020-06-03 16:12:24] [INFO ] Added : 285 causal constraints over 57 iterations in 3871 ms. Result :(error "Failed to check-sat")
[2020-06-03 16:12:24] [INFO ] [Real]Absence check using 34 positive place invariants in 34 ms returned sat
[2020-06-03 16:12:24] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 46 ms returned sat
[2020-06-03 16:12:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:12:25] [INFO ] [Real]Absence check using state equation in 997 ms returned sat
[2020-06-03 16:12:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:12:25] [INFO ] [Nat]Absence check using 34 positive place invariants in 43 ms returned sat
[2020-06-03 16:12:25] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 192 ms returned sat
[2020-06-03 16:12:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:12:27] [INFO ] [Nat]Absence check using state equation in 1521 ms returned sat
[2020-06-03 16:12:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 10 ms returned sat
[2020-06-03 16:12:27] [INFO ] Computed and/alt/rep : 296/1259/296 causal constraints in 121 ms.
[2020-06-03 16:12:30] [INFO ] Added : 267 causal constraints over 54 iterations in 3122 ms. Result :(error "Failed to check-sat")
[2020-06-03 16:12:30] [INFO ] [Real]Absence check using 34 positive place invariants in 36 ms returned sat
[2020-06-03 16:12:30] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 57 ms returned sat
[2020-06-03 16:12:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:12:32] [INFO ] [Real]Absence check using state equation in 1916 ms returned sat
[2020-06-03 16:12:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:12:32] [INFO ] [Nat]Absence check using 34 positive place invariants in 36 ms returned sat
[2020-06-03 16:12:33] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 136 ms returned sat
[2020-06-03 16:12:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:12:35] [INFO ] [Nat]Absence check using state equation in 2058 ms returned sat
[2020-06-03 16:12:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 13 ms returned sat
[2020-06-03 16:12:35] [INFO ] Computed and/alt/rep : 296/1259/296 causal constraints in 46 ms.
[2020-06-03 16:12:37] [INFO ] Added : 220 causal constraints over 44 iterations in 2644 ms. Result :unknown
[2020-06-03 16:12:37] [INFO ] [Real]Absence check using 34 positive place invariants in 35 ms returned sat
[2020-06-03 16:12:37] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 42 ms returned sat
[2020-06-03 16:12:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:12:38] [INFO ] [Real]Absence check using state equation in 864 ms returned sat
[2020-06-03 16:12:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:12:38] [INFO ] [Nat]Absence check using 34 positive place invariants in 47 ms returned sat
[2020-06-03 16:12:39] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 138 ms returned sat
[2020-06-03 16:12:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:12:40] [INFO ] [Nat]Absence check using state equation in 1308 ms returned sat
[2020-06-03 16:12:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 20 ms returned sat
[2020-06-03 16:12:40] [INFO ] Computed and/alt/rep : 296/1259/296 causal constraints in 35 ms.
[2020-06-03 16:12:43] [INFO ] Added : 230 causal constraints over 46 iterations in 3353 ms. Result :unknown
[2020-06-03 16:12:43] [INFO ] [Real]Absence check using 34 positive place invariants in 37 ms returned sat
[2020-06-03 16:12:43] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 47 ms returned sat
[2020-06-03 16:12:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:12:44] [INFO ] [Real]Absence check using state equation in 994 ms returned sat
[2020-06-03 16:12:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:12:45] [INFO ] [Nat]Absence check using 34 positive place invariants in 41 ms returned sat
[2020-06-03 16:12:45] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 178 ms returned sat
[2020-06-03 16:12:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:12:46] [INFO ] [Nat]Absence check using state equation in 1087 ms returned sat
[2020-06-03 16:12:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2020-06-03 16:12:46] [INFO ] Computed and/alt/rep : 296/1259/296 causal constraints in 24 ms.
[2020-06-03 16:12:47] [INFO ] Added : 95 causal constraints over 20 iterations in 1507 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
[2020-06-03 16:12:48] [INFO ] [Real]Absence check using 34 positive place invariants in 43 ms returned sat
[2020-06-03 16:12:48] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 48 ms returned sat
[2020-06-03 16:12:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:12:48] [INFO ] [Real]Absence check using state equation in 646 ms returned unsat
[2020-06-03 16:12:49] [INFO ] [Real]Absence check using 34 positive place invariants in 46 ms returned sat
[2020-06-03 16:12:49] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 46 ms returned sat
[2020-06-03 16:12:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:12:50] [INFO ] [Real]Absence check using state equation in 965 ms returned sat
[2020-06-03 16:12:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:12:50] [INFO ] [Nat]Absence check using 34 positive place invariants in 34 ms returned sat
[2020-06-03 16:12:50] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 130 ms returned sat
[2020-06-03 16:12:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:12:51] [INFO ] [Nat]Absence check using state equation in 1500 ms returned sat
[2020-06-03 16:12:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 22 ms returned sat
[2020-06-03 16:12:51] [INFO ] Computed and/alt/rep : 296/1259/296 causal constraints in 32 ms.
[2020-06-03 16:12:55] [INFO ] Added : 235 causal constraints over 47 iterations in 3224 ms. Result :unknown
[2020-06-03 16:12:55] [INFO ] [Real]Absence check using 34 positive place invariants in 35 ms returned sat
[2020-06-03 16:12:55] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 45 ms returned sat
[2020-06-03 16:12:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:12:56] [INFO ] [Real]Absence check using state equation in 826 ms returned sat
[2020-06-03 16:12:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:12:56] [INFO ] [Nat]Absence check using 34 positive place invariants in 49 ms returned sat
[2020-06-03 16:12:56] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 155 ms returned sat
[2020-06-03 16:12:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:12:57] [INFO ] [Nat]Absence check using state equation in 1434 ms returned sat
[2020-06-03 16:12:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 15 ms returned sat
[2020-06-03 16:12:57] [INFO ] Computed and/alt/rep : 296/1259/296 causal constraints in 38 ms.
[2020-06-03 16:13:01] [INFO ] Added : 254 causal constraints over 51 iterations in 3210 ms. Result :unknown
[2020-06-03 16:13:01] [INFO ] [Real]Absence check using 34 positive place invariants in 34 ms returned sat
[2020-06-03 16:13:01] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 56 ms returned sat
[2020-06-03 16:13:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:13:03] [INFO ] [Real]Absence check using state equation in 1860 ms returned sat
[2020-06-03 16:13:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:13:03] [INFO ] [Nat]Absence check using 34 positive place invariants in 40 ms returned sat
[2020-06-03 16:13:03] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 430 ms returned sat
[2020-06-03 16:13:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:13:05] [INFO ] [Nat]Absence check using state equation in 1573 ms returned sat
[2020-06-03 16:13:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2020-06-03 16:13:05] [INFO ] Computed and/alt/rep : 296/1259/296 causal constraints in 41 ms.
[2020-06-03 16:13:08] [INFO ] Added : 132 causal constraints over 27 iterations in 2833 ms. Result :sat
[2020-06-03 16:13:08] [INFO ] Deduced a trap composed of 2 places in 289 ms
[2020-06-03 16:13:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s251) 0)") while checking expression at index 13
[2020-06-03 16:13:08] [INFO ] [Real]Absence check using 34 positive place invariants in 34 ms returned sat
[2020-06-03 16:13:08] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 52 ms returned sat
[2020-06-03 16:13:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:13:09] [INFO ] [Real]Absence check using state equation in 891 ms returned sat
[2020-06-03 16:13:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:13:09] [INFO ] [Nat]Absence check using 34 positive place invariants in 46 ms returned sat
[2020-06-03 16:13:09] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 139 ms returned sat
[2020-06-03 16:13:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:13:11] [INFO ] [Nat]Absence check using state equation in 1294 ms returned sat
[2020-06-03 16:13:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 14 ms returned sat
[2020-06-03 16:13:11] [INFO ] Computed and/alt/rep : 296/1259/296 causal constraints in 36 ms.
[2020-06-03 16:13:14] [INFO ] Added : 257 causal constraints over 52 iterations in 3380 ms. Result :unknown
[2020-06-03 16:13:14] [INFO ] [Real]Absence check using 34 positive place invariants in 35 ms returned sat
[2020-06-03 16:13:14] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 91 ms returned sat
[2020-06-03 16:13:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:13:16] [INFO ] [Real]Absence check using state equation in 1673 ms returned sat
[2020-06-03 16:13:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:13:16] [INFO ] [Nat]Absence check using 34 positive place invariants in 37 ms returned sat
[2020-06-03 16:13:16] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 98 ms returned sat
[2020-06-03 16:13:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:13:18] [INFO ] [Nat]Absence check using state equation in 1888 ms returned sat
[2020-06-03 16:13:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 22 ms returned sat
[2020-06-03 16:13:18] [INFO ] Computed and/alt/rep : 296/1259/296 causal constraints in 35 ms.
[2020-06-03 16:13:21] [INFO ] Added : 110 causal constraints over 22 iterations in 2846 ms. Result :unknown
FORMULA DES-PT-60a-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-60a-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-60a-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 110100 steps, including 2927 resets, run finished after 828 ms. (steps per millisecond=132 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 129800 steps, including 2979 resets, run finished after 881 ms. (steps per millisecond=147 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 309800 steps, including 7659 resets, run finished after 1790 ms. (steps per millisecond=173 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1] could not realise parikh vector
FORMULA DES-PT-60a-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-60a-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 206200 steps, including 4974 resets, run finished after 1142 ms. (steps per millisecond=180 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 63400 steps, including 1325 resets, run finished after 356 ms. (steps per millisecond=178 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 287300 steps, including 6984 resets, run finished after 1623 ms. (steps per millisecond=177 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 295400 steps, including 7445 resets, run finished after 1655 ms. (steps per millisecond=178 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 224300 steps, including 5241 resets, run finished after 1017 ms. (steps per millisecond=220 ) properties seen :[0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0] could not realise parikh vector
FORMULA DES-PT-60a-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-60a-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-60a-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-60a-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-60a-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 76400 steps, including 1732 resets, run finished after 367 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 293100 steps, including 6456 resets, run finished after 1333 ms. (steps per millisecond=219 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 17 out of 354 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 354/354 places, 297/297 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 354 transition count 295
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 354 transition count 295
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 353 transition count 294
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 10 place count 353 transition count 294
Applied a total of 10 rules in 237 ms. Remains 353 /354 variables (removed 1) and now considering 294/297 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 353/354 places, 294/297 transitions.
Incomplete random walk after 1000000 steps, including 13463 resets, run finished after 4372 ms. (steps per millisecond=228 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1729 resets, run finished after 2057 ms. (steps per millisecond=486 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2456 resets, run finished after 2332 ms. (steps per millisecond=428 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1713 resets, run finished after 1950 ms. (steps per millisecond=512 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2266 resets, run finished after 1948 ms. (steps per millisecond=513 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 1682 resets, run finished after 2130 ms. (steps per millisecond=469 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2377 resets, run finished after 1916 ms. (steps per millisecond=521 ) properties seen :[0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 8330435 steps, run timeout after 30001 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0]
Probabilistic random walk after 8330435 steps, saw 1056864 distinct states, run finished after 30001 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 294 rows 353 cols
[2020-06-03 16:14:19] [INFO ] Computed 61 place invariants in 38 ms
[2020-06-03 16:14:19] [INFO ] [Real]Absence check using 36 positive place invariants in 61 ms returned sat
[2020-06-03 16:14:20] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 48 ms returned sat
[2020-06-03 16:14:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:14:21] [INFO ] [Real]Absence check using state equation in 1115 ms returned sat
[2020-06-03 16:14:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:14:21] [INFO ] [Nat]Absence check using 36 positive place invariants in 46 ms returned sat
[2020-06-03 16:14:21] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 172 ms returned sat
[2020-06-03 16:14:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:14:22] [INFO ] [Nat]Absence check using state equation in 1427 ms returned sat
[2020-06-03 16:14:22] [INFO ] State equation strengthened by 4 read => feed constraints.
[2020-06-03 16:14:23] [INFO ] [Nat]Added 4 Read/Feed constraints in 66 ms returned sat
[2020-06-03 16:14:23] [INFO ] Deduced a trap composed of 71 places in 298 ms
[2020-06-03 16:14:23] [INFO ] Deduced a trap composed of 74 places in 272 ms
[2020-06-03 16:14:23] [INFO ] Deduced a trap composed of 68 places in 147 ms
[2020-06-03 16:14:24] [INFO ] Deduced a trap composed of 80 places in 174 ms
[2020-06-03 16:14:24] [INFO ] Deduced a trap composed of 80 places in 136 ms
[2020-06-03 16:14:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1358 ms
[2020-06-03 16:14:24] [INFO ] Computed and/alt/rep : 293/1430/293 causal constraints in 30 ms.
[2020-06-03 16:14:27] [INFO ] Added : 234 causal constraints over 47 iterations in 3248 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 32 ms.
[2020-06-03 16:14:27] [INFO ] [Real]Absence check using 36 positive place invariants in 40 ms returned sat
[2020-06-03 16:14:27] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 49 ms returned sat
[2020-06-03 16:14:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:14:29] [INFO ] [Real]Absence check using state equation in 1163 ms returned sat
[2020-06-03 16:14:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:14:29] [INFO ] [Nat]Absence check using 36 positive place invariants in 37 ms returned sat
[2020-06-03 16:14:29] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 123 ms returned sat
[2020-06-03 16:14:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:14:30] [INFO ] [Nat]Absence check using state equation in 1416 ms returned sat
[2020-06-03 16:14:30] [INFO ] [Nat]Added 4 Read/Feed constraints in 49 ms returned sat
[2020-06-03 16:14:30] [INFO ] Computed and/alt/rep : 293/1430/293 causal constraints in 43 ms.
[2020-06-03 16:14:34] [INFO ] Added : 291 causal constraints over 59 iterations in 3564 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 38 ms.
[2020-06-03 16:14:34] [INFO ] [Real]Absence check using 36 positive place invariants in 40 ms returned sat
[2020-06-03 16:14:34] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 43 ms returned sat
[2020-06-03 16:14:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:14:35] [INFO ] [Real]Absence check using state equation in 960 ms returned sat
[2020-06-03 16:14:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:14:35] [INFO ] [Nat]Absence check using 36 positive place invariants in 54 ms returned sat
[2020-06-03 16:14:36] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 168 ms returned sat
[2020-06-03 16:14:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:14:37] [INFO ] [Nat]Absence check using state equation in 1450 ms returned sat
[2020-06-03 16:14:37] [INFO ] [Nat]Added 4 Read/Feed constraints in 12 ms returned sat
[2020-06-03 16:14:37] [INFO ] Deduced a trap composed of 74 places in 253 ms
[2020-06-03 16:14:38] [INFO ] Deduced a trap composed of 73 places in 187 ms
[2020-06-03 16:14:38] [INFO ] Deduced a trap composed of 66 places in 232 ms
[2020-06-03 16:14:38] [INFO ] Deduced a trap composed of 81 places in 182 ms
[2020-06-03 16:14:38] [INFO ] Deduced a trap composed of 76 places in 187 ms
[2020-06-03 16:14:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1399 ms
[2020-06-03 16:14:39] [INFO ] Computed and/alt/rep : 293/1430/293 causal constraints in 35 ms.
[2020-06-03 16:14:42] [INFO ] Added : 279 causal constraints over 56 iterations in 3600 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 49 ms.
[2020-06-03 16:14:42] [INFO ] [Real]Absence check using 36 positive place invariants in 43 ms returned sat
[2020-06-03 16:14:42] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 41 ms returned sat
[2020-06-03 16:14:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:14:44] [INFO ] [Real]Absence check using state equation in 1203 ms returned sat
[2020-06-03 16:14:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:14:44] [INFO ] [Nat]Absence check using 36 positive place invariants in 35 ms returned sat
[2020-06-03 16:14:44] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 49 ms returned sat
[2020-06-03 16:14:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:14:45] [INFO ] [Nat]Absence check using state equation in 1092 ms returned sat
[2020-06-03 16:14:45] [INFO ] [Nat]Added 4 Read/Feed constraints in 223 ms returned sat
[2020-06-03 16:14:45] [INFO ] Computed and/alt/rep : 293/1430/293 causal constraints in 30 ms.
[2020-06-03 16:14:50] [INFO ] Added : 283 causal constraints over 57 iterations in 4474 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 40 ms.
[2020-06-03 16:14:50] [INFO ] [Real]Absence check using 36 positive place invariants in 44 ms returned sat
[2020-06-03 16:14:50] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 46 ms returned sat
[2020-06-03 16:14:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:14:51] [INFO ] [Real]Absence check using state equation in 981 ms returned sat
[2020-06-03 16:14:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:14:51] [INFO ] [Nat]Absence check using 36 positive place invariants in 71 ms returned sat
[2020-06-03 16:14:51] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 206 ms returned sat
[2020-06-03 16:14:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:14:53] [INFO ] [Nat]Absence check using state equation in 1543 ms returned sat
[2020-06-03 16:14:53] [INFO ] [Nat]Added 4 Read/Feed constraints in 128 ms returned sat
[2020-06-03 16:14:53] [INFO ] Computed and/alt/rep : 293/1430/293 causal constraints in 38 ms.
[2020-06-03 16:14:55] [INFO ] Added : 130 causal constraints over 26 iterations in 1892 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 20 ms.
[2020-06-03 16:14:55] [INFO ] [Real]Absence check using 36 positive place invariants in 47 ms returned sat
[2020-06-03 16:14:55] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 45 ms returned sat
[2020-06-03 16:14:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:14:56] [INFO ] [Real]Absence check using state equation in 852 ms returned sat
[2020-06-03 16:14:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:14:56] [INFO ] [Nat]Absence check using 36 positive place invariants in 43 ms returned sat
[2020-06-03 16:14:56] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 125 ms returned sat
[2020-06-03 16:14:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:14:57] [INFO ] [Nat]Absence check using state equation in 1143 ms returned sat
[2020-06-03 16:14:58] [INFO ] [Nat]Added 4 Read/Feed constraints in 152 ms returned sat
[2020-06-03 16:14:58] [INFO ] Deduced a trap composed of 68 places in 83 ms
[2020-06-03 16:14:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2020-06-03 16:14:58] [INFO ] Computed and/alt/rep : 293/1430/293 causal constraints in 35 ms.
[2020-06-03 16:15:03] [INFO ] Added : 265 causal constraints over 53 iterations in 4915 ms. Result :sat
[2020-06-03 16:15:03] [INFO ] Deduced a trap composed of 10 places in 185 ms
[2020-06-03 16:15:03] [INFO ] Deduced a trap composed of 12 places in 213 ms
[2020-06-03 16:15:03] [INFO ] Deduced a trap composed of 13 places in 139 ms
[2020-06-03 16:15:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 792 ms
Attempting to minimize the solution found.
Minimization took 29 ms.
Incomplete Parikh walk after 125500 steps, including 1830 resets, run finished after 562 ms. (steps per millisecond=223 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 190200 steps, including 2809 resets, run finished after 844 ms. (steps per millisecond=225 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 270300 steps, including 4001 resets, run finished after 1182 ms. (steps per millisecond=228 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 282500 steps, including 4301 resets, run finished after 1233 ms. (steps per millisecond=229 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 284400 steps, including 4271 resets, run finished after 1263 ms. (steps per millisecond=225 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 280500 steps, including 4080 resets, run finished after 1262 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 17 out of 353 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 353/353 places, 294/294 transitions.
Applied a total of 0 rules in 38 ms. Remains 353 /353 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 353/353 places, 294/294 transitions.
Starting structural reductions, iteration 0 : 353/353 places, 294/294 transitions.
Applied a total of 0 rules in 33 ms. Remains 353 /353 variables (removed 0) and now considering 294/294 (removed 0) transitions.
// Phase 1: matrix 294 rows 353 cols
[2020-06-03 16:15:10] [INFO ] Computed 61 place invariants in 16 ms
[2020-06-03 16:15:12] [INFO ] Implicit Places using invariants in 1640 ms returned [251]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1643 ms to find 1 implicit places.
[2020-06-03 16:15:12] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 294 rows 352 cols
[2020-06-03 16:15:12] [INFO ] Computed 60 place invariants in 18 ms
[2020-06-03 16:15:13] [INFO ] Dead Transitions using invariants and state equation in 1383 ms returned []
Starting structural reductions, iteration 1 : 352/353 places, 294/294 transitions.
Applied a total of 0 rules in 39 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2020-06-03 16:15:13] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 294 rows 352 cols
[2020-06-03 16:15:13] [INFO ] Computed 60 place invariants in 13 ms
[2020-06-03 16:15:14] [INFO ] Dead Transitions using invariants and state equation in 1359 ms returned []
Finished structural reductions, in 2 iterations. Remains : 352/353 places, 294/294 transitions.
Incomplete random walk after 1000000 steps, including 13424 resets, run finished after 4300 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1738 resets, run finished after 2015 ms. (steps per millisecond=496 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2457 resets, run finished after 2234 ms. (steps per millisecond=447 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1744 resets, run finished after 1931 ms. (steps per millisecond=517 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2302 resets, run finished after 1897 ms. (steps per millisecond=527 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 1727 resets, run finished after 2037 ms. (steps per millisecond=490 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2358 resets, run finished after 1882 ms. (steps per millisecond=531 ) properties seen :[0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 8235576 steps, run timeout after 30001 ms. (steps per millisecond=274 ) properties seen :[0, 0, 0, 0, 0, 0]
Probabilistic random walk after 8235576 steps, saw 1046694 distinct states, run finished after 30001 ms. (steps per millisecond=274 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 294 rows 352 cols
[2020-06-03 16:16:01] [INFO ] Computed 60 place invariants in 21 ms
[2020-06-03 16:16:01] [INFO ] [Real]Absence check using 35 positive place invariants in 48 ms returned sat
[2020-06-03 16:16:01] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 51 ms returned sat
[2020-06-03 16:16:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:16:02] [INFO ] [Real]Absence check using state equation in 1031 ms returned sat
[2020-06-03 16:16:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:16:02] [INFO ] [Nat]Absence check using 35 positive place invariants in 35 ms returned sat
[2020-06-03 16:16:02] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 53 ms returned sat
[2020-06-03 16:16:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:16:04] [INFO ] [Nat]Absence check using state equation in 1366 ms returned sat
[2020-06-03 16:16:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-03 16:16:04] [INFO ] [Nat]Added 2 Read/Feed constraints in 53 ms returned sat
[2020-06-03 16:16:04] [INFO ] Deduced a trap composed of 68 places in 220 ms
[2020-06-03 16:16:04] [INFO ] Deduced a trap composed of 79 places in 236 ms
[2020-06-03 16:16:05] [INFO ] Deduced a trap composed of 76 places in 230 ms
[2020-06-03 16:16:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 967 ms
[2020-06-03 16:16:05] [INFO ] Computed and/alt/rep : 293/1426/293 causal constraints in 28 ms.
[2020-06-03 16:16:08] [INFO ] Added : 285 causal constraints over 57 iterations in 3085 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 40 ms.
[2020-06-03 16:16:08] [INFO ] [Real]Absence check using 35 positive place invariants in 35 ms returned sat
[2020-06-03 16:16:08] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 46 ms returned sat
[2020-06-03 16:16:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:16:09] [INFO ] [Real]Absence check using state equation in 1121 ms returned sat
[2020-06-03 16:16:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:16:09] [INFO ] [Nat]Absence check using 35 positive place invariants in 41 ms returned sat
[2020-06-03 16:16:09] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 94 ms returned sat
[2020-06-03 16:16:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:16:11] [INFO ] [Nat]Absence check using state equation in 1573 ms returned sat
[2020-06-03 16:16:11] [INFO ] [Nat]Added 2 Read/Feed constraints in 28 ms returned sat
[2020-06-03 16:16:11] [INFO ] Computed and/alt/rep : 293/1426/293 causal constraints in 42 ms.
[2020-06-03 16:16:14] [INFO ] Added : 272 causal constraints over 55 iterations in 3317 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 43 ms.
[2020-06-03 16:16:15] [INFO ] [Real]Absence check using 35 positive place invariants in 34 ms returned sat
[2020-06-03 16:16:15] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 42 ms returned sat
[2020-06-03 16:16:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:16:16] [INFO ] [Real]Absence check using state equation in 995 ms returned sat
[2020-06-03 16:16:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:16:16] [INFO ] [Nat]Absence check using 35 positive place invariants in 40 ms returned sat
[2020-06-03 16:16:16] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 100 ms returned sat
[2020-06-03 16:16:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:16:17] [INFO ] [Nat]Absence check using state equation in 1119 ms returned sat
[2020-06-03 16:16:17] [INFO ] [Nat]Added 2 Read/Feed constraints in 17 ms returned sat
[2020-06-03 16:16:17] [INFO ] Deduced a trap composed of 74 places in 268 ms
[2020-06-03 16:16:18] [INFO ] Deduced a trap composed of 68 places in 142 ms
[2020-06-03 16:16:18] [INFO ] Deduced a trap composed of 66 places in 163 ms
[2020-06-03 16:16:18] [INFO ] Deduced a trap composed of 76 places in 165 ms
[2020-06-03 16:16:18] [INFO ] Deduced a trap composed of 9 places in 111 ms
[2020-06-03 16:16:18] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1218 ms
[2020-06-03 16:16:18] [INFO ] Computed and/alt/rep : 293/1426/293 causal constraints in 27 ms.
[2020-06-03 16:16:22] [INFO ] Added : 281 causal constraints over 57 iterations in 3500 ms. Result :sat
[2020-06-03 16:16:22] [INFO ] Deduced a trap composed of 12 places in 129 ms
[2020-06-03 16:16:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 253 ms
Attempting to minimize the solution found.
Minimization took 36 ms.
[2020-06-03 16:16:22] [INFO ] [Real]Absence check using 35 positive place invariants in 47 ms returned sat
[2020-06-03 16:16:22] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 50 ms returned sat
[2020-06-03 16:16:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:16:23] [INFO ] [Real]Absence check using state equation in 1215 ms returned sat
[2020-06-03 16:16:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:16:24] [INFO ] [Nat]Absence check using 35 positive place invariants in 45 ms returned sat
[2020-06-03 16:16:24] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 103 ms returned sat
[2020-06-03 16:16:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:16:25] [INFO ] [Nat]Absence check using state equation in 1292 ms returned sat
[2020-06-03 16:16:25] [INFO ] [Nat]Added 2 Read/Feed constraints in 204 ms returned sat
[2020-06-03 16:16:25] [INFO ] Computed and/alt/rep : 293/1426/293 causal constraints in 40 ms.
[2020-06-03 16:16:29] [INFO ] Added : 281 causal constraints over 57 iterations in 3875 ms. Result :sat
[2020-06-03 16:16:29] [INFO ] Deduced a trap composed of 9 places in 121 ms
[2020-06-03 16:16:29] [INFO ] Deduced a trap composed of 11 places in 107 ms
[2020-06-03 16:16:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 475 ms
Attempting to minimize the solution found.
Minimization took 32 ms.
[2020-06-03 16:16:30] [INFO ] [Real]Absence check using 35 positive place invariants in 42 ms returned sat
[2020-06-03 16:16:30] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 47 ms returned sat
[2020-06-03 16:16:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:16:31] [INFO ] [Real]Absence check using state equation in 1070 ms returned sat
[2020-06-03 16:16:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:16:31] [INFO ] [Nat]Absence check using 35 positive place invariants in 36 ms returned sat
[2020-06-03 16:16:31] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 60 ms returned sat
[2020-06-03 16:16:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:16:32] [INFO ] [Nat]Absence check using state equation in 1187 ms returned sat
[2020-06-03 16:16:33] [INFO ] [Nat]Added 2 Read/Feed constraints in 176 ms returned sat
[2020-06-03 16:16:33] [INFO ] Deduced a trap composed of 16 places in 236 ms
[2020-06-03 16:16:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 307 ms
[2020-06-03 16:16:33] [INFO ] Computed and/alt/rep : 293/1426/293 causal constraints in 33 ms.
[2020-06-03 16:16:35] [INFO ] Added : 90 causal constraints over 18 iterations in 1681 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
[2020-06-03 16:16:35] [INFO ] [Real]Absence check using 35 positive place invariants in 34 ms returned sat
[2020-06-03 16:16:35] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 42 ms returned sat
[2020-06-03 16:16:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:16:36] [INFO ] [Real]Absence check using state equation in 1174 ms returned sat
[2020-06-03 16:16:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:16:36] [INFO ] [Nat]Absence check using 35 positive place invariants in 44 ms returned sat
[2020-06-03 16:16:36] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 61 ms returned sat
[2020-06-03 16:16:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:16:37] [INFO ] [Nat]Absence check using state equation in 823 ms returned sat
[2020-06-03 16:16:37] [INFO ] [Nat]Added 2 Read/Feed constraints in 36 ms returned sat
[2020-06-03 16:16:37] [INFO ] Deduced a trap composed of 68 places in 76 ms
[2020-06-03 16:16:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2020-06-03 16:16:37] [INFO ] Computed and/alt/rep : 293/1426/293 causal constraints in 35 ms.
[2020-06-03 16:16:41] [INFO ] Added : 264 causal constraints over 53 iterations in 4061 ms. Result :sat
[2020-06-03 16:16:41] [INFO ] Deduced a trap composed of 6 places in 128 ms
[2020-06-03 16:16:42] [INFO ] Deduced a trap composed of 7 places in 114 ms
[2020-06-03 16:16:42] [INFO ] Deduced a trap composed of 18 places in 121 ms
[2020-06-03 16:16:42] [INFO ] Deduced a trap composed of 18 places in 120 ms
[2020-06-03 16:16:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 794 ms
Attempting to minimize the solution found.
Minimization took 40 ms.
Incomplete Parikh walk after 192500 steps, including 2824 resets, run finished after 833 ms. (steps per millisecond=231 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 43300 steps, including 604 resets, run finished after 190 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 267200 steps, including 4040 resets, run finished after 1158 ms. (steps per millisecond=230 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 278000 steps, including 3024 resets, run finished after 1207 ms. (steps per millisecond=230 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 298200 steps, including 4394 resets, run finished after 1281 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 276000 steps, including 3766 resets, run finished after 1195 ms. (steps per millisecond=230 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 17 out of 352 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 32 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 44 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
// Phase 1: matrix 294 rows 352 cols
[2020-06-03 16:16:48] [INFO ] Computed 60 place invariants in 14 ms
[2020-06-03 16:16:50] [INFO ] Implicit Places using invariants in 1869 ms returned []
// Phase 1: matrix 294 rows 352 cols
[2020-06-03 16:16:50] [INFO ] Computed 60 place invariants in 14 ms
[2020-06-03 16:16:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-03 16:16:58] [INFO ] Implicit Places using invariants and state equation in 8095 ms returned []
Implicit Place search using SMT with State Equation took 9973 ms to find 0 implicit places.
[2020-06-03 16:16:58] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 294 rows 352 cols
[2020-06-03 16:16:58] [INFO ] Computed 60 place invariants in 17 ms
[2020-06-03 16:17:00] [INFO ] Dead Transitions using invariants and state equation in 1718 ms returned []
Finished structural reductions, in 1 iterations. Remains : 352/352 places, 294/294 transitions.
Incomplete random walk after 100000 steps, including 1353 resets, run finished after 531 ms. (steps per millisecond=188 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 294 rows 352 cols
[2020-06-03 16:17:00] [INFO ] Computed 60 place invariants in 12 ms
[2020-06-03 16:17:00] [INFO ] [Real]Absence check using 35 positive place invariants in 34 ms returned sat
[2020-06-03 16:17:00] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 42 ms returned sat
[2020-06-03 16:17:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:17:01] [INFO ] [Real]Absence check using state equation in 891 ms returned sat
[2020-06-03 16:17:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:17:02] [INFO ] [Nat]Absence check using 35 positive place invariants in 44 ms returned sat
[2020-06-03 16:17:02] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 89 ms returned sat
[2020-06-03 16:17:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:17:03] [INFO ] [Nat]Absence check using state equation in 1389 ms returned sat
[2020-06-03 16:17:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-03 16:17:03] [INFO ] [Nat]Added 2 Read/Feed constraints in 29 ms returned sat
[2020-06-03 16:17:03] [INFO ] Deduced a trap composed of 68 places in 232 ms
[2020-06-03 16:17:04] [INFO ] Deduced a trap composed of 79 places in 252 ms
[2020-06-03 16:17:04] [INFO ] Deduced a trap composed of 76 places in 226 ms
[2020-06-03 16:17:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1053 ms
[2020-06-03 16:17:04] [INFO ] Computed and/alt/rep : 293/1426/293 causal constraints in 37 ms.
[2020-06-03 16:17:07] [INFO ] Added : 285 causal constraints over 57 iterations in 3265 ms. Result :sat
[2020-06-03 16:17:07] [INFO ] [Real]Absence check using 35 positive place invariants in 37 ms returned sat
[2020-06-03 16:17:08] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 46 ms returned sat
[2020-06-03 16:17:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:17:09] [INFO ] [Real]Absence check using state equation in 1020 ms returned sat
[2020-06-03 16:17:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:17:09] [INFO ] [Nat]Absence check using 35 positive place invariants in 35 ms returned sat
[2020-06-03 16:17:09] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 92 ms returned sat
[2020-06-03 16:17:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:17:10] [INFO ] [Nat]Absence check using state equation in 1657 ms returned sat
[2020-06-03 16:17:11] [INFO ] [Nat]Added 2 Read/Feed constraints in 50 ms returned sat
[2020-06-03 16:17:11] [INFO ] Computed and/alt/rep : 293/1426/293 causal constraints in 41 ms.
[2020-06-03 16:17:14] [INFO ] Added : 272 causal constraints over 55 iterations in 3189 ms. Result :sat
[2020-06-03 16:17:14] [INFO ] [Real]Absence check using 35 positive place invariants in 36 ms returned sat
[2020-06-03 16:17:14] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 47 ms returned sat
[2020-06-03 16:17:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:17:15] [INFO ] [Real]Absence check using state equation in 943 ms returned sat
[2020-06-03 16:17:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:17:15] [INFO ] [Nat]Absence check using 35 positive place invariants in 44 ms returned sat
[2020-06-03 16:17:15] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 96 ms returned sat
[2020-06-03 16:17:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:17:16] [INFO ] [Nat]Absence check using state equation in 1089 ms returned sat
[2020-06-03 16:17:16] [INFO ] [Nat]Added 2 Read/Feed constraints in 31 ms returned sat
[2020-06-03 16:17:17] [INFO ] Deduced a trap composed of 74 places in 238 ms
[2020-06-03 16:17:17] [INFO ] Deduced a trap composed of 68 places in 186 ms
[2020-06-03 16:17:17] [INFO ] Deduced a trap composed of 66 places in 153 ms
[2020-06-03 16:17:17] [INFO ] Deduced a trap composed of 76 places in 148 ms
[2020-06-03 16:17:17] [INFO ] Deduced a trap composed of 9 places in 117 ms
[2020-06-03 16:17:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1221 ms
[2020-06-03 16:17:17] [INFO ] Computed and/alt/rep : 293/1426/293 causal constraints in 26 ms.
[2020-06-03 16:17:21] [INFO ] Added : 281 causal constraints over 57 iterations in 3253 ms. Result :sat
[2020-06-03 16:17:21] [INFO ] Deduced a trap composed of 12 places in 69 ms
[2020-06-03 16:17:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2020-06-03 16:17:21] [INFO ] [Real]Absence check using 35 positive place invariants in 42 ms returned sat
[2020-06-03 16:17:21] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 51 ms returned sat
[2020-06-03 16:17:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:17:22] [INFO ] [Real]Absence check using state equation in 1200 ms returned sat
[2020-06-03 16:17:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:17:22] [INFO ] [Nat]Absence check using 35 positive place invariants in 40 ms returned sat
[2020-06-03 16:17:23] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 118 ms returned sat
[2020-06-03 16:17:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:17:24] [INFO ] [Nat]Absence check using state equation in 1255 ms returned sat
[2020-06-03 16:17:24] [INFO ] [Nat]Added 2 Read/Feed constraints in 204 ms returned sat
[2020-06-03 16:17:24] [INFO ] Computed and/alt/rep : 293/1426/293 causal constraints in 33 ms.
[2020-06-03 16:17:28] [INFO ] Added : 281 causal constraints over 57 iterations in 3836 ms. Result :sat
[2020-06-03 16:17:28] [INFO ] Deduced a trap composed of 9 places in 165 ms
[2020-06-03 16:17:28] [INFO ] Deduced a trap composed of 11 places in 129 ms
[2020-06-03 16:17:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 551 ms
[2020-06-03 16:17:29] [INFO ] [Real]Absence check using 35 positive place invariants in 35 ms returned sat
[2020-06-03 16:17:29] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 43 ms returned sat
[2020-06-03 16:17:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:17:30] [INFO ] [Real]Absence check using state equation in 1127 ms returned sat
[2020-06-03 16:17:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:17:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 45 ms returned sat
[2020-06-03 16:17:30] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 90 ms returned sat
[2020-06-03 16:17:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:17:31] [INFO ] [Nat]Absence check using state equation in 1265 ms returned sat
[2020-06-03 16:17:31] [INFO ] [Nat]Added 2 Read/Feed constraints in 175 ms returned sat
[2020-06-03 16:17:32] [INFO ] Deduced a trap composed of 16 places in 261 ms
[2020-06-03 16:17:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 322 ms
[2020-06-03 16:17:32] [INFO ] Computed and/alt/rep : 293/1426/293 causal constraints in 29 ms.
[2020-06-03 16:17:33] [INFO ] Added : 90 causal constraints over 18 iterations in 1716 ms. Result :sat
[2020-06-03 16:17:34] [INFO ] [Real]Absence check using 35 positive place invariants in 48 ms returned sat
[2020-06-03 16:17:34] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 52 ms returned sat
[2020-06-03 16:17:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:17:35] [INFO ] [Real]Absence check using state equation in 1172 ms returned sat
[2020-06-03 16:17:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:17:35] [INFO ] [Nat]Absence check using 35 positive place invariants in 39 ms returned sat
[2020-06-03 16:17:35] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 55 ms returned sat
[2020-06-03 16:17:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:17:36] [INFO ] [Nat]Absence check using state equation in 835 ms returned sat
[2020-06-03 16:17:36] [INFO ] [Nat]Added 2 Read/Feed constraints in 35 ms returned sat
[2020-06-03 16:17:36] [INFO ] Deduced a trap composed of 68 places in 97 ms
[2020-06-03 16:17:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2020-06-03 16:17:36] [INFO ] Computed and/alt/rep : 293/1426/293 causal constraints in 32 ms.
[2020-06-03 16:17:40] [INFO ] Added : 264 causal constraints over 53 iterations in 3835 ms. Result :sat
[2020-06-03 16:17:40] [INFO ] Deduced a trap composed of 6 places in 101 ms
[2020-06-03 16:17:40] [INFO ] Deduced a trap composed of 7 places in 98 ms
[2020-06-03 16:17:40] [INFO ] Deduced a trap composed of 18 places in 94 ms
[2020-06-03 16:17:41] [INFO ] Deduced a trap composed of 18 places in 97 ms
[2020-06-03 16:17:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 709 ms
Applied a total of 0 rules in 28 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
// Phase 1: matrix 294 rows 352 cols
[2020-06-03 16:17:41] [INFO ] Computed 60 place invariants in 10 ms
[2020-06-03 16:17:41] [INFO ] [Real]Absence check using 35 positive place invariants in 34 ms returned sat
[2020-06-03 16:17:41] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 43 ms returned sat
[2020-06-03 16:17:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:17:42] [INFO ] [Real]Absence check using state equation in 979 ms returned sat
[2020-06-03 16:17:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:17:42] [INFO ] [Nat]Absence check using 35 positive place invariants in 47 ms returned sat
[2020-06-03 16:17:42] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 61 ms returned sat
[2020-06-03 16:17:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:17:44] [INFO ] [Nat]Absence check using state equation in 1408 ms returned sat
[2020-06-03 16:17:44] [INFO ] Deduced a trap composed of 8 places in 77 ms
[2020-06-03 16:17:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2020-06-03 16:17:44] [INFO ] Computed and/alt/rep : 293/1420/293 causal constraints in 32 ms.
[2020-06-03 16:17:47] [INFO ] Added : 273 causal constraints over 55 iterations in 3228 ms. Result :sat
[2020-06-03 16:17:47] [INFO ] Deduced a trap composed of 66 places in 207 ms
[2020-06-03 16:17:47] [INFO ] Deduced a trap composed of 81 places in 160 ms
[2020-06-03 16:17:48] [INFO ] Deduced a trap composed of 74 places in 124 ms
[2020-06-03 16:17:48] [INFO ] Deduced a trap composed of 78 places in 119 ms
[2020-06-03 16:17:48] [INFO ] Deduced a trap composed of 76 places in 112 ms
[2020-06-03 16:17:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1199 ms
Attempting to minimize the solution found.
Minimization took 34 ms.
[2020-06-03 16:17:48] [INFO ] [Real]Absence check using 35 positive place invariants in 46 ms returned sat
[2020-06-03 16:17:48] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 47 ms returned sat
[2020-06-03 16:17:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:17:49] [INFO ] [Real]Absence check using state equation in 1051 ms returned sat
[2020-06-03 16:17:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:17:50] [INFO ] [Nat]Absence check using 35 positive place invariants in 37 ms returned sat
[2020-06-03 16:17:50] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 96 ms returned sat
[2020-06-03 16:17:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:17:51] [INFO ] [Nat]Absence check using state equation in 1571 ms returned sat
[2020-06-03 16:17:51] [INFO ] Deduced a trap composed of 13 places in 167 ms
[2020-06-03 16:17:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2020-06-03 16:17:51] [INFO ] Computed and/alt/rep : 293/1420/293 causal constraints in 35 ms.
[2020-06-03 16:17:55] [INFO ] Added : 292 causal constraints over 59 iterations in 3506 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 37 ms.
[2020-06-03 16:17:55] [INFO ] [Real]Absence check using 35 positive place invariants in 44 ms returned sat
[2020-06-03 16:17:55] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 48 ms returned sat
[2020-06-03 16:17:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:17:56] [INFO ] [Real]Absence check using state equation in 1030 ms returned sat
[2020-06-03 16:17:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:17:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 45 ms returned sat
[2020-06-03 16:17:57] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 96 ms returned sat
[2020-06-03 16:17:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:17:58] [INFO ] [Nat]Absence check using state equation in 1198 ms returned sat
[2020-06-03 16:17:58] [INFO ] Deduced a trap composed of 10 places in 219 ms
[2020-06-03 16:17:58] [INFO ] Deduced a trap composed of 8 places in 48 ms
[2020-06-03 16:17:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 371 ms
[2020-06-03 16:17:58] [INFO ] Computed and/alt/rep : 293/1420/293 causal constraints in 34 ms.
[2020-06-03 16:18:02] [INFO ] Added : 284 causal constraints over 57 iterations in 3684 ms. Result :sat
[2020-06-03 16:18:02] [INFO ] Deduced a trap composed of 68 places in 184 ms
[2020-06-03 16:18:02] [INFO ] Deduced a trap composed of 66 places in 156 ms
[2020-06-03 16:18:02] [INFO ] Deduced a trap composed of 76 places in 118 ms
[2020-06-03 16:18:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 738 ms
Attempting to minimize the solution found.
Minimization took 38 ms.
[2020-06-03 16:18:03] [INFO ] [Real]Absence check using 35 positive place invariants in 34 ms returned sat
[2020-06-03 16:18:03] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 43 ms returned sat
[2020-06-03 16:18:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:18:04] [INFO ] [Real]Absence check using state equation in 1102 ms returned sat
[2020-06-03 16:18:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:18:04] [INFO ] [Nat]Absence check using 35 positive place invariants in 40 ms returned sat
[2020-06-03 16:18:04] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 99 ms returned sat
[2020-06-03 16:18:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:18:05] [INFO ] [Nat]Absence check using state equation in 1213 ms returned sat
[2020-06-03 16:18:06] [INFO ] Deduced a trap composed of 9 places in 76 ms
[2020-06-03 16:18:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2020-06-03 16:18:06] [INFO ] Computed and/alt/rep : 293/1420/293 causal constraints in 33 ms.
[2020-06-03 16:18:09] [INFO ] Added : 280 causal constraints over 56 iterations in 3271 ms. Result :sat
[2020-06-03 16:18:09] [INFO ] Deduced a trap composed of 9 places in 131 ms
[2020-06-03 16:18:09] [INFO ] Deduced a trap composed of 11 places in 146 ms
[2020-06-03 16:18:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 488 ms
Attempting to minimize the solution found.
Minimization took 30 ms.
[2020-06-03 16:18:10] [INFO ] [Real]Absence check using 35 positive place invariants in 36 ms returned sat
[2020-06-03 16:18:10] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 44 ms returned sat
[2020-06-03 16:18:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:18:11] [INFO ] [Real]Absence check using state equation in 1117 ms returned sat
[2020-06-03 16:18:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:18:11] [INFO ] [Nat]Absence check using 35 positive place invariants in 43 ms returned sat
[2020-06-03 16:18:11] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 62 ms returned sat
[2020-06-03 16:18:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:18:12] [INFO ] [Nat]Absence check using state equation in 1204 ms returned sat
[2020-06-03 16:18:12] [INFO ] Deduced a trap composed of 12 places in 168 ms
[2020-06-03 16:18:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2020-06-03 16:18:12] [INFO ] Computed and/alt/rep : 293/1420/293 causal constraints in 34 ms.
[2020-06-03 16:18:14] [INFO ] Added : 127 causal constraints over 26 iterations in 1933 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 28 ms.
[2020-06-03 16:18:15] [INFO ] [Real]Absence check using 35 positive place invariants in 46 ms returned sat
[2020-06-03 16:18:15] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 50 ms returned sat
[2020-06-03 16:18:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:18:16] [INFO ] [Real]Absence check using state equation in 1172 ms returned sat
[2020-06-03 16:18:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:18:16] [INFO ] [Nat]Absence check using 35 positive place invariants in 37 ms returned sat
[2020-06-03 16:18:16] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 56 ms returned sat
[2020-06-03 16:18:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:18:17] [INFO ] [Nat]Absence check using state equation in 887 ms returned sat
[2020-06-03 16:18:17] [INFO ] Computed and/alt/rep : 293/1420/293 causal constraints in 36 ms.
[2020-06-03 16:18:21] [INFO ] Added : 264 causal constraints over 53 iterations in 4173 ms. Result :sat
[2020-06-03 16:18:21] [INFO ] Deduced a trap composed of 6 places in 166 ms
[2020-06-03 16:18:21] [INFO ] Deduced a trap composed of 18 places in 83 ms
[2020-06-03 16:18:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 532 ms
Attempting to minimize the solution found.
Minimization took 42 ms.
[2020-06-03 16:18:22] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2020-06-03 16:18:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 11 ms.
[2020-06-03 16:18:22] [INFO ] Flatten gal took : 160 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ DES-PT-60a @ 3570 seconds

FORMULA DES-PT-60a-ReachabilityFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-60a-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-60a-ReachabilityFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-60a-ReachabilityFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-60a-ReachabilityFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-60a-ReachabilityFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3506
rslt: Output for ReachabilityFireability @ DES-PT-60a

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 16:18:22 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 593
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (((p63 <= 0) OR (p347 <= 0))))",
"processed_size": 36,
"rewrites": 2
},
"result":
{
"edges": 75473,
"markings": 62730,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (((p146 <= 0) OR (p268 <= 0))))",
"processed_size": 37,
"rewrites": 2
},
"result":
{
"edges": 1108,
"markings": 1109,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 890
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p6) AND (1 <= p271) AND (1 <= p273))))",
"processed_size": 51,
"rewrites": 1
},
"result":
{
"edges": 2637,
"markings": 2638,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1187
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G (((p63 <= 0) OR (p347 <= 0) OR ((1 <= p81) AND (1 <= p347)))))",
"processed_size": 69,
"rewrites": 2
},
"result":
{
"edges": 75473,
"markings": 62730,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1780
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (G (((p113 <= 0) OR (p347 <= 0) OR (p54 <= 0) OR (p271 <= 0) OR (p273 <= 0))))",
"processed_size": 84,
"rewrites": 2
},
"result":
{
"edges": 10622618,
"markings": 7509297,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 5
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3506
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p2) AND (1 <= p271) AND (1 <= p273) AND (1 <= p260) AND (1 <= p265) AND (1 <= p267) AND ((p162 <= 0) OR (p268 <= 0) OR ((1 <= p245) AND (1 <= p266))))))",
"processed_size": 167,
"rewrites": 1
},
"result":
{
"edges": 2834,
"markings": 2835,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 22,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 27688,
"runtime": 64.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : A(G(**)) : A(G(**))"
},
"net":
{
"arcs": 1450,
"conflict_clusters": 41,
"places": 352,
"places_significant": 292,
"singleton_clusters": 0,
"transitions": 294
},
"result":
{
"preliminary_value": "no yes no yes no no ",
"value": "no yes no yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 646/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 352
lola: finding significant places
lola: 352 places, 294 transitions, 292 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p347 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p347 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p271 <= 1)
lola: LP says that atomic proposition is always true: (p273 <= 1)
lola: LP says that atomic proposition is always true: (p260 <= 1)
lola: LP says that atomic proposition is always true: (p265 <= 1)
lola: LP says that atomic proposition is always true: (p267 <= 1)
lola: LP says that atomic proposition is always true: (p162 <= 1)
lola: LP says that atomic proposition is always true: (p268 <= 1)
lola: LP says that atomic proposition is always true: (p245 <= 1)
lola: LP says that atomic proposition is always true: (p266 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p347 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p271 <= 1)
lola: LP says that atomic proposition is always true: (p273 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p347 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p271 <= 1)
lola: LP says that atomic proposition is always true: (p273 <= 1)
lola: LP says that atomic proposition is always true: (p146 <= 1)
lola: LP says that atomic proposition is always true: (p268 <= 1)
lola: A (G (((p63 <= 0) OR (p347 <= 0) OR ((1 <= p81) AND (1 <= p347))))) : E (F (((1 <= p2) AND (1 <= p271) AND (1 <= p273) AND (1 <= p260) AND (1 <= p265) AND (1 <= p267) AND ((p162 <= 0) OR (p268 <= 0) OR ((1 <= p245) AND (1 <= p266)))))) : A (G (((p63 <= 0) OR (p347 <= 0)))) : E (F (((1 <= p6) AND (1 <= p271) AND (1 <= p273)))) : A (G (((p113 <= 0) OR (p347 <= 0) OR (p54 <= 0) OR (p271 <= 0) OR (p273 <= 0)))) : A (G (((p146 <= 0) OR (p268 <= 0))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p63 <= 0) OR (p347 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p63 <= 0) OR (p347 <= 0))))
lola: processed formula length: 36
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p63) AND (1 <= p347))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 62730 markings, 75473 edges
lola: ========================================
lola: subprocess 1 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p146 <= 0) OR (p268 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p146 <= 0) OR (p268 <= 0))))
lola: processed formula length: 37
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p146) AND (1 <= p268))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1109 markings, 1108 edges
lola: ========================================
lola: subprocess 2 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p6) AND (1 <= p271) AND (1 <= p273))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p6) AND (1 <= p271) AND (1 <= p273))))
lola: processed formula length: 51
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p6) AND (1 <= p271) AND (1 <= p273))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-2-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2638 markings, 2637 edges
lola: ========================================
lola: subprocess 3 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p63 <= 0) OR (p347 <= 0) OR ((1 <= p81) AND (1 <= p347)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p63 <= 0) OR (p347 <= 0) OR ((1 <= p81) AND (1 <= p347)))))
lola: processed formula length: 69
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p63) AND (1 <= p347) AND ((p81 <= 0) OR (p347 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-3-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 62730 markings, 75473 edges
lola: ========================================
lola: subprocess 4 will run for 1780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p113 <= 0) OR (p347 <= 0) OR (p54 <= 0) OR (p271 <= 0) OR (p273 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p113 <= 0) OR (p347 <= 0) OR (p54 <= 0) OR (p271 <= 0) OR (p273 <= 0))))
lola: processed formula length: 84
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p113) AND (1 <= p347) AND (1 <= p54) AND (1 <= p271) AND (1 <= p273))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-4-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 776865 markings, 1040875 edges, 155373 markings/sec, 0 secs
lola: sara is running 5 secs || 1480944 markings, 2045215 edges, 140816 markings/sec, 5 secs
lola: sara is running 10 secs || 2154251 markings, 3006816 edges, 134661 markings/sec, 10 secs
lola: sara is running 15 secs || 2824981 markings, 3955328 edges, 134146 markings/sec, 15 secs
lola: sara is running 20 secs || 3480933 markings, 4893178 edges, 131190 markings/sec, 20 secs
lola: sara is running 25 secs || 4140106 markings, 5825693 edges, 131835 markings/sec, 25 secs
lola: sara is running 30 secs || 4787317 markings, 6746867 edges, 129442 markings/sec, 30 secs
lola: sara is running 35 secs || 5417687 markings, 7644158 edges, 126074 markings/sec, 35 secs
lola: sara is running 40 secs || 6079600 markings, 8580735 edges, 132383 markings/sec, 40 secs
lola: sara is running 45 secs || 6783466 markings, 9584713 edges, 140773 markings/sec, 45 secs
lola: sara is running 50 secs || 7490591 markings, 10593843 edges, 141425 markings/sec, 50 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7509297 markings, 10622618 edges
lola: ========================================
lola: subprocess 5 will run for 3506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p2) AND (1 <= p271) AND (1 <= p273) AND (1 <= p260) AND (1 <= p265) AND (1 <= p267) AND ((p162 <= 0) OR (p268 <= 0) OR ((1 <= p245) AND (1 <= p266))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p2) AND (1 <= p271) AND (1 <= p273) AND (1 <= p260) AND (1 <= p265) AND (1 <= p267) AND ((p162 <= 0) OR (p268 <= 0) OR ((1 <= p245) AND (1 <= p266))))))
lola: processed formula length: 167
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p2) AND (1 <= p271) AND (1 <= p273) AND (1 <= p260) AND (1 <= p265) AND (1 <= p267) AND ((p162 <= 0) OR (p268 <= 0) OR ((1 <= p245) AND (1 <= p266))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 22 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2835 markings, 2834 edges
lola: RESULT
lola:
SUMMARY: no yes no yes no no
lola:
preliminary result: no yes no yes no no
lola: ========================================
lola: memory consumption: 27688 KB
lola: time consumption: 64 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished

--------------------
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-60a"
export BK_EXAMINATION="ReachabilityFireability"
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-60a, examination is ReachabilityFireability"
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-158987900000327"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-60a.tgz
mv DES-PT-60a execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;