About the Execution of ITS-Tools for BusinessProcesses-PT-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15744.960 | 238354.00 | 405509.00 | 315.60 | FFTFTFFFFFFFFFFT | 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-158897699100482.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-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699100482
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 3.5K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 22:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.4K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K 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-05-00
FORMULA_NAME BusinessProcesses-PT-05-01
FORMULA_NAME BusinessProcesses-PT-05-02
FORMULA_NAME BusinessProcesses-PT-05-03
FORMULA_NAME BusinessProcesses-PT-05-04
FORMULA_NAME BusinessProcesses-PT-05-05
FORMULA_NAME BusinessProcesses-PT-05-06
FORMULA_NAME BusinessProcesses-PT-05-07
FORMULA_NAME BusinessProcesses-PT-05-08
FORMULA_NAME BusinessProcesses-PT-05-09
FORMULA_NAME BusinessProcesses-PT-05-10
FORMULA_NAME BusinessProcesses-PT-05-11
FORMULA_NAME BusinessProcesses-PT-05-12
FORMULA_NAME BusinessProcesses-PT-05-13
FORMULA_NAME BusinessProcesses-PT-05-14
FORMULA_NAME BusinessProcesses-PT-05-15
=== Now, execution of the tool begins
BK_START 1589250677956
[2020-05-12 02:31:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-12 02:31:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:31:21] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2020-05-12 02:31:21] [INFO ] Transformed 368 places.
[2020-05-12 02:31:21] [INFO ] Transformed 319 transitions.
[2020-05-12 02:31:21] [INFO ] Found NUPN structural information;
[2020-05-12 02:31:21] [INFO ] Parsed PT model containing 368 places and 319 transitions in 121 ms.
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 944 resets, run finished after 375 ms. (steps per millisecond=266 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 318 rows 367 cols
[2020-05-12 02:31:21] [INFO ] Computed 57 place invariants in 25 ms
[2020-05-12 02:31:22] [INFO ] [Real]Absence check using 41 positive place invariants in 685 ms returned sat
[2020-05-12 02:31:22] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 18 ms returned sat
[2020-05-12 02:31:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:31:24] [INFO ] [Real]Absence check using state equation in 1355 ms returned sat
[2020-05-12 02:31:24] [INFO ] Deduced a trap composed of 16 places in 496 ms
[2020-05-12 02:31:25] [INFO ] Deduced a trap composed of 8 places in 132 ms
[2020-05-12 02:31:25] [INFO ] Deduced a trap composed of 18 places in 172 ms
[2020-05-12 02:31:25] [INFO ] Deduced a trap composed of 23 places in 643 ms
[2020-05-12 02:31:26] [INFO ] Deduced a trap composed of 15 places in 86 ms
[2020-05-12 02:31:26] [INFO ] Deduced a trap composed of 32 places in 138 ms
[2020-05-12 02:31:26] [INFO ] Deduced a trap composed of 91 places in 96 ms
[2020-05-12 02:31:26] [INFO ] Deduced a trap composed of 31 places in 115 ms
[2020-05-12 02:31:26] [INFO ] Deduced a trap composed of 30 places in 157 ms
[2020-05-12 02:31:29] [INFO ] Deduced a trap composed of 19 places in 2517 ms
[2020-05-12 02:31:30] [INFO ] Deduced a trap composed of 31 places in 1326 ms
[2020-05-12 02:31:35] [INFO ] Deduced a trap composed of 88 places in 4470 ms
[2020-05-12 02:31:35] [INFO ] Deduced a trap composed of 83 places in 745 ms
[2020-05-12 02:31:36] [INFO ] Deduced a trap composed of 15 places in 1124 ms
[2020-05-12 02:31:37] [INFO ] Deduced a trap composed of 13 places in 92 ms
[2020-05-12 02:31:37] [INFO ] Deduced a trap composed of 14 places in 61 ms
[2020-05-12 02:31:37] [INFO ] Deduced a trap composed of 26 places in 108 ms
[2020-05-12 02:31:38] [INFO ] Deduced a trap composed of 22 places in 1299 ms
[2020-05-12 02:31:39] [INFO ] Deduced a trap composed of 32 places in 850 ms
[2020-05-12 02:31:41] [INFO ] Deduced a trap composed of 18 places in 2354 ms
[2020-05-12 02:31:41] [INFO ] Deduced a trap composed of 23 places in 132 ms
[2020-05-12 02:31:41] [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 s73 s74 s75 s95 s96 s135 s207 s208 s209 s218 s223 s257 s258 s259 s261 s263 s264 s265 s313 s314 s319) 0)") while checking expression at index 0
[2020-05-12 02:31:42] [INFO ] [Real]Absence check using 41 positive place invariants in 37 ms returned sat
[2020-05-12 02:31:42] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 9 ms returned sat
[2020-05-12 02:31:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:31:42] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2020-05-12 02:31:43] [INFO ] Deduced a trap composed of 9 places in 586 ms
[2020-05-12 02:31:44] [INFO ] Deduced a trap composed of 17 places in 1086 ms
[2020-05-12 02:31:44] [INFO ] Deduced a trap composed of 21 places in 186 ms
[2020-05-12 02:31:44] [INFO ] Deduced a trap composed of 15 places in 192 ms
[2020-05-12 02:31:44] [INFO ] Deduced a trap composed of 27 places in 304 ms
[2020-05-12 02:31:45] [INFO ] Deduced a trap composed of 89 places in 99 ms
[2020-05-12 02:31:45] [INFO ] Deduced a trap composed of 19 places in 71 ms
[2020-05-12 02:31:45] [INFO ] Deduced a trap composed of 30 places in 348 ms
[2020-05-12 02:31:45] [INFO ] Deduced a trap composed of 11 places in 132 ms
[2020-05-12 02:31:46] [INFO ] Deduced a trap composed of 26 places in 573 ms
[2020-05-12 02:31:46] [INFO ] Deduced a trap composed of 18 places in 229 ms
[2020-05-12 02:31:46] [INFO ] Deduced a trap composed of 35 places in 213 ms
[2020-05-12 02:31:46] [INFO ] Deduced a trap composed of 25 places in 109 ms
[2020-05-12 02:31:47] [INFO ] Deduced a trap composed of 28 places in 240 ms
[2020-05-12 02:31:47] [INFO ] Deduced a trap composed of 31 places in 102 ms
[2020-05-12 02:31:47] [INFO ] Deduced a trap composed of 15 places in 192 ms
[2020-05-12 02:31:47] [INFO ] Deduced a trap composed of 21 places in 153 ms
[2020-05-12 02:31:47] [INFO ] Deduced a trap composed of 25 places in 104 ms
[2020-05-12 02:31:47] [INFO ] Deduced a trap composed of 94 places in 76 ms
[2020-05-12 02:31:47] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 5452 ms
[2020-05-12 02:31:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:31:48] [INFO ] [Nat]Absence check using 41 positive place invariants in 59 ms returned sat
[2020-05-12 02:31:48] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 106 ms returned sat
[2020-05-12 02:31:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:31:49] [INFO ] [Nat]Absence check using state equation in 1686 ms returned sat
[2020-05-12 02:31:51] [INFO ] Deduced a trap composed of 9 places in 1468 ms
[2020-05-12 02:31:51] [INFO ] Deduced a trap composed of 20 places in 191 ms
[2020-05-12 02:31:51] [INFO ] Deduced a trap composed of 18 places in 86 ms
[2020-05-12 02:31:51] [INFO ] Deduced a trap composed of 29 places in 221 ms
[2020-05-12 02:31:52] [INFO ] Deduced a trap composed of 29 places in 157 ms
[2020-05-12 02:31:57] [INFO ] Deduced a trap composed of 21 places in 5700 ms
[2020-05-12 02:31:57] [INFO ] Deduced a trap composed of 15 places in 81 ms
[2020-05-12 02:31:58] [INFO ] Deduced a trap composed of 12 places in 127 ms
[2020-05-12 02:31:58] [INFO ] Deduced a trap composed of 15 places in 182 ms
[2020-05-12 02:31:58] [INFO ] Deduced a trap composed of 91 places in 127 ms
[2020-05-12 02:31:58] [INFO ] Deduced a trap composed of 92 places in 379 ms
[2020-05-12 02:31:58] [INFO ] Deduced a trap composed of 95 places in 84 ms
[2020-05-12 02:31:59] [INFO ] Deduced a trap composed of 35 places in 135 ms
[2020-05-12 02:31:59] [INFO ] Deduced a trap composed of 50 places in 168 ms
[2020-05-12 02:31:59] [INFO ] Deduced a trap composed of 92 places in 632 ms
[2020-05-12 02:32:00] [INFO ] Deduced a trap composed of 19 places in 112 ms
[2020-05-12 02:32:00] [INFO ] Deduced a trap composed of 37 places in 149 ms
[2020-05-12 02:32:00] [INFO ] Deduced a trap composed of 22 places in 110 ms
[2020-05-12 02:32:00] [INFO ] Deduced a trap composed of 96 places in 153 ms
[2020-05-12 02:32:00] [INFO ] Deduced a trap composed of 43 places in 200 ms
[2020-05-12 02:32:00] [INFO ] Deduced a trap composed of 94 places in 142 ms
[2020-05-12 02:32:01] [INFO ] Deduced a trap composed of 28 places in 120 ms
[2020-05-12 02:32:01] [INFO ] Deduced a trap composed of 93 places in 153 ms
[2020-05-12 02:32:01] [INFO ] Deduced a trap composed of 20 places in 136 ms
[2020-05-12 02:32:01] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 11580 ms
[2020-05-12 02:32:01] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 76 ms.
[2020-05-12 02:32:03] [INFO ] Added : 236 causal constraints over 48 iterations in 2059 ms. Result :sat
[2020-05-12 02:32:06] [INFO ] Deduced a trap composed of 94 places in 3411 ms
[2020-05-12 02:32:11] [INFO ] Deduced a trap composed of 92 places in 4009 ms
[2020-05-12 02:32:11] [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 s25 s28 s29 s39 s42 s43 s60 s61 s62 s63 s68 s69 s88 s89 s100 s101 s102 s106 s107 s108 s118 s119 s120 s131 s134 s163 s173 s193 s203 s213 s217 s218 s219 s223 s227 s228 s229 s233 s238 s243 s248 s253 s258 s263 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278 s279 s280 s285 s286 s287 s288 s289 s290 s291 s292 s293 s298 s299 s300 s301 s302 s303 s304 s305 s306 s309 s310 s330 s331 s342 s343 s354 s355 s360 s361 s362 s363 s366) 0)") while checking expression at index 1
[2020-05-12 02:32:11] [INFO ] [Real]Absence check using 41 positive place invariants in 161 ms returned sat
[2020-05-12 02:32:11] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 57 ms returned sat
[2020-05-12 02:32:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:32:12] [INFO ] [Real]Absence check using state equation in 1570 ms returned sat
[2020-05-12 02:32:16] [INFO ] Deduced a trap composed of 16 places in 3273 ms
[2020-05-12 02:32:16] [INFO ] Deduced a trap composed of 19 places in 201 ms
[2020-05-12 02:32:16] [INFO ] Deduced a trap composed of 18 places in 186 ms
[2020-05-12 02:32:17] [INFO ] Deduced a trap composed of 21 places in 330 ms
[2020-05-12 02:32:20] [INFO ] Deduced a trap composed of 86 places in 2971 ms
[2020-05-12 02:32:23] [INFO ] Deduced a trap composed of 8 places in 3311 ms
[2020-05-12 02:32:23] [INFO ] Deduced a trap composed of 15 places in 199 ms
[2020-05-12 02:32:23] [INFO ] Deduced a trap composed of 25 places in 192 ms
[2020-05-12 02:32:24] [INFO ] Deduced a trap composed of 85 places in 221 ms
[2020-05-12 02:32:24] [INFO ] Deduced a trap composed of 30 places in 121 ms
[2020-05-12 02:32:24] [INFO ] Deduced a trap composed of 91 places in 175 ms
[2020-05-12 02:32:24] [INFO ] Deduced a trap composed of 90 places in 167 ms
[2020-05-12 02:32:24] [INFO ] Deduced a trap composed of 90 places in 208 ms
[2020-05-12 02:32:25] [INFO ] Deduced a trap composed of 20 places in 499 ms
[2020-05-12 02:32:25] [INFO ] Deduced a trap composed of 15 places in 161 ms
[2020-05-12 02:32:25] [INFO ] Deduced a trap composed of 31 places in 129 ms
[2020-05-12 02:32:27] [INFO ] Deduced a trap composed of 38 places in 1686 ms
[2020-05-12 02:32:27] [INFO ] Deduced a trap composed of 36 places in 538 ms
[2020-05-12 02:32:28] [INFO ] Deduced a trap composed of 25 places in 832 ms
[2020-05-12 02:32:28] [INFO ] Deduced a trap composed of 32 places in 173 ms
[2020-05-12 02:32:30] [INFO ] Deduced a trap composed of 96 places in 1488 ms
[2020-05-12 02:32:30] [INFO ] Deduced a trap composed of 24 places in 81 ms
[2020-05-12 02:32:30] [INFO ] Deduced a trap composed of 29 places in 96 ms
[2020-05-12 02:32:30] [INFO ] Deduced a trap composed of 35 places in 84 ms
[2020-05-12 02:32:30] [INFO ] Deduced a trap composed of 37 places in 111 ms
[2020-05-12 02:32:31] [INFO ] Deduced a trap composed of 88 places in 83 ms
[2020-05-12 02:32:31] [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 s37 s38 s47 s48 s51 s52 s56 s57 s58 s62 s63 s64 s65 s68 s69 s112 s113 s114 s118 s119 s120 s121 s162 s163 s164 s167 s168 s169 s173 s178 s183 s188 s213 s223 s228 s233 s237 s238 s239 s243 s248 s253 s258 s263 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278 s279 s280 s285 s286 s298 s299 s302 s303 s307 s308 s317 s318 s322 s323 s324 s325 s330 s331 s336 s337 s342 s343 s350 s351 s362 s363 s366) 0)") while checking expression at index 2
[2020-05-12 02:32:31] [INFO ] [Real]Absence check using 41 positive place invariants in 246 ms returned sat
[2020-05-12 02:32:31] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 69 ms returned sat
[2020-05-12 02:32:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:32:31] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2020-05-12 02:32:32] [INFO ] Deduced a trap composed of 16 places in 246 ms
[2020-05-12 02:32:32] [INFO ] Deduced a trap composed of 19 places in 95 ms
[2020-05-12 02:32:34] [INFO ] Deduced a trap composed of 8 places in 1905 ms
[2020-05-12 02:32:35] [INFO ] Deduced a trap composed of 19 places in 1522 ms
[2020-05-12 02:32:35] [INFO ] Deduced a trap composed of 17 places in 106 ms
[2020-05-12 02:32:36] [INFO ] Deduced a trap composed of 23 places in 109 ms
[2020-05-12 02:32:36] [INFO ] Deduced a trap composed of 18 places in 114 ms
[2020-05-12 02:32:36] [INFO ] Deduced a trap composed of 22 places in 99 ms
[2020-05-12 02:32:36] [INFO ] Deduced a trap composed of 15 places in 103 ms
[2020-05-12 02:32:36] [INFO ] Deduced a trap composed of 19 places in 290 ms
[2020-05-12 02:32:39] [INFO ] Deduced a trap composed of 18 places in 3015 ms
[2020-05-12 02:32:39] [INFO ] Deduced a trap composed of 22 places in 85 ms
[2020-05-12 02:32:40] [INFO ] Deduced a trap composed of 28 places in 98 ms
[2020-05-12 02:32:40] [INFO ] Deduced a trap composed of 25 places in 98 ms
[2020-05-12 02:32:40] [INFO ] Deduced a trap composed of 25 places in 94 ms
[2020-05-12 02:32:40] [INFO ] Deduced a trap composed of 94 places in 99 ms
[2020-05-12 02:32:40] [INFO ] Deduced a trap composed of 95 places in 105 ms
[2020-05-12 02:32:40] [INFO ] Deduced a trap composed of 92 places in 94 ms
[2020-05-12 02:32:40] [INFO ] Deduced a trap composed of 91 places in 114 ms
[2020-05-12 02:32:40] [INFO ] Deduced a trap composed of 90 places in 102 ms
[2020-05-12 02:32:40] [INFO ] Deduced a trap composed of 93 places in 92 ms
[2020-05-12 02:32:41] [INFO ] Deduced a trap composed of 22 places in 106 ms
[2020-05-12 02:32:41] [INFO ] Deduced a trap composed of 94 places in 104 ms
[2020-05-12 02:32:41] [INFO ] Deduced a trap composed of 99 places in 92 ms
[2020-05-12 02:32:41] [INFO ] Deduced a trap composed of 91 places in 110 ms
[2020-05-12 02:32:41] [INFO ] Deduced a trap composed of 100 places in 113 ms
[2020-05-12 02:32:41] [INFO ] Deduced a trap composed of 93 places in 176 ms
[2020-05-12 02:32:46] [INFO ] Deduced a trap composed of 96 places in 4267 ms
[2020-05-12 02:32:46] [INFO ] Deduced a trap composed of 20 places in 95 ms
[2020-05-12 02:32:46] [INFO ] Deduced a trap composed of 101 places in 283 ms
[2020-05-12 02:32:48] [INFO ] Deduced a trap composed of 94 places in 2310 ms
[2020-05-12 02:32:51] [INFO ] Deduced a trap composed of 92 places in 2300 ms
[2020-05-12 02:32:51] [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 s30 s31 s56 s57 s58 s64 s65 s68 s81 s82 s95 s96 s112 s113 s114 s131 s134 s167 s168 s169 s172 s173 s174 s178 s183 s198 s208 s222 s224 s228 s237 s239 s243 s248 s253 s258 s263 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s281 s282 s287 s288 s291 s292 s293 s298 s299 s300 s301 s304 s305 s306 s307 s308 s317 s318 s319 s320 s321 s324 s325 s326 s327 s328 s329 s336 s337 s338 s339 s350 s351 s358 s359 s360 s361 s362 s363 s364 s365 s366) 0)") while checking expression at index 3
[2020-05-12 02:32:51] [INFO ] [Real]Absence check using 41 positive place invariants in 38 ms returned sat
[2020-05-12 02:32:51] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 9 ms returned sat
[2020-05-12 02:32:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:32:51] [INFO ] [Real]Absence check using state equation in 646 ms returned sat
[2020-05-12 02:32:52] [INFO ] Deduced a trap composed of 8 places in 693 ms
[2020-05-12 02:32:52] [INFO ] Deduced a trap composed of 26 places in 109 ms
[2020-05-12 02:32:53] [INFO ] Deduced a trap composed of 22 places in 608 ms
[2020-05-12 02:32:53] [INFO ] Deduced a trap composed of 30 places in 474 ms
[2020-05-12 02:32:54] [INFO ] Deduced a trap composed of 23 places in 58 ms
[2020-05-12 02:32:55] [INFO ] Deduced a trap composed of 36 places in 1371 ms
[2020-05-12 02:32:55] [INFO ] Deduced a trap composed of 32 places in 71 ms
[2020-05-12 02:32:55] [INFO ] Deduced a trap composed of 39 places in 135 ms
[2020-05-12 02:32:55] [INFO ] Deduced a trap composed of 32 places in 112 ms
[2020-05-12 02:32:55] [INFO ] Deduced a trap composed of 15 places in 69 ms
[2020-05-12 02:32:56] [INFO ] Deduced a trap composed of 53 places in 590 ms
[2020-05-12 02:32:56] [INFO ] Deduced a trap composed of 56 places in 78 ms
[2020-05-12 02:32:56] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4660 ms
[2020-05-12 02:32:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:32:56] [INFO ] [Nat]Absence check using 41 positive place invariants in 201 ms returned sat
[2020-05-12 02:32:56] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 56 ms returned sat
[2020-05-12 02:32:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:32:59] [INFO ] [Nat]Absence check using state equation in 2018 ms returned sat
[2020-05-12 02:32:59] [INFO ] Deduced a trap composed of 21 places in 64 ms
[2020-05-12 02:33:00] [INFO ] Deduced a trap composed of 18 places in 1659 ms
[2020-05-12 02:33:00] [INFO ] Deduced a trap composed of 8 places in 154 ms
[2020-05-12 02:33:01] [INFO ] Deduced a trap composed of 31 places in 159 ms
[2020-05-12 02:33:01] [INFO ] Deduced a trap composed of 34 places in 127 ms
[2020-05-12 02:33:03] [INFO ] Deduced a trap composed of 25 places in 1694 ms
[2020-05-12 02:33:03] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4051 ms
[2020-05-12 02:33:03] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 17 ms.
[2020-05-12 02:33:04] [INFO ] Added : 185 causal constraints over 38 iterations in 1822 ms. Result :sat
[2020-05-12 02:33:05] [INFO ] [Real]Absence check using 41 positive place invariants in 177 ms returned sat
[2020-05-12 02:33:05] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 91 ms returned sat
[2020-05-12 02:33:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:33:06] [INFO ] [Real]Absence check using state equation in 1287 ms returned sat
[2020-05-12 02:33:06] [INFO ] Deduced a trap composed of 86 places in 240 ms
[2020-05-12 02:33:06] [INFO ] Deduced a trap composed of 9 places in 199 ms
[2020-05-12 02:33:07] [INFO ] Deduced a trap composed of 11 places in 175 ms
[2020-05-12 02:33:07] [INFO ] Deduced a trap composed of 12 places in 604 ms
[2020-05-12 02:33:07] [INFO ] Deduced a trap composed of 13 places in 171 ms
[2020-05-12 02:33:08] [INFO ] Deduced a trap composed of 18 places in 124 ms
[2020-05-12 02:33:08] [INFO ] Deduced a trap composed of 15 places in 122 ms
[2020-05-12 02:33:08] [INFO ] Deduced a trap composed of 17 places in 116 ms
[2020-05-12 02:33:09] [INFO ] Deduced a trap composed of 15 places in 921 ms
[2020-05-12 02:33:09] [INFO ] Deduced a trap composed of 24 places in 83 ms
[2020-05-12 02:33:09] [INFO ] Deduced a trap composed of 41 places in 100 ms
[2020-05-12 02:33:09] [INFO ] Deduced a trap composed of 39 places in 64 ms
[2020-05-12 02:33:09] [INFO ] Deduced a trap composed of 37 places in 74 ms
[2020-05-12 02:33:12] [INFO ] Deduced a trap composed of 45 places in 2289 ms
[2020-05-12 02:33:12] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 5590 ms
[2020-05-12 02:33:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:33:12] [INFO ] [Nat]Absence check using 41 positive place invariants in 107 ms returned sat
[2020-05-12 02:33:12] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2020-05-12 02:33:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:33:12] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2020-05-12 02:33:13] [INFO ] Deduced a trap composed of 13 places in 316 ms
[2020-05-12 02:33:13] [INFO ] Deduced a trap composed of 8 places in 107 ms
[2020-05-12 02:33:14] [INFO ] Deduced a trap composed of 11 places in 1714 ms
[2020-05-12 02:33:15] [INFO ] Deduced a trap composed of 17 places in 287 ms
[2020-05-12 02:33:16] [INFO ] Deduced a trap composed of 18 places in 1621 ms
[2020-05-12 02:33:18] [INFO ] Deduced a trap composed of 18 places in 1869 ms
[2020-05-12 02:33:18] [INFO ] Deduced a trap composed of 16 places in 68 ms
[2020-05-12 02:33:18] [INFO ] Deduced a trap composed of 19 places in 106 ms
[2020-05-12 02:33:19] [INFO ] Deduced a trap composed of 18 places in 211 ms
[2020-05-12 02:33:19] [INFO ] Deduced a trap composed of 21 places in 377 ms
[2020-05-12 02:33:20] [INFO ] Deduced a trap composed of 21 places in 577 ms
[2020-05-12 02:33:20] [INFO ] Deduced a trap composed of 25 places in 95 ms
[2020-05-12 02:33:20] [INFO ] Deduced a trap composed of 58 places in 76 ms
[2020-05-12 02:33:20] [INFO ] Deduced a trap composed of 39 places in 125 ms
[2020-05-12 02:33:20] [INFO ] Deduced a trap composed of 30 places in 103 ms
[2020-05-12 02:33:20] [INFO ] Deduced a trap composed of 22 places in 77 ms
[2020-05-12 02:33:20] [INFO ] Deduced a trap composed of 32 places in 59 ms
[2020-05-12 02:33:20] [INFO ] Deduced a trap composed of 46 places in 60 ms
[2020-05-12 02:33:20] [INFO ] Deduced a trap composed of 40 places in 57 ms
[2020-05-12 02:33:20] [INFO ] Deduced a trap composed of 14 places in 42 ms
[2020-05-12 02:33:21] [INFO ] Deduced a trap composed of 27 places in 44 ms
[2020-05-12 02:33:21] [INFO ] Deduced a trap composed of 26 places in 46 ms
[2020-05-12 02:33:21] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 8404 ms
[2020-05-12 02:33:21] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 13 ms.
[2020-05-12 02:33:23] [INFO ] Added : 209 causal constraints over 43 iterations in 2113 ms. Result :sat
[2020-05-12 02:33:23] [INFO ] [Real]Absence check using 41 positive place invariants in 235 ms returned sat
[2020-05-12 02:33:23] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 105 ms returned sat
[2020-05-12 02:33:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:33:24] [INFO ] [Real]Absence check using state equation in 826 ms returned sat
[2020-05-12 02:33:24] [INFO ] Deduced a trap composed of 13 places in 83 ms
[2020-05-12 02:33:24] [INFO ] Deduced a trap composed of 8 places in 74 ms
[2020-05-12 02:33:24] [INFO ] Deduced a trap composed of 10 places in 208 ms
[2020-05-12 02:33:25] [INFO ] Deduced a trap composed of 18 places in 655 ms
[2020-05-12 02:33:25] [INFO ] Deduced a trap composed of 26 places in 144 ms
[2020-05-12 02:33:25] [INFO ] Deduced a trap composed of 21 places in 132 ms
[2020-05-12 02:33:26] [INFO ] Deduced a trap composed of 16 places in 396 ms
[2020-05-12 02:33:26] [INFO ] Deduced a trap composed of 19 places in 255 ms
[2020-05-12 02:33:26] [INFO ] Deduced a trap composed of 20 places in 108 ms
[2020-05-12 02:33:26] [INFO ] Deduced a trap composed of 18 places in 91 ms
[2020-05-12 02:33:26] [INFO ] Deduced a trap composed of 21 places in 147 ms
[2020-05-12 02:33:27] [INFO ] Deduced a trap composed of 25 places in 122 ms
[2020-05-12 02:33:27] [INFO ] Deduced a trap composed of 27 places in 129 ms
[2020-05-12 02:33:27] [INFO ] Deduced a trap composed of 34 places in 284 ms
[2020-05-12 02:33:27] [INFO ] Deduced a trap composed of 30 places in 126 ms
[2020-05-12 02:33:29] [INFO ] Deduced a trap composed of 27 places in 1332 ms
[2020-05-12 02:33:29] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4626 ms
[2020-05-12 02:33:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:33:29] [INFO ] [Nat]Absence check using 41 positive place invariants in 68 ms returned sat
[2020-05-12 02:33:29] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 7 ms returned sat
[2020-05-12 02:33:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:33:29] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2020-05-12 02:33:29] [INFO ] Deduced a trap composed of 9 places in 207 ms
[2020-05-12 02:33:30] [INFO ] Deduced a trap composed of 8 places in 961 ms
[2020-05-12 02:33:30] [INFO ] Deduced a trap composed of 18 places in 195 ms
[2020-05-12 02:33:31] [INFO ] Deduced a trap composed of 13 places in 163 ms
[2020-05-12 02:33:34] [INFO ] Deduced a trap composed of 30 places in 3201 ms
[2020-05-12 02:33:34] [INFO ] Deduced a trap composed of 17 places in 137 ms
[2020-05-12 02:33:36] [INFO ] Deduced a trap composed of 20 places in 1647 ms
[2020-05-12 02:33:36] [INFO ] Deduced a trap composed of 14 places in 775 ms
[2020-05-12 02:33:37] [INFO ] Deduced a trap composed of 31 places in 139 ms
[2020-05-12 02:33:37] [INFO ] Deduced a trap composed of 18 places in 121 ms
[2020-05-12 02:33:37] [INFO ] Deduced a trap composed of 16 places in 121 ms
[2020-05-12 02:33:39] [INFO ] Deduced a trap composed of 31 places in 1771 ms
[2020-05-12 02:33:40] [INFO ] Deduced a trap composed of 25 places in 1267 ms
[2020-05-12 02:33:41] [INFO ] Deduced a trap composed of 36 places in 640 ms
[2020-05-12 02:33:41] [INFO ] Deduced a trap composed of 32 places in 100 ms
[2020-05-12 02:33:42] [INFO ] Deduced a trap composed of 23 places in 832 ms
[2020-05-12 02:33:43] [INFO ] Deduced a trap composed of 35 places in 1012 ms
[2020-05-12 02:33:44] [INFO ] Deduced a trap composed of 21 places in 1101 ms
[2020-05-12 02:33:44] [INFO ] Deduced a trap composed of 17 places in 40 ms
[2020-05-12 02:33:44] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 14804 ms
[2020-05-12 02:33:44] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 19 ms.
[2020-05-12 02:33:45] [INFO ] Added : 205 causal constraints over 42 iterations in 1430 ms. Result :sat
[2020-05-12 02:33:45] [INFO ] [Real]Absence check using 41 positive place invariants in 32 ms returned sat
[2020-05-12 02:33:45] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 9 ms returned sat
[2020-05-12 02:33:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:33:47] [INFO ] [Real]Absence check using state equation in 1136 ms returned sat
[2020-05-12 02:33:48] [INFO ] Deduced a trap composed of 21 places in 1155 ms
[2020-05-12 02:33:48] [INFO ] Deduced a trap composed of 17 places in 233 ms
[2020-05-12 02:33:48] [INFO ] Deduced a trap composed of 8 places in 120 ms
[2020-05-12 02:33:51] [INFO ] Deduced a trap composed of 43 places in 3307 ms
[2020-05-12 02:33:55] [INFO ] Deduced a trap composed of 19 places in 3777 ms
[2020-05-12 02:33:58] [INFO ] Deduced a trap composed of 89 places in 2758 ms
[2020-05-12 02:34:01] [INFO ] Deduced a trap composed of 18 places in 2862 ms
[2020-05-12 02:34:01] [INFO ] Deduced a trap composed of 35 places in 170 ms
[2020-05-12 02:34:05] [INFO ] Deduced a trap composed of 39 places in 3839 ms
[2020-05-12 02:34:05] [INFO ] Deduced a trap composed of 35 places in 190 ms
[2020-05-12 02:34:07] [INFO ] Deduced a trap composed of 28 places in 1365 ms
[2020-05-12 02:34:07] [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 s88 s89 s112 s113 s114 s135 s222 s223 s224 s227 s228 s229 s242 s243 s244 s248 s253 s258 s261 s263 s264 s265 s342 s343 s350 s351) 0)") while checking expression at index 7
[2020-05-12 02:34:07] [INFO ] [Real]Absence check using 41 positive place invariants in 270 ms returned sat
[2020-05-12 02:34:07] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 55 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-12 02:34:07] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-12 02:34:07] [INFO ] Flatten gal took : 117 ms
FORMULA BusinessProcesses-PT-05-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 02:34:07] [INFO ] Flatten gal took : 48 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-12 02:34:08] [INFO ] Applying decomposition
[2020-05-12 02:34:08] [INFO ] Flatten gal took : 28 ms
[2020-05-12 02:34:08] [INFO ] Input system was already deterministic with 318 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 318 rows 367 cols
[2020-05-12 02:34:08] [INFO ] Computed 57 place invariants in 5 ms
inv : p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p59 + p66 + p67 - p266 - p267 - p268 - p269 - p270 - p271 - p273 - p274 - p275 - p276 - p277 - p278 - p279 - p280 - p281 - p282 - p283 - p284 - p285 - p286 - p287 - p288 - p289 - p290 - p291 - p292 - p293 - p294 - p295 - p296 - p297 - p298 - p299 - p300 - p301 - p302 - p303 - p304 - p305 - p306 - p307 - p308 - p309 - p310 - p311 - p318 - p319 - p323 - p324 - p325 - p326 - p327 - p328 - p329 - p330 - p331 - p332 - p333 - p334 - p335 - p336 - p337 - p338 - p339 - p340 - p341 - p342 - p343 - p344 - p345 - p346 - p347 - p348 - p349 - p350 - p351 - p352 - p353 - p354 - p355 - p356 - p357 - p358 - p359 - p360 - p361 - p362 - p363 - p364 - p365 - p366 - p367 = 0
inv : p0 + p1 + p2 + p3 + p127 + p128 + p129 + p130 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p25 + p26 + p27 + p28 + p29 + p286 + p287 = 1
inv : p118 + p119 + p120 - p359 - p360 = 0
inv : p100 + p101 + p102 - p347 - p348 = 0
inv : p30 + p31 - p286 - p287 = 0
inv : p0 + p1 + p135 + p136 + p137 + p138 + p139 + p140 + p236 + p237 + p238 + p239 + p240 = 1
inv : p0 + p1 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p161 + p162 + p163 + p164 + p165 = 1
inv : p0 + p1 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p186 + p187 + p188 + p189 + p190 = 1
inv : p0 + p1 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p211 + p212 + p213 + p214 + p215 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p70 + p71 + p72 + p325 + p326 = 1
inv : p47 + p48 + p51 + p52 - p301 - p302 - p305 - p306 - p307 = 0
inv : p106 + p107 + p108 - p351 - p352 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p32 + p35 + p36 + p288 + p289 + p292 + p293 + p294 = 1
inv : p0 + p1 + p2 + p131 + p132 + p133 + p134 = 1
inv : p44 + p45 - p299 - p300 = 0
inv : p0 + p1 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p226 + p227 + p228 + p229 + p230 = 1
inv : p81 + p82 - p331 - p332 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p46 + p49 + p50 + p301 + p302 + p305 + p306 + p307 = 1
inv : p0 + p1 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p166 + p167 + p168 + p169 + p170 = 1
inv : p88 + p89 - p337 - p338 = 0
inv : p95 + p96 - p343 - p344 = 0
inv : p0 + p1 + p2 + p3 + p4 + p121 + p122 + p123 + p363 + p364 = 1
inv : p0 + p1 + p135 + p136 + p137 + p138 + p139 + p241 + p242 + p243 + p244 + p245 = 1
inv : p0 + p1 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p231 + p232 + p233 + p234 + p235 = 1
inv : p0 + p1 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p196 + p197 + p198 + p199 + p200 = 1
inv : p73 + p74 + p75 - p325 - p326 = 0
inv : p0 + p1 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 = 1
inv : p33 + p34 + p37 + p38 - p288 - p289 - p292 - p293 - p294 = 0
inv : p124 + p125 + p126 - p363 - p364 = 0
inv : p0 + p1 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p206 + p207 + p208 + p209 + p210 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p115 + p116 + p117 + p359 + p360 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p90 + p91 + p92 + p93 + p94 + p343 + p344 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p109 + p110 + p111 + p355 + p356 = 1
inv : p112 + p113 + p114 - p355 - p356 = 0
inv : p0 + p1 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p181 + p182 + p183 + p184 + p185 = 1
inv : p0 + p1 + p135 + p136 + p256 + p257 + p258 + p259 + p260 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p53 + p54 + p55 + p310 + p311 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p103 + p104 + p105 + p351 + p352 = 1
inv : p0 + p1 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p201 + p202 + p203 + p204 + p205 = 1
inv : p0 + p1 + p135 + p136 + p137 + p138 + p246 + p247 + p248 + p249 + p250 = 1
inv : p0 + p1 + p135 + p261 + p262 + p263 + p264 + p265 = 1
inv : p0 + p1 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p191 + p192 + p193 + p194 + p195 = 1
inv : p0 + p1 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p171 + p172 + p173 + p174 + p175 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p39 + p40 + p41 + p42 + p43 + p299 + p300 = 1
inv : p0 + p60 + p61 + p62 + p63 + p64 + p65 + p68 + p69 + p266 + p267 + p268 + p269 + p270 + p271 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p318 + p319 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 = 1
inv : p0 + p1 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p176 + p177 + p178 + p179 + p180 = 1
inv : p0 + p1 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p221 + p222 + p223 + p224 + p225 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p97 + p98 + p99 + p347 + p348 = 1
inv : p0 + p1 + p135 + p136 + p137 + p251 + p252 + p253 + p254 + p255 = 1
inv : p0 + p1 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p216 + p217 + p218 + p219 + p220 = 1
inv : p56 + p57 + p58 - p310 - p311 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p280 + p281 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p83 + p84 + p85 + p86 + p87 + p337 + p338 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p76 + p77 + p78 + p79 + p80 + p331 + p332 = 1
inv : p22 + p23 + p24 - p280 - p281 = 0
inv : p0 + p266 + p267 + p268 + p269 + p270 + p271 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 = 1
Total of 57 invariants.
[2020-05-12 02:34:08] [INFO ] Computed 57 place invariants in 24 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/graph3193940593991359039.txt, -o, /tmp/graph3193940593991359039.bin, -w, /tmp/graph3193940593991359039.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/graph3193940593991359039.bin, -l, -1, -v, -w, /tmp/graph3193940593991359039.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 02:34:08] [INFO ] Decomposing Gal with order
[2020-05-12 02:34:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 02:34:08] [INFO ] Removed a total of 70 redundant transitions.
[2020-05-12 02:34:09] [INFO ] Flatten gal took : 180 ms
[2020-05-12 02:34:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2020-05-12 02:34:09] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 18 ms
[2020-05-12 02:34:09] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 12 LTL properties
Checking formula 0 : !((G((G((G(!(F("(i20.u121.p303==1)"))))||("(((i9.i0.u18.p44==1)&&(i7.i3.u69.p174==1))&&(i9.i0.u119.p299==1))")))||((!(G("(i13.u53.p133==1)")))&&("(i20.u121.p303!=1)")))))
Formula 0 simplified : !G(G("(((i9.i0.u18.p44==1)&&(i7.i3.u69.p174==1))&&(i9.i0.u119.p299==1))" | G!F"(i20.u121.p303==1)") | ("(i20.u121.p303!=1)" & !G"(i13.u53.p133==1)"))
built 59 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 18 ordering constraints for composite.
built 10 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 13 ordering constraints for composite.
built 12 ordering constraints for composite.
built 4 ordering constraints for composite.
built 14 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 49 ordering constraints for composite.
built 15 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 14 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 4 ordering constraints for composite.
built 12 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
[2020-05-12 02:34:10] [INFO ] Proved 367 variables to be positive in 2443 ms
[2020-05-12 02:34:10] [INFO ] Computing symmetric may disable matrix : 318 transitions.
[2020-05-12 02:34:10] [INFO ] Computation of disable matrix completed :0/318 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 02:34:10] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 02:34:11] [INFO ] Computing symmetric may enable matrix : 318 transitions.
[2020-05-12 02:34:11] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions t182, t244, t256, i0.u42.t197, i0.u46.t189, i1.t148, i1.u77.t149, i2.i0.t250, i2.i0.u8.t264, i2.i0.u14.t253, i2.i1.t255, i2.i1.u15.t251, i3.i0.u20.t241, i3.i0.u22.t237, i3.i1.t243, i3.i1.u21.t239, i4.t233, i4.t231, i4.t229, i4.u27.t227, i4.u28.t225, i5.i0.u48.t185, i5.i0.u50.t181, i5.i2.t152, i5.i2.u75.t153, i6.i1.t136, i6.i1.u83.t137, i6.i2.t128, i6.i2.u87.t129, i6.i3.t124, i6.i3.u88.t125, i7.i1.t175, i7.i1.u63.t176, i7.i2.t168, i7.i2.u67.t169, i7.i3.t164, i7.i3.u69.t165, i7.i4.t160, i7.i4.u70.t161, i8.i0.t259, i8.i0.u10.t261, i8.i1.t172, i8.i1.u64.t173, i9.i0.t247, i9.i0.u16.t249, i9.i1.t156, i9.i1.u73.t157, i10.i0.t144, i10.i0.u79.t145, i10.i1.t140, i10.i1.u80.t141, i11.i0.u40.t201, i11.i1.t205, i11.i1.u37.t207, i12.t51, i12.u120.t55, i13.t132, i13.u85.t133, i14.u29.t223, i15.i0.t211, i15.i0.u34.t213, i15.i1.t120, i15.i1.u91.t121, i16.i0.t217, i16.i0.u31.t219, i16.i1.t116, i16.i1.u92.t117, i17.i0.t112, i17.i0.u95.t113, i17.i1.t108, i17.i1.u96.t109, i17.i2.t104, i17.i2.u99.t105, i18.i0.u44.t193, i18.i1.t100, i18.i1.u100.t101, i18.i2.t96, i18.i2.u103.t97, i19.t92, i19.u104.t93, i20.t76, i20.t74, i20.t71, i20.t69, i20.t64, i20.t60, i20.t58, i20.t53, i20.t49, i20.t40, i20.t36, i20.t33, i20.t31, i20.t28, i20.t26, i20.t23, i20.t21, i20.t18, i20.t15, i20.t12, i20.t9, i20.t6, i20.t3, i20.u106.t1, i21.t62, i21.u114.t66, i22.t46, i22.t42, i22.t38, i22.u126.t44, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/208/110/318
Computing Next relation with stutter on 24 deadlock states
89 unique states visited
89 strongly connected components in search stack
90 transitions explored
89 items max in DFS search stack
495 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.02321,187656,1,0,350238,489,5015,536598,255,941,918127
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-05-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((!(X(G(("(i2.i0.u9.p24==1)")U("(i3.i0.u124.p311==1)")))))&&(!(("(i20.u111.p282==1)")U(G((X("(i20.u111.p282==1)"))&&("(i3.i0.u124.p311==1)")))))))
Formula 1 simplified : !(!XG("(i2.i0.u9.p24==1)" U "(i3.i0.u124.p311==1)") & !("(i20.u111.p282==1)" U G("(i3.i0.u124.p311==1)" & X"(i20.u111.p282==1)")))
Computing Next relation with stutter on 24 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.02567,188124,1,0,350242,489,5058,536598,256,941,918267
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-05-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(F(!(X(G(F((X((X("(i7.i0.u59.p149==1)"))||("(i7.i0.u59.p149==1)")))&&("(i0.u42.p105!=1)")))))))))
Formula 2 simplified : F!XGF("(i0.u42.p105!=1)" & X("(i7.i0.u59.p149==1)" | X"(i7.i0.u59.p149==1)"))
Computing Next relation with stutter on 24 deadlock states
[2020-05-12 02:34:16] [INFO ] Computing symmetric co enabling matrix : 318 transitions.
143 unique states visited
143 strongly connected components in search stack
144 transitions explored
143 items max in DFS search stack
383 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.86083,222672,1,0,419057,489,5174,649806,256,1115,1084428
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-05-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G((G("(i21.u114.p289==1)"))U((F(X(F(!((G("(i0.u2.p5==1)"))U("(((i8.i0.u12.p30==1)&&(i8.i1.u64.p164==1))&&(i8.i0.u113.p286==1))"))))))||("(((i8.i0.u12.p30==1)&&(i8.i1.u64.p164==1))&&(i8.i0.u113.p286==1))")))))
Formula 3 simplified : !G(G"(i21.u114.p289==1)" U ("(((i8.i0.u12.p30==1)&&(i8.i1.u64.p164==1))&&(i8.i0.u113.p286==1))" | FXF!(G"(i0.u2.p5==1)" U "(((i8.i0.u12.p30==1)&&(i8.i1.u64.p164==1))&&(i8.i0.u113.p286==1))")))
Computing Next relation with stutter on 24 deadlock states
[2020-05-12 02:34:20] [INFO ] Computation of co-enabling matrix(0/318) took 4109 ms. Total solver calls (SAT/UNSAT): 288(0/288)
288 unique states visited
0 strongly connected components in search stack
478 transitions explored
134 items max in DFS search stack
330 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.1642,241612,1,0,455540,489,5345,683800,256,1115,1181768
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-05-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((("(i15.i1.u91.p227==1)")U(G("(i20.u108.p276!=1)"))))
Formula 4 simplified : !("(i15.i1.u91.p227==1)" U G"(i20.u108.p276!=1)")
Computing Next relation with stutter on 24 deadlock states
SMT solver raised 'unknown', retrying with same input.
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
207 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,14.2387,300484,1,0,579928,489,5387,820069,256,1141,1460613
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-05-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X((F((G("(((i4.u28.p68==1)&&(i6.i2.u87.p219==1))&&(i22.u126.p320==1))"))&&(X("(i20.u143.p349==1)"))))&&(G(X((((!(F("(i20.u130.p324==1)")))&&("(i4.u28.p68==1)"))&&("(i6.i2.u87.p219==1)"))&&("(i22.u126.p320==1)")))))))
Formula 5 simplified : !X(F(G"(((i4.u28.p68==1)&&(i6.i2.u87.p219==1))&&(i22.u126.p320==1))" & X"(i20.u143.p349==1)") & GX("(i4.u28.p68==1)" & "(i6.i2.u87.p219==1)" & "(i22.u126.p320==1)" & !F"(i20.u130.p324==1)"))
Computing Next relation with stutter on 24 deadlock states
87 unique states visited
87 strongly connected components in search stack
87 transitions explored
87 items max in DFS search stack
133 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,15.5768,323172,1,0,614619,489,5482,879824,256,1143,1544692
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-05-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X((X(F(((F("(i0.u46.p117==1)"))U(G(("(((i17.i1.u43.p106==1)&&(i17.i1.u96.p244==1))&&(i0.u144.p351==1))")U("(i20.u121.p304==1)"))))||("(i0.u46.p117==1)"))))&&(G("(i0.u46.p117==1)")))))
Formula 6 simplified : !X(XF("(i0.u46.p117==1)" | (F"(i0.u46.p117==1)" U G("(((i17.i1.u43.p106==1)&&(i17.i1.u96.p244==1))&&(i0.u144.p351==1))" U "(i20.u121.p304==1)"))) & G"(i0.u46.p117==1)")
Computing Next relation with stutter on 24 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,15.5821,323436,1,0,614641,489,5493,879869,256,1143,1544865
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-05-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X((((((G((X("(((i11.i0.u41.p100==1)&&(i10.i1.u80.p204==1))&&(i11.i0.u142.p347==1))"))&&("(i2.i0.u14.p35==1)")))&&(G("(i12.u122.p307==1)")))&&("(i7.i2.u66.p170==1)"))&&("(i11.i0.u41.p100==1)"))&&("(i10.i1.u80.p204==1)"))&&("(i11.i0.u142.p347==1)"))))
Formula 7 simplified : !X("(i7.i2.u66.p170==1)" & "(i10.i1.u80.p204==1)" & "(i11.i0.u41.p100==1)" & "(i11.i0.u142.p347==1)" & G("(i2.i0.u14.p35==1)" & X"(((i11.i0.u41.p100==1)&&(i10.i1.u80.p204==1))&&(i11.i0.u142.p347==1))") & G"(i12.u122.p307==1)")
Computing Next relation with stutter on 24 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,15.6009,323436,1,0,614641,489,5558,879869,256,1143,1545041
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-05-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X((G("(i5.i0.u1.p4!=1)"))U(F("(((i8.i0.u10.p25==1)&&(i7.i1.u63.p158==1))&&(i20.u106.p367==1))")))))
Formula 8 simplified : !X(G"(i5.i0.u1.p4!=1)" U F"(((i8.i0.u10.p25==1)&&(i7.i1.u63.p158==1))&&(i20.u106.p367==1))")
Computing Next relation with stutter on 24 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
105 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,16.6514,359864,1,0,685316,492,5635,949957,257,1198,1708657
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-05-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(G("(i20.u128.p319==1)"))))
Formula 9 simplified : !FG"(i20.u128.p319==1)"
Computing Next relation with stutter on 24 deadlock states
SMT solver raised 'unknown', retrying with same input.
SMT solver raised 'unknown' twice, overapproximating result to 1.
[2020-05-12 02:34:26] [INFO ] Computation of co-enabling matrix(1/318) took 10021 ms. Total solver calls (SAT/UNSAT): 383(9/374)
[2020-05-12 02:34:26] [INFO ] Computation of Finished co-enabling matrix. took 10030 ms. Total solver calls (SAT/UNSAT): 383(9/374)
[2020-05-12 02:34:26] [INFO ] Computing Do-Not-Accords matrix : 318 transitions.
[2020-05-12 02:34:34] [INFO ] Computation of Completed DNA matrix. took 8186 ms. Total solver calls (SAT/UNSAT): 1499(0/1499)
[2020-05-12 02:34:34] [INFO ] Built C files in 26645ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 7901 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 122 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([]((LTLAP32==true))), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([]((LTLAP32==true))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([]((LTLAP32==true))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3148 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,48.124,777776,1,0,1.53461e+06,504,5655,1.96557e+06,257,1306,3022447
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-05-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((!(F(!(F(X((F("(i20.u106.p269==1)"))||("(((i18.i0.u45.p112==1)&&(i18.i1.u100.p254==1))&&(i18.i0.u146.p355==1))"))))))))
Formula 10 simplified : F!FX("(((i18.i0.u45.p112==1)&&(i18.i1.u100.p254==1))&&(i18.i0.u146.p355==1))" | F"(i20.u106.p269==1)")
Computing Next relation with stutter on 24 deadlock states
89 unique states visited
89 strongly connected components in search stack
90 transitions explored
89 items max in DFS search stack
1096 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,59.0868,924624,1,0,1.8116e+06,508,5696,2.32837e+06,257,1318,3487850
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-05-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((G(X("((i9.i1.u72.p185!=1)||(((i14.u30.p73==1)&&(i6.i1.u83.p209==1))&&(i14.u131.p325==1)))")))U((((!(X("(i17.i1.u97.p241==1)")))&&("(i14.u30.p73==1)"))&&("(i6.i1.u83.p209==1)"))&&("(i14.u131.p325==1)"))))
Formula 11 simplified : !(GX"((i9.i1.u72.p185!=1)||(((i14.u30.p73==1)&&(i6.i1.u83.p209==1))&&(i14.u131.p325==1)))" U ("(i6.i1.u83.p209==1)" & "(i14.u30.p73==1)" & "(i14.u131.p325==1)" & !X"(i17.i1.u97.p241==1)"))
Computing Next relation with stutter on 24 deadlock states
87 unique states visited
87 strongly connected components in search stack
87 transitions explored
87 items max in DFS search stack
427 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,63.3573,1041840,1,0,2.00712e+06,508,5814,2.61029e+06,257,1318,3867387
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-05-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
BK_STOP 1589250916310
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -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-05"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-05, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r021-oct2-158897699100482"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-05.tgz
mv BusinessProcesses-PT-05 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;