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-158922814800763.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-003, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814800763
=====================================================================

--------------------
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-CTLCardinality-00
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-01
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-02
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-03
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-04
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-05
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-06
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-07
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-08
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-09
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-10
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-11
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-12
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-13
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-14
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1590134171823

[2020-05-22 07:56:13] [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 07:56:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 07:56:13] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2020-05-22 07:56:13] [INFO ] Transformed 163 places.
[2020-05-22 07:56:13] [INFO ] Transformed 148 transitions.
[2020-05-22 07:56:13] [INFO ] Parsed PT model containing 163 places and 148 transitions in 73 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
Incomplete random walk after 100000 steps, including 3341 resets, run finished after 287 ms. (steps per millisecond=348 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0]
// Phase 1: matrix 148 rows 163 cols
[2020-05-22 07:56:13] [INFO ] Computed 19 place invariants in 13 ms
[2020-05-22 07:56:13] [INFO ] [Real]Absence check using 5 positive place invariants in 17 ms returned sat
[2020-05-22 07:56:13] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2020-05-22 07:56:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:56:13] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2020-05-22 07:56:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:56:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 17 ms returned sat
[2020-05-22 07:56:14] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2020-05-22 07:56:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:56:14] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2020-05-22 07:56:14] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 11 ms.
[2020-05-22 07:56:14] [INFO ] Added : 133 causal constraints over 28 iterations in 468 ms. Result :sat
[2020-05-22 07:56:14] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned unsat
[2020-05-22 07:56:14] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned unsat
[2020-05-22 07:56:14] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-05-22 07:56:14] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 2 ms returned unsat
[2020-05-22 07:56:14] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned unsat
[2020-05-22 07:56:14] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2020-05-22 07:56:14] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned unsat
[2020-05-22 07:56:14] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned unsat
[2020-05-22 07:56:14] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned unsat
[2020-05-22 07:56:14] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-05-22 07:56:14] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2020-05-22 07:56:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:56:14] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2020-05-22 07:56:14] [INFO ] Deduced a trap composed of 31 places in 75 ms
[2020-05-22 07:56:15] [INFO ] Deduced a trap composed of 37 places in 39 ms
[2020-05-22 07:56:15] [INFO ] Deduced a trap composed of 70 places in 40 ms
[2020-05-22 07:56:15] [INFO ] Deduced a trap composed of 67 places in 36 ms
[2020-05-22 07:56:15] [INFO ] Deduced a trap composed of 52 places in 36 ms
[2020-05-22 07:56:15] [INFO ] Deduced a trap composed of 65 places in 36 ms
[2020-05-22 07:56:15] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 324 ms
[2020-05-22 07:56:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:56:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2020-05-22 07:56:15] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2020-05-22 07:56:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:56:15] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2020-05-22 07:56:15] [INFO ] Deduced a trap composed of 31 places in 48 ms
[2020-05-22 07:56:15] [INFO ] Deduced a trap composed of 37 places in 53 ms
[2020-05-22 07:56:15] [INFO ] Deduced a trap composed of 67 places in 62 ms
[2020-05-22 07:56:15] [INFO ] Deduced a trap composed of 52 places in 47 ms
[2020-05-22 07:56:15] [INFO ] Deduced a trap composed of 65 places in 48 ms
[2020-05-22 07:56:15] [INFO ] Deduced a trap composed of 64 places in 42 ms
[2020-05-22 07:56:15] [INFO ] Deduced a trap composed of 67 places in 43 ms
[2020-05-22 07:56:15] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 414 ms
[2020-05-22 07:56:15] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 9 ms.
[2020-05-22 07:56:16] [INFO ] Added : 127 causal constraints over 26 iterations in 374 ms. Result :sat
[2020-05-22 07:56:16] [INFO ] Deduced a trap composed of 67 places in 58 ms
[2020-05-22 07:56:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2020-05-22 07:56:16] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2020-05-22 07:56:16] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2020-05-22 07:56:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:56:16] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2020-05-22 07:56:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:56:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 18 ms returned sat
[2020-05-22 07:56:16] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-05-22 07:56:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:56:16] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2020-05-22 07:56:16] [INFO ] Deduced a trap composed of 69 places in 96 ms
[2020-05-22 07:56:16] [INFO ] Deduced a trap composed of 53 places in 66 ms
[2020-05-22 07:56:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 192 ms
[2020-05-22 07:56:16] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 7 ms.
[2020-05-22 07:56:17] [INFO ] Added : 143 causal constraints over 29 iterations in 350 ms. Result :sat
[2020-05-22 07:56:17] [INFO ] Deduced a trap composed of 58 places in 91 ms
[2020-05-22 07:56:17] [INFO ] Deduced a trap composed of 69 places in 72 ms
[2020-05-22 07:56:17] [INFO ] Deduced a trap composed of 65 places in 60 ms
[2020-05-22 07:56:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 286 ms
[2020-05-22 07:56:17] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned sat
[2020-05-22 07:56:17] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 11 ms returned sat
[2020-05-22 07:56:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:56:17] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2020-05-22 07:56:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:56:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 19 ms returned sat
[2020-05-22 07:56:17] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 48 ms returned sat
[2020-05-22 07:56:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:56:17] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2020-05-22 07:56:17] [INFO ] Deduced a trap composed of 18 places in 67 ms
[2020-05-22 07:56:17] [INFO ] Deduced a trap composed of 42 places in 26 ms
[2020-05-22 07:56:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 123 ms
[2020-05-22 07:56:17] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 13 ms.
[2020-05-22 07:56:18] [INFO ] Added : 145 causal constraints over 29 iterations in 507 ms. Result :sat
[2020-05-22 07:56:18] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2020-05-22 07:56:18] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2020-05-22 07:56:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:56:18] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2020-05-22 07:56:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:56:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 25 ms returned sat
[2020-05-22 07:56:18] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 11 ms returned sat
[2020-05-22 07:56:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:56:18] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2020-05-22 07:56:18] [INFO ] Deduced a trap composed of 43 places in 88 ms
[2020-05-22 07:56:19] [INFO ] Deduced a trap composed of 42 places in 22 ms
[2020-05-22 07:56:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 137 ms
[2020-05-22 07:56:19] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 11 ms.
[2020-05-22 07:56:19] [INFO ] Added : 143 causal constraints over 30 iterations in 709 ms. Result :sat
[2020-05-22 07:56:19] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned unsat
[2020-05-22 07:56:19] [INFO ] [Real]Absence check using 5 positive place invariants in 56 ms returned unsat
[2020-05-22 07:56:19] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2020-05-22 07:56:19] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 8 ms returned sat
[2020-05-22 07:56:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:56:20] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2020-05-22 07:56:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:56:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 28 ms returned sat
[2020-05-22 07:56:20] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 107 ms returned sat
[2020-05-22 07:56:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:56:20] [INFO ] [Nat]Absence check using state equation in 371 ms returned sat
[2020-05-22 07:56:20] [INFO ] Deduced a trap composed of 18 places in 117 ms
[2020-05-22 07:56:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2020-05-22 07:56:20] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 6 ms.
[2020-05-22 07:56:21] [INFO ] Added : 145 causal constraints over 29 iterations in 546 ms. Result :sat
[2020-05-22 07:56:21] [INFO ] [Real]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-05-22 07:56:21] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 11 ms returned sat
[2020-05-22 07:56:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:56:21] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2020-05-22 07:56:21] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:56:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 17 ms returned sat
[2020-05-22 07:56:21] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 9 ms returned sat
[2020-05-22 07:56:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:56:21] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2020-05-22 07:56:21] [INFO ] Deduced a trap composed of 18 places in 77 ms
[2020-05-22 07:56:21] [INFO ] Deduced a trap composed of 31 places in 59 ms
[2020-05-22 07:56:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 155 ms
[2020-05-22 07:56:21] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2020-05-22 07:56:21] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-05-22 07:56:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:56:22] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2020-05-22 07:56:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:56:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-05-22 07:56:22] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2020-05-22 07:56:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:56:22] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2020-05-22 07:56:22] [INFO ] Deduced a trap composed of 18 places in 32 ms
[2020-05-22 07:56:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2020-05-22 07:56:22] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 7 ms.
[2020-05-22 07:56:22] [INFO ] Added : 143 causal constraints over 29 iterations in 333 ms. Result :sat
[2020-05-22 07:56:22] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2020-05-22 07:56:22] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned unsat
[2020-05-22 07:56:22] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned unsat
[2020-05-22 07:56:22] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned unsat
[2020-05-22 07:56:22] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned unsat
[2020-05-22 07:56:22] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned sat
[2020-05-22 07:56:22] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned unsat
[2020-05-22 07:56:22] [INFO ] [Real]Absence check using 5 positive place invariants in 17 ms returned sat
[2020-05-22 07:56:22] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2020-05-22 07:56:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:56:22] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2020-05-22 07:56:23] [INFO ] Deduced a trap composed of 56 places in 71 ms
[2020-05-22 07:56:23] [INFO ] Deduced a trap composed of 59 places in 60 ms
[2020-05-22 07:56:23] [INFO ] Deduced a trap composed of 45 places in 61 ms
[2020-05-22 07:56:23] [INFO ] Deduced a trap composed of 47 places in 59 ms
[2020-05-22 07:56:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 297 ms
[2020-05-22 07:56:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:56:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-05-22 07:56:23] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-05-22 07:56:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:56:23] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2020-05-22 07:56:23] [INFO ] Deduced a trap composed of 56 places in 73 ms
[2020-05-22 07:56:23] [INFO ] Deduced a trap composed of 59 places in 60 ms
[2020-05-22 07:56:23] [INFO ] Deduced a trap composed of 45 places in 53 ms
[2020-05-22 07:56:23] [INFO ] Deduced a trap composed of 62 places in 83 ms
[2020-05-22 07:56:23] [INFO ] Deduced a trap composed of 75 places in 64 ms
[2020-05-22 07:56:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 381 ms
[2020-05-22 07:56:23] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 8 ms.
[2020-05-22 07:56:24] [INFO ] Added : 143 causal constraints over 29 iterations in 482 ms. Result :sat
[2020-05-22 07:56:24] [INFO ] Deduced a trap composed of 56 places in 100 ms
[2020-05-22 07:56:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2020-05-22 07:56:24] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned unsat
[2020-05-22 07:56:24] [INFO ] [Real]Absence check using 5 positive place invariants in 18 ms returned sat
[2020-05-22 07:56:24] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2020-05-22 07:56:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:56:24] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2020-05-22 07:56:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:56:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 21 ms returned sat
[2020-05-22 07:56:24] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2020-05-22 07:56:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:56:24] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2020-05-22 07:56:24] [INFO ] Deduced a trap composed of 68 places in 75 ms
[2020-05-22 07:56:24] [INFO ] Deduced a trap composed of 56 places in 55 ms
[2020-05-22 07:56:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 147 ms
[2020-05-22 07:56:24] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 10 ms.
[2020-05-22 07:56:25] [INFO ] Added : 145 causal constraints over 30 iterations in 307 ms. Result :sat
[2020-05-22 07:56:25] [INFO ] Deduced a trap composed of 40 places in 52 ms
[2020-05-22 07:56:25] [INFO ] Deduced a trap composed of 43 places in 45 ms
[2020-05-22 07:56:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 165 ms
[2020-05-22 07:56:25] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned unsat
[2020-05-22 07:56:25] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-05-22 07:56:25] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 9 ms returned sat
[2020-05-22 07:56:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:56:25] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2020-05-22 07:56:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:56:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 24 ms returned sat
[2020-05-22 07:56:25] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2020-05-22 07:56:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:56:25] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2020-05-22 07:56:25] [INFO ] Deduced a trap composed of 42 places in 76 ms
[2020-05-22 07:56:25] [INFO ] Deduced a trap composed of 71 places in 73 ms
[2020-05-22 07:56:26] [INFO ] Deduced a trap composed of 69 places in 57 ms
[2020-05-22 07:56:26] [INFO ] Deduced a trap composed of 53 places in 54 ms
[2020-05-22 07:56:26] [INFO ] Deduced a trap composed of 48 places in 37 ms
[2020-05-22 07:56:26] [INFO ] Deduced a trap composed of 68 places in 81 ms
[2020-05-22 07:56:26] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 450 ms
[2020-05-22 07:56:26] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 11 ms.
[2020-05-22 07:56:26] [INFO ] Added : 143 causal constraints over 29 iterations in 428 ms. Result :sat
[2020-05-22 07:56:26] [INFO ] Deduced a trap composed of 37 places in 50 ms
[2020-05-22 07:56:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2020-05-22 07:56:26] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned unsat
Successfully simplified 18 atomic propositions for a total of 18 simplifications.
[2020-05-22 07:56:27] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-05-22 07:56:27] [INFO ] Flatten gal took : 55 ms
[2020-05-22 07:56:27] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-05-22 07:56:27] [INFO ] Flatten gal took : 19 ms
FORMULA DoubleExponent-PT-003-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 07:56:27] [INFO ] Applying decomposition
[2020-05-22 07:56:27] [INFO ] Flatten gal took : 14 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/graph17705164242763285338.txt, -o, /tmp/graph17705164242763285338.bin, -w, /tmp/graph17705164242763285338.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/graph17705164242763285338.bin, -l, -1, -v, -w, /tmp/graph17705164242763285338.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 07:56:27] [INFO ] Decomposing Gal with order
[2020-05-22 07:56:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 07:56:27] [INFO ] Removed a total of 40 redundant transitions.
[2020-05-22 07:56:27] [INFO ] Flatten gal took : 38 ms
[2020-05-22 07:56:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 10 ms.
[2020-05-22 07:56:27] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 8 ms
[2020-05-22 07:56:27] [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 9 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.38507e+06,5.04245,169124,2,179419,5,759032,6,0,794,408352,0


Converting to forward existential form...Done !
original formula: (!(AF((gi6.gu1.p10>gi6.gu1.p153))) + EG(TRUE))
=> equivalent forward existential formula: ([FwdG(Init,!((gi6.gu1.p10>gi6.gu1.p153)))] != FALSE + [FwdG(Init,TRUE)] != FALSE)
Hit Full ! (commute/partial/dont) 137/0/9
(forward)formula 0,1,377.774,7188100,1,0,18137,2.54839e+07,8,6,2354,1.79789e+07,2
FORMULA DoubleExponent-PT-003-CTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: !(AF((((gi10.gi4.gi2.gu43.p46>=2)&&(gu30.p19<=gu30.p160))||((gu30.p83>=1)&&(gi9.gu8.p12<=gi9.gu8.p109)))))
=> equivalent forward existential formula: [FwdG(Init,!((((gi10.gi4.gi2.gu43.p46>=2)&&(gu30.p19<=gu30.p160))||((gu30.p83>=1)&&(gi9.gu8.p12<=gi9.gu8.p109)))))] != FALSE
Hit Full ! (commute/partial/dont) 131/5/15
(forward)formula 1,1,378.388,7188100,1,0,18137,2.54839e+07,16,6,2642,1.79789e+07,5
FORMULA DoubleExponent-PT-003-CTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: AG(A((gi4.gu16.p131<=gi4.gu16.p67) U (gu64.p98<=gu64.p60)))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),!((gu64.p98<=gu64.p60))) * (!((gi4.gu16.p131<=gi4.gu16.p67)) * !((gu64.p98<=gu64.p60))))] = FALSE * [FwdG(FwdU(Init,TRUE),!((gu64.p98<=gu64.p60)))] = FALSE)
dead was empty
(forward)formula 2,1,378.807,7188100,1,0,18137,2.54839e+07,22,6,2661,1.79789e+07,6
FORMULA DoubleExponent-PT-003-CTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EG(((gu21.p142<=gu21.p41)||((gu30.p83>gu30.p19)&&(gi3.gu10.p162<3))))
=> equivalent forward existential formula: [FwdG(Init,((gu21.p142<=gu21.p41)||((gu30.p83>gu30.p19)&&(gi3.gu10.p162<3))))] != FALSE
Hit Full ! (commute/partial/dont) 137/0/9
(forward)formula 3,1,379.889,7188100,1,0,18137,2.54839e+07,29,8,2893,1.79789e+07,9
FORMULA DoubleExponent-PT-003-CTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: AF(((gi7.gu45.p8<=gi7.gu45.p51)&&(gi10.gi2.gu37.p33>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(((gi7.gu45.p8<=gi7.gu45.p51)&&(gi10.gi2.gu37.p33>=1))))] = FALSE
Hit Full ! (commute/partial/dont) 135/0/11
(forward)formula 4,0,380.17,7188100,1,0,18137,2.54839e+07,37,11,3147,1.79789e+07,12
FORMULA DoubleExponent-PT-003-CTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: EG((AX((gu23.p112<=gu23.p146)) * EX(TRUE)))
=> equivalent forward existential formula: [FwdG(Init,(!(EX(!((gu23.p112<=gu23.p146)))) * EX(TRUE)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions gu57.t99, gi4.gu16.t122, gi4.t117, gi10.gi0.gi0.gu19.t129, gi10.gi0.gi0.gu19.t134, gi10.gi2.gu35.t25, gi10.gi2.gu35.t30, gi10.gi3.t16, gi10.gi4.gi1.gu20.t7, gi10.gi4.gi1.t19, gi10.gi4.gi2.gu39.t42, gi10.gi4.gi2.t37, gi10.gi4.t97, gi10.gi5.gi0.t138, gi10.gi5.gi1.t58, gi10.gi5.gi2.gu34.t49, gi10.gi5.gi3.gu56.t72, gi10.gi5.gi3.t67, gi10.gi5.gi4.gu61.t84, gi10.gi5.gi4.t79, gi10.gi5.t51, gi10.gi5.t61, gi10.t9, gi10.t85, gi10.t147, gi10.t144, gi10.t135, t101, t108, t111, t123, t73, t88, t94, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/112/34/146
dead was empty
(forward)formula 5,0,492.59,7188100,1,0,18137,2.54839e+07,339,165,6209,1.79789e+07,315
FORMULA DoubleExponent-PT-003-CTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AG(AX(((gu57.p114<=gu57.p80)&&(gi3.gu10.p122<=gi3.gu10.p162))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(((gu57.p114<=gu57.p80)&&(gi3.gu10.p122<=gi3.gu10.p162))))] = FALSE
(forward)formula 6,0,493.731,7188100,1,0,18137,2.54839e+07,341,167,6849,1.79789e+07,317
FORMULA DoubleExponent-PT-003-CTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: EG(TRUE)
=> equivalent forward existential formula: [FwdG(Init,TRUE)] != FALSE
(forward)formula 7,1,493.731,7188100,1,0,18137,2.54839e+07,341,168,6849,1.79789e+07,317
FORMULA DoubleExponent-PT-003-CTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: AG((gi0.gu2.p113<=gi0.gu2.p100))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !((gi0.gu2.p113<=gi0.gu2.p100)))] = FALSE
(forward)formula 8,0,494.08,7188100,1,0,18137,2.54839e+07,343,170,6883,1.79789e+07,318
FORMULA DoubleExponent-PT-003-CTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************


BK_STOP 1590134684683

--------------------
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-003"
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-003, 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-158922814800763"
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 [ "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 ;