fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r066-tajo-158922814800771
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for DoubleExponent-PT-004

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15740.200 3600000.00 3687308.00 2507.20 F?F??F?????????? normal

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.r066-tajo-158922814800771.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 itstools
Input is DoubleExponent-PT-004, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814800771
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 3.6K Mar 31 07:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 31 07:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 30 00:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.3K 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 1.9K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 28 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 27 07:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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 67K 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-004-CTLCardinality-00
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-01
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-02
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-03
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-04
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-05
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-06
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-07
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-08
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-09
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-10
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-11
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-12
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-13
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-14
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1590134845235

[2020-05-22 08:07:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-22 08:07:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 08:07:28] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2020-05-22 08:07:28] [INFO ] Transformed 216 places.
[2020-05-22 08:07:28] [INFO ] Transformed 198 transitions.
[2020-05-22 08:07:28] [INFO ] Parsed PT model containing 216 places and 198 transitions in 184 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 42 ms.
Incomplete random walk after 100000 steps, including 3336 resets, run finished after 410 ms. (steps per millisecond=243 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0]
// Phase 1: matrix 198 rows 216 cols
[2020-05-22 08:07:28] [INFO ] Computed 24 place invariants in 29 ms
[2020-05-22 08:07:28] [INFO ] [Real]Absence check using 3 positive place invariants in 27 ms returned unsat
[2020-05-22 08:07:29] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-05-22 08:07:29] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 13 ms returned sat
[2020-05-22 08:07:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:07:29] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2020-05-22 08:07:29] [INFO ] Deduced a trap composed of 83 places in 246 ms
[2020-05-22 08:07:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 391 ms
[2020-05-22 08:07:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:07:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 16 ms returned sat
[2020-05-22 08:07:29] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 14 ms returned sat
[2020-05-22 08:07:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:07:30] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2020-05-22 08:07:30] [INFO ] Deduced a trap composed of 83 places in 254 ms
[2020-05-22 08:07:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 295 ms
[2020-05-22 08:07:30] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 27 ms.
[2020-05-22 08:07:31] [INFO ] Added : 195 causal constraints over 39 iterations in 1032 ms. Result :sat
[2020-05-22 08:07:32] [INFO ] Deduced a trap composed of 73 places in 1123 ms
[2020-05-22 08:07:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1164 ms
[2020-05-22 08:07:32] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-05-22 08:07:32] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 28 ms returned sat
[2020-05-22 08:07:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:07:32] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2020-05-22 08:07:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:07:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2020-05-22 08:07:32] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 30 ms returned sat
[2020-05-22 08:07:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:07:33] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2020-05-22 08:07:33] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 16 ms.
[2020-05-22 08:07:33] [INFO ] Added : 193 causal constraints over 40 iterations in 880 ms. Result :sat
[2020-05-22 08:07:34] [INFO ] [Real]Absence check using 3 positive place invariants in 22 ms returned unsat
[2020-05-22 08:07:34] [INFO ] [Real]Absence check using 3 positive place invariants in 21 ms returned sat
[2020-05-22 08:07:34] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 52 ms returned sat
[2020-05-22 08:07:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:07:34] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2020-05-22 08:07:34] [INFO ] Deduced a trap composed of 74 places in 168 ms
[2020-05-22 08:07:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2020-05-22 08:07:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:07:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2020-05-22 08:07:34] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 17 ms returned sat
[2020-05-22 08:07:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:07:34] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2020-05-22 08:07:35] [INFO ] Deduced a trap composed of 74 places in 99 ms
[2020-05-22 08:07:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2020-05-22 08:07:35] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 27 ms.
[2020-05-22 08:07:36] [INFO ] Added : 195 causal constraints over 39 iterations in 963 ms. Result :sat
[2020-05-22 08:07:36] [INFO ] Deduced a trap composed of 101 places in 120 ms
[2020-05-22 08:07:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2020-05-22 08:07:36] [INFO ] [Real]Absence check using 3 positive place invariants in 38 ms returned sat
[2020-05-22 08:07:36] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 104 ms returned sat
[2020-05-22 08:07:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:07:36] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2020-05-22 08:07:36] [INFO ] Deduced a trap composed of 41 places in 111 ms
[2020-05-22 08:07:37] [INFO ] Deduced a trap composed of 67 places in 217 ms
[2020-05-22 08:07:37] [INFO ] Deduced a trap composed of 43 places in 83 ms
[2020-05-22 08:07:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 551 ms
[2020-05-22 08:07:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:07:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-05-22 08:07:37] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 20 ms returned sat
[2020-05-22 08:07:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:07:38] [INFO ] [Nat]Absence check using state equation in 801 ms returned sat
[2020-05-22 08:07:38] [INFO ] Deduced a trap composed of 41 places in 121 ms
[2020-05-22 08:07:38] [INFO ] Deduced a trap composed of 77 places in 126 ms
[2020-05-22 08:07:38] [INFO ] Deduced a trap composed of 43 places in 55 ms
[2020-05-22 08:07:38] [INFO ] Deduced a trap composed of 55 places in 28 ms
[2020-05-22 08:07:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 421 ms
[2020-05-22 08:07:38] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 13 ms.
[2020-05-22 08:07:39] [INFO ] Added : 190 causal constraints over 39 iterations in 610 ms. Result :sat
[2020-05-22 08:07:39] [INFO ] Deduced a trap composed of 47 places in 164 ms
[2020-05-22 08:07:39] [INFO ] Deduced a trap composed of 89 places in 78 ms
[2020-05-22 08:07:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 334 ms
[2020-05-22 08:07:39] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-05-22 08:07:39] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 18 ms returned sat
[2020-05-22 08:07:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:07:39] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2020-05-22 08:07:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:07:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2020-05-22 08:07:40] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 14 ms returned sat
[2020-05-22 08:07:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:07:40] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2020-05-22 08:07:40] [INFO ] Deduced a trap composed of 64 places in 62 ms
[2020-05-22 08:07:40] [INFO ] Deduced a trap composed of 43 places in 79 ms
[2020-05-22 08:07:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 179 ms
[2020-05-22 08:07:40] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 43 ms.
[2020-05-22 08:07:41] [INFO ] Added : 153 causal constraints over 31 iterations in 785 ms. Result :sat
[2020-05-22 08:07:41] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-05-22 08:07:41] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 13 ms returned sat
[2020-05-22 08:07:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:07:41] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2020-05-22 08:07:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:07:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 20 ms returned sat
[2020-05-22 08:07:41] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 54 ms returned sat
[2020-05-22 08:07:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:07:43] [INFO ] [Nat]Absence check using state equation in 1452 ms returned sat
[2020-05-22 08:07:44] [INFO ] Deduced a trap composed of 81 places in 1757 ms
[2020-05-22 08:07:46] [INFO ] Deduced a trap composed of 58 places in 1671 ms
[2020-05-22 08:07:46] [INFO ] Deduced a trap composed of 73 places in 98 ms
[2020-05-22 08:07:46] [INFO ] Deduced a trap composed of 73 places in 80 ms
[2020-05-22 08:07:46] [INFO ] Deduced a trap composed of 92 places in 102 ms
[2020-05-22 08:07:47] [INFO ] Deduced a trap composed of 99 places in 82 ms
[2020-05-22 08:07:47] [INFO ] Deduced a trap composed of 58 places in 90 ms
[2020-05-22 08:07:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4048 ms
[2020-05-22 08:07:47] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 12 ms.
[2020-05-22 08:07:48] [INFO ] Added : 189 causal constraints over 38 iterations in 1439 ms. Result :sat
[2020-05-22 08:07:48] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-05-22 08:07:48] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 71 ms returned sat
[2020-05-22 08:07:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:07:48] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2020-05-22 08:07:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:07:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 17 ms returned sat
[2020-05-22 08:07:49] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 17 ms returned sat
[2020-05-22 08:07:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:07:49] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2020-05-22 08:07:49] [INFO ] Deduced a trap composed of 29 places in 159 ms
[2020-05-22 08:07:49] [INFO ] Deduced a trap composed of 69 places in 113 ms
[2020-05-22 08:07:49] [INFO ] Deduced a trap composed of 74 places in 106 ms
[2020-05-22 08:07:49] [INFO ] Deduced a trap composed of 31 places in 91 ms
[2020-05-22 08:07:49] [INFO ] Deduced a trap composed of 76 places in 82 ms
[2020-05-22 08:07:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 644 ms
[2020-05-22 08:07:49] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 23 ms.
[2020-05-22 08:07:50] [INFO ] Added : 160 causal constraints over 32 iterations in 657 ms. Result :sat
[2020-05-22 08:07:50] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-05-22 08:07:50] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2020-05-22 08:07:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:07:50] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2020-05-22 08:07:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:07:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2020-05-22 08:07:50] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 11 ms returned sat
[2020-05-22 08:07:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:07:51] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2020-05-22 08:07:51] [INFO ] Deduced a trap composed of 76 places in 118 ms
[2020-05-22 08:07:51] [INFO ] Deduced a trap composed of 99 places in 95 ms
[2020-05-22 08:07:51] [INFO ] Deduced a trap composed of 84 places in 86 ms
[2020-05-22 08:07:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 345 ms
[2020-05-22 08:07:51] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 14 ms.
[2020-05-22 08:07:53] [INFO ] Added : 193 causal constraints over 39 iterations in 1649 ms. Result :sat
[2020-05-22 08:07:53] [INFO ] Deduced a trap composed of 84 places in 155 ms
[2020-05-22 08:07:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2020-05-22 08:07:53] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned unsat
[2020-05-22 08:07:53] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned unsat
[2020-05-22 08:07:53] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2020-05-22 08:07:53] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 18 ms returned sat
[2020-05-22 08:07:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:07:53] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2020-05-22 08:07:53] [INFO ] Deduced a trap composed of 96 places in 152 ms
[2020-05-22 08:07:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2020-05-22 08:07:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:07:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-05-22 08:07:53] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 14 ms returned sat
[2020-05-22 08:07:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:07:54] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2020-05-22 08:07:54] [INFO ] Deduced a trap composed of 96 places in 103 ms
[2020-05-22 08:07:54] [INFO ] Deduced a trap composed of 93 places in 103 ms
[2020-05-22 08:07:54] [INFO ] Deduced a trap composed of 31 places in 173 ms
[2020-05-22 08:07:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 602 ms
[2020-05-22 08:07:54] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 11 ms.
[2020-05-22 08:07:55] [INFO ] Added : 103 causal constraints over 21 iterations in 506 ms. Result :sat
[2020-05-22 08:07:55] [INFO ] Deduced a trap composed of 16 places in 86 ms
[2020-05-22 08:07:55] [INFO ] Deduced a trap composed of 84 places in 112 ms
[2020-05-22 08:07:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 287 ms
[2020-05-22 08:07:55] [INFO ] [Real]Absence check using 3 positive place invariants in 28 ms returned unsat
[2020-05-22 08:07:55] [INFO ] [Real]Absence check using 3 positive place invariants in 29 ms returned sat
[2020-05-22 08:07:55] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 53 ms returned unsat
[2020-05-22 08:07:55] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned unsat
[2020-05-22 08:07:55] [INFO ] [Real]Absence check using 3 positive place invariants in 26 ms returned sat
[2020-05-22 08:07:55] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 67 ms returned sat
[2020-05-22 08:07:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:07:56] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2020-05-22 08:07:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:07:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2020-05-22 08:07:56] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 14 ms returned sat
[2020-05-22 08:07:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:07:56] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2020-05-22 08:07:56] [INFO ] Deduced a trap composed of 16 places in 100 ms
[2020-05-22 08:07:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2020-05-22 08:07:56] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 13 ms.
[2020-05-22 08:07:57] [INFO ] Added : 194 causal constraints over 40 iterations in 841 ms. Result :sat
[2020-05-22 08:07:57] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-05-22 08:07:57] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 17 ms returned sat
[2020-05-22 08:07:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:07:57] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2020-05-22 08:07:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:07:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2020-05-22 08:07:57] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 16 ms returned sat
[2020-05-22 08:07:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:07:58] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2020-05-22 08:07:58] [INFO ] Deduced a trap composed of 62 places in 104 ms
[2020-05-22 08:07:58] [INFO ] Deduced a trap composed of 47 places in 128 ms
[2020-05-22 08:07:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 261 ms
[2020-05-22 08:07:58] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 19 ms.
[2020-05-22 08:07:59] [INFO ] Added : 195 causal constraints over 40 iterations in 801 ms. Result :sat
[2020-05-22 08:07:59] [INFO ] Deduced a trap composed of 35 places in 198 ms
[2020-05-22 08:08:01] [INFO ] Deduced a trap composed of 39 places in 2136 ms
[2020-05-22 08:08:01] [INFO ] Deduced a trap composed of 103 places in 166 ms
[2020-05-22 08:08:01] [INFO ] Deduced a trap composed of 68 places in 57 ms
[2020-05-22 08:08:01] [INFO ] Deduced a trap composed of 76 places in 109 ms
[2020-05-22 08:08:01] [INFO ] Deduced a trap composed of 95 places in 98 ms
[2020-05-22 08:08:02] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2944 ms
[2020-05-22 08:08:02] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-05-22 08:08:02] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 3 ms returned unsat
[2020-05-22 08:08:02] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-05-22 08:08:02] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2020-05-22 08:08:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:08:02] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2020-05-22 08:08:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:08:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 32 ms returned sat
[2020-05-22 08:08:02] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 33 ms returned sat
[2020-05-22 08:08:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:08:02] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2020-05-22 08:08:02] [INFO ] Deduced a trap composed of 83 places in 106 ms
[2020-05-22 08:08:02] [INFO ] Deduced a trap composed of 65 places in 83 ms
[2020-05-22 08:08:02] [INFO ] Deduced a trap composed of 49 places in 96 ms
[2020-05-22 08:08:03] [INFO ] Deduced a trap composed of 69 places in 90 ms
[2020-05-22 08:08:03] [INFO ] Deduced a trap composed of 41 places in 171 ms
[2020-05-22 08:08:03] [INFO ] Deduced a trap composed of 54 places in 109 ms
[2020-05-22 08:08:03] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 748 ms
[2020-05-22 08:08:03] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 19 ms.
[2020-05-22 08:08:04] [INFO ] Added : 160 causal constraints over 33 iterations in 854 ms. Result :sat
[2020-05-22 08:08:04] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-05-22 08:08:04] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 17 ms returned sat
[2020-05-22 08:08:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:08:04] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2020-05-22 08:08:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:08:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 16 ms returned sat
[2020-05-22 08:08:04] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 18 ms returned sat
[2020-05-22 08:08:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:08:04] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2020-05-22 08:08:04] [INFO ] Deduced a trap composed of 54 places in 39 ms
[2020-05-22 08:08:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2020-05-22 08:08:04] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 20 ms.
[2020-05-22 08:08:05] [INFO ] Added : 194 causal constraints over 39 iterations in 868 ms. Result :sat
[2020-05-22 08:08:05] [INFO ] Deduced a trap composed of 39 places in 146 ms
[2020-05-22 08:08:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2020-05-22 08:08:05] [INFO ] [Real]Absence check using 3 positive place invariants in 21 ms returned sat
[2020-05-22 08:08:06] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 39 ms returned sat
[2020-05-22 08:08:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:08:06] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2020-05-22 08:08:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:08:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned unsat
[2020-05-22 08:08:06] [INFO ] [Real]Absence check using 3 positive place invariants in 18 ms returned sat
[2020-05-22 08:08:06] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 94 ms returned sat
[2020-05-22 08:08:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:08:06] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2020-05-22 08:08:06] [INFO ] Deduced a trap composed of 54 places in 95 ms
[2020-05-22 08:08:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2020-05-22 08:08:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:08:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2020-05-22 08:08:07] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 13 ms returned sat
[2020-05-22 08:08:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:08:07] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2020-05-22 08:08:07] [INFO ] Deduced a trap composed of 62 places in 103 ms
[2020-05-22 08:08:07] [INFO ] Deduced a trap composed of 47 places in 108 ms
[2020-05-22 08:08:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 247 ms
[2020-05-22 08:08:07] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 13 ms.
[2020-05-22 08:08:08] [INFO ] Added : 194 causal constraints over 40 iterations in 1373 ms. Result :sat
[2020-05-22 08:08:08] [INFO ] Deduced a trap composed of 41 places in 50 ms
[2020-05-22 08:08:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2020-05-22 08:08:09] [INFO ] [Real]Absence check using 3 positive place invariants in 31 ms returned sat
[2020-05-22 08:08:09] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 23 ms returned sat
[2020-05-22 08:08:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:08:09] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2020-05-22 08:08:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:08:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 19 ms returned sat
[2020-05-22 08:08:09] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 24 ms returned sat
[2020-05-22 08:08:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:08:09] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2020-05-22 08:08:09] [INFO ] Deduced a trap composed of 78 places in 103 ms
[2020-05-22 08:08:09] [INFO ] Deduced a trap composed of 85 places in 88 ms
[2020-05-22 08:08:09] [INFO ] Deduced a trap composed of 31 places in 88 ms
[2020-05-22 08:08:10] [INFO ] Deduced a trap composed of 88 places in 114 ms
[2020-05-22 08:08:10] [INFO ] Deduced a trap composed of 83 places in 100 ms
[2020-05-22 08:08:10] [INFO ] Deduced a trap composed of 81 places in 86 ms
[2020-05-22 08:08:10] [INFO ] Deduced a trap composed of 36 places in 94 ms
[2020-05-22 08:08:10] [INFO ] Deduced a trap composed of 85 places in 77 ms
[2020-05-22 08:08:10] [INFO ] Deduced a trap composed of 59 places in 72 ms
[2020-05-22 08:08:10] [INFO ] Deduced a trap composed of 79 places in 73 ms
[2020-05-22 08:08:10] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1033 ms
[2020-05-22 08:08:10] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 10 ms.
[2020-05-22 08:08:11] [INFO ] Added : 190 causal constraints over 39 iterations in 681 ms. Result :sat
[2020-05-22 08:08:11] [INFO ] Deduced a trap composed of 43 places in 59 ms
[2020-05-22 08:08:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2020-05-22 08:08:11] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-05-22 08:08:11] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 15 ms returned sat
[2020-05-22 08:08:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:08:11] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2020-05-22 08:08:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:08:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2020-05-22 08:08:11] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2020-05-22 08:08:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:08:11] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2020-05-22 08:08:12] [INFO ] Deduced a trap composed of 87 places in 92 ms
[2020-05-22 08:08:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2020-05-22 08:08:12] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 8 ms.
[2020-05-22 08:08:13] [INFO ] Added : 193 causal constraints over 39 iterations in 956 ms. Result :sat
[2020-05-22 08:08:13] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-05-22 08:08:13] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2020-05-22 08:08:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:08:13] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2020-05-22 08:08:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:08:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 19 ms returned sat
[2020-05-22 08:08:13] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 19 ms returned sat
[2020-05-22 08:08:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:08:13] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2020-05-22 08:08:13] [INFO ] Deduced a trap composed of 49 places in 38 ms
[2020-05-22 08:08:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2020-05-22 08:08:13] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 19 ms.
[2020-05-22 08:08:14] [INFO ] Added : 191 causal constraints over 39 iterations in 892 ms. Result :sat
[2020-05-22 08:08:14] [INFO ] Deduced a trap composed of 21 places in 107 ms
[2020-05-22 08:08:14] [INFO ] Deduced a trap composed of 75 places in 86 ms
[2020-05-22 08:08:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 257 ms
[2020-05-22 08:08:14] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-05-22 08:08:14] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 17 ms returned sat
[2020-05-22 08:08:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:08:15] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2020-05-22 08:08:15] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 12 ms.
[2020-05-22 08:08:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:08:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2020-05-22 08:08:15] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 14 ms returned sat
[2020-05-22 08:08:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:08:15] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2020-05-22 08:08:15] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 13 ms.
[2020-05-22 08:08:16] [INFO ] Added : 160 causal constraints over 32 iterations in 599 ms. Result :sat
[2020-05-22 08:08:16] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-05-22 08:08:16] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 12 ms returned sat
[2020-05-22 08:08:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:08:16] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2020-05-22 08:08:16] [INFO ] Deduced a trap composed of 73 places in 103 ms
[2020-05-22 08:08:16] [INFO ] Deduced a trap composed of 55 places in 85 ms
[2020-05-22 08:08:16] [INFO ] Deduced a trap composed of 89 places in 108 ms
[2020-05-22 08:08:16] [INFO ] Deduced a trap composed of 101 places in 95 ms
[2020-05-22 08:08:16] [INFO ] Deduced a trap composed of 107 places in 102 ms
[2020-05-22 08:08:16] [INFO ] Deduced a trap composed of 57 places in 52 ms
[2020-05-22 08:08:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 620 ms
[2020-05-22 08:08:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:08:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 17 ms returned sat
[2020-05-22 08:08:16] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 17 ms returned sat
[2020-05-22 08:08:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:08:17] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2020-05-22 08:08:17] [INFO ] Deduced a trap composed of 73 places in 92 ms
[2020-05-22 08:08:17] [INFO ] Deduced a trap composed of 55 places in 80 ms
[2020-05-22 08:08:17] [INFO ] Deduced a trap composed of 89 places in 103 ms
[2020-05-22 08:08:17] [INFO ] Deduced a trap composed of 101 places in 151 ms
[2020-05-22 08:08:17] [INFO ] Deduced a trap composed of 107 places in 111 ms
[2020-05-22 08:08:17] [INFO ] Deduced a trap composed of 57 places in 63 ms
[2020-05-22 08:08:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 687 ms
[2020-05-22 08:08:17] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 11 ms.
[2020-05-22 08:08:18] [INFO ] Added : 195 causal constraints over 39 iterations in 864 ms. Result :sat
[2020-05-22 08:08:18] [INFO ] Deduced a trap composed of 106 places in 117 ms
[2020-05-22 08:08:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
Successfully simplified 9 atomic propositions for a total of 9 simplifications.
[2020-05-22 08:08:19] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-22 08:08:19] [INFO ] Flatten gal took : 87 ms
[2020-05-22 08:08:19] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-22 08:08:19] [INFO ] Flatten gal took : 22 ms
FORMULA DoubleExponent-PT-004-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 08:08:19] [INFO ] Applying decomposition
[2020-05-22 08:08:19] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph14882651379503550186.txt, -o, /tmp/graph14882651379503550186.bin, -w, /tmp/graph14882651379503550186.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph14882651379503550186.bin, -l, -1, -v, -w, /tmp/graph14882651379503550186.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 08:08:19] [INFO ] Decomposing Gal with order
[2020-05-22 08:08:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 08:08:19] [INFO ] Removed a total of 54 redundant transitions.
[2020-05-22 08:08:19] [INFO ] Flatten gal took : 62 ms
[2020-05-22 08:08:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 11 ms.
[2020-05-22 08:08:19] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 15 ms
[2020-05-22 08:08:19] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLCardinality.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLCardinality.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLCardinality.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLCardinality.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
Detected timeout of ITS tools.
[2020-05-22 08:28:36] [INFO ] Flatten gal took : 27 ms
[2020-05-22 08:28:36] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 5 ms
[2020-05-22 08:28:36] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 9 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLCardinality.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLCardinality.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLCardinality.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLCardinality.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
Detected timeout of ITS tools.
[2020-05-22 08:48:54] [INFO ] Flatten gal took : 84 ms
[2020-05-22 08:48:54] [INFO ] Input system was already deterministic with 198 transitions.
[2020-05-22 08:48:54] [INFO ] Transformed 216 places.
[2020-05-22 08:48:54] [INFO ] Transformed 198 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-22 08:48:54] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 2 ms
[2020-05-22 08:48:54] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLCardinality.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLCardinality.ctl, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLCardinality.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLCardinality.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-004"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-004, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r066-tajo-158922814800771"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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