Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987914000492.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is BusinessProcesses-PT-06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914000492
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 2.8K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 22:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 22:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 14:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 85K 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 BusinessProcesses-PT-06-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591158563197

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 04:29:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 04:29:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 04:29:24] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2020-06-03 04:29:24] [INFO ] Transformed 376 places.
[2020-06-03 04:29:24] [INFO ] Transformed 297 transitions.
[2020-06-03 04:29:24] [INFO ] Found NUPN structural information;
[2020-06-03 04:29:24] [INFO ] Parsed PT model containing 376 places and 297 transitions in 92 ms.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Incomplete random walk after 100000 steps, including 1024 resets, run finished after 219 ms. (steps per millisecond=456 ) properties seen :[0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1]
// Phase 1: matrix 296 rows 375 cols
[2020-06-03 04:29:24] [INFO ] Computed 81 place invariants in 13 ms
[2020-06-03 04:29:25] [INFO ] [Real]Absence check using 42 positive place invariants in 32 ms returned sat
[2020-06-03 04:29:25] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 16 ms returned sat
[2020-06-03 04:29:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:29:25] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2020-06-03 04:29:25] [INFO ] Deduced a trap composed of 12 places in 97 ms
[2020-06-03 04:29:25] [INFO ] Deduced a trap composed of 11 places in 73 ms
[2020-06-03 04:29:25] [INFO ] Deduced a trap composed of 18 places in 65 ms
[2020-06-03 04:29:25] [INFO ] Deduced a trap composed of 21 places in 70 ms
[2020-06-03 04:29:25] [INFO ] Deduced a trap composed of 21 places in 53 ms
[2020-06-03 04:29:25] [INFO ] Deduced a trap composed of 14 places in 56 ms
[2020-06-03 04:29:25] [INFO ] Deduced a trap composed of 17 places in 49 ms
[2020-06-03 04:29:26] [INFO ] Deduced a trap composed of 16 places in 80 ms
[2020-06-03 04:29:26] [INFO ] Deduced a trap composed of 14 places in 54 ms
[2020-06-03 04:29:26] [INFO ] Deduced a trap composed of 21 places in 48 ms
[2020-06-03 04:29:26] [INFO ] Deduced a trap composed of 22 places in 44 ms
[2020-06-03 04:29:26] [INFO ] Deduced a trap composed of 20 places in 55 ms
[2020-06-03 04:29:26] [INFO ] Deduced a trap composed of 26 places in 75 ms
[2020-06-03 04:29:26] [INFO ] Deduced a trap composed of 26 places in 35 ms
[2020-06-03 04:29:26] [INFO ] Deduced a trap composed of 24 places in 27 ms
[2020-06-03 04:29:26] [INFO ] Deduced a trap composed of 19 places in 31 ms
[2020-06-03 04:29:26] [INFO ] Deduced a trap composed of 23 places in 20 ms
[2020-06-03 04:29:26] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1221 ms
[2020-06-03 04:29:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:29:26] [INFO ] [Nat]Absence check using 42 positive place invariants in 32 ms returned sat
[2020-06-03 04:29:26] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 24 ms returned sat
[2020-06-03 04:29:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:29:27] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2020-06-03 04:29:27] [INFO ] Deduced a trap composed of 12 places in 63 ms
[2020-06-03 04:29:27] [INFO ] Deduced a trap composed of 11 places in 65 ms
[2020-06-03 04:29:27] [INFO ] Deduced a trap composed of 18 places in 49 ms
[2020-06-03 04:29:27] [INFO ] Deduced a trap composed of 21 places in 55 ms
[2020-06-03 04:29:27] [INFO ] Deduced a trap composed of 21 places in 47 ms
[2020-06-03 04:29:27] [INFO ] Deduced a trap composed of 14 places in 55 ms
[2020-06-03 04:29:27] [INFO ] Deduced a trap composed of 17 places in 44 ms
[2020-06-03 04:29:27] [INFO ] Deduced a trap composed of 16 places in 48 ms
[2020-06-03 04:29:27] [INFO ] Deduced a trap composed of 14 places in 39 ms
[2020-06-03 04:29:27] [INFO ] Deduced a trap composed of 21 places in 39 ms
[2020-06-03 04:29:27] [INFO ] Deduced a trap composed of 23 places in 56 ms
[2020-06-03 04:29:27] [INFO ] Deduced a trap composed of 24 places in 34 ms
[2020-06-03 04:29:27] [INFO ] Deduced a trap composed of 25 places in 31 ms
[2020-06-03 04:29:27] [INFO ] Deduced a trap composed of 22 places in 29 ms
[2020-06-03 04:29:27] [INFO ] Deduced a trap composed of 25 places in 27 ms
[2020-06-03 04:29:27] [INFO ] Deduced a trap composed of 23 places in 33 ms
[2020-06-03 04:29:27] [INFO ] Deduced a trap composed of 20 places in 27 ms
[2020-06-03 04:29:28] [INFO ] Deduced a trap composed of 25 places in 25 ms
[2020-06-03 04:29:28] [INFO ] Deduced a trap composed of 19 places in 27 ms
[2020-06-03 04:29:28] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1024 ms
[2020-06-03 04:29:28] [INFO ] Computed and/alt/rep : 295/981/295 causal constraints in 34 ms.
[2020-06-03 04:29:29] [INFO ] Added : 278 causal constraints over 56 iterations in 1305 ms. Result :sat
[2020-06-03 04:29:29] [INFO ] [Real]Absence check using 42 positive place invariants in 23 ms returned unsat
[2020-06-03 04:29:29] [INFO ] [Real]Absence check using 42 positive place invariants in 15 ms returned unsat
[2020-06-03 04:29:29] [INFO ] [Real]Absence check using 42 positive place invariants in 21 ms returned sat
[2020-06-03 04:29:29] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 17 ms returned sat
[2020-06-03 04:29:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:29:29] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2020-06-03 04:29:30] [INFO ] Deduced a trap composed of 10 places in 107 ms
[2020-06-03 04:29:30] [INFO ] Deduced a trap composed of 8 places in 98 ms
[2020-06-03 04:29:30] [INFO ] Deduced a trap composed of 16 places in 62 ms
[2020-06-03 04:29:30] [INFO ] Deduced a trap composed of 18 places in 48 ms
[2020-06-03 04:29:30] [INFO ] Deduced a trap composed of 21 places in 48 ms
[2020-06-03 04:29:30] [INFO ] Deduced a trap composed of 11 places in 42 ms
[2020-06-03 04:29:30] [INFO ] Deduced a trap composed of 19 places in 44 ms
[2020-06-03 04:29:30] [INFO ] Deduced a trap composed of 15 places in 46 ms
[2020-06-03 04:29:30] [INFO ] Deduced a trap composed of 21 places in 42 ms
[2020-06-03 04:29:30] [INFO ] Deduced a trap composed of 19 places in 46 ms
[2020-06-03 04:29:30] [INFO ] Deduced a trap composed of 20 places in 44 ms
[2020-06-03 04:29:30] [INFO ] Deduced a trap composed of 18 places in 42 ms
[2020-06-03 04:29:30] [INFO ] Deduced a trap composed of 24 places in 39 ms
[2020-06-03 04:29:30] [INFO ] Deduced a trap composed of 15 places in 42 ms
[2020-06-03 04:29:30] [INFO ] Deduced a trap composed of 21 places in 55 ms
[2020-06-03 04:29:31] [INFO ] Deduced a trap composed of 24 places in 39 ms
[2020-06-03 04:29:31] [INFO ] Deduced a trap composed of 19 places in 30 ms
[2020-06-03 04:29:31] [INFO ] Deduced a trap composed of 14 places in 31 ms
[2020-06-03 04:29:31] [INFO ] Deduced a trap composed of 22 places in 24 ms
[2020-06-03 04:29:31] [INFO ] Deduced a trap composed of 24 places in 22 ms
[2020-06-03 04:29:31] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1258 ms
[2020-06-03 04:29:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:29:31] [INFO ] [Nat]Absence check using 42 positive place invariants in 26 ms returned sat
[2020-06-03 04:29:31] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 15 ms returned sat
[2020-06-03 04:29:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:29:31] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2020-06-03 04:29:31] [INFO ] Deduced a trap composed of 10 places in 92 ms
[2020-06-03 04:29:31] [INFO ] Deduced a trap composed of 8 places in 102 ms
[2020-06-03 04:29:31] [INFO ] Deduced a trap composed of 16 places in 62 ms
[2020-06-03 04:29:31] [INFO ] Deduced a trap composed of 18 places in 71 ms
[2020-06-03 04:29:32] [INFO ] Deduced a trap composed of 21 places in 55 ms
[2020-06-03 04:29:32] [INFO ] Deduced a trap composed of 11 places in 60 ms
[2020-06-03 04:29:32] [INFO ] Deduced a trap composed of 19 places in 52 ms
[2020-06-03 04:29:32] [INFO ] Deduced a trap composed of 15 places in 48 ms
[2020-06-03 04:29:32] [INFO ] Deduced a trap composed of 21 places in 49 ms
[2020-06-03 04:29:32] [INFO ] Deduced a trap composed of 19 places in 91 ms
[2020-06-03 04:29:32] [INFO ] Deduced a trap composed of 15 places in 88 ms
[2020-06-03 04:29:32] [INFO ] Deduced a trap composed of 24 places in 87 ms
[2020-06-03 04:29:32] [INFO ] Deduced a trap composed of 78 places in 82 ms
[2020-06-03 04:29:32] [INFO ] Deduced a trap composed of 79 places in 83 ms
[2020-06-03 04:29:32] [INFO ] Deduced a trap composed of 18 places in 84 ms
[2020-06-03 04:29:32] [INFO ] Deduced a trap composed of 23 places in 75 ms
[2020-06-03 04:29:33] [INFO ] Deduced a trap composed of 14 places in 64 ms
[2020-06-03 04:29:33] [INFO ] Deduced a trap composed of 19 places in 66 ms
[2020-06-03 04:29:33] [INFO ] Deduced a trap composed of 78 places in 69 ms
[2020-06-03 04:29:33] [INFO ] Deduced a trap composed of 72 places in 71 ms
[2020-06-03 04:29:33] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1734 ms
[2020-06-03 04:29:33] [INFO ] Computed and/alt/rep : 295/981/295 causal constraints in 15 ms.
[2020-06-03 04:29:34] [INFO ] Added : 290 causal constraints over 58 iterations in 1300 ms. Result :sat
[2020-06-03 04:29:34] [INFO ] Deduced a trap composed of 79 places in 79 ms
[2020-06-03 04:29:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2020-06-03 04:29:34] [INFO ] [Real]Absence check using 42 positive place invariants in 22 ms returned sat
[2020-06-03 04:29:34] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 21 ms returned sat
[2020-06-03 04:29:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:29:35] [INFO ] [Real]Absence check using state equation in 346 ms returned sat
[2020-06-03 04:29:35] [INFO ] Deduced a trap composed of 27 places in 50 ms
[2020-06-03 04:29:35] [INFO ] Deduced a trap composed of 17 places in 48 ms
[2020-06-03 04:29:35] [INFO ] Deduced a trap composed of 14 places in 48 ms
[2020-06-03 04:29:35] [INFO ] Deduced a trap composed of 20 places in 47 ms
[2020-06-03 04:29:35] [INFO ] Deduced a trap composed of 11 places in 47 ms
[2020-06-03 04:29:35] [INFO ] Deduced a trap composed of 18 places in 45 ms
[2020-06-03 04:29:35] [INFO ] Deduced a trap composed of 24 places in 44 ms
[2020-06-03 04:29:35] [INFO ] Deduced a trap composed of 19 places in 34 ms
[2020-06-03 04:29:35] [INFO ] Deduced a trap composed of 23 places in 32 ms
[2020-06-03 04:29:35] [INFO ] Deduced a trap composed of 13 places in 35 ms
[2020-06-03 04:29:35] [INFO ] Deduced a trap composed of 23 places in 28 ms
[2020-06-03 04:29:35] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 605 ms
[2020-06-03 04:29:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:29:35] [INFO ] [Nat]Absence check using 42 positive place invariants in 29 ms returned sat
[2020-06-03 04:29:35] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 24 ms returned sat
[2020-06-03 04:29:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:29:36] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2020-06-03 04:29:36] [INFO ] Deduced a trap composed of 20 places in 59 ms
[2020-06-03 04:29:36] [INFO ] Deduced a trap composed of 11 places in 54 ms
[2020-06-03 04:29:36] [INFO ] Deduced a trap composed of 24 places in 53 ms
[2020-06-03 04:29:36] [INFO ] Deduced a trap composed of 13 places in 52 ms
[2020-06-03 04:29:36] [INFO ] Deduced a trap composed of 22 places in 56 ms
[2020-06-03 04:29:36] [INFO ] Deduced a trap composed of 25 places in 43 ms
[2020-06-03 04:29:36] [INFO ] Deduced a trap composed of 14 places in 44 ms
[2020-06-03 04:29:36] [INFO ] Deduced a trap composed of 18 places in 43 ms
[2020-06-03 04:29:36] [INFO ] Deduced a trap composed of 8 places in 47 ms
[2020-06-03 04:29:36] [INFO ] Deduced a trap composed of 20 places in 44 ms
[2020-06-03 04:29:36] [INFO ] Deduced a trap composed of 20 places in 50 ms
[2020-06-03 04:29:37] [INFO ] Deduced a trap composed of 19 places in 44 ms
[2020-06-03 04:29:37] [INFO ] Deduced a trap composed of 24 places in 39 ms
[2020-06-03 04:29:37] [INFO ] Deduced a trap composed of 17 places in 41 ms
[2020-06-03 04:29:37] [INFO ] Deduced a trap composed of 82 places in 77 ms
[2020-06-03 04:29:37] [INFO ] Deduced a trap composed of 15 places in 76 ms
[2020-06-03 04:29:37] [INFO ] Deduced a trap composed of 22 places in 77 ms
[2020-06-03 04:29:37] [INFO ] Deduced a trap composed of 78 places in 75 ms
[2020-06-03 04:29:37] [INFO ] Deduced a trap composed of 87 places in 74 ms
[2020-06-03 04:29:37] [INFO ] Deduced a trap composed of 82 places in 70 ms
[2020-06-03 04:29:37] [INFO ] Deduced a trap composed of 78 places in 62 ms
[2020-06-03 04:29:37] [INFO ] Deduced a trap composed of 80 places in 76 ms
[2020-06-03 04:29:37] [INFO ] Deduced a trap composed of 78 places in 69 ms
[2020-06-03 04:29:37] [INFO ] Deduced a trap composed of 83 places in 68 ms
[2020-06-03 04:29:38] [INFO ] Deduced a trap composed of 81 places in 66 ms
[2020-06-03 04:29:38] [INFO ] Deduced a trap composed of 82 places in 63 ms
[2020-06-03 04:29:38] [INFO ] Deduced a trap composed of 80 places in 77 ms
[2020-06-03 04:29:38] [INFO ] Deduced a trap composed of 81 places in 73 ms
[2020-06-03 04:29:38] [INFO ] Deduced a trap composed of 78 places in 76 ms
[2020-06-03 04:29:38] [INFO ] Deduced a trap composed of 83 places in 77 ms
[2020-06-03 04:29:38] [INFO ] Deduced a trap composed of 86 places in 77 ms
[2020-06-03 04:29:38] [INFO ] Deduced a trap composed of 87 places in 81 ms
[2020-06-03 04:29:38] [INFO ] Deduced a trap composed of 86 places in 78 ms
[2020-06-03 04:29:38] [INFO ] Deduced a trap composed of 20 places in 76 ms
[2020-06-03 04:29:38] [INFO ] Deduced a trap composed of 81 places in 78 ms
[2020-06-03 04:29:39] [INFO ] Deduced a trap composed of 84 places in 76 ms
[2020-06-03 04:29:39] [INFO ] Deduced a trap composed of 88 places in 81 ms
[2020-06-03 04:29:39] [INFO ] Deduced a trap composed of 81 places in 74 ms
[2020-06-03 04:29:39] [INFO ] Deduced a trap composed of 89 places in 68 ms
[2020-06-03 04:29:39] [INFO ] Deduced a trap composed of 87 places in 70 ms
[2020-06-03 04:29:39] [INFO ] Deduced a trap composed of 81 places in 74 ms
[2020-06-03 04:29:39] [INFO ] Deduced a trap composed of 80 places in 71 ms
[2020-06-03 04:29:39] [INFO ] Deduced a trap composed of 82 places in 81 ms
[2020-06-03 04:29:39] [INFO ] Deduced a trap composed of 85 places in 79 ms
[2020-06-03 04:29:39] [INFO ] Deduced a trap composed of 84 places in 78 ms
[2020-06-03 04:29:39] [INFO ] Deduced a trap composed of 81 places in 72 ms
[2020-06-03 04:29:40] [INFO ] Deduced a trap composed of 89 places in 74 ms
[2020-06-03 04:29:40] [INFO ] Deduced a trap composed of 79 places in 84 ms
[2020-06-03 04:29:40] [INFO ] Deduced a trap composed of 79 places in 80 ms
[2020-06-03 04:29:40] [INFO ] Deduced a trap composed of 82 places in 76 ms
[2020-06-03 04:29:40] [INFO ] Deduced a trap composed of 81 places in 74 ms
[2020-06-03 04:29:40] [INFO ] Deduced a trap composed of 80 places in 83 ms
[2020-06-03 04:29:40] [INFO ] Deduced a trap composed of 76 places in 78 ms
[2020-06-03 04:29:40] [INFO ] Deduced a trap composed of 20 places in 78 ms
[2020-06-03 04:29:40] [INFO ] Deduced a trap composed of 92 places in 77 ms
[2020-06-03 04:29:41] [INFO ] Deduced a trap composed of 79 places in 73 ms
[2020-06-03 04:29:41] [INFO ] Deduced a trap composed of 80 places in 71 ms
[2020-06-03 04:29:41] [INFO ] Deduced a trap composed of 16 places in 71 ms
[2020-06-03 04:29:41] [INFO ] Deduced a trap composed of 86 places in 81 ms
[2020-06-03 04:29:41] [INFO ] Deduced a trap composed of 84 places in 68 ms
[2020-06-03 04:29:41] [INFO ] Deduced a trap composed of 85 places in 65 ms
[2020-06-03 04:29:41] [INFO ] Deduced a trap composed of 81 places in 66 ms
[2020-06-03 04:29:41] [INFO ] Deduced a trap composed of 78 places in 78 ms
[2020-06-03 04:29:41] [INFO ] Deduced a trap composed of 81 places in 72 ms
[2020-06-03 04:29:41] [INFO ] Deduced a trap composed of 84 places in 73 ms
[2020-06-03 04:29:41] [INFO ] Deduced a trap composed of 86 places in 81 ms
[2020-06-03 04:29:42] [INFO ] Deduced a trap composed of 78 places in 73 ms
[2020-06-03 04:29:42] [INFO ] Deduced a trap composed of 78 places in 79 ms
[2020-06-03 04:29:42] [INFO ] Deduced a trap composed of 77 places in 76 ms
[2020-06-03 04:29:42] [INFO ] Deduced a trap composed of 76 places in 76 ms
[2020-06-03 04:29:42] [INFO ] Deduced a trap composed of 88 places in 82 ms
[2020-06-03 04:29:42] [INFO ] Deduced a trap composed of 83 places in 76 ms
[2020-06-03 04:29:42] [INFO ] Deduced a trap composed of 78 places in 73 ms
[2020-06-03 04:29:42] [INFO ] Deduced a trap composed of 79 places in 70 ms
[2020-06-03 04:29:42] [INFO ] Deduced a trap composed of 74 places in 82 ms
[2020-06-03 04:29:42] [INFO ] Deduced a trap composed of 76 places in 76 ms
[2020-06-03 04:29:43] [INFO ] Deduced a trap composed of 84 places in 81 ms
[2020-06-03 04:29:43] [INFO ] Deduced a trap composed of 75 places in 76 ms
[2020-06-03 04:29:43] [INFO ] Deduced a trap composed of 87 places in 76 ms
[2020-06-03 04:29:43] [INFO ] Deduced a trap composed of 83 places in 80 ms
[2020-06-03 04:29:43] [INFO ] Deduced a trap composed of 81 places in 77 ms
[2020-06-03 04:29:43] [INFO ] Deduced a trap composed of 80 places in 81 ms
[2020-06-03 04:29:43] [INFO ] Deduced a trap composed of 89 places in 74 ms
[2020-06-03 04:29:43] [INFO ] Deduced a trap composed of 74 places in 75 ms
[2020-06-03 04:29:44] [INFO ] Deduced a trap composed of 81 places in 81 ms
[2020-06-03 04:29:44] [INFO ] Deduced a trap composed of 76 places in 79 ms
[2020-06-03 04:29:44] [INFO ] Deduced a trap composed of 82 places in 78 ms
[2020-06-03 04:29:44] [INFO ] Deduced a trap composed of 85 places in 78 ms
[2020-06-03 04:29:44] [INFO ] Deduced a trap composed of 74 places in 80 ms
[2020-06-03 04:29:44] [INFO ] Deduced a trap composed of 75 places in 77 ms
[2020-06-03 04:29:44] [INFO ] Deduced a trap composed of 85 places in 81 ms
[2020-06-03 04:29:44] [INFO ] Deduced a trap composed of 82 places in 80 ms
[2020-06-03 04:29:45] [INFO ] Deduced a trap composed of 86 places in 79 ms
[2020-06-03 04:29:45] [INFO ] Deduced a trap composed of 82 places in 75 ms
[2020-06-03 04:29:45] [INFO ] Deduced a trap composed of 82 places in 85 ms
[2020-06-03 04:29:45] [INFO ] Deduced a trap composed of 85 places in 79 ms
[2020-06-03 04:29:45] [INFO ] Deduced a trap composed of 81 places in 79 ms
[2020-06-03 04:29:45] [INFO ] Deduced a trap composed of 85 places in 71 ms
[2020-06-03 04:29:45] [INFO ] Deduced a trap composed of 90 places in 70 ms
[2020-06-03 04:29:45] [INFO ] Deduced a trap composed of 77 places in 72 ms
[2020-06-03 04:29:45] [INFO ] Deduced a trap composed of 83 places in 78 ms
[2020-06-03 04:29:45] [INFO ] Deduced a trap composed of 83 places in 80 ms
[2020-06-03 04:29:46] [INFO ] Deduced a trap composed of 82 places in 79 ms
[2020-06-03 04:29:46] [INFO ] Deduced a trap composed of 85 places in 87 ms
[2020-06-03 04:29:46] [INFO ] Deduced a trap composed of 83 places in 78 ms
[2020-06-03 04:29:46] [INFO ] Deduced a trap composed of 84 places in 72 ms
[2020-06-03 04:29:46] [INFO ] Deduced a trap composed of 87 places in 73 ms
[2020-06-03 04:29:46] [INFO ] Deduced a trap composed of 83 places in 83 ms
[2020-06-03 04:29:46] [INFO ] Deduced a trap composed of 84 places in 81 ms
[2020-06-03 04:29:46] [INFO ] Deduced a trap composed of 90 places in 79 ms
[2020-06-03 04:29:47] [INFO ] Deduced a trap composed of 90 places in 84 ms
[2020-06-03 04:29:47] [INFO ] Deduced a trap composed of 83 places in 79 ms
[2020-06-03 04:29:47] [INFO ] Deduced a trap composed of 83 places in 80 ms
[2020-06-03 04:29:47] [INFO ] Deduced a trap composed of 89 places in 78 ms
[2020-06-03 04:29:47] [INFO ] Deduced a trap composed of 88 places in 77 ms
[2020-06-03 04:29:47] [INFO ] Deduced a trap composed of 81 places in 78 ms
[2020-06-03 04:29:47] [INFO ] Deduced a trap composed of 82 places in 78 ms
[2020-06-03 04:29:47] [INFO ] Deduced a trap composed of 88 places in 70 ms
[2020-06-03 04:29:48] [INFO ] Deduced a trap composed of 83 places in 79 ms
[2020-06-03 04:29:49] [INFO ] Deduced a trap composed of 83 places in 72 ms
[2020-06-03 04:29:49] [INFO ] Deduced a trap composed of 83 places in 72 ms
[2020-06-03 04:29:49] [INFO ] Deduced a trap composed of 80 places in 71 ms
[2020-06-03 04:29:50] [INFO ] Deduced a trap composed of 81 places in 161 ms
[2020-06-03 04:29:50] [INFO ] Deduced a trap composed of 97 places in 122 ms
[2020-06-03 04:29:50] [INFO ] Deduced a trap composed of 84 places in 156 ms
[2020-06-03 04:29:50] [INFO ] Deduced a trap composed of 85 places in 83 ms
[2020-06-03 04:29:50] [INFO ] Deduced a trap composed of 89 places in 166 ms
[2020-06-03 04:29:51] [INFO ] Deduced a trap composed of 85 places in 164 ms
[2020-06-03 04:29:51] [INFO ] Deduced a trap composed of 80 places in 80 ms
[2020-06-03 04:29:51] [INFO ] Deduced a trap composed of 85 places in 81 ms
[2020-06-03 04:29:51] [INFO ] Deduced a trap composed of 88 places in 72 ms
[2020-06-03 04:29:52] [INFO ] Deduced a trap composed of 85 places in 199 ms
[2020-06-03 04:29:52] [INFO ] Deduced a trap composed of 85 places in 73 ms
[2020-06-03 04:29:52] [INFO ] Deduced a trap composed of 81 places in 75 ms
[2020-06-03 04:29:52] [INFO ] Deduced a trap composed of 85 places in 77 ms
[2020-06-03 04:29:53] [INFO ] Deduced a trap composed of 87 places in 113 ms
[2020-06-03 04:29:53] [INFO ] Deduced a trap composed of 84 places in 72 ms
[2020-06-03 04:29:53] [INFO ] Deduced a trap composed of 82 places in 66 ms
[2020-06-03 04:29:53] [INFO ] Deduced a trap composed of 81 places in 64 ms
[2020-06-03 04:29:53] [INFO ] Deduced a trap composed of 81 places in 68 ms
[2020-06-03 04:29:55] [INFO ] Deduced a trap composed of 90 places in 65 ms
[2020-06-03 04:29:55] [INFO ] Deduced a trap composed of 85 places in 67 ms
[2020-06-03 04:29:55] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 04:29:55] [INFO ] Deduced a trap composed of 9 places in 133 ms
[2020-06-03 04:29:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s137 s266 s267 s268) 0)") while checking expression at index 4
[2020-06-03 04:29:56] [INFO ] [Real]Absence check using 42 positive place invariants in 38 ms returned sat
[2020-06-03 04:29:56] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 35 ms returned sat
[2020-06-03 04:29:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:29:56] [INFO ] [Real]Absence check using state equation in 853 ms returned sat
[2020-06-03 04:29:57] [INFO ] Deduced a trap composed of 11 places in 82 ms
[2020-06-03 04:29:57] [INFO ] Deduced a trap composed of 18 places in 83 ms
[2020-06-03 04:29:57] [INFO ] Deduced a trap composed of 14 places in 93 ms
[2020-06-03 04:29:57] [INFO ] Deduced a trap composed of 19 places in 87 ms
[2020-06-03 04:29:57] [INFO ] Deduced a trap composed of 20 places in 102 ms
[2020-06-03 04:29:57] [INFO ] Deduced a trap composed of 14 places in 83 ms
[2020-06-03 04:29:57] [INFO ] Deduced a trap composed of 15 places in 82 ms
[2020-06-03 04:29:57] [INFO ] Deduced a trap composed of 18 places in 95 ms
[2020-06-03 04:29:57] [INFO ] Deduced a trap composed of 18 places in 78 ms
[2020-06-03 04:29:58] [INFO ] Deduced a trap composed of 23 places in 79 ms
[2020-06-03 04:29:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 1106 ms
[2020-06-03 04:29:58] [INFO ] [Real]Absence check using 42 positive place invariants in 22 ms returned sat
[2020-06-03 04:29:58] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 22 ms returned sat
[2020-06-03 04:29:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:29:58] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2020-06-03 04:29:58] [INFO ] Deduced a trap composed of 12 places in 145 ms
[2020-06-03 04:29:58] [INFO ] Deduced a trap composed of 11 places in 71 ms
[2020-06-03 04:29:58] [INFO ] Deduced a trap composed of 18 places in 55 ms
[2020-06-03 04:29:58] [INFO ] Deduced a trap composed of 19 places in 74 ms
[2020-06-03 04:29:59] [INFO ] Deduced a trap composed of 18 places in 47 ms
[2020-06-03 04:29:59] [INFO ] Deduced a trap composed of 18 places in 93 ms
[2020-06-03 04:29:59] [INFO ] Deduced a trap composed of 19 places in 47 ms
[2020-06-03 04:29:59] [INFO ] Deduced a trap composed of 17 places in 48 ms
[2020-06-03 04:29:59] [INFO ] Deduced a trap composed of 15 places in 43 ms
[2020-06-03 04:29:59] [INFO ] Deduced a trap composed of 16 places in 44 ms
[2020-06-03 04:29:59] [INFO ] Deduced a trap composed of 17 places in 42 ms
[2020-06-03 04:29:59] [INFO ] Deduced a trap composed of 23 places in 102 ms
[2020-06-03 04:29:59] [INFO ] Deduced a trap composed of 10 places in 87 ms
[2020-06-03 04:29:59] [INFO ] Deduced a trap composed of 22 places in 81 ms
[2020-06-03 04:29:59] [INFO ] Deduced a trap composed of 20 places in 100 ms
[2020-06-03 04:30:00] [INFO ] Deduced a trap composed of 8 places in 96 ms
[2020-06-03 04:30:00] [INFO ] Deduced a trap composed of 75 places in 70 ms
[2020-06-03 04:30:00] [INFO ] Deduced a trap composed of 16 places in 93 ms
[2020-06-03 04:30:00] [INFO ] Deduced a trap composed of 20 places in 70 ms
[2020-06-03 04:30:00] [INFO ] Deduced a trap composed of 20 places in 147 ms
[2020-06-03 04:30:00] [INFO ] Deduced a trap composed of 24 places in 74 ms
[2020-06-03 04:30:00] [INFO ] Deduced a trap composed of 25 places in 107 ms
[2020-06-03 04:30:00] [INFO ] Deduced a trap composed of 17 places in 145 ms
[2020-06-03 04:30:01] [INFO ] Deduced a trap composed of 79 places in 133 ms
[2020-06-03 04:30:01] [INFO ] Deduced a trap composed of 22 places in 25 ms
[2020-06-03 04:30:01] [INFO ] Deduced a trap composed of 21 places in 20 ms
[2020-06-03 04:30:01] [INFO ] Deduced a trap composed of 75 places in 173 ms
[2020-06-03 04:30:01] [INFO ] Deduced a trap composed of 76 places in 67 ms
[2020-06-03 04:30:01] [INFO ] Deduced a trap composed of 82 places in 75 ms
[2020-06-03 04:30:01] [INFO ] Deduced a trap composed of 78 places in 145 ms
[2020-06-03 04:30:01] [INFO ] Deduced a trap composed of 77 places in 144 ms
[2020-06-03 04:30:02] [INFO ] Deduced a trap composed of 77 places in 142 ms
[2020-06-03 04:30:02] [INFO ] Deduced a trap composed of 75 places in 142 ms
[2020-06-03 04:30:02] [INFO ] Deduced a trap composed of 76 places in 146 ms
[2020-06-03 04:30:02] [INFO ] Deduced a trap composed of 75 places in 142 ms
[2020-06-03 04:30:02] [INFO ] Deduced a trap composed of 78 places in 149 ms
[2020-06-03 04:30:02] [INFO ] Deduced a trap composed of 85 places in 75 ms
[2020-06-03 04:30:03] [INFO ] Deduced a trap composed of 76 places in 146 ms
[2020-06-03 04:30:03] [INFO ] Deduced a trap composed of 83 places in 148 ms
[2020-06-03 04:30:03] [INFO ] Deduced a trap composed of 79 places in 149 ms
[2020-06-03 04:30:03] [INFO ] Deduced a trap composed of 73 places in 149 ms
[2020-06-03 04:30:03] [INFO ] Deduced a trap composed of 79 places in 153 ms
[2020-06-03 04:30:03] [INFO ] Deduced a trap composed of 80 places in 129 ms
[2020-06-03 04:30:04] [INFO ] Deduced a trap composed of 81 places in 143 ms
[2020-06-03 04:30:04] [INFO ] Deduced a trap composed of 75 places in 145 ms
[2020-06-03 04:30:04] [INFO ] Deduced a trap composed of 77 places in 138 ms
[2020-06-03 04:30:04] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 5872 ms
[2020-06-03 04:30:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:30:04] [INFO ] [Nat]Absence check using 42 positive place invariants in 54 ms returned sat
[2020-06-03 04:30:04] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 42 ms returned sat
[2020-06-03 04:30:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:30:05] [INFO ] [Nat]Absence check using state equation in 802 ms returned sat
[2020-06-03 04:30:05] [INFO ] Deduced a trap composed of 12 places in 96 ms
[2020-06-03 04:30:05] [INFO ] Deduced a trap composed of 18 places in 107 ms
[2020-06-03 04:30:05] [INFO ] Deduced a trap composed of 19 places in 139 ms
[2020-06-03 04:30:05] [INFO ] Deduced a trap composed of 19 places in 88 ms
[2020-06-03 04:30:06] [INFO ] Deduced a trap composed of 14 places in 140 ms
[2020-06-03 04:30:06] [INFO ] Deduced a trap composed of 17 places in 89 ms
[2020-06-03 04:30:06] [INFO ] Deduced a trap composed of 79 places in 90 ms
[2020-06-03 04:30:06] [INFO ] Deduced a trap composed of 16 places in 187 ms
[2020-06-03 04:30:06] [INFO ] Deduced a trap composed of 29 places in 186 ms
[2020-06-03 04:30:06] [INFO ] Deduced a trap composed of 11 places in 92 ms
[2020-06-03 04:30:06] [INFO ] Deduced a trap composed of 21 places in 90 ms
[2020-06-03 04:30:06] [INFO ] Deduced a trap composed of 19 places in 84 ms
[2020-06-03 04:30:07] [INFO ] Deduced a trap composed of 17 places in 168 ms
[2020-06-03 04:30:07] [INFO ] Deduced a trap composed of 19 places in 142 ms
[2020-06-03 04:30:07] [INFO ] Deduced a trap composed of 25 places in 168 ms
[2020-06-03 04:30:07] [INFO ] Deduced a trap composed of 76 places in 137 ms
[2020-06-03 04:30:07] [INFO ] Deduced a trap composed of 80 places in 170 ms
[2020-06-03 04:30:07] [INFO ] Deduced a trap composed of 78 places in 80 ms
[2020-06-03 04:30:08] [INFO ] Deduced a trap composed of 79 places in 80 ms
[2020-06-03 04:30:08] [INFO ] Deduced a trap composed of 78 places in 78 ms
[2020-06-03 04:30:08] [INFO ] Deduced a trap composed of 79 places in 165 ms
[2020-06-03 04:30:08] [INFO ] Deduced a trap composed of 83 places in 163 ms
[2020-06-03 04:30:08] [INFO ] Deduced a trap composed of 86 places in 157 ms
[2020-06-03 04:30:08] [INFO ] Deduced a trap composed of 87 places in 156 ms
[2020-06-03 04:30:09] [INFO ] Deduced a trap composed of 87 places in 133 ms
[2020-06-03 04:30:09] [INFO ] Deduced a trap composed of 85 places in 157 ms
[2020-06-03 04:30:09] [INFO ] Deduced a trap composed of 88 places in 154 ms
[2020-06-03 04:30:09] [INFO ] Deduced a trap composed of 77 places in 143 ms
[2020-06-03 04:30:09] [INFO ] Deduced a trap composed of 84 places in 76 ms
[2020-06-03 04:30:09] [INFO ] Deduced a trap composed of 69 places in 71 ms
[2020-06-03 04:30:09] [INFO ] Deduced a trap composed of 82 places in 155 ms
[2020-06-03 04:30:10] [INFO ] Deduced a trap composed of 76 places in 153 ms
[2020-06-03 04:30:10] [INFO ] Deduced a trap composed of 81 places in 176 ms
[2020-06-03 04:30:10] [INFO ] Deduced a trap composed of 19 places in 186 ms
[2020-06-03 04:30:10] [INFO ] Deduced a trap composed of 15 places in 222 ms
[2020-06-03 04:30:10] [INFO ] Deduced a trap composed of 20 places in 85 ms
[2020-06-03 04:30:11] [INFO ] Deduced a trap composed of 84 places in 551 ms
[2020-06-03 04:30:11] [INFO ] Deduced a trap composed of 85 places in 64 ms
[2020-06-03 04:30:11] [INFO ] Deduced a trap composed of 81 places in 65 ms
[2020-06-03 04:30:11] [INFO ] Deduced a trap composed of 79 places in 101 ms
[2020-06-03 04:30:11] [INFO ] Deduced a trap composed of 78 places in 87 ms
[2020-06-03 04:30:12] [INFO ] Deduced a trap composed of 81 places in 81 ms
[2020-06-03 04:30:12] [INFO ] Deduced a trap composed of 84 places in 77 ms
[2020-06-03 04:30:12] [INFO ] Deduced a trap composed of 82 places in 75 ms
[2020-06-03 04:30:12] [INFO ] Deduced a trap composed of 79 places in 80 ms
[2020-06-03 04:30:18] [INFO ] Deduced a trap composed of 83 places in 6002 ms
[2020-06-03 04:30:18] [INFO ] Deduced a trap composed of 84 places in 90 ms
[2020-06-03 04:30:18] [INFO ] Deduced a trap composed of 75 places in 135 ms
[2020-06-03 04:30:18] [INFO ] Deduced a trap composed of 78 places in 83 ms
[2020-06-03 04:30:18] [INFO ] Deduced a trap composed of 76 places in 85 ms
[2020-06-03 04:30:19] [INFO ] Deduced a trap composed of 77 places in 483 ms
[2020-06-03 04:30:19] [INFO ] Deduced a trap composed of 79 places in 195 ms
[2020-06-03 04:30:19] [INFO ] Deduced a trap composed of 79 places in 117 ms
[2020-06-03 04:30:19] [INFO ] Deduced a trap composed of 82 places in 77 ms
[2020-06-03 04:30:19] [INFO ] Deduced a trap composed of 15 places in 71 ms
[2020-06-03 04:30:20] [INFO ] Deduced a trap composed of 78 places in 68 ms
[2020-06-03 04:30:20] [INFO ] Deduced a trap composed of 80 places in 70 ms
[2020-06-03 04:30:20] [INFO ] Deduced a trap composed of 86 places in 114 ms
[2020-06-03 04:30:20] [INFO ] Deduced a trap composed of 81 places in 157 ms
[2020-06-03 04:30:20] [INFO ] Deduced a trap composed of 81 places in 160 ms
[2020-06-03 04:30:20] [INFO ] Deduced a trap composed of 82 places in 82 ms
[2020-06-03 04:30:20] [INFO ] Deduced a trap composed of 83 places in 72 ms
[2020-06-03 04:30:20] [INFO ] Deduced a trap composed of 84 places in 74 ms
[2020-06-03 04:30:21] [INFO ] Deduced a trap composed of 83 places in 71 ms
[2020-06-03 04:30:21] [INFO ] Deduced a trap composed of 80 places in 66 ms
[2020-06-03 04:30:21] [INFO ] Deduced a trap composed of 78 places in 112 ms
[2020-06-03 04:30:21] [INFO ] Deduced a trap composed of 82 places in 82 ms
[2020-06-03 04:30:21] [INFO ] Deduced a trap composed of 83 places in 80 ms
[2020-06-03 04:30:21] [INFO ] Deduced a trap composed of 84 places in 65 ms
[2020-06-03 04:30:21] [INFO ] Deduced a trap composed of 80 places in 64 ms
[2020-06-03 04:30:21] [INFO ] Deduced a trap composed of 78 places in 64 ms
[2020-06-03 04:30:21] [INFO ] Deduced a trap composed of 80 places in 54 ms
[2020-06-03 04:30:21] [INFO ] Deduced a trap composed of 81 places in 93 ms
[2020-06-03 04:30:22] [INFO ] Deduced a trap composed of 84 places in 101 ms
[2020-06-03 04:30:22] [INFO ] Deduced a trap composed of 81 places in 66 ms
[2020-06-03 04:30:22] [INFO ] Deduced a trap composed of 80 places in 66 ms
[2020-06-03 04:30:22] [INFO ] Deduced a trap composed of 82 places in 78 ms
[2020-06-03 04:30:22] [INFO ] Deduced a trap composed of 75 places in 89 ms
[2020-06-03 04:30:22] [INFO ] Deduced a trap composed of 78 places in 100 ms
[2020-06-03 04:30:22] [INFO ] Deduced a trap composed of 81 places in 253 ms
[2020-06-03 04:30:23] [INFO ] Deduced a trap composed of 80 places in 96 ms
[2020-06-03 04:30:23] [INFO ] Deduced a trap composed of 82 places in 68 ms
[2020-06-03 04:30:23] [INFO ] Deduced a trap composed of 86 places in 68 ms
[2020-06-03 04:30:23] [INFO ] Deduced a trap composed of 85 places in 63 ms
[2020-06-03 04:30:23] [INFO ] Deduced a trap composed of 85 places in 63 ms
[2020-06-03 04:30:23] [INFO ] Deduced a trap composed of 79 places in 61 ms
[2020-06-03 04:30:23] [INFO ] Deduced a trap composed of 78 places in 57 ms
[2020-06-03 04:30:23] [INFO ] Deduced a trap composed of 81 places in 62 ms
[2020-06-03 04:30:23] [INFO ] Deduced a trap composed of 81 places in 169 ms
[2020-06-03 04:30:24] [INFO ] Deduced a trap composed of 78 places in 605 ms
[2020-06-03 04:30:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s36 s37 s38 s99 s100 s101 s102 s122 s140 s141 s142 s147 s150 s177 s187 s227 s231 s232 s233 s237 s247 s267 s271 s272 s273 s274 s275 s276 s277 s278 s279 s280 s281 s282 s283 s284 s285 s286 s289 s290 s291 s292 s293 s294 s299 s300 s301 s302 s305 s306 s309 s310 s313 s314 s315 s316 s317 s318 s319 s320 s321 s322 s323 s324 s325 s326 s329 s330 s334 s335 s336 s337 s338 s339 s344) 0)") while checking expression at index 6
[2020-06-03 04:30:24] [INFO ] [Real]Absence check using 42 positive place invariants in 19 ms returned sat
[2020-06-03 04:30:24] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 15 ms returned sat
[2020-06-03 04:30:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:30:24] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2020-06-03 04:30:25] [INFO ] Deduced a trap composed of 18 places in 149 ms
[2020-06-03 04:30:25] [INFO ] Deduced a trap composed of 11 places in 98 ms
[2020-06-03 04:30:25] [INFO ] Deduced a trap composed of 13 places in 91 ms
[2020-06-03 04:30:25] [INFO ] Deduced a trap composed of 17 places in 90 ms
[2020-06-03 04:30:25] [INFO ] Deduced a trap composed of 22 places in 79 ms
[2020-06-03 04:30:25] [INFO ] Deduced a trap composed of 21 places in 85 ms
[2020-06-03 04:30:25] [INFO ] Deduced a trap composed of 17 places in 107 ms
[2020-06-03 04:30:25] [INFO ] Deduced a trap composed of 24 places in 70 ms
[2020-06-03 04:30:25] [INFO ] Deduced a trap composed of 19 places in 101 ms
[2020-06-03 04:30:25] [INFO ] Deduced a trap composed of 76 places in 82 ms
[2020-06-03 04:30:26] [INFO ] Deduced a trap composed of 79 places in 79 ms
[2020-06-03 04:30:26] [INFO ] Deduced a trap composed of 20 places in 165 ms
[2020-06-03 04:30:26] [INFO ] Deduced a trap composed of 19 places in 75 ms
[2020-06-03 04:30:26] [INFO ] Deduced a trap composed of 71 places in 74 ms
[2020-06-03 04:30:26] [INFO ] Deduced a trap composed of 76 places in 85 ms
[2020-06-03 04:30:26] [INFO ] Deduced a trap composed of 77 places in 72 ms
[2020-06-03 04:30:26] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1780 ms
[2020-06-03 04:30:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:30:26] [INFO ] [Nat]Absence check using 42 positive place invariants in 26 ms returned sat
[2020-06-03 04:30:26] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 15 ms returned sat
[2020-06-03 04:30:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:30:27] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2020-06-03 04:30:27] [INFO ] Deduced a trap composed of 18 places in 103 ms
[2020-06-03 04:30:27] [INFO ] Deduced a trap composed of 11 places in 105 ms
[2020-06-03 04:30:27] [INFO ] Deduced a trap composed of 13 places in 105 ms
[2020-06-03 04:30:27] [INFO ] Deduced a trap composed of 17 places in 86 ms
[2020-06-03 04:30:28] [INFO ] Deduced a trap composed of 22 places in 616 ms
[2020-06-03 04:30:28] [INFO ] Deduced a trap composed of 21 places in 139 ms
[2020-06-03 04:30:28] [INFO ] Deduced a trap composed of 17 places in 157 ms
[2020-06-03 04:30:28] [INFO ] Deduced a trap composed of 24 places in 133 ms
[2020-06-03 04:30:28] [INFO ] Deduced a trap composed of 20 places in 117 ms
[2020-06-03 04:30:28] [INFO ] Deduced a trap composed of 80 places in 86 ms
[2020-06-03 04:30:28] [INFO ] Deduced a trap composed of 19 places in 82 ms
[2020-06-03 04:30:29] [INFO ] Deduced a trap composed of 74 places in 80 ms
[2020-06-03 04:30:29] [INFO ] Deduced a trap composed of 20 places in 78 ms
[2020-06-03 04:30:29] [INFO ] Deduced a trap composed of 73 places in 95 ms
[2020-06-03 04:30:29] [INFO ] Deduced a trap composed of 74 places in 80 ms
[2020-06-03 04:30:29] [INFO ] Deduced a trap composed of 76 places in 77 ms
[2020-06-03 04:30:29] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2405 ms
[2020-06-03 04:30:29] [INFO ] Computed and/alt/rep : 295/981/295 causal constraints in 19 ms.
[2020-06-03 04:30:31] [INFO ] Added : 283 causal constraints over 57 iterations in 1651 ms. Result :sat
[2020-06-03 04:30:31] [INFO ] [Real]Absence check using 42 positive place invariants in 20 ms returned sat
[2020-06-03 04:30:31] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 20 ms returned sat
[2020-06-03 04:30:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:30:31] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2020-06-03 04:30:31] [INFO ] Deduced a trap composed of 17 places in 112 ms
[2020-06-03 04:30:31] [INFO ] Deduced a trap composed of 11 places in 187 ms
[2020-06-03 04:30:32] [INFO ] Deduced a trap composed of 16 places in 183 ms
[2020-06-03 04:30:32] [INFO ] Deduced a trap composed of 19 places in 181 ms
[2020-06-03 04:30:32] [INFO ] Deduced a trap composed of 10 places in 188 ms
[2020-06-03 04:30:32] [INFO ] Deduced a trap composed of 23 places in 127 ms
[2020-06-03 04:30:32] [INFO ] Deduced a trap composed of 22 places in 62 ms
[2020-06-03 04:30:32] [INFO ] Deduced a trap composed of 20 places in 95 ms
[2020-06-03 04:30:32] [INFO ] Deduced a trap composed of 15 places in 93 ms
[2020-06-03 04:30:32] [INFO ] Deduced a trap composed of 17 places in 92 ms
[2020-06-03 04:30:33] [INFO ] Deduced a trap composed of 17 places in 85 ms
[2020-06-03 04:30:33] [INFO ] Deduced a trap composed of 22 places in 83 ms
[2020-06-03 04:30:33] [INFO ] Deduced a trap composed of 23 places in 76 ms
[2020-06-03 04:30:33] [INFO ] Deduced a trap composed of 22 places in 75 ms
[2020-06-03 04:30:33] [INFO ] Deduced a trap composed of 25 places in 71 ms
[2020-06-03 04:30:33] [INFO ] Deduced a trap composed of 16 places in 63 ms
[2020-06-03 04:30:33] [INFO ] Deduced a trap composed of 27 places in 38 ms
[2020-06-03 04:30:33] [INFO ] Deduced a trap composed of 23 places in 65 ms
[2020-06-03 04:30:33] [INFO ] Deduced a trap composed of 15 places in 58 ms
[2020-06-03 04:30:33] [INFO ] Deduced a trap composed of 23 places in 37 ms
[2020-06-03 04:30:33] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2301 ms
[2020-06-03 04:30:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:30:33] [INFO ] [Nat]Absence check using 42 positive place invariants in 48 ms returned sat
[2020-06-03 04:30:33] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 16 ms returned sat
[2020-06-03 04:30:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:30:34] [INFO ] [Nat]Absence check using state equation in 756 ms returned sat
[2020-06-03 04:30:34] [INFO ] Deduced a trap composed of 17 places in 107 ms
[2020-06-03 04:30:34] [INFO ] Deduced a trap composed of 14 places in 84 ms
[2020-06-03 04:30:35] [INFO ] Deduced a trap composed of 11 places in 88 ms
[2020-06-03 04:30:35] [INFO ] Deduced a trap composed of 10 places in 325 ms
[2020-06-03 04:30:35] [INFO ] Deduced a trap composed of 20 places in 49 ms
[2020-06-03 04:30:35] [INFO ] Deduced a trap composed of 22 places in 52 ms
[2020-06-03 04:30:35] [INFO ] Deduced a trap composed of 21 places in 51 ms
[2020-06-03 04:30:35] [INFO ] Deduced a trap composed of 17 places in 85 ms
[2020-06-03 04:30:35] [INFO ] Deduced a trap composed of 20 places in 48 ms
[2020-06-03 04:30:36] [INFO ] Deduced a trap composed of 14 places in 424 ms
[2020-06-03 04:30:36] [INFO ] Deduced a trap composed of 26 places in 80 ms
[2020-06-03 04:30:36] [INFO ] Deduced a trap composed of 16 places in 79 ms
[2020-06-03 04:30:36] [INFO ] Deduced a trap composed of 15 places in 70 ms
[2020-06-03 04:30:36] [INFO ] Deduced a trap composed of 23 places in 63 ms
[2020-06-03 04:30:36] [INFO ] Deduced a trap composed of 24 places in 56 ms
[2020-06-03 04:30:36] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1878 ms
[2020-06-03 04:30:36] [INFO ] Computed and/alt/rep : 295/981/295 causal constraints in 18 ms.
[2020-06-03 04:30:38] [INFO ] Added : 279 causal constraints over 56 iterations in 1426 ms. Result :sat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-06-03 04:30:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 04:30:38] [INFO ] Flatten gal took : 69 ms
[2020-06-03 04:30:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 04:30:38] [INFO ] Flatten gal took : 18 ms
FORMULA BusinessProcesses-PT-06-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 04:30:38] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2020-06-03 04:30:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 13 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ BusinessProcesses-PT-06 @ 3570 seconds

FORMULA BusinessProcesses-PT-06-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-06-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-06-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-06-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-06-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-06-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-06-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-06-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-06-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-06-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 477340 kB
After kill :
MemTotal: 16427332 kB
MemFree: 469928 kB

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-06"
export BK_EXAMINATION="CTLFireability"
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 BusinessProcesses-PT-06, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r182-oct2-158987914000492"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-06.tgz
mv BusinessProcesses-PT-06 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;