About the Execution of ITS-Tools for BusinessProcesses-PT-12
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15743.550 | 1392698.00 | 1544626.00 | 10341.30 | TTTFTFFFFTFFTFTT | normal |
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.r021-oct2-158897699200540.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 itstools
Input is BusinessProcesses-PT-12, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699200540
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 3.3K Mar 26 02:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 02:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 22:45 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.5K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 14:38 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 146K 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-12-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1589253494577
[2020-05-12 03:18:16] [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, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-12 03:18:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 03:18:16] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2020-05-12 03:18:16] [INFO ] Transformed 586 places.
[2020-05-12 03:18:16] [INFO ] Transformed 525 transitions.
[2020-05-12 03:18:16] [INFO ] Found NUPN structural information;
[2020-05-12 03:18:16] [INFO ] Parsed PT model containing 586 places and 525 transitions in 109 ms.
Deduced a syphon composed of 4 places in 7 ms
Reduce places removed 4 places and 4 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
Incomplete random walk after 100000 steps, including 730 resets, run finished after 299 ms. (steps per millisecond=334 ) properties seen :[1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1]
// Phase 1: matrix 521 rows 582 cols
[2020-05-12 03:18:16] [INFO ] Computed 98 place invariants in 26 ms
[2020-05-12 03:18:16] [INFO ] [Real]Absence check using 55 positive place invariants in 47 ms returned sat
[2020-05-12 03:18:17] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 18 ms returned sat
[2020-05-12 03:18:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:18:17] [INFO ] [Real]Absence check using state equation in 661 ms returned unsat
[2020-05-12 03:18:17] [INFO ] [Real]Absence check using 55 positive place invariants in 40 ms returned sat
[2020-05-12 03:18:17] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 21 ms returned sat
[2020-05-12 03:18:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:18:18] [INFO ] [Real]Absence check using state equation in 685 ms returned sat
[2020-05-12 03:18:18] [INFO ] Deduced a trap composed of 23 places in 371 ms
[2020-05-12 03:18:19] [INFO ] Deduced a trap composed of 29 places in 131 ms
[2020-05-12 03:18:19] [INFO ] Deduced a trap composed of 25 places in 91 ms
[2020-05-12 03:18:19] [INFO ] Deduced a trap composed of 16 places in 93 ms
[2020-05-12 03:18:19] [INFO ] Deduced a trap composed of 32 places in 125 ms
[2020-05-12 03:18:19] [INFO ] Deduced a trap composed of 31 places in 89 ms
[2020-05-12 03:18:19] [INFO ] Deduced a trap composed of 25 places in 119 ms
[2020-05-12 03:18:19] [INFO ] Deduced a trap composed of 22 places in 100 ms
[2020-05-12 03:18:19] [INFO ] Deduced a trap composed of 22 places in 88 ms
[2020-05-12 03:18:20] [INFO ] Deduced a trap composed of 22 places in 87 ms
[2020-05-12 03:18:20] [INFO ] Deduced a trap composed of 24 places in 82 ms
[2020-05-12 03:18:20] [INFO ] Deduced a trap composed of 23 places in 81 ms
[2020-05-12 03:18:20] [INFO ] Deduced a trap composed of 26 places in 79 ms
[2020-05-12 03:18:20] [INFO ] Deduced a trap composed of 33 places in 81 ms
[2020-05-12 03:18:20] [INFO ] Deduced a trap composed of 33 places in 78 ms
[2020-05-12 03:18:20] [INFO ] Deduced a trap composed of 32 places in 82 ms
[2020-05-12 03:18:20] [INFO ] Deduced a trap composed of 45 places in 73 ms
[2020-05-12 03:18:20] [INFO ] Deduced a trap composed of 33 places in 94 ms
[2020-05-12 03:18:21] [INFO ] Deduced a trap composed of 32 places in 88 ms
[2020-05-12 03:18:21] [INFO ] Deduced a trap composed of 33 places in 86 ms
[2020-05-12 03:18:21] [INFO ] Deduced a trap composed of 47 places in 89 ms
[2020-05-12 03:18:21] [INFO ] Deduced a trap composed of 40 places in 232 ms
[2020-05-12 03:18:21] [INFO ] Deduced a trap composed of 48 places in 74 ms
[2020-05-12 03:18:21] [INFO ] Deduced a trap composed of 51 places in 77 ms
[2020-05-12 03:18:21] [INFO ] Deduced a trap composed of 29 places in 79 ms
[2020-05-12 03:18:21] [INFO ] Deduced a trap composed of 24 places in 78 ms
[2020-05-12 03:18:22] [INFO ] Deduced a trap composed of 27 places in 76 ms
[2020-05-12 03:18:22] [INFO ] Deduced a trap composed of 37 places in 75 ms
[2020-05-12 03:18:22] [INFO ] Deduced a trap composed of 45 places in 96 ms
[2020-05-12 03:18:22] [INFO ] Deduced a trap composed of 46 places in 69 ms
[2020-05-12 03:18:22] [INFO ] Deduced a trap composed of 54 places in 74 ms
[2020-05-12 03:18:22] [INFO ] Deduced a trap composed of 40 places in 79 ms
[2020-05-12 03:18:22] [INFO ] Deduced a trap composed of 63 places in 76 ms
[2020-05-12 03:18:22] [INFO ] Deduced a trap composed of 67 places in 78 ms
[2020-05-12 03:18:22] [INFO ] Deduced a trap composed of 35 places in 76 ms
[2020-05-12 03:18:22] [INFO ] Deduced a trap composed of 38 places in 77 ms
[2020-05-12 03:18:23] [INFO ] Deduced a trap composed of 63 places in 75 ms
[2020-05-12 03:18:23] [INFO ] Deduced a trap composed of 37 places in 75 ms
[2020-05-12 03:18:23] [INFO ] Deduced a trap composed of 27 places in 76 ms
[2020-05-12 03:18:23] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 4722 ms
[2020-05-12 03:18:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:18:23] [INFO ] [Nat]Absence check using 55 positive place invariants in 62 ms returned sat
[2020-05-12 03:18:23] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 19 ms returned sat
[2020-05-12 03:18:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:18:24] [INFO ] [Nat]Absence check using state equation in 717 ms returned sat
[2020-05-12 03:18:24] [INFO ] Deduced a trap composed of 18 places in 156 ms
[2020-05-12 03:18:24] [INFO ] Deduced a trap composed of 22 places in 106 ms
[2020-05-12 03:18:24] [INFO ] Deduced a trap composed of 30 places in 96 ms
[2020-05-12 03:18:24] [INFO ] Deduced a trap composed of 26 places in 92 ms
[2020-05-12 03:18:24] [INFO ] Deduced a trap composed of 17 places in 95 ms
[2020-05-12 03:18:24] [INFO ] Deduced a trap composed of 22 places in 94 ms
[2020-05-12 03:18:25] [INFO ] Deduced a trap composed of 36 places in 90 ms
[2020-05-12 03:18:25] [INFO ] Deduced a trap composed of 31 places in 91 ms
[2020-05-12 03:18:25] [INFO ] Deduced a trap composed of 25 places in 85 ms
[2020-05-12 03:18:25] [INFO ] Deduced a trap composed of 20 places in 86 ms
[2020-05-12 03:18:25] [INFO ] Deduced a trap composed of 21 places in 85 ms
[2020-05-12 03:18:25] [INFO ] Deduced a trap composed of 22 places in 89 ms
[2020-05-12 03:18:25] [INFO ] Deduced a trap composed of 16 places in 85 ms
[2020-05-12 03:18:25] [INFO ] Deduced a trap composed of 25 places in 81 ms
[2020-05-12 03:18:25] [INFO ] Deduced a trap composed of 24 places in 79 ms
[2020-05-12 03:18:26] [INFO ] Deduced a trap composed of 35 places in 132 ms
[2020-05-12 03:18:26] [INFO ] Deduced a trap composed of 32 places in 78 ms
[2020-05-12 03:18:26] [INFO ] Deduced a trap composed of 26 places in 86 ms
[2020-05-12 03:18:26] [INFO ] Deduced a trap composed of 52 places in 77 ms
[2020-05-12 03:18:26] [INFO ] Deduced a trap composed of 21 places in 78 ms
[2020-05-12 03:18:26] [INFO ] Deduced a trap composed of 20 places in 85 ms
[2020-05-12 03:18:26] [INFO ] Deduced a trap composed of 25 places in 79 ms
[2020-05-12 03:18:26] [INFO ] Deduced a trap composed of 31 places in 75 ms
[2020-05-12 03:18:26] [INFO ] Deduced a trap composed of 21 places in 75 ms
[2020-05-12 03:18:26] [INFO ] Deduced a trap composed of 40 places in 75 ms
[2020-05-12 03:18:27] [INFO ] Deduced a trap composed of 30 places in 169 ms
[2020-05-12 03:18:27] [INFO ] Deduced a trap composed of 30 places in 86 ms
[2020-05-12 03:18:27] [INFO ] Deduced a trap composed of 48 places in 89 ms
[2020-05-12 03:18:27] [INFO ] Deduced a trap composed of 50 places in 206 ms
[2020-05-12 03:18:27] [INFO ] Deduced a trap composed of 27 places in 141 ms
[2020-05-12 03:18:27] [INFO ] Deduced a trap composed of 13 places in 159 ms
[2020-05-12 03:18:28] [INFO ] Deduced a trap composed of 44 places in 90 ms
[2020-05-12 03:18:28] [INFO ] Deduced a trap composed of 40 places in 173 ms
[2020-05-12 03:18:28] [INFO ] Deduced a trap composed of 28 places in 92 ms
[2020-05-12 03:18:28] [INFO ] Deduced a trap composed of 50 places in 178 ms
[2020-05-12 03:18:28] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 4422 ms
[2020-05-12 03:18:28] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 39 ms.
[2020-05-12 03:18:31] [INFO ] Added : 313 causal constraints over 64 iterations in 3360 ms. Result :sat
[2020-05-12 03:18:32] [INFO ] [Real]Absence check using 55 positive place invariants in 294 ms returned sat
[2020-05-12 03:18:32] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 21 ms returned sat
[2020-05-12 03:18:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:18:33] [INFO ] [Real]Absence check using state equation in 668 ms returned sat
[2020-05-12 03:18:33] [INFO ] Deduced a trap composed of 16 places in 85 ms
[2020-05-12 03:18:33] [INFO ] Deduced a trap composed of 21 places in 82 ms
[2020-05-12 03:18:33] [INFO ] Deduced a trap composed of 20 places in 84 ms
[2020-05-12 03:18:33] [INFO ] Deduced a trap composed of 26 places in 82 ms
[2020-05-12 03:18:33] [INFO ] Deduced a trap composed of 19 places in 86 ms
[2020-05-12 03:18:33] [INFO ] Deduced a trap composed of 15 places in 80 ms
[2020-05-12 03:18:33] [INFO ] Deduced a trap composed of 34 places in 78 ms
[2020-05-12 03:18:33] [INFO ] Deduced a trap composed of 13 places in 57 ms
[2020-05-12 03:18:33] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 810 ms
[2020-05-12 03:18:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:18:33] [INFO ] [Nat]Absence check using 55 positive place invariants in 43 ms returned sat
[2020-05-12 03:18:34] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 21 ms returned sat
[2020-05-12 03:18:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:18:34] [INFO ] [Nat]Absence check using state equation in 688 ms returned sat
[2020-05-12 03:18:34] [INFO ] Deduced a trap composed of 16 places in 95 ms
[2020-05-12 03:18:34] [INFO ] Deduced a trap composed of 22 places in 88 ms
[2020-05-12 03:18:35] [INFO ] Deduced a trap composed of 19 places in 98 ms
[2020-05-12 03:18:35] [INFO ] Deduced a trap composed of 18 places in 89 ms
[2020-05-12 03:18:35] [INFO ] Deduced a trap composed of 21 places in 82 ms
[2020-05-12 03:18:35] [INFO ] Deduced a trap composed of 24 places in 85 ms
[2020-05-12 03:18:35] [INFO ] Deduced a trap composed of 13 places in 135 ms
[2020-05-12 03:18:38] [INFO ] Deduced a trap composed of 31 places in 2645 ms
[2020-05-12 03:18:38] [INFO ] Deduced a trap composed of 30 places in 80 ms
[2020-05-12 03:18:38] [INFO ] Deduced a trap composed of 25 places in 81 ms
[2020-05-12 03:18:38] [INFO ] Deduced a trap composed of 23 places in 92 ms
[2020-05-12 03:18:38] [INFO ] Deduced a trap composed of 29 places in 80 ms
[2020-05-12 03:18:38] [INFO ] Deduced a trap composed of 38 places in 190 ms
[2020-05-12 03:18:38] [INFO ] Deduced a trap composed of 31 places in 137 ms
[2020-05-12 03:18:39] [INFO ] Deduced a trap composed of 29 places in 135 ms
[2020-05-12 03:18:39] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4478 ms
[2020-05-12 03:18:39] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 42 ms.
[2020-05-12 03:18:41] [INFO ] Added : 250 causal constraints over 51 iterations in 2552 ms. Result :sat
[2020-05-12 03:18:42] [INFO ] [Real]Absence check using 55 positive place invariants in 177 ms returned sat
[2020-05-12 03:18:42] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 165 ms returned sat
[2020-05-12 03:18:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:18:46] [INFO ] [Real]Absence check using state equation in 3913 ms returned unsat
[2020-05-12 03:18:46] [INFO ] [Real]Absence check using 55 positive place invariants in 230 ms returned sat
[2020-05-12 03:18:46] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 151 ms returned sat
[2020-05-12 03:18:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:18:50] [INFO ] [Real]Absence check using state equation in 3476 ms returned sat
[2020-05-12 03:18:50] [INFO ] Deduced a trap composed of 15 places in 453 ms
[2020-05-12 03:18:51] [INFO ] Deduced a trap composed of 23 places in 826 ms
[2020-05-12 03:18:52] [INFO ] Deduced a trap composed of 22 places in 1309 ms
[2020-05-12 03:18:52] [INFO ] Deduced a trap composed of 133 places in 151 ms
[2020-05-12 03:18:53] [INFO ] Deduced a trap composed of 23 places in 722 ms
[2020-05-12 03:18:53] [INFO ] Deduced a trap composed of 26 places in 281 ms
[2020-05-12 03:18:54] [INFO ] Deduced a trap composed of 127 places in 286 ms
[2020-05-12 03:18:54] [INFO ] Deduced a trap composed of 26 places in 291 ms
[2020-05-12 03:18:54] [INFO ] Deduced a trap composed of 16 places in 174 ms
[2020-05-12 03:18:54] [INFO ] Deduced a trap composed of 119 places in 134 ms
[2020-05-12 03:18:55] [INFO ] Deduced a trap composed of 116 places in 249 ms
[2020-05-12 03:18:55] [INFO ] Deduced a trap composed of 24 places in 513 ms
[2020-05-12 03:18:56] [INFO ] Deduced a trap composed of 25 places in 350 ms
[2020-05-12 03:18:56] [INFO ] Deduced a trap composed of 32 places in 137 ms
[2020-05-12 03:18:56] [INFO ] Deduced a trap composed of 22 places in 148 ms
[2020-05-12 03:18:56] [INFO ] Deduced a trap composed of 40 places in 85 ms
[2020-05-12 03:18:56] [INFO ] Deduced a trap composed of 30 places in 76 ms
[2020-05-12 03:18:56] [INFO ] Deduced a trap composed of 22 places in 108 ms
[2020-05-12 03:18:56] [INFO ] Deduced a trap composed of 26 places in 160 ms
[2020-05-12 03:18:57] [INFO ] Deduced a trap composed of 33 places in 87 ms
[2020-05-12 03:18:57] [INFO ] Deduced a trap composed of 29 places in 81 ms
[2020-05-12 03:18:57] [INFO ] Deduced a trap composed of 22 places in 114 ms
[2020-05-12 03:18:57] [INFO ] Deduced a trap composed of 31 places in 92 ms
[2020-05-12 03:18:57] [INFO ] Deduced a trap composed of 42 places in 84 ms
[2020-05-12 03:18:57] [INFO ] Deduced a trap composed of 31 places in 73 ms
[2020-05-12 03:18:57] [INFO ] Deduced a trap composed of 30 places in 73 ms
[2020-05-12 03:18:57] [INFO ] Deduced a trap composed of 49 places in 73 ms
[2020-05-12 03:18:57] [INFO ] Deduced a trap composed of 34 places in 76 ms
[2020-05-12 03:18:58] [INFO ] Deduced a trap composed of 35 places in 96 ms
[2020-05-12 03:18:58] [INFO ] Deduced a trap composed of 27 places in 76 ms
[2020-05-12 03:18:58] [INFO ] Deduced a trap composed of 45 places in 86 ms
[2020-05-12 03:18:58] [INFO ] Deduced a trap composed of 47 places in 74 ms
[2020-05-12 03:18:58] [INFO ] Deduced a trap composed of 47 places in 72 ms
[2020-05-12 03:18:58] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 8451 ms
[2020-05-12 03:18:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:18:58] [INFO ] [Nat]Absence check using 55 positive place invariants in 92 ms returned sat
[2020-05-12 03:18:58] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-05-12 03:18:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:18:59] [INFO ] [Nat]Absence check using state equation in 674 ms returned sat
[2020-05-12 03:18:59] [INFO ] Deduced a trap composed of 22 places in 203 ms
[2020-05-12 03:18:59] [INFO ] Deduced a trap composed of 13 places in 138 ms
[2020-05-12 03:19:00] [INFO ] Deduced a trap composed of 26 places in 568 ms
[2020-05-12 03:19:00] [INFO ] Deduced a trap composed of 119 places in 324 ms
[2020-05-12 03:19:01] [INFO ] Deduced a trap composed of 116 places in 297 ms
[2020-05-12 03:19:01] [INFO ] Deduced a trap composed of 118 places in 300 ms
[2020-05-12 03:19:01] [INFO ] Deduced a trap composed of 23 places in 280 ms
[2020-05-12 03:19:01] [INFO ] Deduced a trap composed of 19 places in 198 ms
[2020-05-12 03:19:02] [INFO ] Deduced a trap composed of 31 places in 288 ms
[2020-05-12 03:19:02] [INFO ] Deduced a trap composed of 24 places in 299 ms
[2020-05-12 03:19:05] [INFO ] Deduced a trap composed of 22 places in 3079 ms
[2020-05-12 03:19:05] [INFO ] Deduced a trap composed of 22 places in 177 ms
[2020-05-12 03:19:07] [INFO ] Deduced a trap composed of 20 places in 1533 ms
[2020-05-12 03:19:07] [INFO ] Deduced a trap composed of 25 places in 112 ms
[2020-05-12 03:19:07] [INFO ] Deduced a trap composed of 18 places in 253 ms
[2020-05-12 03:19:08] [INFO ] Deduced a trap composed of 22 places in 180 ms
[2020-05-12 03:19:08] [INFO ] Deduced a trap composed of 27 places in 148 ms
[2020-05-12 03:19:08] [INFO ] Deduced a trap composed of 38 places in 358 ms
[2020-05-12 03:19:09] [INFO ] Deduced a trap composed of 27 places in 678 ms
[2020-05-12 03:19:11] [INFO ] Deduced a trap composed of 21 places in 2360 ms
[2020-05-12 03:19:11] [INFO ] Deduced a trap composed of 26 places in 172 ms
[2020-05-12 03:19:13] [INFO ] Deduced a trap composed of 32 places in 1523 ms
[2020-05-12 03:19:14] [INFO ] Deduced a trap composed of 32 places in 1037 ms
[2020-05-12 03:19:16] [INFO ] Deduced a trap composed of 43 places in 1684 ms
[2020-05-12 03:19:16] [INFO ] Deduced a trap composed of 44 places in 90 ms
[2020-05-12 03:19:16] [INFO ] Deduced a trap composed of 24 places in 240 ms
[2020-05-12 03:19:16] [INFO ] Deduced a trap composed of 48 places in 164 ms
[2020-05-12 03:19:16] [INFO ] Deduced a trap composed of 47 places in 101 ms
[2020-05-12 03:19:17] [INFO ] Deduced a trap composed of 24 places in 93 ms
[2020-05-12 03:19:17] [INFO ] Deduced a trap composed of 48 places in 97 ms
[2020-05-12 03:19:17] [INFO ] Deduced a trap composed of 42 places in 175 ms
[2020-05-12 03:19:17] [INFO ] Deduced a trap composed of 46 places in 135 ms
[2020-05-12 03:19:17] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 18231 ms
[2020-05-12 03:19:17] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 27 ms.
[2020-05-12 03:19:18] [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: Broken pipe (=> (> t136 0) (and (> t11 0) (< o11 o136)))") while checking expression at index 4
[2020-05-12 03:19:18] [INFO ] [Real]Absence check using 55 positive place invariants in 100 ms returned sat
[2020-05-12 03:19:18] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 179 ms returned sat
[2020-05-12 03:19:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:19:21] [INFO ] [Real]Absence check using state equation in 2566 ms returned sat
[2020-05-12 03:19:22] [INFO ] Deduced a trap composed of 25 places in 956 ms
[2020-05-12 03:19:22] [INFO ] Deduced a trap composed of 12 places in 121 ms
[2020-05-12 03:19:22] [INFO ] Deduced a trap composed of 19 places in 254 ms
[2020-05-12 03:19:24] [INFO ] Deduced a trap composed of 19 places in 1491 ms
[2020-05-12 03:19:27] [INFO ] Deduced a trap composed of 29 places in 3367 ms
[2020-05-12 03:19:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 6331 ms
[2020-05-12 03:19:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:19:28] [INFO ] [Nat]Absence check using 55 positive place invariants in 206 ms returned sat
[2020-05-12 03:19:28] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 60 ms returned sat
[2020-05-12 03:19:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:19:31] [INFO ] [Nat]Absence check using state equation in 3698 ms returned sat
[2020-05-12 03:19:34] [INFO ] Deduced a trap composed of 11 places in 2394 ms
[2020-05-12 03:19:34] [INFO ] Deduced a trap composed of 28 places in 100 ms
[2020-05-12 03:19:34] [INFO ] Deduced a trap composed of 16 places in 104 ms
[2020-05-12 03:19:34] [INFO ] Deduced a trap composed of 17 places in 152 ms
[2020-05-12 03:19:35] [INFO ] Deduced a trap composed of 29 places in 477 ms
[2020-05-12 03:19:35] [INFO ] Deduced a trap composed of 18 places in 151 ms
[2020-05-12 03:19:35] [INFO ] Deduced a trap composed of 16 places in 243 ms
[2020-05-12 03:19:35] [INFO ] Deduced a trap composed of 26 places in 153 ms
[2020-05-12 03:19:37] [INFO ] Deduced a trap composed of 31 places in 1973 ms
[2020-05-12 03:19:38] [INFO ] Deduced a trap composed of 25 places in 570 ms
[2020-05-12 03:19:39] [INFO ] Deduced a trap composed of 24 places in 554 ms
[2020-05-12 03:19:39] [INFO ] Deduced a trap composed of 35 places in 89 ms
[2020-05-12 03:19:39] [INFO ] Deduced a trap composed of 23 places in 127 ms
[2020-05-12 03:19:39] [INFO ] Deduced a trap composed of 18 places in 76 ms
[2020-05-12 03:19:39] [INFO ] Deduced a trap composed of 38 places in 92 ms
[2020-05-12 03:19:39] [INFO ] Deduced a trap composed of 23 places in 105 ms
[2020-05-12 03:19:39] [INFO ] Deduced a trap composed of 20 places in 104 ms
[2020-05-12 03:19:39] [INFO ] Deduced a trap composed of 41 places in 87 ms
[2020-05-12 03:19:40] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 8017 ms
[2020-05-12 03:19:40] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 62 ms.
[2020-05-12 03:19:42] [INFO ] Added : 269 causal constraints over 55 iterations in 2362 ms. Result :sat
[2020-05-12 03:19:42] [INFO ] [Real]Absence check using 55 positive place invariants in 49 ms returned sat
[2020-05-12 03:19:42] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 21 ms returned sat
[2020-05-12 03:19:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:19:43] [INFO ] [Real]Absence check using state equation in 700 ms returned sat
[2020-05-12 03:19:43] [INFO ] Deduced a trap composed of 16 places in 148 ms
[2020-05-12 03:19:43] [INFO ] Deduced a trap composed of 19 places in 121 ms
[2020-05-12 03:19:43] [INFO ] Deduced a trap composed of 15 places in 122 ms
[2020-05-12 03:19:43] [INFO ] Deduced a trap composed of 16 places in 117 ms
[2020-05-12 03:19:44] [INFO ] Deduced a trap composed of 17 places in 240 ms
[2020-05-12 03:19:44] [INFO ] Deduced a trap composed of 24 places in 113 ms
[2020-05-12 03:19:44] [INFO ] Deduced a trap composed of 20 places in 112 ms
[2020-05-12 03:19:44] [INFO ] Deduced a trap composed of 34 places in 146 ms
[2020-05-12 03:19:44] [INFO ] Deduced a trap composed of 32 places in 111 ms
[2020-05-12 03:19:45] [INFO ] Deduced a trap composed of 20 places in 864 ms
[2020-05-12 03:19:45] [INFO ] Deduced a trap composed of 23 places in 244 ms
[2020-05-12 03:19:46] [INFO ] Deduced a trap composed of 35 places in 617 ms
[2020-05-12 03:19:48] [INFO ] Deduced a trap composed of 37 places in 1791 ms
[2020-05-12 03:19:48] [INFO ] Deduced a trap composed of 21 places in 274 ms
[2020-05-12 03:19:48] [INFO ] Deduced a trap composed of 21 places in 110 ms
[2020-05-12 03:19:50] [INFO ] Deduced a trap composed of 25 places in 1369 ms
[2020-05-12 03:19:50] [INFO ] Deduced a trap composed of 22 places in 93 ms
[2020-05-12 03:19:50] [INFO ] Deduced a trap composed of 18 places in 90 ms
[2020-05-12 03:19:50] [INFO ] Deduced a trap composed of 22 places in 90 ms
[2020-05-12 03:19:50] [INFO ] Deduced a trap composed of 33 places in 90 ms
[2020-05-12 03:19:50] [INFO ] Deduced a trap composed of 23 places in 97 ms
[2020-05-12 03:19:50] [INFO ] Deduced a trap composed of 35 places in 140 ms
[2020-05-12 03:19:51] [INFO ] Deduced a trap composed of 24 places in 74 ms
[2020-05-12 03:19:51] [INFO ] Deduced a trap composed of 39 places in 63 ms
[2020-05-12 03:19:51] [INFO ] Deduced a trap composed of 20 places in 64 ms
[2020-05-12 03:19:51] [INFO ] Deduced a trap composed of 41 places in 62 ms
[2020-05-12 03:19:51] [INFO ] Deduced a trap composed of 44 places in 65 ms
[2020-05-12 03:19:51] [INFO ] Deduced a trap composed of 28 places in 63 ms
[2020-05-12 03:19:51] [INFO ] Deduced a trap composed of 28 places in 69 ms
[2020-05-12 03:19:51] [INFO ] Deduced a trap composed of 24 places in 64 ms
[2020-05-12 03:19:51] [INFO ] Deduced a trap composed of 46 places in 77 ms
[2020-05-12 03:19:51] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 8566 ms
[2020-05-12 03:19:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:19:51] [INFO ] [Nat]Absence check using 55 positive place invariants in 51 ms returned sat
[2020-05-12 03:19:51] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 21 ms returned sat
[2020-05-12 03:19:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:19:52] [INFO ] [Nat]Absence check using state equation in 673 ms returned sat
[2020-05-12 03:19:52] [INFO ] Deduced a trap composed of 20 places in 172 ms
[2020-05-12 03:19:53] [INFO ] Deduced a trap composed of 20 places in 158 ms
[2020-05-12 03:19:53] [INFO ] Deduced a trap composed of 15 places in 155 ms
[2020-05-12 03:19:53] [INFO ] Deduced a trap composed of 22 places in 285 ms
[2020-05-12 03:19:53] [INFO ] Deduced a trap composed of 24 places in 95 ms
[2020-05-12 03:19:53] [INFO ] Deduced a trap composed of 12 places in 95 ms
[2020-05-12 03:19:53] [INFO ] Deduced a trap composed of 19 places in 105 ms
[2020-05-12 03:19:54] [INFO ] Deduced a trap composed of 31 places in 132 ms
[2020-05-12 03:19:54] [INFO ] Deduced a trap composed of 41 places in 135 ms
[2020-05-12 03:19:54] [INFO ] Deduced a trap composed of 21 places in 148 ms
[2020-05-12 03:19:54] [INFO ] Deduced a trap composed of 35 places in 100 ms
[2020-05-12 03:19:54] [INFO ] Deduced a trap composed of 54 places in 87 ms
[2020-05-12 03:19:54] [INFO ] Deduced a trap composed of 20 places in 100 ms
[2020-05-12 03:19:54] [INFO ] Deduced a trap composed of 20 places in 101 ms
[2020-05-12 03:19:54] [INFO ] Deduced a trap composed of 22 places in 102 ms
[2020-05-12 03:19:55] [INFO ] Deduced a trap composed of 27 places in 88 ms
[2020-05-12 03:19:55] [INFO ] Deduced a trap composed of 27 places in 159 ms
[2020-05-12 03:19:55] [INFO ] Deduced a trap composed of 28 places in 99 ms
[2020-05-12 03:19:55] [INFO ] Deduced a trap composed of 31 places in 113 ms
[2020-05-12 03:19:55] [INFO ] Deduced a trap composed of 39 places in 100 ms
[2020-05-12 03:19:55] [INFO ] Deduced a trap composed of 36 places in 197 ms
[2020-05-12 03:19:56] [INFO ] Deduced a trap composed of 24 places in 204 ms
[2020-05-12 03:19:56] [INFO ] Deduced a trap composed of 25 places in 161 ms
[2020-05-12 03:19:56] [INFO ] Deduced a trap composed of 24 places in 191 ms
[2020-05-12 03:19:56] [INFO ] Deduced a trap composed of 41 places in 193 ms
[2020-05-12 03:19:56] [INFO ] Deduced a trap composed of 43 places in 170 ms
[2020-05-12 03:19:57] [INFO ] Deduced a trap composed of 39 places in 204 ms
[2020-05-12 03:19:57] [INFO ] Deduced a trap composed of 43 places in 230 ms
[2020-05-12 03:19:57] [INFO ] Deduced a trap composed of 41 places in 190 ms
[2020-05-12 03:19:57] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 5006 ms
[2020-05-12 03:19:57] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 49 ms.
[2020-05-12 03:20:00] [INFO ] Added : 303 causal constraints over 61 iterations in 2869 ms. Result :sat
[2020-05-12 03:20:00] [INFO ] [Real]Absence check using 55 positive place invariants in 37 ms returned sat
[2020-05-12 03:20:00] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 24 ms returned sat
[2020-05-12 03:20:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:20:01] [INFO ] [Real]Absence check using state equation in 751 ms returned sat
[2020-05-12 03:20:02] [INFO ] Deduced a trap composed of 108 places in 1054 ms
[2020-05-12 03:20:02] [INFO ] Deduced a trap composed of 109 places in 164 ms
[2020-05-12 03:20:02] [INFO ] Deduced a trap composed of 22 places in 160 ms
[2020-05-12 03:20:03] [INFO ] Deduced a trap composed of 29 places in 175 ms
[2020-05-12 03:20:03] [INFO ] Deduced a trap composed of 26 places in 170 ms
[2020-05-12 03:20:03] [INFO ] Deduced a trap composed of 34 places in 168 ms
[2020-05-12 03:20:05] [INFO ] Deduced a trap composed of 17 places in 1588 ms
[2020-05-12 03:20:05] [INFO ] Deduced a trap composed of 21 places in 326 ms
[2020-05-12 03:20:06] [INFO ] Deduced a trap composed of 25 places in 847 ms
[2020-05-12 03:20:06] [INFO ] Deduced a trap composed of 35 places in 163 ms
[2020-05-12 03:20:06] [INFO ] Deduced a trap composed of 34 places in 155 ms
[2020-05-12 03:20:06] [INFO ] Deduced a trap composed of 20 places in 153 ms
[2020-05-12 03:20:07] [INFO ] Deduced a trap composed of 16 places in 329 ms
[2020-05-12 03:20:07] [INFO ] Deduced a trap composed of 25 places in 181 ms
[2020-05-12 03:20:07] [INFO ] Deduced a trap composed of 112 places in 260 ms
[2020-05-12 03:20:08] [INFO ] Deduced a trap composed of 38 places in 215 ms
[2020-05-12 03:20:08] [INFO ] Deduced a trap composed of 107 places in 173 ms
[2020-05-12 03:20:08] [INFO ] Deduced a trap composed of 112 places in 169 ms
[2020-05-12 03:20:08] [INFO ] Deduced a trap composed of 37 places in 228 ms
[2020-05-12 03:20:09] [INFO ] Deduced a trap composed of 67 places in 428 ms
[2020-05-12 03:20:09] [INFO ] Deduced a trap composed of 30 places in 148 ms
[2020-05-12 03:20:10] [INFO ] Deduced a trap composed of 22 places in 1124 ms
[2020-05-12 03:20:10] [INFO ] Deduced a trap composed of 23 places in 143 ms
[2020-05-12 03:20:10] [INFO ] Deduced a trap composed of 111 places in 136 ms
[2020-05-12 03:20:11] [INFO ] Deduced a trap composed of 110 places in 284 ms
[2020-05-12 03:20:11] [INFO ] Deduced a trap composed of 102 places in 184 ms
[2020-05-12 03:20:11] [INFO ] Deduced a trap composed of 46 places in 233 ms
[2020-05-12 03:20:11] [INFO ] Deduced a trap composed of 107 places in 268 ms
[2020-05-12 03:20:12] [INFO ] Deduced a trap composed of 43 places in 206 ms
[2020-05-12 03:20:15] [INFO ] Deduced a trap composed of 28 places in 3514 ms
[2020-05-12 03:20:15] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 14271 ms
[2020-05-12 03:20:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:20:15] [INFO ] [Nat]Absence check using 55 positive place invariants in 45 ms returned sat
[2020-05-12 03:20:15] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 22 ms returned sat
[2020-05-12 03:20:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:20:18] [INFO ] [Nat]Absence check using state equation in 2394 ms returned sat
[2020-05-12 03:20:18] [INFO ] Deduced a trap composed of 8 places in 215 ms
[2020-05-12 03:20:18] [INFO ] Deduced a trap composed of 28 places in 119 ms
[2020-05-12 03:20:18] [INFO ] Deduced a trap composed of 19 places in 115 ms
[2020-05-12 03:20:18] [INFO ] Deduced a trap composed of 33 places in 116 ms
[2020-05-12 03:20:19] [INFO ] Deduced a trap composed of 21 places in 112 ms
[2020-05-12 03:20:19] [INFO ] Deduced a trap composed of 30 places in 106 ms
[2020-05-12 03:20:19] [INFO ] Deduced a trap composed of 23 places in 120 ms
[2020-05-12 03:20:19] [INFO ] Deduced a trap composed of 25 places in 96 ms
[2020-05-12 03:20:19] [INFO ] Deduced a trap composed of 34 places in 111 ms
[2020-05-12 03:20:19] [INFO ] Deduced a trap composed of 34 places in 119 ms
[2020-05-12 03:20:19] [INFO ] Deduced a trap composed of 21 places in 148 ms
[2020-05-12 03:20:20] [INFO ] Deduced a trap composed of 23 places in 182 ms
[2020-05-12 03:20:20] [INFO ] Deduced a trap composed of 28 places in 181 ms
[2020-05-12 03:20:20] [INFO ] Deduced a trap composed of 34 places in 424 ms
[2020-05-12 03:20:21] [INFO ] Deduced a trap composed of 36 places in 137 ms
[2020-05-12 03:20:21] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2736 ms
[2020-05-12 03:20:21] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 44 ms.
[2020-05-12 03:20:26] [INFO ] Added : 383 causal constraints over 77 iterations in 5934 ms. Result :sat
[2020-05-12 03:20:27] [INFO ] Deduced a trap composed of 137 places in 283 ms
[2020-05-12 03:20:27] [INFO ] Deduced a trap composed of 132 places in 283 ms
[2020-05-12 03:20:28] [INFO ] Deduced a trap composed of 142 places in 666 ms
[2020-05-12 03:20:29] [INFO ] Deduced a trap composed of 141 places in 1264 ms
[2020-05-12 03:20:30] [INFO ] Deduced a trap composed of 134 places in 274 ms
[2020-05-12 03:20:30] [INFO ] Deduced a trap composed of 130 places in 276 ms
[2020-05-12 03:20:30] [INFO ] Deduced a trap composed of 139 places in 272 ms
[2020-05-12 03:20:36] [INFO ] Deduced a trap composed of 128 places in 5667 ms
[2020-05-12 03:20:36] [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 s73 s75 s77 s83 s87 s88 s102 s108 s111 s134 s135 s145 s148 s149 s154 s155 s159 s160 s161 s171 s172 s173 s223 s224 s228 s229 s230 s236 s239 s270 s289 s294 s299 s304 s309 s314 s319 s339 s359 s374 s389 s394 s404 s409 s413 s414 s415 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427 s428 s429 s432 s433 s434 s435 s436 s437 s438 s439 s440 s441 s442 s443 s444 s447 s448 s451 s452 s454 s461 s462 s463 s469 s474 s475 s478 s479 s482 s483 s486 s487 s488 s489 s492 s493 s500 s501 s502 s503 s504 s505 s509 s510 s511 s512 s513 s514 s515 s516 s517 s518 s521 s522 s523 s524 s525 s526 s529 s530 s533 s534 s543 s551 s572 s576) 0)") while checking expression at index 7
[2020-05-12 03:20:37] [INFO ] [Real]Absence check using 55 positive place invariants in 249 ms returned sat
[2020-05-12 03:20:37] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 144 ms returned sat
[2020-05-12 03:20:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:20:38] [INFO ] [Real]Absence check using state equation in 1218 ms returned unsat
[2020-05-12 03:20:38] [INFO ] [Real]Absence check using 55 positive place invariants in 86 ms returned sat
[2020-05-12 03:20:38] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 53 ms returned sat
[2020-05-12 03:20:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:20:40] [INFO ] [Real]Absence check using state equation in 1669 ms returned sat
[2020-05-12 03:20:40] [INFO ] Deduced a trap composed of 15 places in 193 ms
[2020-05-12 03:20:40] [INFO ] Deduced a trap composed of 22 places in 350 ms
[2020-05-12 03:20:41] [INFO ] Deduced a trap composed of 20 places in 349 ms
[2020-05-12 03:20:41] [INFO ] Deduced a trap composed of 13 places in 438 ms
[2020-05-12 03:20:41] [INFO ] Deduced a trap composed of 22 places in 183 ms
[2020-05-12 03:20:42] [INFO ] Deduced a trap composed of 142 places in 348 ms
[2020-05-12 03:20:43] [INFO ] Deduced a trap composed of 128 places in 689 ms
[2020-05-12 03:20:43] [INFO ] Deduced a trap composed of 14 places in 351 ms
[2020-05-12 03:20:43] [INFO ] Deduced a trap composed of 20 places in 334 ms
[2020-05-12 03:20:44] [INFO ] Deduced a trap composed of 22 places in 211 ms
[2020-05-12 03:20:44] [INFO ] Deduced a trap composed of 34 places in 164 ms
[2020-05-12 03:20:45] [INFO ] Deduced a trap composed of 19 places in 1190 ms
[2020-05-12 03:20:45] [INFO ] Deduced a trap composed of 27 places in 331 ms
[2020-05-12 03:20:46] [INFO ] Deduced a trap composed of 32 places in 786 ms
[2020-05-12 03:20:47] [INFO ] Deduced a trap composed of 23 places in 398 ms
[2020-05-12 03:20:47] [INFO ] Deduced a trap composed of 33 places in 255 ms
[2020-05-12 03:20:47] [INFO ] Deduced a trap composed of 131 places in 249 ms
[2020-05-12 03:20:47] [INFO ] Deduced a trap composed of 128 places in 157 ms
[2020-05-12 03:20:48] [INFO ] Deduced a trap composed of 29 places in 154 ms
[2020-05-12 03:20:48] [INFO ] Deduced a trap composed of 23 places in 156 ms
[2020-05-12 03:20:48] [INFO ] Deduced a trap composed of 125 places in 156 ms
[2020-05-12 03:20:49] [INFO ] Deduced a trap composed of 28 places in 627 ms
[2020-05-12 03:20:49] [INFO ] Deduced a trap composed of 25 places in 763 ms
[2020-05-12 03:20:50] [INFO ] Deduced a trap composed of 26 places in 192 ms
[2020-05-12 03:20:50] [INFO ] Deduced a trap composed of 37 places in 290 ms
[2020-05-12 03:20:50] [INFO ] Deduced a trap composed of 36 places in 304 ms
[2020-05-12 03:20:51] [INFO ] Deduced a trap composed of 36 places in 369 ms
[2020-05-12 03:20:52] [INFO ] Deduced a trap composed of 129 places in 990 ms
[2020-05-12 03:20:52] [INFO ] Deduced a trap composed of 42 places in 394 ms
[2020-05-12 03:20:52] [INFO ] Deduced a trap composed of 25 places in 347 ms
[2020-05-12 03:20:53] [INFO ] Deduced a trap composed of 124 places in 307 ms
[2020-05-12 03:20:53] [INFO ] Deduced a trap composed of 128 places in 357 ms
[2020-05-12 03:20:54] [INFO ] Deduced a trap composed of 130 places in 285 ms
[2020-05-12 03:20:54] [INFO ] Deduced a trap composed of 35 places in 246 ms
[2020-05-12 03:20:54] [INFO ] Deduced a trap composed of 137 places in 165 ms
[2020-05-12 03:20:54] [INFO ] Deduced a trap composed of 39 places in 270 ms
[2020-05-12 03:20:55] [INFO ] Deduced a trap composed of 124 places in 274 ms
[2020-05-12 03:20:55] [INFO ] Deduced a trap composed of 24 places in 282 ms
[2020-05-12 03:20:57] [INFO ] Deduced a trap composed of 143 places in 1998 ms
[2020-05-12 03:20:57] [INFO ] Deduced a trap composed of 30 places in 157 ms
[2020-05-12 03:20:57] [INFO ] Deduced a trap composed of 28 places in 173 ms
[2020-05-12 03:20:58] [INFO ] Deduced a trap composed of 129 places in 158 ms
[2020-05-12 03:20:58] [INFO ] Deduced a trap composed of 127 places in 273 ms
[2020-05-12 03:20:58] [INFO ] Deduced a trap composed of 134 places in 320 ms
[2020-05-12 03:20:58] [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 s5 s6 s7 s8 s27 s28 s31 s32 s36 s37 s38 s42 s43 s44 s45 s52 s53 s66 s67 s68 s71 s75 s77 s80 s83 s86 s87 s88 s89 s90 s108 s111 s145 s148 s149 s151 s152 s165 s166 s167 s176 s177 s185 s206 s209 s210 s211 s223 s224 s270 s275 s284 s289 s294 s299 s304 s323 s325 s334 s349 s364 s369 s374 s379 s384 s389 s399 s409 s413 s416 s417 s418 s419 s423 s424 s425 s426 s427 s435 s436 s439 s440 s441 s442 s443 s444 s447 s448 s456 s472 s473 s474 s475 s480 s481 s482 s483 s484 s485 s486 s487 s488 s489 s494 s495 s496 s497 s498 s499 s504 s505 s506 s507 s513 s514 s517 s518 s521 s522 s529 s530 s531 s532 s537 s538 s539 s540 s543 s554) 0)") while checking expression at index 9
[2020-05-12 03:20:58] [INFO ] [Real]Absence check using 55 positive place invariants in 26 ms returned unsat
[2020-05-12 03:20:59] [INFO ] [Real]Absence check using 55 positive place invariants in 91 ms returned sat
[2020-05-12 03:20:59] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-05-12 03:20:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:20:59] [INFO ] [Real]Absence check using state equation in 727 ms returned sat
[2020-05-12 03:21:00] [INFO ] Deduced a trap composed of 13 places in 346 ms
[2020-05-12 03:21:00] [INFO ] Deduced a trap composed of 138 places in 404 ms
[2020-05-12 03:21:00] [INFO ] Deduced a trap composed of 15 places in 165 ms
[2020-05-12 03:21:01] [INFO ] Deduced a trap composed of 17 places in 634 ms
[2020-05-12 03:21:01] [INFO ] Deduced a trap composed of 26 places in 168 ms
[2020-05-12 03:21:01] [INFO ] Deduced a trap composed of 25 places in 187 ms
[2020-05-12 03:21:02] [INFO ] Deduced a trap composed of 35 places in 169 ms
[2020-05-12 03:21:02] [INFO ] Deduced a trap composed of 138 places in 302 ms
[2020-05-12 03:21:02] [INFO ] Deduced a trap composed of 14 places in 165 ms
[2020-05-12 03:21:02] [INFO ] Deduced a trap composed of 27 places in 295 ms
[2020-05-12 03:21:03] [INFO ] Deduced a trap composed of 138 places in 161 ms
[2020-05-12 03:21:03] [INFO ] Deduced a trap composed of 137 places in 192 ms
[2020-05-12 03:21:03] [INFO ] Deduced a trap composed of 24 places in 162 ms
[2020-05-12 03:21:03] [INFO ] Deduced a trap composed of 23 places in 287 ms
[2020-05-12 03:21:04] [INFO ] Deduced a trap composed of 24 places in 176 ms
[2020-05-12 03:21:04] [INFO ] Deduced a trap composed of 27 places in 165 ms
[2020-05-12 03:21:04] [INFO ] Deduced a trap composed of 32 places in 173 ms
[2020-05-12 03:21:04] [INFO ] Deduced a trap composed of 28 places in 224 ms
[2020-05-12 03:21:04] [INFO ] Deduced a trap composed of 44 places in 148 ms
[2020-05-12 03:21:04] [INFO ] Deduced a trap composed of 128 places in 145 ms
[2020-05-12 03:21:05] [INFO ] Deduced a trap composed of 37 places in 157 ms
[2020-05-12 03:21:05] [INFO ] Deduced a trap composed of 22 places in 411 ms
[2020-05-12 03:21:07] [INFO ] Deduced a trap composed of 133 places in 1710 ms
[2020-05-12 03:21:07] [INFO ] Deduced a trap composed of 49 places in 158 ms
[2020-05-12 03:21:07] [INFO ] Deduced a trap composed of 47 places in 185 ms
[2020-05-12 03:21:07] [INFO ] Deduced a trap composed of 28 places in 158 ms
[2020-05-12 03:21:08] [INFO ] Deduced a trap composed of 47 places in 188 ms
[2020-05-12 03:21:08] [INFO ] Deduced a trap composed of 32 places in 451 ms
[2020-05-12 03:21:09] [INFO ] Deduced a trap composed of 123 places in 293 ms
[2020-05-12 03:21:09] [INFO ] Deduced a trap composed of 26 places in 241 ms
[2020-05-12 03:21:09] [INFO ] Deduced a trap composed of 30 places in 328 ms
[2020-05-12 03:21:10] [INFO ] Deduced a trap composed of 63 places in 606 ms
[2020-05-12 03:21:10] [INFO ] Deduced a trap composed of 127 places in 634 ms
[2020-05-12 03:21:11] [INFO ] Deduced a trap composed of 48 places in 396 ms
[2020-05-12 03:21:11] [INFO ] Deduced a trap composed of 27 places in 174 ms
[2020-05-12 03:21:11] [INFO ] Deduced a trap composed of 26 places in 230 ms
[2020-05-12 03:21:12] [INFO ] Deduced a trap composed of 126 places in 309 ms
[2020-05-12 03:21:12] [INFO ] Deduced a trap composed of 26 places in 298 ms
[2020-05-12 03:21:12] [INFO ] Deduced a trap composed of 128 places in 296 ms
[2020-05-12 03:21:13] [INFO ] Deduced a trap composed of 135 places in 291 ms
[2020-05-12 03:21:13] [INFO ] Deduced a trap composed of 22 places in 264 ms
[2020-05-12 03:21:13] [INFO ] Deduced a trap composed of 47 places in 326 ms
[2020-05-12 03:21:14] [INFO ] Deduced a trap composed of 49 places in 284 ms
[2020-05-12 03:21:14] [INFO ] Deduced a trap composed of 21 places in 339 ms
[2020-05-12 03:21:14] [INFO ] Deduced a trap composed of 52 places in 293 ms
[2020-05-12 03:21:15] [INFO ] Deduced a trap composed of 30 places in 190 ms
[2020-05-12 03:21:15] [INFO ] Deduced a trap composed of 28 places in 157 ms
[2020-05-12 03:21:15] [INFO ] Deduced a trap composed of 34 places in 180 ms
[2020-05-12 03:21:18] [INFO ] Deduced a trap composed of 43 places in 3294 ms
[2020-05-12 03:21:22] [INFO ] Deduced a trap composed of 120 places in 3938 ms
[2020-05-12 03:21:22] [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 s66 s67 s68 s73 s83 s87 s88 s102 s159 s160 s161 s165 s166 s167 s176 s177 s185 s197 s198 s199 s203 s204 s205 s223 s224 s236 s239 s270 s283 s284 s285 s293 s295 s299 s304 s314 s319 s323 s324 s325 s329 s334 s338 s339 s340 s344 s348 s349 s350 s369 s374 s379 s393 s394 s395 s399 s404 s409 s413 s416 s417 s418 s419 s422 s423 s424 s425 s426 s427 s428 s429 s432 s433 s434 s439 s440 s441 s442 s445 s446 s447 s448 s449 s450 s454 s458 s460 s461 s462 s463 s469 s474 s475 s484 s485 s488 s489 s492 s493 s506 s507 s508 s513 s514 s515 s516 s525 s526 s539 s540 s543 s544 s548 s563 s566 s580 s581) 0)") while checking expression at index 11
[2020-05-12 03:21:22] [INFO ] [Real]Absence check using 55 positive place invariants in 33 ms returned sat
[2020-05-12 03:21:22] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 21 ms returned sat
[2020-05-12 03:21:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:21:23] [INFO ] [Real]Absence check using state equation in 731 ms returned sat
[2020-05-12 03:21:24] [INFO ] Deduced a trap composed of 11 places in 495 ms
[2020-05-12 03:21:26] [INFO ] Deduced a trap composed of 15 places in 2453 ms
[2020-05-12 03:21:26] [INFO ] Deduced a trap composed of 19 places in 175 ms
[2020-05-12 03:21:26] [INFO ] Deduced a trap composed of 122 places in 144 ms
[2020-05-12 03:21:27] [INFO ] Deduced a trap composed of 22 places in 133 ms
[2020-05-12 03:21:27] [INFO ] Deduced a trap composed of 22 places in 286 ms
[2020-05-12 03:21:27] [INFO ] Deduced a trap composed of 17 places in 290 ms
[2020-05-12 03:21:29] [INFO ] Deduced a trap composed of 20 places in 1471 ms
[2020-05-12 03:21:32] [INFO ] Deduced a trap composed of 25 places in 2769 ms
[2020-05-12 03:21:32] [INFO ] Deduced a trap composed of 31 places in 281 ms
[2020-05-12 03:21:33] [INFO ] Deduced a trap composed of 32 places in 810 ms
[2020-05-12 03:21:33] [INFO ] Deduced a trap composed of 18 places in 336 ms
[2020-05-12 03:21:36] [INFO ] Deduced a trap composed of 23 places in 2765 ms
[2020-05-12 03:21:36] [INFO ] Deduced a trap composed of 108 places in 263 ms
[2020-05-12 03:21:36] [INFO ] Deduced a trap composed of 21 places in 153 ms
[2020-05-12 03:21:37] [INFO ] Deduced a trap composed of 30 places in 155 ms
[2020-05-12 03:21:37] [INFO ] Deduced a trap composed of 39 places in 143 ms
[2020-05-12 03:21:37] [INFO ] Deduced a trap composed of 28 places in 158 ms
[2020-05-12 03:21:37] [INFO ] Deduced a trap composed of 21 places in 208 ms
[2020-05-12 03:21:37] [INFO ] Deduced a trap composed of 26 places in 145 ms
[2020-05-12 03:21:37] [INFO ] Deduced a trap composed of 29 places in 139 ms
[2020-05-12 03:21:38] [INFO ] Deduced a trap composed of 27 places in 144 ms
[2020-05-12 03:21:38] [INFO ] Deduced a trap composed of 27 places in 457 ms
[2020-05-12 03:21:39] [INFO ] Deduced a trap composed of 30 places in 1018 ms
[2020-05-12 03:21:40] [INFO ] Deduced a trap composed of 124 places in 360 ms
[2020-05-12 03:21:40] [INFO ] Deduced a trap composed of 41 places in 721 ms
[2020-05-12 03:21:40] [INFO ] Deduced a trap composed of 45 places in 133 ms
[2020-05-12 03:21:44] [INFO ] Deduced a trap composed of 130 places in 3514 ms
[2020-05-12 03:21:44] [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 s5 s27 s28 s31 s32 s71 s73 s77 s86 s87 s88 s96 s102 s114 s134 s135 s139 s140 s141 s159 s160 s161 s165 s166 s167 s203 s204 s205 s215 s216 s217 s225 s228 s229 s230 s279 s284 s293 s295 s298 s299 s300 s304 s324 s329 s339 s369 s379 s389 s394 s399 s404 s409 s413 s414 s415 s416 s417 s418 s419 s422 s423 s424 s425 s426 s427 s430 s431 s437 s438 s439 s440 s441 s442 s449 s450 s451 s452 s458 s461 s462 s463 s466 s472 s473 s474 s475 s476 s477 s478 s479 s480 s481 s490 s491 s492 s493 s494 s495 s500 s501 s504 s505 s506 s507 s508 s509 s510 s513 s514 s515 s516 s517 s518 s519 s520 s525 s526 s535 s536 s543 s563 s579 s580 s581) 0)") while checking expression at index 12
[2020-05-12 03:21:44] [INFO ] [Real]Absence check using 55 positive place invariants in 64 ms returned sat
[2020-05-12 03:21:44] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 22 ms returned sat
[2020-05-12 03:21:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:21:45] [INFO ] [Real]Absence check using state equation in 738 ms returned sat
[2020-05-12 03:21:46] [INFO ] Deduced a trap composed of 13 places in 1108 ms
[2020-05-12 03:21:47] [INFO ] Deduced a trap composed of 150 places in 662 ms
[2020-05-12 03:21:48] [INFO ] Deduced a trap composed of 16 places in 1647 ms
[2020-05-12 03:21:49] [INFO ] Deduced a trap composed of 20 places in 386 ms
[2020-05-12 03:21:49] [INFO ] Deduced a trap composed of 23 places in 492 ms
[2020-05-12 03:21:52] [INFO ] Deduced a trap composed of 134 places in 2694 ms
[2020-05-12 03:21:53] [INFO ] Deduced a trap composed of 36 places in 443 ms
[2020-05-12 03:21:53] [INFO ] Deduced a trap composed of 35 places in 328 ms
[2020-05-12 03:21:54] [INFO ] Deduced a trap composed of 135 places in 1031 ms
[2020-05-12 03:21:54] [INFO ] Deduced a trap composed of 29 places in 217 ms
[2020-05-12 03:21:56] [INFO ] Deduced a trap composed of 33 places in 1914 ms
[2020-05-12 03:21:57] [INFO ] Deduced a trap composed of 38 places in 404 ms
[2020-05-12 03:21:57] [INFO ] Deduced a trap composed of 134 places in 186 ms
[2020-05-12 03:21:57] [INFO ] Deduced a trap composed of 135 places in 340 ms
[2020-05-12 03:21:58] [INFO ] Deduced a trap composed of 40 places in 311 ms
[2020-05-12 03:21:58] [INFO ] Deduced a trap composed of 121 places in 375 ms
[2020-05-12 03:21:58] [INFO ] Deduced a trap composed of 128 places in 395 ms
[2020-05-12 03:21:59] [INFO ] Deduced a trap composed of 136 places in 598 ms
[2020-05-12 03:21:59] [INFO ] Deduced a trap composed of 151 places in 156 ms
[2020-05-12 03:21:59] [INFO ] Deduced a trap composed of 127 places in 193 ms
[2020-05-12 03:22:00] [INFO ] Deduced a trap composed of 37 places in 180 ms
[2020-05-12 03:22:00] [INFO ] Deduced a trap composed of 31 places in 150 ms
[2020-05-12 03:22:00] [INFO ] Deduced a trap composed of 46 places in 152 ms
[2020-05-12 03:22:02] [INFO ] Deduced a trap composed of 135 places in 1806 ms
[2020-05-12 03:22:04] [INFO ] Deduced a trap composed of 129 places in 2585 ms
[2020-05-12 03:22:04] [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 s27 s28 s31 s32 s36 s37 s38 s60 s61 s62 s71 s77 s96 s114 s126 s127 s128 s139 s140 s141 s165 s166 s167 s176 s177 s178 s179 s203 s204 s205 s223 s224 s228 s229 s230 s236 s239 s270 s279 s289 s294 s304 s319 s324 s329 s334 s339 s344 s354 s374 s388 s389 s390 s394 s399 s409 s413 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427 s439 s440 s441 s442 s443 s444 s451 s452 s455 s456 s458 s461 s462 s463 s464 s465 s466 s469 s470 s471 s472 s473 s474 s475 s476 s477 s484 s485 s490 s491 s492 s493 s494 s495 s498 s499 s500 s501 s506 s507 s511 s512 s513 s514 s523 s524 s525 s526 s529 s530 s537 s538 s543 s554 s555 s556 s563) 0)") while checking expression at index 13
[2020-05-12 03:22:05] [INFO ] [Real]Absence check using 55 positive place invariants in 132 ms returned sat
[2020-05-12 03:22:05] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 11 ms returned unsat
[2020-05-12 03:22:05] [INFO ] [Real]Absence check using 55 positive place invariants in 57 ms returned sat
[2020-05-12 03:22:05] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 67 ms returned sat
[2020-05-12 03:22:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:22:06] [INFO ] [Real]Absence check using state equation in 792 ms returned unsat
[2020-05-12 03:22:06] [INFO ] [Real]Absence check using 55 positive place invariants in 61 ms returned sat
[2020-05-12 03:22:06] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-05-12 03:22:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:22:07] [INFO ] [Real]Absence check using state equation in 655 ms returned sat
[2020-05-12 03:22:07] [INFO ] Deduced a trap composed of 8 places in 119 ms
[2020-05-12 03:22:07] [INFO ] Deduced a trap composed of 11 places in 79 ms
[2020-05-12 03:22:07] [INFO ] Deduced a trap composed of 21 places in 77 ms
[2020-05-12 03:22:07] [INFO ] Deduced a trap composed of 24 places in 84 ms
[2020-05-12 03:22:07] [INFO ] Deduced a trap composed of 25 places in 114 ms
[2020-05-12 03:22:07] [INFO ] Deduced a trap composed of 15 places in 75 ms
[2020-05-12 03:22:07] [INFO ] Deduced a trap composed of 23 places in 74 ms
[2020-05-12 03:22:07] [INFO ] Deduced a trap composed of 16 places in 70 ms
[2020-05-12 03:22:08] [INFO ] Deduced a trap composed of 18 places in 83 ms
[2020-05-12 03:22:08] [INFO ] Deduced a trap composed of 27 places in 64 ms
[2020-05-12 03:22:08] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1102 ms
[2020-05-12 03:22:08] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:22:08] [INFO ] [Nat]Absence check using 55 positive place invariants in 41 ms returned sat
[2020-05-12 03:22:08] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 30 ms returned sat
[2020-05-12 03:22:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:22:08] [INFO ] [Nat]Absence check using state equation in 688 ms returned sat
[2020-05-12 03:22:09] [INFO ] Deduced a trap composed of 8 places in 153 ms
[2020-05-12 03:22:09] [INFO ] Deduced a trap composed of 11 places in 81 ms
[2020-05-12 03:22:09] [INFO ] Deduced a trap composed of 15 places in 95 ms
[2020-05-12 03:22:09] [INFO ] Deduced a trap composed of 16 places in 78 ms
[2020-05-12 03:22:09] [INFO ] Deduced a trap composed of 18 places in 76 ms
[2020-05-12 03:22:09] [INFO ] Deduced a trap composed of 22 places in 66 ms
[2020-05-12 03:22:09] [INFO ] Deduced a trap composed of 32 places in 68 ms
[2020-05-12 03:22:09] [INFO ] Deduced a trap composed of 25 places in 61 ms
[2020-05-12 03:22:09] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 945 ms
[2020-05-12 03:22:09] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 27 ms.
[2020-05-12 03:22:11] [INFO ] Added : 252 causal constraints over 51 iterations in 1838 ms. Result :sat
[2020-05-12 03:22:11] [INFO ] Deduced a trap composed of 47 places in 69 ms
[2020-05-12 03:22:11] [INFO ] Deduced a trap composed of 46 places in 69 ms
[2020-05-12 03:22:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 258 ms
[2020-05-12 03:22:12] [INFO ] [Real]Absence check using 55 positive place invariants in 21 ms returned unsat
[2020-05-12 03:22:12] [INFO ] [Real]Absence check using 55 positive place invariants in 33 ms returned sat
[2020-05-12 03:22:12] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 21 ms returned sat
[2020-05-12 03:22:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:22:12] [INFO ] [Real]Absence check using state equation in 629 ms returned unsat
[2020-05-12 03:22:12] [INFO ] [Real]Absence check using 55 positive place invariants in 32 ms returned sat
[2020-05-12 03:22:12] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 21 ms returned sat
[2020-05-12 03:22:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:22:13] [INFO ] [Real]Absence check using state equation in 542 ms returned unsat
[2020-05-12 03:22:13] [INFO ] [Real]Absence check using 55 positive place invariants in 32 ms returned sat
[2020-05-12 03:22:13] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 19 ms returned sat
[2020-05-12 03:22:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:22:15] [INFO ] [Real]Absence check using state equation in 1976 ms returned unsat
[2020-05-12 03:22:15] [INFO ] [Real]Absence check using 55 positive place invariants in 36 ms returned sat
[2020-05-12 03:22:15] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 24 ms returned sat
[2020-05-12 03:22:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:22:16] [INFO ] [Real]Absence check using state equation in 456 ms returned unsat
[2020-05-12 03:22:16] [INFO ] [Real]Absence check using 55 positive place invariants in 34 ms returned sat
[2020-05-12 03:22:16] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 21 ms returned sat
[2020-05-12 03:22:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:22:17] [INFO ] [Real]Absence check using state equation in 1432 ms returned sat
[2020-05-12 03:22:17] [INFO ] Deduced a trap composed of 12 places in 242 ms
[2020-05-12 03:22:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2020-05-12 03:22:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:22:18] [INFO ] [Nat]Absence check using 55 positive place invariants in 68 ms returned sat
[2020-05-12 03:22:18] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 43 ms returned sat
[2020-05-12 03:22:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:22:19] [INFO ] [Nat]Absence check using state equation in 1691 ms returned sat
[2020-05-12 03:22:20] [INFO ] Deduced a trap composed of 11 places in 129 ms
[2020-05-12 03:22:20] [INFO ] Deduced a trap composed of 114 places in 131 ms
[2020-05-12 03:22:20] [INFO ] Deduced a trap composed of 122 places in 347 ms
[2020-05-12 03:22:20] [INFO ] Deduced a trap composed of 22 places in 221 ms
[2020-05-12 03:22:21] [INFO ] Deduced a trap composed of 11 places in 256 ms
[2020-05-12 03:22:21] [INFO ] Deduced a trap composed of 21 places in 289 ms
[2020-05-12 03:22:21] [INFO ] Deduced a trap composed of 19 places in 250 ms
[2020-05-12 03:22:21] [INFO ] Deduced a trap composed of 29 places in 127 ms
[2020-05-12 03:22:22] [INFO ] Deduced a trap composed of 122 places in 144 ms
[2020-05-12 03:22:22] [INFO ] Deduced a trap composed of 38 places in 261 ms
[2020-05-12 03:22:22] [INFO ] Deduced a trap composed of 35 places in 240 ms
[2020-05-12 03:22:23] [INFO ] Deduced a trap composed of 137 places in 1126 ms
[2020-05-12 03:22:24] [INFO ] Deduced a trap composed of 15 places in 277 ms
[2020-05-12 03:22:24] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4152 ms
[2020-05-12 03:22:24] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 25 ms.
[2020-05-12 03:22:25] [INFO ] Added : 161 causal constraints over 33 iterations in 1304 ms. Result :sat
Successfully simplified 11 atomic propositions for a total of 11 simplifications.
[2020-05-12 03:22:25] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-12 03:22:25] [INFO ] Flatten gal took : 159 ms
[2020-05-12 03:22:25] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-12 03:22:25] [INFO ] Flatten gal took : 40 ms
FORMULA BusinessProcesses-PT-12-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 03:22:25] [INFO ] Applying decomposition
[2020-05-12 03:22:26] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph13969688759448933588.txt, -o, /tmp/graph13969688759448933588.bin, -w, /tmp/graph13969688759448933588.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph13969688759448933588.bin, -l, -1, -v, -w, /tmp/graph13969688759448933588.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 03:22:26] [INFO ] Decomposing Gal with order
[2020-05-12 03:22:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 03:22:26] [INFO ] Removed a total of 263 redundant transitions.
[2020-05-12 03:22:26] [INFO ] Flatten gal took : 144 ms
[2020-05-12 03:22:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 24 ms.
[2020-05-12 03:22:26] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 10 ms
[2020-05-12 03:22:26] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 12 CTL formulae.
built 55 ordering constraints for composite.
built 6 ordering constraints for composite.
built 30 ordering constraints for composite.
built 28 ordering constraints for composite.
built 21 ordering constraints for composite.
built 14 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 21 ordering constraints for composite.
built 21 ordering constraints for composite.
built 25 ordering constraints for composite.
built 72 ordering constraints for composite.
built 33 ordering constraints for composite.
built 15 ordering constraints for composite.
built 25 ordering constraints for composite.
built 16 ordering constraints for composite.
built 28 ordering constraints for composite.
built 20 ordering constraints for composite.
built 24 ordering constraints for composite.
built 88 ordering constraints for composite.
built 24 ordering constraints for composite.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.14329e+23,3.08022,93036,9026,88,167633,1025,1134,449746,82,2885,0
Converting to forward existential form...Done !
original formula: EX(EF(EG((i3.u23.p54==1))))
=> equivalent forward existential formula: [FwdG(FwdU(EY(Init),TRUE),(i3.u23.p54==1))] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,1,58.8112,800504,1,0,1.35516e+06,1284,6142,3.81587e+06,329,4346,1900780
FORMULA BusinessProcesses-PT-12-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (EF((i0.u209.p526==1)) + EG(AX((i14.u5.p14==1))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (i0.u209.p526==1))] != FALSE + [FwdG(Init,!(EX(!((i14.u5.p14==1)))))] != FALSE)
(forward)formula 1,1,58.8178,801032,1,0,1.35519e+06,1284,6145,3.81606e+06,330,4346,1902999
FORMULA BusinessProcesses-PT-12-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EF(((i12.u113.p296==1)||(i5.u72.p189==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((i12.u113.p296==1)||(i5.u72.p189==1)))] != FALSE
(forward)formula 2,1,58.8333,801296,1,0,1.35661e+06,1284,6150,3.81929e+06,330,4346,1904676
FORMULA BusinessProcesses-PT-12-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AF(((AG(((i11.u36.p87!=1)||(i11.u184.p474!=1))) + EX((i2.u168.p437==1))) + EX((i1.u7.p18==1))))
=> equivalent forward existential formula: [FwdG(Init,!(((!(E(TRUE U !(((i11.u36.p87!=1)||(i11.u184.p474!=1))))) + EX((i2.u168.p437==1))) + EX((i1.u7.p18==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t80, t264, t282, t388, i0.t274, i0.t270, i0.t155, i0.u80.t273, i0.u74.t285, i0.u76.t281, i0.u78.t277, i0.u152.t156, i1.t325, i1.t207, i1.t203, i1.u53.t321, i1.u50.t327, i1.u126.t208, i1.u128.t204, i2.t396, i2.t115, i2.u12.t394, i2.u24.t369, i2.u13.t392, i2.u166.t119, i3.t387, i3.t383, i3.t381, i3.t379, i3.t377, i3.t374, i3.t372, i4.t195, i4.u55.t317, i4.u60.t309, i4.u132.t196, i5.t171, i5.u66.t297, i5.u72.t289, i5.u143.t172, i6.t163, i6.u147.t164, i7.i0.i0.t260, i7.i0.i0.u86.t263, i7.i0.i1.u89.t256, i7.i0.i3.t143, i7.i0.i3.u157.t144, i7.i0.i4.t139, i7.i0.i4.u160.t140, i7.i1.i0.t267, i7.i1.i0.u82.t269, i7.i1.i1.t147, i7.i1.i1.u156.t148, i8.t175, i8.t167, i8.t159, i8.t151, i8.u141.t176, i8.u145.t168, i8.u150.t160, i8.u153.t152, i9.t250, i9.t239, i9.t235, i9.u14.t391, i9.u104.t251, i9.u110.t240, i9.u111.t236, i10.u46.t335, i10.u48.t331, i10.u26.t365, i11.t343, i11.t341, i11.t339, i11.t247, i11.t227, i11.t223, i11.u107.t248, i11.u29.t347, i11.u29.t351, i11.u29.t355, i11.u29.t361, i11.u116.t228, i11.u118.t224, i12.t231, i12.t219, i12.t215, i12.t211, i12.u114.t232, i12.u120.t220, i12.u122.t216, i12.u124.t212, i13.t199, i13.t191, i13.t187, i13.t183, i13.t179, i13.u130.t200, i13.u133.t192, i13.u136.t188, i13.u138.t184, i13.u140.t180, i14.u62.t305, i14.u64.t301, i15.t133, i15.t126, i15.t117, i15.t113, i15.t110, i15.t108, i15.t106, i15.t104, i15.t101, i15.t73, i15.t70, i15.t67, i15.t65, i15.t62, i15.t59, i15.t57, i15.t55, i15.t53, i15.t50, i15.t47, i15.t37, i15.t34, i15.t31, i15.t28, i15.t25, i15.t22, i15.t20, i15.t17, i15.t14, i15.u165.t12, i15.u165.t44, i15.u165.t84, i15.u165.t88, i15.u165.t92, i15.u165.t98, i15.u165.t121, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/343/140/519
(forward)formula 3,0,73.8536,1287984,1,0,2.43818e+06,1405,10367,5.439e+06,472,4818,4220977
FORMULA BusinessProcesses-PT-12-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EF((i14.u63.p166==1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (i14.u63.p166==1))] != FALSE
(forward)formula 4,1,73.8558,1288512,1,0,2.43818e+06,1405,10368,5.43907e+06,472,4818,4221492
FORMULA BusinessProcesses-PT-12-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (!(AG((i15.u206.p519==1))) * (AG((((i7.i0.i1.u89.p235!=1)||(i12.u120.p313!=1))||(i15.u165.p547!=1))) + !(EF((i7.i1.i0.u84.p224==1)))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !((i15.u206.p519==1)))))] = FALSE * [(FwdU((Init * !(!(E(TRUE U !((((i7.i0.i1.u89.p235!=1)||(i12.u120.p313!=1))||(i15.u165.p547!=1))))))),TRUE) * (i7.i1.i0.u84.p224==1))] = FALSE)
(forward)formula 5,0,74.7148,1308840,1,0,2.48398e+06,1423,10385,5.50414e+06,474,4836,4307177
FORMULA BusinessProcesses-PT-12-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AF((i3.u22.p51==1))
=> equivalent forward existential formula: [FwdG(Init,!((i3.u22.p51==1)))] = FALSE
(forward)formula 6,0,81.8971,1471728,1,0,2.81098e+06,1429,10398,5.92954e+06,474,4890,4852482
FORMULA BusinessProcesses-PT-12-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: (A(((((i11.u28.p93!=1)||(i11.u116.p304!=1))||(i11.u220.p552!=1))&&(i15.u204.p515!=1)) U EG((i11.u43.p110==1))) + EF((AX((i11.u227.p566==1)) + AX((i11.u33.p79==1)))))
=> equivalent forward existential formula: ([((Init * !(EG(!(EG((i11.u43.p110==1)))))) * !(E(!(EG((i11.u43.p110==1))) U (!(((((i11.u28.p93!=1)||(i11.u116.p304!=1))||(i11.u220.p552!=1))&&(i15.u204.p515!=1))) * !(EG((i11.u43.p110==1)))))))] != FALSE + ([(FwdU(Init,TRUE) * !(EX(!((i11.u227.p566==1)))))] != FALSE + [(FwdU(Init,TRUE) * !(EX(!((i11.u33.p79==1)))))] != FALSE))
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 7,1,1131.64,3115024,1,0,3.80294e+06,1561,2607,1.93729e+07,187,5146,2653362
FORMULA BusinessProcesses-PT-12-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: E((((i9.u14.p33!=1)||(i9.u110.p288!=1))||(i15.u165.p547!=1)) U EG((((i5.u73.p191==1)&&(i5.u143.p374==1))&&(i5.u205.p517==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,(((i9.u14.p33!=1)||(i9.u110.p288!=1))||(i15.u165.p547!=1))),(((i5.u73.p191==1)&&(i5.u143.p374==1))&&(i5.u205.p517==1)))] != FALSE
(forward)formula 8,0,1137.72,3115024,1,0,3.80294e+06,1561,4997,1.93729e+07,247,5146,3864835
FORMULA BusinessProcesses-PT-12-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EF((((i11.u115.p301==1)||((i1.u52.p135==1)&&(i1.u125.p326==1)))||(((i7.i1.i0.u82.p218==1)&&(i7.i0.i3.u157.p408==1))&&(i15.u165.p547==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (((i11.u115.p301==1)||((i1.u52.p135==1)&&(i1.u125.p326==1)))||(((i7.i1.i0.u82.p218==1)&&(i7.i0.i3.u157.p408==1))&&(i15.u165.p547==1))))] != FALSE
(forward)formula 9,1,1137.74,3115024,1,0,3.80294e+06,1561,5027,1.93729e+07,248,5146,3869313
FORMULA BusinessProcesses-PT-12-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (AX(((i7.i0.i0.u91.p239!=1)&&(i13.u134.p346==1))) + EF(((i8.u149.p390==1)&&(i0.u75.p199==1))))
=> equivalent forward existential formula: [(EY((Init * !(E(TRUE U ((i8.u149.p390==1)&&(i0.u75.p199==1)))))) * !(((i7.i0.i0.u91.p239!=1)&&(i13.u134.p346==1))))] = FALSE
(forward)formula 10,1,1139.38,3115024,1,0,3.80294e+06,1561,6253,1.93729e+07,274,5146,4052274
FORMULA BusinessProcesses-PT-12-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EF(((i7.i1.i0.u216.p540==1)||(i15.u165.p430==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((i7.i1.i0.u216.p540==1)||(i15.u165.p430==1)))] != FALSE
(forward)formula 11,1,1139.46,3115024,1,0,3.80294e+06,1561,6259,1.93729e+07,274,5146,4056816
FORMULA BusinessProcesses-PT-12-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
BK_STOP 1589254887275
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-12"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-12, 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 r021-oct2-158897699200540"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-12.tgz
mv BusinessProcesses-PT-12 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 '
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 ;