Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987882800761.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 itslola
Input is DoubleExponent-PT-003, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882800761
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 3.7K Mar 31 07:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 31 07:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 30 00:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 30 00:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 28 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 27 07:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 27 07:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 50K 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 DoubleExponent-PT-003-00
FORMULA_NAME DoubleExponent-PT-003-01
FORMULA_NAME DoubleExponent-PT-003-02
FORMULA_NAME DoubleExponent-PT-003-03
FORMULA_NAME DoubleExponent-PT-003-04
FORMULA_NAME DoubleExponent-PT-003-05
FORMULA_NAME DoubleExponent-PT-003-06
FORMULA_NAME DoubleExponent-PT-003-07
FORMULA_NAME DoubleExponent-PT-003-08
FORMULA_NAME DoubleExponent-PT-003-09
FORMULA_NAME DoubleExponent-PT-003-10
FORMULA_NAME DoubleExponent-PT-003-11
FORMULA_NAME DoubleExponent-PT-003-12
FORMULA_NAME DoubleExponent-PT-003-13
FORMULA_NAME DoubleExponent-PT-003-14
FORMULA_NAME DoubleExponent-PT-003-15

=== Now, execution of the tool begins

BK_START 1591239118787

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 02:52:01] [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-04 02:52:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 02:52:01] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2020-06-04 02:52:01] [INFO ] Transformed 163 places.
[2020-06-04 02:52:01] [INFO ] Transformed 148 transitions.
[2020-06-04 02:52:01] [INFO ] Parsed PT model containing 163 places and 148 transitions in 112 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 57 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 3322 resets, run finished after 240 ms. (steps per millisecond=416 ) properties seen :[1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1]
// Phase 1: matrix 148 rows 163 cols
[2020-06-04 02:52:01] [INFO ] Computed 19 place invariants in 45 ms
[2020-06-04 02:52:02] [INFO ] [Real]Absence check using 5 positive place invariants in 23 ms returned unsat
[2020-06-04 02:52:02] [INFO ] [Real]Absence check using 5 positive place invariants in 38 ms returned sat
[2020-06-04 02:52:02] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 53 ms returned sat
[2020-06-04 02:52:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:02] [INFO ] [Real]Absence check using state equation in 542 ms returned sat
[2020-06-04 02:52:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 17 ms returned sat
[2020-06-04 02:52:02] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-06-04 02:52:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:02] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2020-06-04 02:52:03] [INFO ] Deduced a trap composed of 18 places in 249 ms
[2020-06-04 02:52:03] [INFO ] Deduced a trap composed of 37 places in 38 ms
[2020-06-04 02:52:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 347 ms
[2020-06-04 02:52:03] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 15 ms.
[2020-06-04 02:52:03] [INFO ] Added : 141 causal constraints over 30 iterations in 475 ms. Result :sat
[2020-06-04 02:52:03] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2020-06-04 02:52:03] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2020-06-04 02:52:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:03] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2020-06-04 02:52:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 19 ms returned sat
[2020-06-04 02:52:04] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2020-06-04 02:52:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:04] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2020-06-04 02:52:04] [INFO ] Deduced a trap composed of 18 places in 51 ms
[2020-06-04 02:52:04] [INFO ] Deduced a trap composed of 37 places in 23 ms
[2020-06-04 02:52:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2020-06-04 02:52:04] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 18 ms.
[2020-06-04 02:52:04] [INFO ] Added : 141 causal constraints over 30 iterations in 474 ms. Result :sat
[2020-06-04 02:52:04] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2020-06-04 02:52:04] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2020-06-04 02:52:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:04] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2020-06-04 02:52:04] [INFO ] Deduced a trap composed of 74 places in 65 ms
[2020-06-04 02:52:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2020-06-04 02:52:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 20 ms returned sat
[2020-06-04 02:52:05] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 8 ms returned sat
[2020-06-04 02:52:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:05] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2020-06-04 02:52:05] [INFO ] Deduced a trap composed of 74 places in 66 ms
[2020-06-04 02:52:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2020-06-04 02:52:05] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 18 ms.
[2020-06-04 02:52:05] [INFO ] Added : 145 causal constraints over 30 iterations in 404 ms. Result :sat
[2020-06-04 02:52:05] [INFO ] Deduced a trap composed of 39 places in 82 ms
[2020-06-04 02:52:05] [INFO ] Deduced a trap composed of 18 places in 99 ms
[2020-06-04 02:52:05] [INFO ] Deduced a trap composed of 37 places in 64 ms
[2020-06-04 02:52:06] [INFO ] Deduced a trap composed of 25 places in 60 ms
[2020-06-04 02:52:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 396 ms
[2020-06-04 02:52:06] [INFO ] [Real]Absence check using 5 positive place invariants in 53 ms returned unsat
[2020-06-04 02:52:06] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned sat
[2020-06-04 02:52:06] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 17 ms returned sat
[2020-06-04 02:52:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:06] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2020-06-04 02:52:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 16 ms returned sat
[2020-06-04 02:52:06] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-06-04 02:52:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:06] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2020-06-04 02:52:06] [INFO ] Deduced a trap composed of 18 places in 71 ms
[2020-06-04 02:52:06] [INFO ] Deduced a trap composed of 56 places in 62 ms
[2020-06-04 02:52:06] [INFO ] Deduced a trap composed of 85 places in 66 ms
[2020-06-04 02:52:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 260 ms
[2020-06-04 02:52:06] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 6 ms.
[2020-06-04 02:52:07] [INFO ] Added : 147 causal constraints over 30 iterations in 355 ms. Result :sat
[2020-06-04 02:52:07] [INFO ] [Real]Absence check using 5 positive place invariants in 55 ms returned sat
[2020-06-04 02:52:07] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned unsat
[2020-06-04 02:52:07] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2020-06-04 02:52:07] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 18 ms returned sat
[2020-06-04 02:52:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:07] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2020-06-04 02:52:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 20 ms returned sat
[2020-06-04 02:52:07] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 8 ms returned sat
[2020-06-04 02:52:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:07] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2020-06-04 02:52:08] [INFO ] Deduced a trap composed of 18 places in 121 ms
[2020-06-04 02:52:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 126 ms
[2020-06-04 02:52:08] [INFO ] [Real]Absence check using 5 positive place invariants in 56 ms returned unsat
[2020-06-04 02:52:08] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2020-06-04 02:52:08] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 9 ms returned sat
[2020-06-04 02:52:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:08] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2020-06-04 02:52:08] [INFO ] Deduced a trap composed of 16 places in 149 ms
[2020-06-04 02:52:08] [INFO ] Deduced a trap composed of 48 places in 91 ms
[2020-06-04 02:52:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 286 ms
[2020-06-04 02:52:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 25 ms returned sat
[2020-06-04 02:52:08] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 8 ms returned sat
[2020-06-04 02:52:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:08] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2020-06-04 02:52:09] [INFO ] Deduced a trap composed of 16 places in 103 ms
[2020-06-04 02:52:09] [INFO ] Deduced a trap composed of 48 places in 55 ms
[2020-06-04 02:52:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 183 ms
[2020-06-04 02:52:09] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 11 ms.
[2020-06-04 02:52:09] [INFO ] Added : 145 causal constraints over 29 iterations in 486 ms. Result :sat
[2020-06-04 02:52:09] [INFO ] Deduced a trap composed of 56 places in 48 ms
[2020-06-04 02:52:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2020-06-04 02:52:09] [INFO ] [Real]Absence check using 5 positive place invariants in 54 ms returned unsat
[2020-06-04 02:52:09] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned unsat
[2020-06-04 02:52:09] [INFO ] [Real]Absence check using 5 positive place invariants in 21 ms returned unsat
[2020-06-04 02:52:09] [INFO ] [Real]Absence check using 5 positive place invariants in 31 ms returned sat
[2020-06-04 02:52:09] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-06-04 02:52:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:09] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2020-06-04 02:52:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 52 ms returned sat
[2020-06-04 02:52:10] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 107 ms returned sat
[2020-06-04 02:52:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:10] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2020-06-04 02:52:10] [INFO ] Deduced a trap composed of 18 places in 129 ms
[2020-06-04 02:52:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2020-06-04 02:52:10] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 19 ms.
[2020-06-04 02:52:11] [INFO ] Added : 144 causal constraints over 29 iterations in 733 ms. Result :sat
[2020-06-04 02:52:11] [INFO ] [Real]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-06-04 02:52:11] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 20 ms returned sat
[2020-06-04 02:52:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:11] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2020-06-04 02:52:11] [INFO ] Deduced a trap composed of 18 places in 124 ms
[2020-06-04 02:52:12] [INFO ] Deduced a trap composed of 67 places in 256 ms
[2020-06-04 02:52:12] [INFO ] Deduced a trap composed of 62 places in 76 ms
[2020-06-04 02:52:12] [INFO ] Deduced a trap composed of 56 places in 208 ms
[2020-06-04 02:52:12] [INFO ] Deduced a trap composed of 31 places in 89 ms
[2020-06-04 02:52:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 832 ms
[2020-06-04 02:52:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 24 ms returned sat
[2020-06-04 02:52:12] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 105 ms returned sat
[2020-06-04 02:52:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:12] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2020-06-04 02:52:12] [INFO ] Deduced a trap composed of 18 places in 52 ms
[2020-06-04 02:52:12] [INFO ] Deduced a trap composed of 67 places in 48 ms
[2020-06-04 02:52:12] [INFO ] Deduced a trap composed of 56 places in 82 ms
[2020-06-04 02:52:13] [INFO ] Deduced a trap composed of 31 places in 48 ms
[2020-06-04 02:52:13] [INFO ] Deduced a trap composed of 16 places in 73 ms
[2020-06-04 02:52:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 337 ms
[2020-06-04 02:52:13] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 9 ms.
[2020-06-04 02:52:13] [INFO ] Added : 93 causal constraints over 19 iterations in 270 ms. Result :sat
[2020-06-04 02:52:13] [INFO ] Deduced a trap composed of 73 places in 65 ms
[2020-06-04 02:52:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2020-06-04 02:52:13] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2020-06-04 02:52:13] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2020-06-04 02:52:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:13] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2020-06-04 02:52:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-06-04 02:52:13] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2020-06-04 02:52:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:13] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2020-06-04 02:52:14] [INFO ] Deduced a trap composed of 18 places in 53 ms
[2020-06-04 02:52:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2020-06-04 02:52:14] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 11 ms.
[2020-06-04 02:52:14] [INFO ] Added : 144 causal constraints over 29 iterations in 472 ms. Result :sat
[2020-06-04 02:52:14] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-06-04 02:52:14] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 9 ms returned sat
[2020-06-04 02:52:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:14] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2020-06-04 02:52:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 27 ms returned sat
[2020-06-04 02:52:14] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 8 ms returned sat
[2020-06-04 02:52:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:14] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2020-06-04 02:52:15] [INFO ] Deduced a trap composed of 18 places in 72 ms
[2020-06-04 02:52:15] [INFO ] Deduced a trap composed of 53 places in 55 ms
[2020-06-04 02:52:15] [INFO ] Deduced a trap composed of 43 places in 51 ms
[2020-06-04 02:52:15] [INFO ] Deduced a trap composed of 37 places in 56 ms
[2020-06-04 02:52:15] [INFO ] Deduced a trap composed of 42 places in 26 ms
[2020-06-04 02:52:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 332 ms
[2020-06-04 02:52:15] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 14 ms.
[2020-06-04 02:52:15] [INFO ] Added : 141 causal constraints over 29 iterations in 326 ms. Result :sat
[2020-06-04 02:52:15] [INFO ] Deduced a trap composed of 40 places in 86 ms
[2020-06-04 02:52:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2020-06-04 02:52:15] [INFO ] [Real]Absence check using 5 positive place invariants in 54 ms returned unsat
[2020-06-04 02:52:15] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-06-04 02:52:15] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 9 ms returned sat
[2020-06-04 02:52:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:16] [INFO ] [Real]Absence check using state equation in 541 ms returned sat
[2020-06-04 02:52:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 24 ms returned sat
[2020-06-04 02:52:16] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2020-06-04 02:52:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:16] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2020-06-04 02:52:16] [INFO ] Deduced a trap composed of 18 places in 78 ms
[2020-06-04 02:52:16] [INFO ] Deduced a trap composed of 47 places in 93 ms
[2020-06-04 02:52:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 215 ms
[2020-06-04 02:52:16] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 13 ms.
[2020-06-04 02:52:17] [INFO ] Added : 100 causal constraints over 20 iterations in 297 ms. Result :sat
[2020-06-04 02:52:17] [INFO ] [Real]Absence check using 5 positive place invariants in 22 ms returned sat
[2020-06-04 02:52:17] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 28 ms returned sat
[2020-06-04 02:52:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:17] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2020-06-04 02:52:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 29 ms returned sat
[2020-06-04 02:52:17] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 11 ms returned sat
[2020-06-04 02:52:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:17] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2020-06-04 02:52:18] [INFO ] Deduced a trap composed of 53 places in 522 ms
[2020-06-04 02:52:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 547 ms
[2020-06-04 02:52:18] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 14 ms.
[2020-06-04 02:52:18] [INFO ] Added : 38 causal constraints over 8 iterations in 186 ms. Result :sat
[2020-06-04 02:52:18] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
Successfully simplified 10 atomic propositions for a total of 12 simplifications.
[2020-06-04 02:52:19] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-04 02:52:19] [INFO ] Flatten gal took : 97 ms
FORMULA DoubleExponent-PT-003-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 02:52:19] [INFO ] Flatten gal took : 25 ms
[2020-06-04 02:52:19] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 9 ms.
[2020-06-04 02:52:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ DoubleExponent-PT-003 @ 3570 seconds

FORMULA DoubleExponent-PT-003-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3552
rslt: Output for LTLCardinality @ DoubleExponent-PT-003

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 02:52:19 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((F ((2 <= p141)) U (G ((X ((2 <= p141)) OR (2 <= p141))) AND X ((p99 <= p136)))))",
"processed_size": 84,
"rewrites": 38
},
"result":
{
"edges": 39,
"markings": 38,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F (((1 <= p92) OR (p116 + 1 <= p139))))",
"processed_size": 43,
"rewrites": 38
},
"result":
{
"edges": 39,
"markings": 39,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((p127 + 1 <= p82)))",
"processed_size": 25,
"rewrites": 38
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p118 <= 2)",
"processed_size": 11,
"rewrites": 40
},
"result":
{
"edges": 28,
"markings": 29,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((p94 + 1 <= p91)))",
"processed_size": 24,
"rewrites": 38
},
"result":
{
"edges": 31,
"markings": 30,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((p47 + 1 <= p94)))",
"processed_size": 24,
"rewrites": 38
},
"result":
{
"edges": 31,
"markings": 30,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((p50 <= p44))",
"processed_size": 16,
"rewrites": 38
},
"result":
{
"edges": 157573,
"markings": 142474,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p115 <= p54)",
"processed_size": 13,
"rewrites": 38
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((p23 <= 0)))",
"processed_size": 18,
"rewrites": 38
},
"result":
{
"edges": 41,
"markings": 40,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p136 <= p94)",
"processed_size": 13,
"rewrites": 40
},
"result":
{
"edges": 28,
"markings": 29,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p136 <= p94)",
"processed_size": 13,
"rewrites": 40
},
"result":
{
"edges": 28,
"markings": 29,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((p92 + 1 <= p143))",
"processed_size": 21,
"rewrites": 38
},
"result":
{
"edges": 29,
"markings": 29,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((p87 <= p81)))",
"processed_size": 20,
"rewrites": 38
},
"result":
{
"edges": 2683425,
"markings": 2429254,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((p87 <= p81)))",
"processed_size": 20,
"rewrites": 38
},
"result":
{
"edges": 2683425,
"markings": 2429254,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 21212,
"runtime": 17.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(G(F(**)) AND **) : F(G(*)) : X((F(**) U (G((X(**) OR **)) AND X(**)))) : X(F(**)) : F(**) : G(**) : F(G(*)) : ((G(F(*)) AND (F(*) OR G(F(*)))) OR G(**)) : X(G(*))"
},
"net":
{
"arcs": 417,
"conflict_clusters": 109,
"places": 163,
"places_significant": 144,
"singleton_clusters": 0,
"transitions": 148
},
"result":
{
"preliminary_value": "no no no no no no no yes no ",
"value": "no no no no no no no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 311/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 5216
lola: finding significant places
lola: 163 places, 148 transitions, 144 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: (G (F ((p23 <= 0))) AND (p115 <= p54)) : F (G (NOT(((0 <= 0) U (p94 <= p47))))) : X ((F ((2 <= p141)) U (G ((X ((2 <= p141)) OR (2 <= p141))) AND X ((p99 <= p136))))) : F (X (((1 <= p92) OR (p116 + 1 <= p139)))) : F ((NOT(((1 <= p97) U (p68 <= p52))) U F ((3 <= p118)))) : G ((p50 <= p44)) : F (NOT(X (G (F (X (F (((p48 <= p64) U (p91 <= p94))))))))) : (NOT((G ((p136 <= p94)) U F (G ((p81 + 1 <= p87))))) OR G ((p92 + 1 <= p143))) : X (NOT(((p119 <= p31) U ((0 <= 0) U (p82 <= p127)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((2 <= p141)) U (G ((X ((2 <= p141)) OR (2 <= p141))) AND X ((p99 <= p136)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((2 <= p141)) U (G ((X ((2 <= p141)) OR (2 <= p141))) AND X ((p99 <= p136)))))
lola: processed formula length: 84
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 38 markings, 39 edges
lola: ========================================
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p92) OR (p116 + 1 <= p139))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p92) OR (p116 + 1 <= p139))))
lola: processed formula length: 43
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 39 markings, 39 edges
lola: ========================================
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p127 + 1 <= p82)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p127 + 1 <= p82)))
lola: processed formula length: 25
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 25 edges
lola: ========================================
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((3 <= p118))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p118 <= 2)
lola: processed formula length: 11
lola: 40 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 29 markings, 28 edges
lola: ========================================
lola: subprocess 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p94 + 1 <= p91)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p94 + 1 <= p91)))
lola: processed formula length: 24
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 30 markings, 31 edges
lola: ========================================
lola: subprocess 5 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p47 + 1 <= p94)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p47 + 1 <= p94)))
lola: processed formula length: 24
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 30 markings, 31 edges
lola: ========================================
lola: subprocess 6 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p50 <= p44))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p50 <= p44))
lola: processed formula length: 16
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 142474 markings, 157573 edges
lola: ========================================
lola: subprocess 7 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((p23 <= 0))) AND (p115 <= p54))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p115 <= p54)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p115 <= p54)
lola: processed formula length: 13
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p23 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p23 <= 0)))
lola: processed formula length: 18
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 40 markings, 41 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G (F ((p87 <= p81))) AND (F ((p94 + 1 <= p136)) OR G (F ((p87 <= p81))))) OR G ((p92 + 1 <= p143)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p94 + 1 <= p136))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p136 <= p94)
lola: processed formula length: 13
lola: 40 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 29 markings, 28 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p87 <= p81)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p87 <= p81)))
lola: processed formula length: 20
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: no no no no no no no unknown no
lola: memory consumption: 69792 KB
lola: time consumption: 5 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p87 <= p81)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p87 <= p81)))
lola: processed formula length: 20
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: no no no no no no no unknown no
lola: memory consumption: 65780 KB
lola: time consumption: 6 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((G (F ((p87 <= p81))) AND (F ((p94 + 1 <= p136)) OR G (F ((p87 <= p81))))) OR G ((p92 + 1 <= p143)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F ((p94 + 1 <= p136))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p136 <= p94)
lola: processed formula length: 13
lola: 40 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 29 markings, 28 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((p92 + 1 <= p143))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p92 + 1 <= p143))
lola: processed formula length: 21
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 29 markings, 29 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((p87 <= p81)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p87 <= p81)))
lola: processed formula length: 20
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 2094025 markings, 2312495 edges, 418805 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2429254 markings, 2683425 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((p87 <= p81)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p87 <= p81)))
lola: processed formula length: 20
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 2057038 markings, 2271633 edges, 411408 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2429254 markings, 2683425 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: RESULT
lola:
SUMMARY: no no no no no no no yes no
lola:
preliminary result: no no no no no no no yes no
lola: ========================================
lola: memory consumption: 21212 KB
lola: time consumption: 17 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

--------------------
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="DoubleExponent-PT-003"
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 DoubleExponent-PT-003, 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 r178-tajo-158987882800761"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-003.tgz
mv DoubleExponent-PT-003 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 ;