Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r035-tajo-162038167700096.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is BusinessProcesses-PT-08, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r035-tajo-162038167700096
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 91K May 5 16:51 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-08-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1620904336896

[2021-05-13 11:12:18] [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]
[2021-05-13 11:12:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 11:12:18] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2021-05-13 11:12:19] [INFO ] Transformed 393 places.
[2021-05-13 11:12:19] [INFO ] Transformed 344 transitions.
[2021-05-13 11:12:19] [INFO ] Found NUPN structural information;
[2021-05-13 11:12:19] [INFO ] Parsed PT model containing 393 places and 344 transitions in 125 ms.
Deduced a syphon composed of 13 places in 8 ms
Reduce places removed 13 places and 13 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 42 ms.
Incomplete random walk after 100000 steps, including 852 resets, run finished after 268 ms. (steps per millisecond=373 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 331 rows 380 cols
[2021-05-13 11:12:19] [INFO ] Computed 58 place invariants in 15 ms
[2021-05-13 11:12:19] [INFO ] [Real]Absence check using 44 positive place invariants in 54 ms returned sat
[2021-05-13 11:12:19] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 8 ms returned sat
[2021-05-13 11:12:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:19] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 27 places in 143 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 16 places in 89 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 12 places in 74 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 37 places in 82 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 24 places in 67 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 29 places in 80 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 29 places in 78 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 36 places in 76 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 24 places in 71 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 31 places in 66 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 39 places in 66 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 24 places in 87 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 60 places in 65 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 24 places in 60 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 33 places in 122 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 54 places in 78 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 32 places in 43 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 28 places in 91 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 16 places in 97 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 27 places in 84 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 15 places in 105 ms
[2021-05-13 11:12:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 21 trap constraints in 2144 ms
[2021-05-13 11:12:22] [INFO ] [Real]Absence check using 44 positive place invariants in 47 ms returned sat
[2021-05-13 11:12:22] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 20 ms returned sat
[2021-05-13 11:12:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:22] [INFO ] [Real]Absence check using state equation in 591 ms returned sat
[2021-05-13 11:12:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:23] [INFO ] [Nat]Absence check using 44 positive place invariants in 60 ms returned sat
[2021-05-13 11:12:23] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 9 ms returned sat
[2021-05-13 11:12:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:23] [INFO ] [Nat]Absence check using state equation in 472 ms returned sat
[2021-05-13 11:12:23] [INFO ] Deduced a trap composed of 8 places in 178 ms
[2021-05-13 11:12:23] [INFO ] Deduced a trap composed of 16 places in 134 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 23 places in 130 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 89 places in 125 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 18 places in 150 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 99 places in 131 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 11 places in 117 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 89 places in 118 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 24 places in 121 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 24 places in 116 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 28 places in 100 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 94 places in 145 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 22 places in 121 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 98 places in 118 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 96 places in 113 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 97 places in 119 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 92 places in 113 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 93 places in 112 ms
[2021-05-13 11:12:26] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2637 ms
[2021-05-13 11:12:26] [INFO ] Computed and/alt/rep : 330/1155/330 causal constraints in 23 ms.
[2021-05-13 11:12:27] [INFO ] Added : 246 causal constraints over 50 iterations in 1477 ms. Result :sat
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 59 places in 164 ms
[2021-05-13 11:12:28] [INFO ] Deduced a trap composed of 94 places in 157 ms
[2021-05-13 11:12:28] [INFO ] Deduced a trap composed of 98 places in 138 ms
[2021-05-13 11:12:28] [INFO ] Deduced a trap composed of 44 places in 81 ms
[2021-05-13 11:12:28] [INFO ] Deduced a trap composed of 39 places in 55 ms
[2021-05-13 11:12:28] [INFO ] Deduced a trap composed of 44 places in 87 ms
[2021-05-13 11:12:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1020 ms
[2021-05-13 11:12:28] [INFO ] [Real]Absence check using 44 positive place invariants in 35 ms returned sat
[2021-05-13 11:12:28] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 10 ms returned sat
[2021-05-13 11:12:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:29] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2021-05-13 11:12:29] [INFO ] Deduced a trap composed of 24 places in 110 ms
[2021-05-13 11:12:29] [INFO ] Deduced a trap composed of 23 places in 103 ms
[2021-05-13 11:12:29] [INFO ] Deduced a trap composed of 27 places in 96 ms
[2021-05-13 11:12:29] [INFO ] Deduced a trap composed of 12 places in 94 ms
[2021-05-13 11:12:29] [INFO ] Deduced a trap composed of 19 places in 105 ms
[2021-05-13 11:12:29] [INFO ] Deduced a trap composed of 27 places in 87 ms
[2021-05-13 11:12:29] [INFO ] Deduced a trap composed of 16 places in 85 ms
[2021-05-13 11:12:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 810 ms
[2021-05-13 11:12:30] [INFO ] [Real]Absence check using 44 positive place invariants in 35 ms returned sat
[2021-05-13 11:12:30] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 10 ms returned sat
[2021-05-13 11:12:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:30] [INFO ] [Real]Absence check using state equation in 450 ms returned sat
[2021-05-13 11:12:30] [INFO ] Deduced a trap composed of 8 places in 160 ms
[2021-05-13 11:12:30] [INFO ] Deduced a trap composed of 20 places in 132 ms
[2021-05-13 11:12:30] [INFO ] Deduced a trap composed of 8 places in 125 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 18 places in 115 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 12 places in 137 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 24 places in 109 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 15 places in 103 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 27 places in 159 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 47 places in 103 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 93 places in 107 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 17 places in 98 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 24 places in 96 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 18 places in 104 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 83 places in 99 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 89 places in 94 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 86 places in 91 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 87 places in 94 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 90 places in 86 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 88 places in 100 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 91 places in 88 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 92 places in 100 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 89 places in 102 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 89 places in 102 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 91 places in 98 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 86 places in 97 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 84 places in 101 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 87 places in 102 ms
[2021-05-13 11:12:34] [INFO ] Deduced a trap composed of 90 places in 82 ms
[2021-05-13 11:12:34] [INFO ] Deduced a trap composed of 90 places in 83 ms
[2021-05-13 11:12:34] [INFO ] Deduced a trap composed of 87 places in 82 ms
[2021-05-13 11:12:34] [INFO ] Deduced a trap composed of 90 places in 86 ms
[2021-05-13 11:12:34] [INFO ] Deduced a trap composed of 88 places in 82 ms
[2021-05-13 11:12:34] [INFO ] Deduced a trap composed of 87 places in 86 ms
[2021-05-13 11:12:34] [INFO ] Deduced a trap composed of 84 places in 84 ms
[2021-05-13 11:12:34] [INFO ] Deduced a trap composed of 93 places in 78 ms
[2021-05-13 11:12:34] [INFO ] Deduced a trap composed of 17 places in 95 ms
[2021-05-13 11:12:35] [INFO ] Deduced a trap composed of 91 places in 76 ms
[2021-05-13 11:12:35] [INFO ] Deduced a trap composed of 94 places in 146 ms
[2021-05-13 11:12:35] [INFO ] Deduced a trap composed of 89 places in 105 ms
[2021-05-13 11:12:35] [INFO ] Deduced a trap composed of 87 places in 121 ms
[2021-05-13 11:12:35] [INFO ] Deduced a trap composed of 90 places in 100 ms
[2021-05-13 11:12:35] [INFO ] Deduced a trap composed of 86 places in 114 ms
[2021-05-13 11:12:35] [INFO ] Deduced a trap composed of 88 places in 107 ms
[2021-05-13 11:12:36] [INFO ] Deduced a trap composed of 95 places in 97 ms
[2021-05-13 11:12:36] [INFO ] Deduced a trap composed of 89 places in 128 ms
[2021-05-13 11:12:36] [INFO ] Deduced a trap composed of 89 places in 100 ms
[2021-05-13 11:12:36] [INFO ] Deduced a trap composed of 90 places in 103 ms
[2021-05-13 11:12:36] [INFO ] Deduced a trap composed of 86 places in 100 ms
[2021-05-13 11:12:36] [INFO ] Deduced a trap composed of 87 places in 98 ms
[2021-05-13 11:12:36] [INFO ] Deduced a trap composed of 94 places in 93 ms
[2021-05-13 11:12:36] [INFO ] Deduced a trap composed of 90 places in 96 ms
[2021-05-13 11:12:36] [INFO ] Deduced a trap composed of 92 places in 91 ms
[2021-05-13 11:12:37] [INFO ] Deduced a trap composed of 85 places in 124 ms
[2021-05-13 11:12:37] [INFO ] Deduced a trap composed of 91 places in 103 ms
[2021-05-13 11:12:37] [INFO ] Deduced a trap composed of 87 places in 100 ms
[2021-05-13 11:12:37] [INFO ] Deduced a trap composed of 85 places in 115 ms
[2021-05-13 11:12:37] [INFO ] Deduced a trap composed of 88 places in 88 ms
[2021-05-13 11:12:37] [INFO ] Deduced a trap composed of 90 places in 119 ms
[2021-05-13 11:12:37] [INFO ] Deduced a trap composed of 85 places in 131 ms
[2021-05-13 11:12:38] [INFO ] Deduced a trap composed of 81 places in 123 ms
[2021-05-13 11:12:38] [INFO ] Deduced a trap composed of 92 places in 137 ms
[2021-05-13 11:12:38] [INFO ] Deduced a trap composed of 16 places in 107 ms
[2021-05-13 11:12:38] [INFO ] Deduced a trap composed of 91 places in 110 ms
[2021-05-13 11:12:38] [INFO ] Deduced a trap composed of 88 places in 137 ms
[2021-05-13 11:12:38] [INFO ] Deduced a trap composed of 93 places in 128 ms
[2021-05-13 11:12:38] [INFO ] Deduced a trap composed of 90 places in 131 ms
[2021-05-13 11:12:39] [INFO ] Deduced a trap composed of 93 places in 147 ms
[2021-05-13 11:12:39] [INFO ] Deduced a trap composed of 95 places in 199 ms
[2021-05-13 11:12:39] [INFO ] Deduced a trap composed of 92 places in 132 ms
[2021-05-13 11:12:39] [INFO ] Deduced a trap composed of 88 places in 141 ms
[2021-05-13 11:12:39] [INFO ] Deduced a trap composed of 85 places in 107 ms
[2021-05-13 11:12:40] [INFO ] Deduced a trap composed of 87 places in 121 ms
[2021-05-13 11:12:43] [INFO ] Deduced a trap composed of 88 places in 3239 ms
[2021-05-13 11:12:47] [INFO ] Deduced a trap composed of 86 places in 4601 ms
[2021-05-13 11:12:53] [INFO ] Deduced a trap composed of 85 places in 5544 ms
[2021-05-13 11:12:53] [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 s21 s22 s23 s24 s27 s28 s39 s40 s48 s49 s56 s57 s80 s81 s123 s124 s125 s162 s167 s171 s179 s184 s189 s193 s195 s199 s203 s204 s205 s209 s214 s218 s219 s220 s223 s225 s229 s244 s269 s274 s277 s278 s279 s280 s281 s282 s283 s284 s285 s286 s287 s299 s300 s308 s309 s310 s311 s323 s324 s325 s326 s333 s334 s335 s336 s339 s340 s351 s352 s357 s358 s359 s360 s363 s364 s365 s366 s367 s368 s369 s370 s371 s372 s379) 0)") while checking expression at index 3
[2021-05-13 11:12:53] [INFO ] [Real]Absence check using 44 positive place invariants in 24 ms returned sat
[2021-05-13 11:12:53] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 5 ms returned sat
[2021-05-13 11:12:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:55] [INFO ] [Real]Absence check using state equation in 2120 ms returned sat
[2021-05-13 11:12:57] [INFO ] Deduced a trap composed of 14 places in 1762 ms
[2021-05-13 11:12:57] [INFO ] Deduced a trap composed of 8 places in 146 ms
[2021-05-13 11:12:57] [INFO ] Deduced a trap composed of 11 places in 164 ms
[2021-05-13 11:12:58] [INFO ] Deduced a trap composed of 35 places in 606 ms
[2021-05-13 11:12:58] [INFO ] Deduced a trap composed of 20 places in 133 ms
[2021-05-13 11:13:01] [INFO ] Deduced a trap composed of 24 places in 2356 ms
[2021-05-13 11:13:01] [INFO ] Deduced a trap composed of 16 places in 105 ms
[2021-05-13 11:13:01] [INFO ] Deduced a trap composed of 17 places in 102 ms
[2021-05-13 11:13:01] [INFO ] Deduced a trap composed of 19 places in 161 ms
[2021-05-13 11:13:01] [INFO ] Deduced a trap composed of 22 places in 140 ms
[2021-05-13 11:13:01] [INFO ] Deduced a trap composed of 23 places in 142 ms
[2021-05-13 11:13:01] [INFO ] Deduced a trap composed of 23 places in 109 ms
[2021-05-13 11:13:02] [INFO ] Deduced a trap composed of 29 places in 105 ms
[2021-05-13 11:13:02] [INFO ] Deduced a trap composed of 22 places in 146 ms
[2021-05-13 11:13:02] [INFO ] Deduced a trap composed of 15 places in 119 ms
[2021-05-13 11:13:02] [INFO ] Deduced a trap composed of 89 places in 185 ms
[2021-05-13 11:13:02] [INFO ] Deduced a trap composed of 27 places in 102 ms
[2021-05-13 11:13:02] [INFO ] Deduced a trap composed of 87 places in 143 ms
[2021-05-13 11:13:03] [INFO ] Deduced a trap composed of 19 places in 129 ms
[2021-05-13 11:13:03] [INFO ] Deduced a trap composed of 32 places in 110 ms
[2021-05-13 11:13:03] [INFO ] Deduced a trap composed of 83 places in 113 ms
[2021-05-13 11:13:03] [INFO ] Deduced a trap composed of 21 places in 108 ms
[2021-05-13 11:13:03] [INFO ] Deduced a trap composed of 93 places in 123 ms
[2021-05-13 11:13:03] [INFO ] Deduced a trap composed of 29 places in 112 ms
[2021-05-13 11:13:03] [INFO ] Deduced a trap composed of 89 places in 99 ms
[2021-05-13 11:13:03] [INFO ] Deduced a trap composed of 24 places in 141 ms
[2021-05-13 11:13:04] [INFO ] Deduced a trap composed of 37 places in 142 ms
[2021-05-13 11:13:04] [INFO ] Deduced a trap composed of 93 places in 117 ms
[2021-05-13 11:13:04] [INFO ] Deduced a trap composed of 89 places in 110 ms
[2021-05-13 11:13:04] [INFO ] Deduced a trap composed of 87 places in 129 ms
[2021-05-13 11:13:04] [INFO ] Deduced a trap composed of 88 places in 131 ms
[2021-05-13 11:13:04] [INFO ] Deduced a trap composed of 87 places in 125 ms
[2021-05-13 11:13:04] [INFO ] Deduced a trap composed of 95 places in 132 ms
[2021-05-13 11:13:05] [INFO ] Deduced a trap composed of 89 places in 103 ms
[2021-05-13 11:13:05] [INFO ] Deduced a trap composed of 89 places in 102 ms
[2021-05-13 11:13:05] [INFO ] Deduced a trap composed of 91 places in 129 ms
[2021-05-13 11:13:05] [INFO ] Deduced a trap composed of 86 places in 96 ms
[2021-05-13 11:13:05] [INFO ] Deduced a trap composed of 100 places in 130 ms
[2021-05-13 11:13:05] [INFO ] Deduced a trap composed of 91 places in 143 ms
[2021-05-13 11:13:05] [INFO ] Deduced a trap composed of 96 places in 144 ms
[2021-05-13 11:13:06] [INFO ] Deduced a trap composed of 90 places in 124 ms
[2021-05-13 11:13:06] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 10297 ms
[2021-05-13 11:13:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:13:06] [INFO ] [Nat]Absence check using 44 positive place invariants in 49 ms returned sat
[2021-05-13 11:13:06] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-13 11:13:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:13:06] [INFO ] [Nat]Absence check using state equation in 391 ms returned sat
[2021-05-13 11:13:06] [INFO ] Deduced a trap composed of 8 places in 100 ms
[2021-05-13 11:13:06] [INFO ] Deduced a trap composed of 15 places in 94 ms
[2021-05-13 11:13:06] [INFO ] Deduced a trap composed of 11 places in 96 ms
[2021-05-13 11:13:07] [INFO ] Deduced a trap composed of 34 places in 76 ms
[2021-05-13 11:13:07] [INFO ] Deduced a trap composed of 16 places in 63 ms
[2021-05-13 11:13:07] [INFO ] Deduced a trap composed of 32 places in 61 ms
[2021-05-13 11:13:07] [INFO ] Deduced a trap composed of 45 places in 93 ms
[2021-05-13 11:13:07] [INFO ] Deduced a trap composed of 41 places in 61 ms
[2021-05-13 11:13:07] [INFO ] Deduced a trap composed of 37 places in 54 ms
[2021-05-13 11:13:07] [INFO ] Deduced a trap composed of 28 places in 46 ms
[2021-05-13 11:13:07] [INFO ] Deduced a trap composed of 28 places in 51 ms
[2021-05-13 11:13:07] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 974 ms
[2021-05-13 11:13:07] [INFO ] Computed and/alt/rep : 330/1155/330 causal constraints in 19 ms.
[2021-05-13 11:13:08] [INFO ] Added : 228 causal constraints over 46 iterations in 1020 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2021-05-13 11:13:08] [INFO ] Flatten gal took : 61 ms
[2021-05-13 11:13:08] [INFO ] Flatten gal took : 22 ms
[2021-05-13 11:13:08] [INFO ] Applying decomposition
[2021-05-13 11:13:08] [INFO ] Flatten gal took : 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/graph15774206605544210735.txt, -o, /tmp/graph15774206605544210735.bin, -w, /tmp/graph15774206605544210735.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/graph15774206605544210735.bin, -l, -1, -v, -w, /tmp/graph15774206605544210735.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 11:13:09] [INFO ] Decomposing Gal with order
[2021-05-13 11:13:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 11:13:09] [INFO ] Removed a total of 83 redundant transitions.
[2021-05-13 11:13:09] [INFO ] Flatten gal took : 86 ms
[2021-05-13 11:13:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2021-05-13 11:13:09] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 12 ms
[2021-05-13 11:13:09] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 7 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 16 CTL formulae.
built 57 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 13 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 13 ordering constraints for composite.
built 13 ordering constraints for composite.
built 4 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 16 ordering constraints for composite.
built 15 ordering constraints for composite.
built 4 ordering constraints for composite.
built 17 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 53 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 20 ordering constraints for composite.
built 10 ordering constraints for composite.
built 13 ordering constraints for composite.
built 13 ordering constraints for composite.
built 12 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 14 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 10 ordering constraints for composite.
built 7 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.
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,4.94e+17,3.02785,78500,6828,26,111083,574,849,249330,52,997,0


Converting to forward existential form...Done !
original formula: E((((((i16.i1.u118.p309!=1)&&(i15.u112.p293!=1))&&(i5.i2.u90.p238!=1))&&(((i12.i1.u41.p102!=1)||(i14.i1.u96.p252!=1))||(i12.i1.u149.p372!=1)))&&(((i3.i1.u48.p120!=1)||(i4.i3.u111.p286!=1))||(i15.u112.p392!=1))) U EF(((AF(EX(((((i15.u142.p358==1)||(((i3.u49.p123==1)&&(i4.i2.u109.p282==1))&&(i3.i1.u157.p388==1)))||(i12.i0.u43.p110==1))||(((i0.i0.u11.p29==1)&&(i0.i2.u105.p271==1))&&(i15.u112.p392==1))))) * ((i1.i0.u5.p17==1)||(i0.i0.u120.p313==1))) * ((((((((((((((i1.i0.u5.p17==1)||(i0.i2.u104.p273==1))||(i15.u112.p290==1))||(i3.i1.u50.p7==1))||(i10.i0.u17.p45==1))||(i7.i3.u75.p194==1))||(i8.i1.u106.p278==1))||(i11.i0.u39.p98==1))||(i16.i0.u8.p24==1))||(i6.i0.u62.p158==1))||(i1.i0.u23.p60==1))||(i13.i0.u31.p79==1)) + EG(((((((((((i9.u33.p83==1)||(i1.i0.u14.p37==1))||(i5.i1.u89.p230==1))||(((i2.u21.p47==1)&&(i5.i1.u89.p231==1))&&(i15.u112.p392==1)))||(i6.i4.u87.p228==1))||(i8.i0.u155.p385==1))||(i12.i0.u2.p9==1))||(i12.i1.u41.p104==1))||(i18.u130.p334==1))||(i13.i0.u31.p78==1)))) + (((((((((((i6.i1.u76.p200!=1)&&(i17.u121.p314!=1))&&(i1.i0.u6.p18!=1))&&(i14.i0.u27.p69!=1))&&(i1.i0.u14.p37!=1))&&(i15.u139.p352!=1))&&(i15.u124.p322!=1))&&(i7.i1.u68.p170!=1))&&(i0.i2.u104.p269!=1))&&(((i0.i0.u12.p32!=1)||(i0.i1.u85.p222!=1))||(i0.i0.u120.p312!=1)))&&(((i1.i0.u14.p34!=1)||(i8.i1.u107.p276!=1))||(i15.u112.p392!=1)))))))
=> equivalent forward existential formula: (([((FwdU(FwdU(Init,(((((i16.i1.u118.p309!=1)&&(i15.u112.p293!=1))&&(i5.i2.u90.p238!=1))&&(((i12.i1.u41.p102!=1)||(i14.i1.u96.p252!=1))||(i12.i1.u149.p372!=1)))&&(((i3.i1.u48.p120!=1)||(i4.i3.u111.p286!=1))||(i15.u112.p392!=1)))),TRUE) * (!(EG(!(EX(((((i15.u142.p358==1)||(((i3.u49.p123==1)&&(i4.i2.u109.p282==1))&&(i3.i1.u157.p388==1)))||(i12.i0.u43.p110==1))||(((i0.i0.u11.p29==1)&&(i0.i2.u105.p271==1))&&(i15.u112.p392==1))))))) * ((i1.i0.u5.p17==1)||(i0.i0.u120.p313==1)))) * ((((((((((((i1.i0.u5.p17==1)||(i0.i2.u104.p273==1))||(i15.u112.p290==1))||(i3.i1.u50.p7==1))||(i10.i0.u17.p45==1))||(i7.i3.u75.p194==1))||(i8.i1.u106.p278==1))||(i11.i0.u39.p98==1))||(i16.i0.u8.p24==1))||(i6.i0.u62.p158==1))||(i1.i0.u23.p60==1))||(i13.i0.u31.p79==1)))] != FALSE + [FwdG((FwdU(FwdU(Init,(((((i16.i1.u118.p309!=1)&&(i15.u112.p293!=1))&&(i5.i2.u90.p238!=1))&&(((i12.i1.u41.p102!=1)||(i14.i1.u96.p252!=1))||(i12.i1.u149.p372!=1)))&&(((i3.i1.u48.p120!=1)||(i4.i3.u111.p286!=1))||(i15.u112.p392!=1)))),TRUE) * (!(EG(!(EX(((((i15.u142.p358==1)||(((i3.u49.p123==1)&&(i4.i2.u109.p282==1))&&(i3.i1.u157.p388==1)))||(i12.i0.u43.p110==1))||(((i0.i0.u11.p29==1)&&(i0.i2.u105.p271==1))&&(i15.u112.p392==1))))))) * ((i1.i0.u5.p17==1)||(i0.i0.u120.p313==1)))),((((((((((i9.u33.p83==1)||(i1.i0.u14.p37==1))||(i5.i1.u89.p230==1))||(((i2.u21.p47==1)&&(i5.i1.u89.p231==1))&&(i15.u112.p392==1)))||(i6.i4.u87.p228==1))||(i8.i0.u155.p385==1))||(i12.i0.u2.p9==1))||(i12.i1.u41.p104==1))||(i18.u130.p334==1))||(i13.i0.u31.p78==1)))] != FALSE) + [((FwdU(FwdU(Init,(((((i16.i1.u118.p309!=1)&&(i15.u112.p293!=1))&&(i5.i2.u90.p238!=1))&&(((i12.i1.u41.p102!=1)||(i14.i1.u96.p252!=1))||(i12.i1.u149.p372!=1)))&&(((i3.i1.u48.p120!=1)||(i4.i3.u111.p286!=1))||(i15.u112.p392!=1)))),TRUE) * (!(EG(!(EX(((((i15.u142.p358==1)||(((i3.u49.p123==1)&&(i4.i2.u109.p282==1))&&(i3.i1.u157.p388==1)))||(i12.i0.u43.p110==1))||(((i0.i0.u11.p29==1)&&(i0.i2.u105.p271==1))&&(i15.u112.p392==1))))))) * ((i1.i0.u5.p17==1)||(i0.i0.u120.p313==1)))) * (((((((((((i6.i1.u76.p200!=1)&&(i17.u121.p314!=1))&&(i1.i0.u6.p18!=1))&&(i14.i0.u27.p69!=1))&&(i1.i0.u14.p37!=1))&&(i15.u139.p352!=1))&&(i15.u124.p322!=1))&&(i7.i1.u68.p170!=1))&&(i0.i2.u104.p269!=1))&&(((i0.i0.u12.p32!=1)||(i0.i1.u85.p222!=1))||(i0.i0.u120.p312!=1)))&&(((i1.i0.u14.p34!=1)||(i8.i1.u107.p276!=1))||(i15.u112.p392!=1))))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t203, t277, i0.i0.u11.t280, i0.i1.t148, i0.i1.u85.t149, i0.i2.t108, i0.i2.u105.t109, i1.i0.u14.t274, i1.i0.u23.t256, i1.i1.t276, i1.i1.u15.t272, i2.t266, i2.t264, i2.t262, i2.u21.t260, i2.u22.t258, i3.i1.u48.t206, i3.i2.u53.t193, i4.i1.t112, i4.i1.u102.t113, i4.i2.t100, i4.i2.u109.t101, i4.i3.t96, i4.i3.u111.t97, i5.i1.t140, i5.i1.u89.t141, i5.i2.t136, i5.i2.u91.t137, i5.i3.t132, i5.i3.u93.t133, i5.i4.t120, i5.i4.u98.t121, i6.i1.t164, i6.i1.u76.t165, i6.i2.t156, i6.i2.u81.t157, i6.i3.t152, i6.i3.u83.t153, i6.i4.t144, i6.i4.u86.t145, i7.i1.t187, i7.i1.u68.t188, i7.i2.t184, i7.i2.u69.t185, i7.i3.t168, i7.i3.u74.t169, i8.i0.t210, i8.i0.t212, i8.i0.u44.t214, i8.i1.t104, i8.i1.u107.t105, i9.t234, i9.t232, i9.t230, i9.u33.t236, i10.i0.u16.t270, i10.i1.t160, i10.i1.u78.t161, i11.i0.u38.t226, i11.i1.t116, i11.i1.u100.t117, i12.i0.u42.t218, i12.i1.u40.t222, i13.i0.t240, i13.i0.t242, i13.i0.u29.t244, i13.i1.t128, i13.i1.u94.t129, i14.i0.t248, i14.i0.t250, i14.i0.u25.t252, i14.i1.t124, i14.i1.u96.t125, i15.t80, i15.t74, i15.t70, i15.t65, i15.t61, i15.t52, i15.t48, i15.t45, i15.t43, i15.t41, i15.t38, i15.t36, i15.t34, i15.t31, i15.t29, i15.t27, i15.t25, i15.t22, i15.t19, i15.t16, i15.t13, i15.t11, i15.t9, i15.t6, i15.t3, i15.u112.t1, i16.i0.t285, i16.i0.t287, i16.i0.u9.t283, i16.i0.u10.t281, i16.i1.t72, i16.i1.t76, i16.i1.u115.t78, i17.t63, i17.u121.t67, i18.t58, i18.t54, i18.t50, i18.u127.t56, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/219/112/331
Detected timeout of ITS tools.
[2021-05-13 11:33:25] [INFO ] Applying decomposition
[2021-05-13 11:33:25] [INFO ] Flatten gal took : 31 ms
[2021-05-13 11:33:25] [INFO ] Decomposing Gal with order
[2021-05-13 11:33:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 11:33:25] [INFO ] Flatten gal took : 34 ms
[2021-05-13 11:33:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-13 11:33:26] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 11 ms
[2021-05-13 11:33:26] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 6 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 16 CTL formulae.
built 2 ordering constraints for composite.
built 92 ordering constraints for composite.
built 47 ordering constraints for composite.
built 46 ordering constraints for composite.
built 45 ordering constraints for composite.
built 45 ordering constraints for composite.
built 45 ordering constraints for composite.
built 45 ordering constraints for composite.
built 43 ordering constraints for composite.
built 39 ordering constraints for composite.
built 37 ordering constraints for composite.
built 35 ordering constraints for composite.
built 33 ordering constraints for composite.
built 28 ordering constraints for composite.
built 24 ordering constraints for composite.
built 20 ordering constraints for composite.
built 18 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 47 ordering constraints for composite.
built 45 ordering constraints for composite.
built 43 ordering constraints for composite.
built 41 ordering constraints for composite.
built 39 ordering constraints for composite.
built 37 ordering constraints for composite.
built 35 ordering constraints for composite.
built 33 ordering constraints for composite.
built 31 ordering constraints for composite.
built 29 ordering constraints for composite.
built 27 ordering constraints for composite.
built 25 ordering constraints for composite.
built 23 ordering constraints for composite.
built 21 ordering constraints for composite.
built 19 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 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,4.94e+17,349.048,8349468,55408,3160,4.61055e+06,8339,995,1.02959e+08,618,114974,0


Converting to forward existential form...Done !
original formula: E((((((u86.p309!=1)&&(u86.p293!=1))&&(i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u75.p238!=1))&&(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u30.p102!=1)||(i0.i1.i0.i0.i0.i0.i0.i0.i0.u78.p252!=1))||(u86.p372!=1)))&&(((i0.i0.i0.i0.i0.i0.i0.u33.p120!=1)||(i0.i1.u85.p286!=1))||(u86.p392!=1))) U EF(((AF(EX(((((u86.p358==1)||(((i0.i0.i0.i0.i0.i0.i0.u33.p123==1)&&(i0.i1.i0.u84.p282==1))&&(u86.p388==1)))||(i0.i0.i0.i0.i0.i0.i0.i0.i0.u31.p110==1))||(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u21.p29==1)&&(i0.i1.i0.i0.i0.u82.p271==1))&&(u86.p392==1))))) * ((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u114.p17==1)||(u86.p313==1))) * ((((((((((((((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u114.p17==1)||(i0.i1.i0.i0.i0.u82.p273==1))||(u86.p290==1))||(i0.i0.i0.i0.i0.i0.i0.u125.p7==1))||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u23.p45==1))||(i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u67.p194==1))||(i0.i1.i0.i0.u83.p278==1))||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u29.p98==1))||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u20.p24==1))||(i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u98.p158==1))||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u25.p60==1))||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u27.p79==1)) + EG(((((((((((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u28.p83==1)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u22.p37==1))||(i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u74.p230==1))||(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u24.p47==1)&&(i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u74.p231==1))&&(u86.p392==1)))||(i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u73.p228==1))||(u86.p385==1))||(i0.i0.i0.i0.i0.i0.i0.i0.i0.u127.p9==1))||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u30.p104==1))||(u86.p334==1))||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u27.p78==1)))) + (((((((((((i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u68.p200!=1)&&(u86.p314!=1))&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u120.p18!=1))&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u26.p69!=1))&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u22.p37!=1))&&(u86.p352!=1))&&(u86.p322!=1))&&(i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u62.p170!=1))&&(i0.i1.i0.i0.i0.u82.p269!=1))&&(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u21.p32!=1)||(i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u72.p222!=1))||(u86.p312!=1)))&&(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u22.p34!=1)||(i0.i1.i0.i0.u83.p276!=1))||(u86.p392!=1)))))))
Detected timeout of ITS tools.
=> equivalent forward existential formula: (([((FwdU(FwdU(Init,(((((u86.p309!=1)&&(u86.p293!=1))&&(i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u75.p238!=1))&&(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u30.p102!=1)||(i0.i1.i0.i0.i0.i0.i0.i0.i0.u78.p252!=1))||(u86.p372!=1)))&&(((i0.i0.i0.i0.i0.i0.i0.u33.p120!=1)||(i0.i1.u85.p286!=1))||(u86.p392!=1)))),TRUE) * (!(EG(!(EX(((((u86.p358==1)||(((i0.i0.i0.i0.i0.i0.i0.u33.p123==1)&&(i0.i1.i0.u84.p282==1))&&(u86.p388==1)))||(i0.i0.i0.i0.i0.i0.i0.i0.i0.u31.p110==1))||(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u21.p29==1)&&(i0.i1.i0.i0.i0.u82.p271==1))&&(u86.p392==1))))))) * ((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u114.p17==1)||(u86.p313==1)))) * ((((((((((((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u114.p17==1)||(i0.i1.i0.i0.i0.u82.p273==1))||(u86.p290==1))||(i0.i0.i0.i0.i0.i0.i0.u125.p7==1))||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u23.p45==1))||(i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u67.p194==1))||(i0.i1.i0.i0.u83.p278==1))||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u29.p98==1))||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u20.p24==1))||(i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u98.p158==1))||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u25.p60==1))||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u27.p79==1)))] != FALSE + [FwdG((FwdU(FwdU(Init,(((((u86.p309!=1)&&(u86.p293!=1))&&(i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u75.p238!=1))&&(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u30.p102!=1)||(i0.i1.i0.i0.i0.i0.i0.i0.i0.u78.p252!=1))||(u86.p37
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:176)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:342)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:284)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:326)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:178)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:185)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:161)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:326)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:392)
at fr.lip6.move.gal.application.ITSRunner$ITSInterpreter.run(ITSRunner.java:180)
at java.base/java.lang.Thread.run(Thread.java:834)
[2021-05-13 11:53:44] [INFO ] Flatten gal took : 311 ms
[2021-05-13 11:53:44] [INFO ] Input system was already deterministic with 331 transitions.
[2021-05-13 11:53:44] [INFO ] Transformed 380 places.
[2021-05-13 11:53:44] [INFO ] Transformed 331 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-13 11:53:49] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 3 ms
[2021-05-13 11:53:49] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 4 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, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], 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 --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

--------------------
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-08"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is BusinessProcesses-PT-08, 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 r035-tajo-162038167700096"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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