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

About the Execution of ITS-Tools for QuasiCertifProtocol-PT-28

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.930 3600000.00 3545089.00 205287.50 ??????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.r126-tajo-158961390900819.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 QuasiCertifProtocol-PT-28, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tajo-158961390900819
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 55K Apr 12 07:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 212K Apr 12 07:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 11 07:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 11 07:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 18K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 77K Apr 10 13:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 293K Apr 10 13:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 9 20:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 9 20:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 22K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 61K Apr 10 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1.4M 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 QuasiCertifProtocol-PT-28-CTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-28-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1589861165651

[2020-05-19 04:06:07] [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-19 04:06:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-19 04:06:07] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2020-05-19 04:06:07] [INFO ] Transformed 2998 places.
[2020-05-19 04:06:07] [INFO ] Transformed 446 transitions.
[2020-05-19 04:06:07] [INFO ] Parsed PT model containing 2998 places and 446 transitions in 178 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 91 ms.
Incomplete random walk after 100000 steps, including 3028 resets, run finished after 4247 ms. (steps per millisecond=23 ) properties seen :[0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 446 rows 2998 cols
[2020-05-19 04:06:11] [INFO ] Computed 2553 place invariants in 100 ms
[2020-05-19 04:06:12] [INFO ] [Real]Absence check using 32 positive place invariants in 115 ms returned sat
[2020-05-19 04:06:17] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 5342 ms returned sat
[2020-05-19 04:06:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 04:06:32] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 04:06:32] [INFO ] [Real]Absence check using state equation in 14239 ms returned (error "Failed to check-sat")
[2020-05-19 04:06:32] [INFO ] [Real]Absence check using 32 positive place invariants in 97 ms returned sat
[2020-05-19 04:06:37] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4728 ms returned sat
[2020-05-19 04:06:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 04:06:52] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 04:06:52] [INFO ] [Real]Absence check using state equation in 14850 ms returned (error "Failed to check-sat")
[2020-05-19 04:06:52] [INFO ] [Real]Absence check using 32 positive place invariants in 126 ms returned sat
[2020-05-19 04:06:56] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4297 ms returned sat
[2020-05-19 04:06:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 04:07:12] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 04:07:12] [INFO ] [Real]Absence check using state equation in 15266 ms returned unknown
[2020-05-19 04:07:12] [INFO ] [Real]Absence check using 32 positive place invariants in 131 ms returned sat
[2020-05-19 04:07:17] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4842 ms returned sat
[2020-05-19 04:07:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 04:07:32] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 04:07:32] [INFO ] [Real]Absence check using state equation in 14732 ms returned (error "Failed to check-sat")
[2020-05-19 04:07:32] [INFO ] [Real]Absence check using 32 positive place invariants in 118 ms returned sat
[2020-05-19 04:07:37] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4813 ms returned sat
[2020-05-19 04:07:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 04:07:52] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 04:07:52] [INFO ] [Real]Absence check using state equation in 14806 ms returned (error "Failed to check-sat")
[2020-05-19 04:07:52] [INFO ] [Real]Absence check using 32 positive place invariants in 130 ms returned sat
[2020-05-19 04:07:57] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4532 ms returned sat
[2020-05-19 04:07:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 04:08:12] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 04:08:12] [INFO ] [Real]Absence check using state equation in 15003 ms returned unknown
[2020-05-19 04:08:12] [INFO ] [Real]Absence check using 32 positive place invariants in 127 ms returned sat
[2020-05-19 04:08:16] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4234 ms returned sat
[2020-05-19 04:08:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 04:08:32] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 04:08:32] [INFO ] [Real]Absence check using state equation in 15332 ms returned unknown
[2020-05-19 04:08:32] [INFO ] [Real]Absence check using 32 positive place invariants in 81 ms returned sat
[2020-05-19 04:08:37] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4599 ms returned sat
[2020-05-19 04:08:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 04:08:52] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 04:08:52] [INFO ] [Real]Absence check using state equation in 15068 ms returned (error "Failed to check-sat")
[2020-05-19 04:08:52] [INFO ] [Real]Absence check using 32 positive place invariants in 82 ms returned sat
[2020-05-19 04:08:57] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4682 ms returned sat
[2020-05-19 04:08:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 04:09:12] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 04:09:12] [INFO ] [Real]Absence check using state equation in 14943 ms returned (error "Failed to check-sat")
[2020-05-19 04:09:12] [INFO ] [Real]Absence check using 32 positive place invariants in 117 ms returned sat
[2020-05-19 04:09:18] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 5471 ms returned sat
[2020-05-19 04:09:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 04:09:32] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 04:09:32] [INFO ] [Real]Absence check using state equation in 14152 ms returned (error "Failed to check-sat")
[2020-05-19 04:09:32] [INFO ] [Real]Absence check using 32 positive place invariants in 96 ms returned sat
[2020-05-19 04:09:38] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 6088 ms returned sat
[2020-05-19 04:09:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 04:09:52] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 04:09:52] [INFO ] [Real]Absence check using state equation in 13583 ms returned (error "Failed to check-sat")
[2020-05-19 04:09:52] [INFO ] [Real]Absence check using 32 positive place invariants in 105 ms returned sat
[2020-05-19 04:10:00] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 7478 ms returned sat
[2020-05-19 04:10:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 04:10:12] [INFO ] [Real]Absence check using state equation in 12153 ms returned (error "Solver has unexpectedly terminated")
[2020-05-19 04:10:12] [INFO ] [Real]Absence check using 32 positive place invariants in 108 ms returned unsat
[2020-05-19 04:10:13] [INFO ] [Real]Absence check using 32 positive place invariants in 98 ms returned sat
[2020-05-19 04:10:18] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 5510 ms returned sat
[2020-05-19 04:10:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 04:10:32] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 04:10:32] [INFO ] [Real]Absence check using state equation in 14118 ms returned (error "Failed to check-sat")
[2020-05-19 04:10:32] [INFO ] [Real]Absence check using 32 positive place invariants in 80 ms returned sat
[2020-05-19 04:10:38] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 5058 ms returned sat
[2020-05-19 04:10:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 04:10:52] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 04:10:52] [INFO ] [Real]Absence check using state equation in 14633 ms returned unknown
[2020-05-19 04:10:52] [INFO ] [Real]Absence check using 32 positive place invariants in 84 ms returned sat
[2020-05-19 04:10:57] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4534 ms returned sat
[2020-05-19 04:10:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 04:11:12] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 04:11:12] [INFO ] [Real]Absence check using state equation in 15149 ms returned (error "Failed to check-sat")
[2020-05-19 04:11:13] [INFO ] [Real]Absence check using 32 positive place invariants in 115 ms returned sat
[2020-05-19 04:11:17] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4367 ms returned sat
[2020-05-19 04:11:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 04:11:18] [INFO ] [Real]Absence check using state equation in 1223 ms returned unsat
[2020-05-19 04:11:19] [INFO ] [Real]Absence check using 32 positive place invariants in 116 ms returned sat
[2020-05-19 04:11:24] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 5147 ms returned sat
[2020-05-19 04:11:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 04:11:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 04:11:38] [INFO ] [Real]Absence check using state equation in 14460 ms returned (error "Failed to check-sat")
[2020-05-19 04:11:39] [INFO ] [Real]Absence check using 32 positive place invariants in 88 ms returned sat
[2020-05-19 04:11:43] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4777 ms returned sat
[2020-05-19 04:11:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 04:11:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 04:11:58] [INFO ] [Real]Absence check using state equation in 14863 ms returned (error "Failed to check-sat")
[2020-05-19 04:11:59] [INFO ] [Real]Absence check using 32 positive place invariants in 85 ms returned sat
[2020-05-19 04:12:04] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 5024 ms returned sat
[2020-05-19 04:12:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 04:12:10] [INFO ] [Real]Absence check using state equation in 6534 ms returned unsat
[2020-05-19 04:12:10] [INFO ] [Real]Absence check using 32 positive place invariants in 81 ms returned sat
[2020-05-19 04:12:16] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 5107 ms returned sat
[2020-05-19 04:12:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 04:12:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 04:12:30] [INFO ] [Real]Absence check using state equation in 14547 ms returned (error "Failed to check-sat")
[2020-05-19 04:12:31] [INFO ] [Real]Absence check using 32 positive place invariants in 124 ms returned sat
[2020-05-19 04:12:35] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4745 ms returned sat
[2020-05-19 04:12:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 04:12:36] [INFO ] [Real]Absence check using state equation in 1069 ms returned unsat
[2020-05-19 04:12:37] [INFO ] [Real]Absence check using 32 positive place invariants in 118 ms returned sat
[2020-05-19 04:12:43] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 6592 ms returned sat
[2020-05-19 04:12:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 04:12:56] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 04:12:56] [INFO ] [Real]Absence check using state equation in 13063 ms returned (error "Failed to check-sat")
[2020-05-19 04:12:57] [INFO ] [Real]Absence check using 32 positive place invariants in 128 ms returned sat
[2020-05-19 04:13:01] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4375 ms returned sat
[2020-05-19 04:13:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 04:13:16] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 04:13:16] [INFO ] [Real]Absence check using state equation in 15134 ms returned (error "Failed to check-sat")
[2020-05-19 04:13:17] [INFO ] [Real]Absence check using 32 positive place invariants in 122 ms returned sat
[2020-05-19 04:13:22] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4891 ms returned sat
[2020-05-19 04:13:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 04:13:36] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 04:13:36] [INFO ] [Real]Absence check using state equation in 14724 ms returned (error "Failed to check-sat")
[2020-05-19 04:13:37] [INFO ] [Real]Absence check using 32 positive place invariants in 88 ms returned sat
[2020-05-19 04:13:42] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4662 ms returned sat
[2020-05-19 04:13:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 04:13:56] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 04:13:56] [INFO ] [Real]Absence check using state equation in 14943 ms returned (error "Failed to check-sat")
[2020-05-19 04:13:57] [INFO ] [Real]Absence check using 32 positive place invariants in 123 ms returned sat
[2020-05-19 04:14:01] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4507 ms returned sat
[2020-05-19 04:14:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 04:14:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 04:14:17] [INFO ] [Real]Absence check using state equation in 15094 ms returned (error "Failed to check-sat")
[2020-05-19 04:14:17] [INFO ] [Real]Absence check using 32 positive place invariants in 149 ms returned sat
[2020-05-19 04:14:23] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 6243 ms returned sat
[2020-05-19 04:14:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 04:14:37] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 04:14:37] [INFO ] [Real]Absence check using state equation in 13152 ms returned (error "Failed to check-sat")
[2020-05-19 04:14:37] [INFO ] [Real]Absence check using 32 positive place invariants in 119 ms returned sat
[2020-05-19 04:14:42] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4673 ms returned sat
[2020-05-19 04:14:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 04:14:47] [INFO ] [Real]Absence check using state equation in 4986 ms returned unsat
[2020-05-19 04:14:47] [INFO ] [Real]Absence check using 32 positive place invariants in 85 ms returned sat
[2020-05-19 04:14:51] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4333 ms returned sat
[2020-05-19 04:14:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 04:15:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 04:15:07] [INFO ] [Real]Absence check using state equation in 15334 ms returned (error "Failed to check-sat")
[2020-05-19 04:15:07] [INFO ] [Real]Absence check using 32 positive place invariants in 86 ms returned sat
[2020-05-19 04:15:11] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4352 ms returned sat
[2020-05-19 04:15:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 04:15:12] [INFO ] [Real]Absence check using state equation in 966 ms returned unsat
[2020-05-19 04:15:13] [INFO ] [Real]Absence check using 32 positive place invariants in 84 ms returned sat
[2020-05-19 04:15:17] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4247 ms returned sat
[2020-05-19 04:15:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 04:15:32] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-19 04:15:32] [INFO ] [Real]Absence check using state equation in 15441 ms returned (error "Failed to check-sat")
Successfully simplified 6 atomic propositions for a total of 6 simplifications.
[2020-05-19 04:15:33] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-19 04:15:33] [INFO ] Flatten gal took : 239 ms
[2020-05-19 04:15:33] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-19 04:15:33] [INFO ] Flatten gal took : 106 ms
FORMULA QuasiCertifProtocol-PT-28-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-19 04:15:33] [INFO ] Applying decomposition
[2020-05-19 04:15:33] [INFO ] Flatten gal took : 93 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/graph4077434633372681493.txt, -o, /tmp/graph4077434633372681493.bin, -w, /tmp/graph4077434633372681493.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/graph4077434633372681493.bin, -l, -1, -v, -w, /tmp/graph4077434633372681493.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-19 04:15:36] [INFO ] Decomposing Gal with order
[2020-05-19 04:15:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-19 04:15:36] [INFO ] Removed a total of 456 redundant transitions.
[2020-05-19 04:15:36] [INFO ] Flatten gal took : 355 ms
[2020-05-19 04:15:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 167 labels/synchronizations in 36 ms.
[2020-05-19 04:15:37] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 19 ms
[2020-05-19 04:15:37] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 5 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 15 CTL formulae.
Detected timeout of ITS tools.
[2020-05-19 04:38:47] [INFO ] Flatten gal took : 283 ms
[2020-05-19 04:38:47] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 173 ms
[2020-05-19 04:38:47] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 23 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 15 CTL formulae.
Detected timeout of ITS tools.
[2020-05-19 05:01:59] [INFO ] Flatten gal took : 784 ms
[2020-05-19 05:02:01] [INFO ] Input system was already deterministic with 446 transitions.
[2020-05-19 05:02:01] [INFO ] Transformed 2998 places.
[2020-05-19 05:02:01] [INFO ] Transformed 446 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
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-19 05:02:31] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 16 ms
[2020-05-19 05:02:31] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/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 15 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="QuasiCertifProtocol-PT-28"
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 QuasiCertifProtocol-PT-28, 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 r126-tajo-158961390900819"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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