fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r182-oct2-158987913900457
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for BusinessProcesses-PT-02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15798.310 3600000.00 3653062.00 6603.50 FF??FF?FFTTTFFFT 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.r182-oct2-158987913900457.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is BusinessProcesses-PT-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913900457
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 3.6K Mar 26 02:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 26 02:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 22:42 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 2.7K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 11K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 59K 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-02-00
FORMULA_NAME BusinessProcesses-PT-02-01
FORMULA_NAME BusinessProcesses-PT-02-02
FORMULA_NAME BusinessProcesses-PT-02-03
FORMULA_NAME BusinessProcesses-PT-02-04
FORMULA_NAME BusinessProcesses-PT-02-05
FORMULA_NAME BusinessProcesses-PT-02-06
FORMULA_NAME BusinessProcesses-PT-02-07
FORMULA_NAME BusinessProcesses-PT-02-08
FORMULA_NAME BusinessProcesses-PT-02-09
FORMULA_NAME BusinessProcesses-PT-02-10
FORMULA_NAME BusinessProcesses-PT-02-11
FORMULA_NAME BusinessProcesses-PT-02-12
FORMULA_NAME BusinessProcesses-PT-02-13
FORMULA_NAME BusinessProcesses-PT-02-14
FORMULA_NAME BusinessProcesses-PT-02-15

=== Now, execution of the tool begins

BK_START 1591156321365

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 03:52:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 03:52:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 03:52:03] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2020-06-03 03:52:03] [INFO ] Transformed 262 places.
[2020-06-03 03:52:03] [INFO ] Transformed 219 transitions.
[2020-06-03 03:52:03] [INFO ] Found NUPN structural information;
[2020-06-03 03:52:03] [INFO ] Parsed PT model containing 262 places and 219 transitions in 99 ms.
Deduced a syphon composed of 17 places in 4 ms
Reduce places removed 17 places and 15 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 63 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1355 resets, run finished after 210 ms. (steps per millisecond=476 ) properties seen :[1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0]
// Phase 1: matrix 204 rows 245 cols
[2020-06-03 03:52:03] [INFO ] Computed 43 place invariants in 8 ms
[2020-06-03 03:52:03] [INFO ] [Real]Absence check using 30 positive place invariants in 44 ms returned sat
[2020-06-03 03:52:03] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 10 ms returned sat
[2020-06-03 03:52:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:52:04] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2020-06-03 03:52:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:52:04] [INFO ] [Nat]Absence check using 30 positive place invariants in 59 ms returned sat
[2020-06-03 03:52:04] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:52:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:52:04] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2020-06-03 03:52:04] [INFO ] Deduced a trap composed of 11 places in 133 ms
[2020-06-03 03:52:04] [INFO ] Deduced a trap composed of 8 places in 62 ms
[2020-06-03 03:52:04] [INFO ] Deduced a trap composed of 23 places in 41 ms
[2020-06-03 03:52:04] [INFO ] Deduced a trap composed of 21 places in 35 ms
[2020-06-03 03:52:04] [INFO ] Deduced a trap composed of 14 places in 34 ms
[2020-06-03 03:52:04] [INFO ] Deduced a trap composed of 17 places in 34 ms
[2020-06-03 03:52:04] [INFO ] Deduced a trap composed of 37 places in 32 ms
[2020-06-03 03:52:04] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 438 ms
[2020-06-03 03:52:04] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 8 ms.
[2020-06-03 03:52:05] [INFO ] Added : 147 causal constraints over 30 iterations in 456 ms. Result :sat
[2020-06-03 03:52:05] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2020-06-03 03:52:05] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:52:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:52:05] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2020-06-03 03:52:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:52:05] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned unsat
[2020-06-03 03:52:05] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2020-06-03 03:52:05] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:52:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:52:05] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2020-06-03 03:52:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:52:05] [INFO ] [Nat]Absence check using 30 positive place invariants in 20 ms returned unsat
[2020-06-03 03:52:05] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2020-06-03 03:52:05] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:52:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:52:05] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2020-06-03 03:52:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:52:05] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2020-06-03 03:52:06] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-06-03 03:52:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:52:06] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2020-06-03 03:52:06] [INFO ] Deduced a trap composed of 10 places in 47 ms
[2020-06-03 03:52:06] [INFO ] Deduced a trap composed of 21 places in 77 ms
[2020-06-03 03:52:06] [INFO ] Deduced a trap composed of 8 places in 36 ms
[2020-06-03 03:52:06] [INFO ] Deduced a trap composed of 19 places in 50 ms
[2020-06-03 03:52:06] [INFO ] Deduced a trap composed of 20 places in 32 ms
[2020-06-03 03:52:06] [INFO ] Deduced a trap composed of 18 places in 33 ms
[2020-06-03 03:52:06] [INFO ] Deduced a trap composed of 29 places in 34 ms
[2020-06-03 03:52:06] [INFO ] Deduced a trap composed of 12 places in 34 ms
[2020-06-03 03:52:06] [INFO ] Deduced a trap composed of 17 places in 32 ms
[2020-06-03 03:52:06] [INFO ] Deduced a trap composed of 33 places in 32 ms
[2020-06-03 03:52:06] [INFO ] Deduced a trap composed of 28 places in 32 ms
[2020-06-03 03:52:06] [INFO ] Deduced a trap composed of 33 places in 31 ms
[2020-06-03 03:52:06] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 587 ms
[2020-06-03 03:52:06] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 8 ms.
[2020-06-03 03:52:07] [INFO ] Added : 150 causal constraints over 31 iterations in 421 ms. Result :sat
[2020-06-03 03:52:07] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2020-06-03 03:52:07] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:52:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:52:07] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2020-06-03 03:52:07] [INFO ] Deduced a trap composed of 13 places in 75 ms
[2020-06-03 03:52:07] [INFO ] Deduced a trap composed of 15 places in 52 ms
[2020-06-03 03:52:07] [INFO ] Deduced a trap composed of 8 places in 65 ms
[2020-06-03 03:52:07] [INFO ] Deduced a trap composed of 60 places in 65 ms
[2020-06-03 03:52:07] [INFO ] Deduced a trap composed of 68 places in 45 ms
[2020-06-03 03:52:07] [INFO ] Deduced a trap composed of 59 places in 44 ms
[2020-06-03 03:52:07] [INFO ] Deduced a trap composed of 58 places in 43 ms
[2020-06-03 03:52:08] [INFO ] Deduced a trap composed of 61 places in 91 ms
[2020-06-03 03:52:08] [INFO ] Deduced a trap composed of 62 places in 78 ms
[2020-06-03 03:52:08] [INFO ] Deduced a trap composed of 17 places in 45 ms
[2020-06-03 03:52:08] [INFO ] Deduced a trap composed of 20 places in 53 ms
[2020-06-03 03:52:08] [INFO ] Deduced a trap composed of 59 places in 62 ms
[2020-06-03 03:52:08] [INFO ] Deduced a trap composed of 58 places in 42 ms
[2020-06-03 03:52:08] [INFO ] Deduced a trap composed of 59 places in 60 ms
[2020-06-03 03:52:08] [INFO ] Deduced a trap composed of 66 places in 41 ms
[2020-06-03 03:52:08] [INFO ] Deduced a trap composed of 65 places in 48 ms
[2020-06-03 03:52:08] [INFO ] Deduced a trap composed of 12 places in 43 ms
[2020-06-03 03:52:08] [INFO ] Deduced a trap composed of 58 places in 56 ms
[2020-06-03 03:52:08] [INFO ] Deduced a trap composed of 57 places in 40 ms
[2020-06-03 03:52:08] [INFO ] Deduced a trap composed of 27 places in 56 ms
[2020-06-03 03:52:09] [INFO ] Deduced a trap composed of 29 places in 54 ms
[2020-06-03 03:52:09] [INFO ] Deduced a trap composed of 39 places in 51 ms
[2020-06-03 03:52:09] [INFO ] Deduced a trap composed of 30 places in 52 ms
[2020-06-03 03:52:09] [INFO ] Deduced a trap composed of 40 places in 58 ms
[2020-06-03 03:52:09] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 1781 ms
[2020-06-03 03:52:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:52:09] [INFO ] [Nat]Absence check using 30 positive place invariants in 20 ms returned sat
[2020-06-03 03:52:09] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2020-06-03 03:52:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:52:09] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2020-06-03 03:52:09] [INFO ] Deduced a trap composed of 13 places in 103 ms
[2020-06-03 03:52:13] [INFO ] Deduced a trap composed of 12 places in 3494 ms
[2020-06-03 03:52:13] [INFO ] Deduced a trap composed of 8 places in 59 ms
[2020-06-03 03:52:13] [INFO ] Deduced a trap composed of 17 places in 56 ms
[2020-06-03 03:52:14] [INFO ] Deduced a trap composed of 8 places in 1373 ms
[2020-06-03 03:52:14] [INFO ] Deduced a trap composed of 41 places in 42 ms
[2020-06-03 03:52:14] [INFO ] Deduced a trap composed of 21 places in 107 ms
[2020-06-03 03:52:14] [INFO ] Deduced a trap composed of 24 places in 44 ms
[2020-06-03 03:52:14] [INFO ] Deduced a trap composed of 38 places in 39 ms
[2020-06-03 03:52:14] [INFO ] Deduced a trap composed of 56 places in 44 ms
[2020-06-03 03:52:14] [INFO ] Deduced a trap composed of 57 places in 73 ms
[2020-06-03 03:52:15] [INFO ] Deduced a trap composed of 36 places in 38 ms
[2020-06-03 03:52:15] [INFO ] Deduced a trap composed of 37 places in 37 ms
[2020-06-03 03:52:15] [INFO ] Deduced a trap composed of 15 places in 52 ms
[2020-06-03 03:52:15] [INFO ] Deduced a trap composed of 18 places in 38 ms
[2020-06-03 03:52:15] [INFO ] Deduced a trap composed of 30 places in 92 ms
[2020-06-03 03:52:15] [INFO ] Deduced a trap composed of 36 places in 39 ms
[2020-06-03 03:52:15] [INFO ] Deduced a trap composed of 36 places in 33 ms
[2020-06-03 03:52:15] [INFO ] Deduced a trap composed of 65 places in 39 ms
[2020-06-03 03:52:15] [INFO ] Deduced a trap composed of 61 places in 62 ms
[2020-06-03 03:52:15] [INFO ] Deduced a trap composed of 66 places in 50 ms
[2020-06-03 03:52:15] [INFO ] Deduced a trap composed of 57 places in 94 ms
[2020-06-03 03:52:15] [INFO ] Deduced a trap composed of 17 places in 74 ms
[2020-06-03 03:52:15] [INFO ] Deduced a trap composed of 31 places in 38 ms
[2020-06-03 03:52:15] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 6385 ms
[2020-06-03 03:52:15] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 6 ms.
[2020-06-03 03:52:16] [INFO ] Added : 145 causal constraints over 30 iterations in 486 ms. Result :sat
[2020-06-03 03:52:16] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2020-06-03 03:52:16] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 8 ms returned sat
[2020-06-03 03:52:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:52:16] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2020-06-03 03:52:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:52:16] [INFO ] [Nat]Absence check using 30 positive place invariants in 42 ms returned sat
[2020-06-03 03:52:16] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-06-03 03:52:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:52:17] [INFO ] [Nat]Absence check using state equation in 428 ms returned sat
[2020-06-03 03:52:17] [INFO ] Deduced a trap composed of 13 places in 151 ms
[2020-06-03 03:52:17] [INFO ] Deduced a trap composed of 20 places in 137 ms
[2020-06-03 03:52:17] [INFO ] Deduced a trap composed of 17 places in 202 ms
[2020-06-03 03:52:17] [INFO ] Deduced a trap composed of 8 places in 90 ms
[2020-06-03 03:52:17] [INFO ] Deduced a trap composed of 27 places in 149 ms
[2020-06-03 03:52:17] [INFO ] Deduced a trap composed of 27 places in 89 ms
[2020-06-03 03:52:18] [INFO ] Deduced a trap composed of 12 places in 157 ms
[2020-06-03 03:52:18] [INFO ] Deduced a trap composed of 33 places in 147 ms
[2020-06-03 03:52:18] [INFO ] Deduced a trap composed of 26 places in 82 ms
[2020-06-03 03:52:18] [INFO ] Deduced a trap composed of 30 places in 166 ms
[2020-06-03 03:52:18] [INFO ] Deduced a trap composed of 63 places in 70 ms
[2020-06-03 03:52:18] [INFO ] Deduced a trap composed of 61 places in 97 ms
[2020-06-03 03:52:18] [INFO ] Deduced a trap composed of 41 places in 124 ms
[2020-06-03 03:52:19] [INFO ] Deduced a trap composed of 58 places in 163 ms
[2020-06-03 03:52:19] [INFO ] Deduced a trap composed of 24 places in 349 ms
[2020-06-03 03:52:19] [INFO ] Deduced a trap composed of 62 places in 69 ms
[2020-06-03 03:52:19] [INFO ] Deduced a trap composed of 57 places in 431 ms
[2020-06-03 03:52:20] [INFO ] Deduced a trap composed of 61 places in 62 ms
[2020-06-03 03:52:20] [INFO ] Deduced a trap composed of 28 places in 177 ms
[2020-06-03 03:52:20] [INFO ] Deduced a trap composed of 63 places in 503 ms
[2020-06-03 03:52:20] [INFO ] Deduced a trap composed of 15 places in 49 ms
[2020-06-03 03:52:20] [INFO ] Deduced a trap composed of 18 places in 63 ms
[2020-06-03 03:52:20] [INFO ] Deduced a trap composed of 66 places in 35 ms
[2020-06-03 03:52:21] [INFO ] Deduced a trap composed of 63 places in 30 ms
[2020-06-03 03:52:21] [INFO ] Deduced a trap composed of 35 places in 31 ms
[2020-06-03 03:52:21] [INFO ] Deduced a trap composed of 59 places in 33 ms
[2020-06-03 03:52:21] [INFO ] Deduced a trap composed of 36 places in 32 ms
[2020-06-03 03:52:21] [INFO ] Deduced a trap composed of 40 places in 32 ms
[2020-06-03 03:52:21] [INFO ] Deduced a trap composed of 55 places in 34 ms
[2020-06-03 03:52:21] [INFO ] Deduced a trap composed of 59 places in 63 ms
[2020-06-03 03:52:21] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 4254 ms
[2020-06-03 03:52:21] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 8 ms.
[2020-06-03 03:52:21] [INFO ] Added : 146 causal constraints over 30 iterations in 427 ms. Result :sat
[2020-06-03 03:52:21] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2020-06-03 03:52:21] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-06-03 03:52:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:52:21] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2020-06-03 03:52:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:52:21] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2020-06-03 03:52:21] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:52:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:52:22] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2020-06-03 03:52:22] [INFO ] Deduced a trap composed of 8 places in 36 ms
[2020-06-03 03:52:22] [INFO ] Deduced a trap composed of 11 places in 30 ms
[2020-06-03 03:52:22] [INFO ] Deduced a trap composed of 16 places in 26 ms
[2020-06-03 03:52:22] [INFO ] Deduced a trap composed of 12 places in 26 ms
[2020-06-03 03:52:22] [INFO ] Deduced a trap composed of 19 places in 26 ms
[2020-06-03 03:52:22] [INFO ] Deduced a trap composed of 15 places in 40 ms
[2020-06-03 03:52:22] [INFO ] Deduced a trap composed of 17 places in 71 ms
[2020-06-03 03:52:22] [INFO ] Deduced a trap composed of 26 places in 34 ms
[2020-06-03 03:52:22] [INFO ] Deduced a trap composed of 21 places in 29 ms
[2020-06-03 03:52:22] [INFO ] Deduced a trap composed of 21 places in 60 ms
[2020-06-03 03:52:22] [INFO ] Deduced a trap composed of 18 places in 30 ms
[2020-06-03 03:52:22] [INFO ] Deduced a trap composed of 24 places in 30 ms
[2020-06-03 03:52:22] [INFO ] Deduced a trap composed of 18 places in 27 ms
[2020-06-03 03:52:22] [INFO ] Deduced a trap composed of 28 places in 22 ms
[2020-06-03 03:52:22] [INFO ] Deduced a trap composed of 30 places in 23 ms
[2020-06-03 03:52:22] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 624 ms
[2020-06-03 03:52:22] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 7 ms.
[2020-06-03 03:52:23] [INFO ] Added : 150 causal constraints over 31 iterations in 401 ms. Result :sat
[2020-06-03 03:52:23] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2020-06-03 03:52:23] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:52:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:52:23] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2020-06-03 03:52:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:52:23] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2020-06-03 03:52:23] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:52:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:52:23] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2020-06-03 03:52:23] [INFO ] Deduced a trap composed of 8 places in 19 ms
[2020-06-03 03:52:23] [INFO ] Deduced a trap composed of 11 places in 21 ms
[2020-06-03 03:52:23] [INFO ] Deduced a trap composed of 17 places in 18 ms
[2020-06-03 03:52:23] [INFO ] Deduced a trap composed of 19 places in 20 ms
[2020-06-03 03:52:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 127 ms
[2020-06-03 03:52:23] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 7 ms.
[2020-06-03 03:52:24] [INFO ] Added : 149 causal constraints over 31 iterations in 440 ms. Result :sat
[2020-06-03 03:52:24] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2020-06-03 03:52:24] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-06-03 03:52:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:52:24] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2020-06-03 03:52:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:52:24] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned unsat
[2020-06-03 03:52:24] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2020-06-03 03:52:24] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:52:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:52:24] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2020-06-03 03:52:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:52:24] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned unsat
[2020-06-03 03:52:24] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2020-06-03 03:52:24] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-06-03 03:52:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:52:24] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2020-06-03 03:52:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:52:24] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned unsat
[2020-06-03 03:52:24] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2020-06-03 03:52:24] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-06-03 03:52:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:52:25] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2020-06-03 03:52:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:52:25] [INFO ] [Nat]Absence check using 30 positive place invariants in 11 ms returned unsat
[2020-06-03 03:52:25] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2020-06-03 03:52:25] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:52:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:52:25] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2020-06-03 03:52:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:52:25] [INFO ] [Nat]Absence check using 30 positive place invariants in 35 ms returned sat
[2020-06-03 03:52:25] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:52:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:52:25] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2020-06-03 03:52:25] [INFO ] Deduced a trap composed of 17 places in 46 ms
[2020-06-03 03:52:25] [INFO ] Deduced a trap composed of 8 places in 42 ms
[2020-06-03 03:52:25] [INFO ] Deduced a trap composed of 17 places in 50 ms
[2020-06-03 03:52:25] [INFO ] Deduced a trap composed of 56 places in 43 ms
[2020-06-03 03:52:25] [INFO ] Deduced a trap composed of 60 places in 38 ms
[2020-06-03 03:52:25] [INFO ] Deduced a trap composed of 12 places in 53 ms
[2020-06-03 03:52:25] [INFO ] Deduced a trap composed of 16 places in 40 ms
[2020-06-03 03:52:25] [INFO ] Deduced a trap composed of 23 places in 49 ms
[2020-06-03 03:52:25] [INFO ] Deduced a trap composed of 18 places in 39 ms
[2020-06-03 03:52:26] [INFO ] Deduced a trap composed of 53 places in 39 ms
[2020-06-03 03:52:26] [INFO ] Deduced a trap composed of 22 places in 38 ms
[2020-06-03 03:52:26] [INFO ] Deduced a trap composed of 23 places in 51 ms
[2020-06-03 03:52:26] [INFO ] Deduced a trap composed of 64 places in 42 ms
[2020-06-03 03:52:26] [INFO ] Deduced a trap composed of 55 places in 38 ms
[2020-06-03 03:52:26] [INFO ] Deduced a trap composed of 16 places in 38 ms
[2020-06-03 03:52:26] [INFO ] Deduced a trap composed of 59 places in 51 ms
[2020-06-03 03:52:26] [INFO ] Deduced a trap composed of 16 places in 41 ms
[2020-06-03 03:52:26] [INFO ] Deduced a trap composed of 17 places in 47 ms
[2020-06-03 03:52:26] [INFO ] Deduced a trap composed of 19 places in 38 ms
[2020-06-03 03:52:26] [INFO ] Deduced a trap composed of 58 places in 48 ms
[2020-06-03 03:52:26] [INFO ] Deduced a trap composed of 61 places in 47 ms
[2020-06-03 03:52:26] [INFO ] Deduced a trap composed of 60 places in 41 ms
[2020-06-03 03:52:26] [INFO ] Deduced a trap composed of 59 places in 38 ms
[2020-06-03 03:52:26] [INFO ] Deduced a trap composed of 58 places in 38 ms
[2020-06-03 03:52:26] [INFO ] Deduced a trap composed of 58 places in 43 ms
[2020-06-03 03:52:26] [INFO ] Deduced a trap composed of 58 places in 40 ms
[2020-06-03 03:52:26] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 1342 ms
[2020-06-03 03:52:26] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 9 ms.
[2020-06-03 03:52:27] [INFO ] Added : 158 causal constraints over 33 iterations in 544 ms. Result :sat
[2020-06-03 03:52:27] [INFO ] Deduced a trap composed of 63 places in 50 ms
[2020-06-03 03:52:27] [INFO ] Deduced a trap composed of 65 places in 45 ms
[2020-06-03 03:52:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 146 ms
[2020-06-03 03:52:27] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2020-06-03 03:52:27] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:52:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:52:27] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2020-06-03 03:52:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:52:27] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned unsat
[2020-06-03 03:52:27] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2020-06-03 03:52:27] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 7 ms returned sat
[2020-06-03 03:52:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:52:27] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2020-06-03 03:52:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:52:28] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned unsat
[2020-06-03 03:52:28] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2020-06-03 03:52:28] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-06-03 03:52:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:52:28] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2020-06-03 03:52:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:52:28] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2020-06-03 03:52:28] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:52:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:52:28] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2020-06-03 03:52:28] [INFO ] Deduced a trap composed of 8 places in 54 ms
[2020-06-03 03:52:28] [INFO ] Deduced a trap composed of 17 places in 55 ms
[2020-06-03 03:52:28] [INFO ] Deduced a trap composed of 11 places in 47 ms
[2020-06-03 03:52:28] [INFO ] Deduced a trap composed of 12 places in 45 ms
[2020-06-03 03:52:28] [INFO ] Deduced a trap composed of 23 places in 45 ms
[2020-06-03 03:52:28] [INFO ] Deduced a trap composed of 10 places in 43 ms
[2020-06-03 03:52:28] [INFO ] Deduced a trap composed of 18 places in 43 ms
[2020-06-03 03:52:28] [INFO ] Deduced a trap composed of 42 places in 43 ms
[2020-06-03 03:52:28] [INFO ] Deduced a trap composed of 36 places in 48 ms
[2020-06-03 03:52:28] [INFO ] Deduced a trap composed of 57 places in 42 ms
[2020-06-03 03:52:29] [INFO ] Deduced a trap composed of 60 places in 37 ms
[2020-06-03 03:52:29] [INFO ] Deduced a trap composed of 61 places in 55 ms
[2020-06-03 03:52:29] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 665 ms
[2020-06-03 03:52:29] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 8 ms.
[2020-06-03 03:52:29] [INFO ] Added : 142 causal constraints over 30 iterations in 411 ms. Result :sat
[2020-06-03 03:52:29] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2020-06-03 03:52:29] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:52:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:52:29] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2020-06-03 03:52:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:52:29] [INFO ] [Nat]Absence check using 30 positive place invariants in 20 ms returned sat
[2020-06-03 03:52:29] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 16 ms returned sat
[2020-06-03 03:52:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:52:29] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2020-06-03 03:52:29] [INFO ] Deduced a trap composed of 8 places in 43 ms
[2020-06-03 03:52:29] [INFO ] Deduced a trap composed of 12 places in 32 ms
[2020-06-03 03:52:30] [INFO ] Deduced a trap composed of 16 places in 28 ms
[2020-06-03 03:52:30] [INFO ] Deduced a trap composed of 19 places in 27 ms
[2020-06-03 03:52:30] [INFO ] Deduced a trap composed of 17 places in 28 ms
[2020-06-03 03:52:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 210 ms
[2020-06-03 03:52:30] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 12 ms.
[2020-06-03 03:52:30] [INFO ] Added : 122 causal constraints over 26 iterations in 352 ms. Result :sat
[2020-06-03 03:52:30] [INFO ] Deduced a trap composed of 63 places in 50 ms
[2020-06-03 03:52:30] [INFO ] Deduced a trap composed of 67 places in 44 ms
[2020-06-03 03:52:30] [INFO ] Deduced a trap composed of 55 places in 42 ms
[2020-06-03 03:52:30] [INFO ] Deduced a trap composed of 57 places in 44 ms
[2020-06-03 03:52:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 286 ms
Successfully simplified 8 atomic propositions for a total of 8 simplifications.
[2020-06-03 03:52:30] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-03 03:52:30] [INFO ] Flatten gal took : 57 ms
FORMULA BusinessProcesses-PT-02-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 03:52:30] [INFO ] Applying decomposition
[2020-06-03 03:52:30] [INFO ] Flatten gal took : 12 ms
[2020-06-03 03:52:31] [INFO ] Decomposing Gal with order
[2020-06-03 03:52:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 03:52:31] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-03 03:52:31] [INFO ] Flatten gal took : 33 ms
[2020-06-03 03:52:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2020-06-03 03:52:31] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA BusinessProcesses-PT-02-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 03:52:31] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-03 03:52:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ BusinessProcesses-PT-02 @ 3570 seconds

FORMULA BusinessProcesses-PT-02-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-02-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-02-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-02-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-02-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-02-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 6101156 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16307308 kB

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is BusinessProcesses-PT-02, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r182-oct2-158987913900457"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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