fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r193-csrt-159033389000604
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for Vasy2003-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.430 160573.00 194705.00 138.40 FFFTTTTTTFFTTFFF normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r193-csrt-159033389000604.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Vasy2003-PT-none, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193-csrt-159033389000604
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 3.7K Apr 12 20:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 12 20:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 11 23:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 11 23:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 15 10:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 15 10:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 10 22:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 10 22:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 10 07:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 10 07:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 10 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 10 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 207K Mar 24 05:38 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 Vasy2003-PT-none-CTLFireability-00
FORMULA_NAME Vasy2003-PT-none-CTLFireability-01
FORMULA_NAME Vasy2003-PT-none-CTLFireability-02
FORMULA_NAME Vasy2003-PT-none-CTLFireability-03
FORMULA_NAME Vasy2003-PT-none-CTLFireability-04
FORMULA_NAME Vasy2003-PT-none-CTLFireability-05
FORMULA_NAME Vasy2003-PT-none-CTLFireability-06
FORMULA_NAME Vasy2003-PT-none-CTLFireability-07
FORMULA_NAME Vasy2003-PT-none-CTLFireability-08
FORMULA_NAME Vasy2003-PT-none-CTLFireability-09
FORMULA_NAME Vasy2003-PT-none-CTLFireability-10
FORMULA_NAME Vasy2003-PT-none-CTLFireability-11
FORMULA_NAME Vasy2003-PT-none-CTLFireability-12
FORMULA_NAME Vasy2003-PT-none-CTLFireability-13
FORMULA_NAME Vasy2003-PT-none-CTLFireability-14
FORMULA_NAME Vasy2003-PT-none-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1590538386938

[2020-05-27 00:13:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -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-27 00:13:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 00:13:09] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2020-05-27 00:13:09] [INFO ] Transformed 485 places.
[2020-05-27 00:13:09] [INFO ] Transformed 776 transitions.
[2020-05-27 00:13:09] [INFO ] Found NUPN structural information;
[2020-05-27 00:13:09] [INFO ] Parsed PT model containing 485 places and 776 transitions in 269 ms.
Ensure Unique test removed 24 transitions
Reduce redundant transitions removed 24 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 57 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 637 ms. (steps per millisecond=156 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0]
[2020-05-27 00:13:10] [INFO ] Flow matrix only has 696 transitions (discarded 56 similar events)
// Phase 1: matrix 696 rows 485 cols
[2020-05-27 00:13:10] [INFO ] Computed 66 place invariants in 30 ms
[2020-05-27 00:13:11] [INFO ] [Real]Absence check using 59 positive place invariants in 53 ms returned sat
[2020-05-27 00:13:11] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 7 ms returned sat
[2020-05-27 00:13:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:13:12] [INFO ] [Real]Absence check using state equation in 1052 ms returned sat
[2020-05-27 00:13:12] [INFO ] State equation strengthened by 73 read => feed constraints.
[2020-05-27 00:13:12] [INFO ] [Real]Added 73 Read/Feed constraints in 32 ms returned sat
[2020-05-27 00:13:12] [INFO ] Computed and/alt/rep : 751/5756/695 causal constraints in 138 ms.
[2020-05-27 00:13:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 00:13:12] [INFO ] [Nat]Absence check using 59 positive place invariants in 105 ms returned sat
[2020-05-27 00:13:12] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 10 ms returned sat
[2020-05-27 00:13:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 00:13:13] [INFO ] [Nat]Absence check using state equation in 915 ms returned sat
[2020-05-27 00:13:13] [INFO ] [Nat]Added 73 Read/Feed constraints in 44 ms returned sat
[2020-05-27 00:13:14] [INFO ] Computed and/alt/rep : 751/5756/695 causal constraints in 151 ms.
[2020-05-27 00:13:32] [INFO ] Added : 535 causal constraints over 107 iterations in 18761 ms. Result :unknown
[2020-05-27 00:13:32] [INFO ] [Real]Absence check using 59 positive place invariants in 43 ms returned sat
[2020-05-27 00:13:32] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 9 ms returned sat
[2020-05-27 00:13:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:13:33] [INFO ] [Real]Absence check using state equation in 925 ms returned sat
[2020-05-27 00:13:33] [INFO ] [Real]Added 73 Read/Feed constraints in 29 ms returned sat
[2020-05-27 00:13:34] [INFO ] Deduced a trap composed of 124 places in 208 ms
[2020-05-27 00:13:34] [INFO ] Deduced a trap composed of 127 places in 450 ms
[2020-05-27 00:13:35] [INFO ] Deduced a trap composed of 132 places in 268 ms
[2020-05-27 00:13:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1086 ms
[2020-05-27 00:13:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 00:13:35] [INFO ] [Nat]Absence check using 59 positive place invariants in 42 ms returned sat
[2020-05-27 00:13:35] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 11 ms returned sat
[2020-05-27 00:13:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 00:13:36] [INFO ] [Nat]Absence check using state equation in 875 ms returned sat
[2020-05-27 00:13:36] [INFO ] [Nat]Added 73 Read/Feed constraints in 25 ms returned sat
[2020-05-27 00:13:36] [INFO ] Deduced a trap composed of 124 places in 220 ms
[2020-05-27 00:13:36] [INFO ] Deduced a trap composed of 127 places in 181 ms
[2020-05-27 00:13:36] [INFO ] Deduced a trap composed of 131 places in 272 ms
[2020-05-27 00:13:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 800 ms
[2020-05-27 00:13:36] [INFO ] Computed and/alt/rep : 751/5756/695 causal constraints in 52 ms.
[2020-05-27 00:13:55] [INFO ] Added : 570 causal constraints over 114 iterations in 18213 ms. Result :unknown
[2020-05-27 00:13:55] [INFO ] [Real]Absence check using 59 positive place invariants in 37 ms returned unsat
[2020-05-27 00:13:55] [INFO ] [Real]Absence check using 59 positive place invariants in 54 ms returned unsat
[2020-05-27 00:13:55] [INFO ] [Real]Absence check using 59 positive place invariants in 48 ms returned sat
[2020-05-27 00:13:55] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 7 ms returned sat
[2020-05-27 00:13:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:13:56] [INFO ] [Real]Absence check using state equation in 873 ms returned sat
[2020-05-27 00:13:56] [INFO ] [Real]Added 73 Read/Feed constraints in 20 ms returned sat
[2020-05-27 00:13:56] [INFO ] Computed and/alt/rep : 751/5756/695 causal constraints in 102 ms.
[2020-05-27 00:13:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 00:13:57] [INFO ] [Nat]Absence check using 59 positive place invariants in 168 ms returned sat
[2020-05-27 00:13:57] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 37 ms returned sat
[2020-05-27 00:13:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 00:13:57] [INFO ] [Nat]Absence check using state equation in 849 ms returned sat
[2020-05-27 00:13:57] [INFO ] [Nat]Added 73 Read/Feed constraints in 32 ms returned sat
[2020-05-27 00:13:58] [INFO ] Computed and/alt/rep : 751/5756/695 causal constraints in 154 ms.
[2020-05-27 00:14:01] [INFO ] Added : 214 causal constraints over 43 iterations in 3568 ms. Result :sat
[2020-05-27 00:14:01] [INFO ] [Real]Absence check using 59 positive place invariants in 150 ms returned sat
[2020-05-27 00:14:01] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 11 ms returned sat
[2020-05-27 00:14:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:14:03] [INFO ] [Real]Absence check using state equation in 1182 ms returned sat
[2020-05-27 00:14:03] [INFO ] [Real]Added 73 Read/Feed constraints in 16 ms returned sat
[2020-05-27 00:14:03] [INFO ] Computed and/alt/rep : 751/5756/695 causal constraints in 36 ms.
[2020-05-27 00:14:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 00:14:03] [INFO ] [Nat]Absence check using 59 positive place invariants in 39 ms returned sat
[2020-05-27 00:14:03] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 7 ms returned sat
[2020-05-27 00:14:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 00:14:04] [INFO ] [Nat]Absence check using state equation in 764 ms returned sat
[2020-05-27 00:14:04] [INFO ] [Nat]Added 73 Read/Feed constraints in 27 ms returned sat
[2020-05-27 00:14:04] [INFO ] Computed and/alt/rep : 751/5756/695 causal constraints in 46 ms.
[2020-05-27 00:14:22] [INFO ] Added : 565 causal constraints over 113 iterations in 18145 ms. Result :unknown
[2020-05-27 00:14:22] [INFO ] [Real]Absence check using 59 positive place invariants in 46 ms returned sat
[2020-05-27 00:14:22] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 10 ms returned sat
[2020-05-27 00:14:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:14:23] [INFO ] [Real]Absence check using state equation in 818 ms returned sat
[2020-05-27 00:14:23] [INFO ] [Real]Added 73 Read/Feed constraints in 34 ms returned sat
[2020-05-27 00:14:23] [INFO ] Computed and/alt/rep : 751/5756/695 causal constraints in 33 ms.
[2020-05-27 00:14:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 00:14:23] [INFO ] [Nat]Absence check using 59 positive place invariants in 39 ms returned sat
[2020-05-27 00:14:23] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 7 ms returned sat
[2020-05-27 00:14:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 00:14:24] [INFO ] [Nat]Absence check using state equation in 821 ms returned sat
[2020-05-27 00:14:24] [INFO ] [Nat]Added 73 Read/Feed constraints in 28 ms returned sat
[2020-05-27 00:14:24] [INFO ] Computed and/alt/rep : 751/5756/695 causal constraints in 58 ms.
[2020-05-27 00:14:27] [INFO ] Added : 213 causal constraints over 43 iterations in 3116 ms. Result :sat
[2020-05-27 00:14:27] [INFO ] [Real]Absence check using 59 positive place invariants in 42 ms returned sat
[2020-05-27 00:14:27] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 9 ms returned sat
[2020-05-27 00:14:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:14:28] [INFO ] [Real]Absence check using state equation in 859 ms returned sat
[2020-05-27 00:14:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 00:14:28] [INFO ] [Nat]Absence check using 59 positive place invariants in 44 ms returned sat
[2020-05-27 00:14:28] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 8 ms returned sat
[2020-05-27 00:14:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 00:14:29] [INFO ] [Nat]Absence check using state equation in 821 ms returned sat
[2020-05-27 00:14:29] [INFO ] [Nat]Added 73 Read/Feed constraints in 44 ms returned sat
[2020-05-27 00:14:29] [INFO ] Computed and/alt/rep : 751/5756/695 causal constraints in 48 ms.
[2020-05-27 00:14:32] [INFO ] Added : 218 causal constraints over 44 iterations in 3126 ms. Result :sat
[2020-05-27 00:14:33] [INFO ] [Real]Absence check using 59 positive place invariants in 44 ms returned sat
[2020-05-27 00:14:33] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 9 ms returned sat
[2020-05-27 00:14:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:14:33] [INFO ] [Real]Absence check using state equation in 879 ms returned sat
[2020-05-27 00:14:34] [INFO ] [Real]Added 73 Read/Feed constraints in 17 ms returned sat
[2020-05-27 00:14:34] [INFO ] Computed and/alt/rep : 751/5756/695 causal constraints in 41 ms.
[2020-05-27 00:14:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 00:14:34] [INFO ] [Nat]Absence check using 59 positive place invariants in 66 ms returned sat
[2020-05-27 00:14:34] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 13 ms returned sat
[2020-05-27 00:14:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 00:14:35] [INFO ] [Nat]Absence check using state equation in 990 ms returned sat
[2020-05-27 00:14:35] [INFO ] [Nat]Added 73 Read/Feed constraints in 26 ms returned sat
[2020-05-27 00:14:35] [INFO ] Computed and/alt/rep : 751/5756/695 causal constraints in 112 ms.
[2020-05-27 00:14:54] [INFO ] Added : 540 causal constraints over 108 iterations in 18704 ms. Result :unknown
[2020-05-27 00:14:54] [INFO ] [Real]Absence check using 59 positive place invariants in 57 ms returned sat
[2020-05-27 00:14:54] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 9 ms returned sat
[2020-05-27 00:14:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:14:55] [INFO ] [Real]Absence check using state equation in 807 ms returned sat
[2020-05-27 00:14:55] [INFO ] [Real]Added 73 Read/Feed constraints in 23 ms returned sat
[2020-05-27 00:14:55] [INFO ] Computed and/alt/rep : 751/5756/695 causal constraints in 82 ms.
[2020-05-27 00:14:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 00:14:55] [INFO ] [Nat]Absence check using 59 positive place invariants in 44 ms returned sat
[2020-05-27 00:14:55] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 8 ms returned sat
[2020-05-27 00:14:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 00:14:56] [INFO ] [Nat]Absence check using state equation in 810 ms returned sat
[2020-05-27 00:14:56] [INFO ] [Nat]Added 73 Read/Feed constraints in 58 ms returned sat
[2020-05-27 00:14:56] [INFO ] Computed and/alt/rep : 751/5756/695 causal constraints in 49 ms.
[2020-05-27 00:15:15] [INFO ] Added : 625 causal constraints over 125 iterations in 18993 ms. Result :unknown
[2020-05-27 00:15:15] [INFO ] [Real]Absence check using 59 positive place invariants in 47 ms returned sat
[2020-05-27 00:15:15] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 9 ms returned sat
[2020-05-27 00:15:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:15:16] [INFO ] [Real]Absence check using state equation in 731 ms returned sat
[2020-05-27 00:15:16] [INFO ] [Real]Added 73 Read/Feed constraints in 14 ms returned sat
[2020-05-27 00:15:16] [INFO ] Deduced a trap composed of 125 places in 186 ms
[2020-05-27 00:15:16] [INFO ] Deduced a trap composed of 129 places in 169 ms
[2020-05-27 00:15:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 427 ms
[2020-05-27 00:15:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 00:15:17] [INFO ] [Nat]Absence check using 59 positive place invariants in 41 ms returned sat
[2020-05-27 00:15:17] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 8 ms returned sat
[2020-05-27 00:15:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 00:15:17] [INFO ] [Nat]Absence check using state equation in 732 ms returned sat
[2020-05-27 00:15:17] [INFO ] [Nat]Added 73 Read/Feed constraints in 38 ms returned sat
[2020-05-27 00:15:18] [INFO ] Deduced a trap composed of 130 places in 182 ms
[2020-05-27 00:15:18] [INFO ] Deduced a trap composed of 123 places in 176 ms
[2020-05-27 00:15:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 427 ms
[2020-05-27 00:15:18] [INFO ] Computed and/alt/rep : 751/5756/695 causal constraints in 39 ms.
[2020-05-27 00:15:35] [INFO ] Added : 530 causal constraints over 106 iterations in 17001 ms. Result :sat
[2020-05-27 00:15:35] [INFO ] [Real]Absence check using 59 positive place invariants in 46 ms returned sat
[2020-05-27 00:15:35] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 8 ms returned sat
[2020-05-27 00:15:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:15:36] [INFO ] [Real]Absence check using state equation in 726 ms returned sat
[2020-05-27 00:15:36] [INFO ] [Real]Added 73 Read/Feed constraints in 20 ms returned sat
[2020-05-27 00:15:36] [INFO ] Computed and/alt/rep : 751/5756/695 causal constraints in 33 ms.
[2020-05-27 00:15:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 00:15:36] [INFO ] [Nat]Absence check using 59 positive place invariants in 41 ms returned sat
[2020-05-27 00:15:36] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 8 ms returned sat
[2020-05-27 00:15:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 00:15:37] [INFO ] [Nat]Absence check using state equation in 832 ms returned sat
[2020-05-27 00:15:37] [INFO ] [Nat]Added 73 Read/Feed constraints in 65 ms returned sat
[2020-05-27 00:15:37] [INFO ] Computed and/alt/rep : 751/5756/695 causal constraints in 51 ms.
[2020-05-27 00:15:40] [INFO ] Added : 230 causal constraints over 46 iterations in 3553 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-05-27 00:15:41] [INFO ] Flatten gal took : 139 ms
[2020-05-27 00:15:41] [INFO ] Flatten gal took : 62 ms
[2020-05-27 00:15:41] [INFO ] Applying decomposition
[2020-05-27 00:15:41] [INFO ] Flatten gal took : 65 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/graph15123295977617673953.txt, -o, /tmp/graph15123295977617673953.bin, -w, /tmp/graph15123295977617673953.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/graph15123295977617673953.bin, -l, -1, -v, -w, /tmp/graph15123295977617673953.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 00:15:42] [INFO ] Decomposing Gal with order
[2020-05-27 00:15:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 00:15:42] [INFO ] Removed a total of 726 redundant transitions.
[2020-05-27 00:15:42] [INFO ] Flatten gal took : 192 ms
[2020-05-27 00:15:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 353 labels/synchronizations in 47 ms.
[2020-05-27 00:15:42] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 36 ms
[2020-05-27 00:15:42] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 2 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/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], 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/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
built 68 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 32 ordering constraints for composite.
built 62 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 19 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 30 ordering constraints for composite.
built 62 ordering constraints for composite.
built 15 ordering constraints for composite.
built 12 ordering constraints for composite.
built 22 ordering constraints for composite.
built 21 ordering constraints for composite.
built 54 ordering constraints for composite.
built 41 ordering constraints for composite.
built 12 ordering constraints for composite.
built 40 ordering constraints for composite.
built 5 ordering constraints for composite.
built 16 ordering constraints for composite.
built 54 ordering constraints for composite.
built 67 ordering constraints for composite.
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,9.79474e+21,0.918579,33296,647,176,51501,4577,1362,116576,242,18724,0


Converting to forward existential form...Done !
original formula: AG((((i2.u102.p407!=1)||(i12.u123.p465!=1))||(((((i10.i1.u15.p48!=1)||(i10.i1.u117.p448!=1))&&((i0.i7.u12.p25!=1)||(i0.i7.u14.p42!=1)))&&((i2.u102.p407!=1)||(i13.u127.p480!=1)))&&((i4.u56.p182!=1)||(i13.u127.p480!=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !((((i2.u102.p407!=1)||(i12.u123.p465!=1))||(((((i10.i1.u15.p48!=1)||(i10.i1.u117.p448!=1))&&((i0.i7.u12.p25!=1)||(i0.i7.u14.p42!=1)))&&((i2.u102.p407!=1)||(i13.u127.p480!=1)))&&((i4.u56.p182!=1)||(i13.u127.p480!=1))))))] = FALSE
(forward)formula 0,0,0.925344,33680,1,0,51501,4577,1407,116576,257,18724,660
FORMULA Vasy2003-PT-none-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(AX(EG(((i13.u85.p317==1)&&(i13.u127.p480==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EG(((i13.u85.p317==1)&&(i13.u127.p480==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t577, t601, t602, t673, i0.i13.u39.t11, i0.i13.u40.t9, i0.i13.u41.t7, i4.t670, i4.t669, i4.t668, i4.t667, i4.t666, i4.t644, i4.t643, i4.t598, i4.t597, i4.t573, i4.t572, i4.t571, i4.t570, i4.t569, i4.t568, i4.t567, i4.t566, i4.t565, i4.t564, i4.u53.t671, i12.u123.t68, i13.u127.t77, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/462/29/491
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 1,0,1.61163,36848,1,0,63052,4577,6977,116766,1495,18724,124091
FORMULA Vasy2003-PT-none-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((AG((i3.u45.p152==1)) * ((i1.u42.p124!=1)||(i1.u42.p166!=1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * ((i1.u42.p124!=1)||(i1.u42.p166!=1))) * !(E(TRUE U !((i3.u45.p152==1)))))] != FALSE
(forward)formula 2,0,1.69697,40280,1,0,69440,5096,7845,127991,1562,18724,146616
FORMULA Vasy2003-PT-none-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(EF(((i4.u55.p180==1)&&(i13.u127.p480==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((i4.u55.p180==1)&&(i13.u127.p480==1))))] != FALSE
(forward)formula 3,1,2.76532,75128,1,0,134194,11352,8949,278949,1640,36805,304117
FORMULA Vasy2003-PT-none-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AX(((i0.i5.u35.p102==1)&&(i0.i13.u41.p117==1))) * EF(((i14.u71.p248==1)&&(i14.u128.p481==1))))
=> equivalent forward existential formula: ([(EY(Init) * !(((i0.i5.u35.p102==1)&&(i0.i13.u41.p117==1))))] = FALSE * [(Init * !(E(TRUE U ((i14.u71.p248==1)&&(i14.u128.p481==1)))))] = FALSE)
(forward)formula 4,1,3.00579,84632,1,0,152198,12583,8968,320789,1641,41317,353491
FORMULA Vasy2003-PT-none-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((((i0.i13.u39.p111==1)&&(i14.u70.p247==1))||((i0.i13.u41.p117==1)&&(i14.u113.p436==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (((i0.i13.u39.p111==1)&&(i14.u70.p247==1))||((i0.i13.u41.p117==1)&&(i14.u113.p436==1))))] != FALSE
(forward)formula 5,1,3.00761,84632,1,0,152202,12583,8985,321104,1642,41317,353756
FORMULA Vasy2003-PT-none-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(EF(((((i14.u126.p476==1)&&(i14.u129.p484==1))&&(i12.u58.p441==1))&&(i12.u123.p465==1))) U (EX(((i12.u49.p150==1)&&(i13.u127.p480==1))) * ((((i2.u43.p126!=1)||(i13.u127.p301!=1))||(i0.i7.u12.p25!=1))||(i0.i7.u14.p44!=1))))
=> equivalent forward existential formula: [(EY((FwdU(Init,E(TRUE U ((((i14.u126.p476==1)&&(i14.u129.p484==1))&&(i12.u58.p441==1))&&(i12.u123.p465==1)))) * ((((i2.u43.p126!=1)||(i13.u127.p301!=1))||(i0.i7.u12.p25!=1))||(i0.i7.u14.p44!=1)))) * ((i12.u49.p150==1)&&(i13.u127.p480==1)))] != FALSE
(forward)formula 6,1,3.16851,89648,1,0,162362,13143,9023,344461,1643,43335,381019
FORMULA Vasy2003-PT-none-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EF(((((((i0.i5.u9.p20==1)&&(i0.i5.u35.p101==1))||((i5.i1.u69.p243==1)&&(i12.u123.p465==1)))&&(((i1.u42.p124==1)&&(i1.u42.p398==1))||((i2.u43.p126==1)&&(i2.u102.p407==1))))||((i4.u72.p252==1)&&(i13.u127.p480==1)))||((i3.u45.p135==1)&&(i14.u126.p467==1)))) + ((EF((((i4.u108.p419==1)||(i14.u126.p467==1))&&(((i2.u43.p126==1)&&(i2.u122.p354==1))||((i1.u42.p124==1)&&(i1.u91.p341==1))))) * AG((i8.u94.p361==1))) * AX(((i2.u43.p126==1)&&(i12.u44.p174==1)))))
=> equivalent forward existential formula: (([((Init * !(E(TRUE U ((((((i0.i5.u9.p20==1)&&(i0.i5.u35.p101==1))||((i5.i1.u69.p243==1)&&(i12.u123.p465==1)))&&(((i1.u42.p124==1)&&(i1.u42.p398==1))||((i2.u43.p126==1)&&(i2.u102.p407==1))))||((i4.u72.p252==1)&&(i13.u127.p480==1)))||((i3.u45.p135==1)&&(i14.u126.p467==1)))))) * !(E(TRUE U (((i4.u108.p419==1)||(i14.u126.p467==1))&&(((i2.u43.p126==1)&&(i2.u122.p354==1))||((i1.u42.p124==1)&&(i1.u91.p341==1)))))))] = FALSE * [(FwdU((Init * !(E(TRUE U ((((((i0.i5.u9.p20==1)&&(i0.i5.u35.p101==1))||((i5.i1.u69.p243==1)&&(i12.u123.p465==1)))&&(((i1.u42.p124==1)&&(i1.u42.p398==1))||((i2.u43.p126==1)&&(i2.u102.p407==1))))||((i4.u72.p252==1)&&(i13.u127.p480==1)))||((i3.u45.p135==1)&&(i14.u126.p467==1)))))),TRUE) * !((i8.u94.p361==1)))] = FALSE) * [(EY((Init * !(E(TRUE U ((((((i0.i5.u9.p20==1)&&(i0.i5.u35.p101==1))||((i5.i1.u69.p243==1)&&(i12.u123.p465==1)))&&(((i1.u42.p124==1)&&(i1.u42.p398==1))||((i2.u43.p126==1)&&(i2.u102.p407==1))))||((i4.u72.p252==1)&&(i13.u127.p480==1)))||((i3.u45.p135==1)&&(i14.u126.p467==1))))))) * !(((i2.u43.p126==1)&&(i12.u44.p174==1))))] = FALSE)
(forward)formula 7,1,3.63574,104432,1,0,191829,13578,9102,410426,1646,45002,461116
FORMULA Vasy2003-PT-none-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX(AF(((i2.u43.p126!=1)||(i2.u102.p407!=1))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(((i2.u43.p126!=1)||(i2.u102.p407!=1))))] = FALSE
(forward)formula 8,1,3.63761,104960,1,0,191829,13578,9117,410439,1646,45002,461214
FORMULA Vasy2003-PT-none-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EG(((i0.i13.u39.p111==1)&&(i14.u82.p305==1))) + AF(((i10.i1.u19.p64==1)&&(i10.i1.u22.p75==1))))
=> equivalent forward existential formula: [FwdG((Init * !(EG(((i0.i13.u39.p111==1)&&(i14.u82.p305==1))))),!(((i10.i1.u19.p64==1)&&(i10.i1.u22.p75==1))))] = FALSE
(forward)formula 9,0,4.23898,118688,1,0,218538,14604,9191,472100,1647,50970,518388
FORMULA Vasy2003-PT-none-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (A(((i0.i7.u12.p25==1)&&(i0.i7.u14.p40==1)) U ((i0.i11.u7.p15==1)&&(i0.i7.u13.p38==1))) + (!(EF(((i2.u43.p126==1)&&(i5.i1.u69.p207==1)))) * !(E(((i0.i7.u12.p25==1)&&(i0.i7.u12.p32==1)) U ((i2.u43.p126==1)&&(i13.u127.p257==1))))))
=> equivalent forward existential formula: ([(FwdU((Init * !(!((E(!(((i0.i11.u7.p15==1)&&(i0.i7.u13.p38==1))) U (!(((i0.i7.u12.p25==1)&&(i0.i7.u14.p40==1))) * !(((i0.i11.u7.p15==1)&&(i0.i7.u13.p38==1))))) + EG(!(((i0.i11.u7.p15==1)&&(i0.i7.u13.p38==1)))))))),TRUE) * ((i2.u43.p126==1)&&(i5.i1.u69.p207==1)))] = FALSE * [(FwdU((Init * !(!((E(!(((i0.i11.u7.p15==1)&&(i0.i7.u13.p38==1))) U (!(((i0.i7.u12.p25==1)&&(i0.i7.u14.p40==1))) * !(((i0.i11.u7.p15==1)&&(i0.i7.u13.p38==1))))) + EG(!(((i0.i11.u7.p15==1)&&(i0.i7.u13.p38==1)))))))),((i0.i7.u12.p25==1)&&(i0.i7.u12.p32==1))) * ((i2.u43.p126==1)&&(i13.u127.p257==1)))] = FALSE)
(forward)formula 10,0,4.30464,122120,1,0,225876,14719,9295,481847,1650,51594,531483
FORMULA Vasy2003-PT-none-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(EG(((i1.u42.p124==1)&&(i13.u85.p316==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((i1.u42.p124==1)&&(i13.u85.p316==1)))] != FALSE
(forward)formula 11,1,4.30936,122120,1,0,226026,14719,9377,481942,1650,51594,532542
FORMULA Vasy2003-PT-none-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (((EF((((i2.u43.p126==1)&&(i2.u43.p430==1))&&(i0.i7.u14.p43==1))) + AG((((i2.u43.p126==1)&&(i2.u102.p407==1))&&((i4.u108.p420!=1)||(i12.u123.p465!=1))))) + EF(AX(((i10.i1.u25.p121==1)&&(i1.u42.p125==1))))) + (EG(((i12.u44.p183==1)&&(i12.u123.p465==1))) * EX(((i10.i1.u23.p78==1)&&(i10.i1.u23.p119==1)))))
=> equivalent forward existential formula: [(FwdU((((Init * !((EG(((i12.u44.p183==1)&&(i12.u123.p465==1))) * EX(((i10.i1.u23.p78==1)&&(i10.i1.u23.p119==1)))))) * !(E(TRUE U !(EX(!(((i10.i1.u25.p121==1)&&(i1.u42.p125==1)))))))) * !(E(TRUE U (((i2.u43.p126==1)&&(i2.u43.p430==1))&&(i0.i7.u14.p43==1))))),TRUE) * !((((i2.u43.p126==1)&&(i2.u102.p407==1))&&((i4.u108.p420!=1)||(i12.u123.p465!=1)))))] = FALSE
(forward)formula 12,1,4.32683,122120,1,0,226797,14719,9396,484382,1653,51594,535053
FORMULA Vasy2003-PT-none-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: ((AG(AX(((i0.i7.u12.p25==1)&&(i0.i7.u14.p44==1)))) + AG(((i2.u43.p126!=1)||(i13.u127.p301!=1)))) + EG(((i0.i11.u33.p98==1)&&(i0.i13.u40.p114==1))))
=> equivalent forward existential formula: [(FwdU(((Init * !(EG(((i0.i11.u33.p98==1)&&(i0.i13.u40.p114==1))))) * !(!(E(TRUE U !(!(EX(!(((i0.i7.u12.p25==1)&&(i0.i7.u14.p44==1)))))))))),TRUE) * !(((i2.u43.p126!=1)||(i13.u127.p301!=1))))] = FALSE
(forward)formula 13,0,4.38956,124760,1,0,233754,14908,9426,494290,1653,52638,545382
FORMULA Vasy2003-PT-none-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (!(AX(EF((i5.i0.u67.p226==1)))) * !(EX(((i14.u57.p190==1)&&(i14.u129.p483==1)))))
=> equivalent forward existential formula: ([(Init * !(EX(!(E(TRUE U (i5.i0.u67.p226==1))))))] = FALSE * [(EY(Init) * ((i14.u57.p190==1)&&(i14.u129.p483==1)))] = FALSE)
(forward)formula 14,0,4.5347,129512,1,0,242167,15281,9434,518004,1653,53186,569483
FORMULA Vasy2003-PT-none-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG((((i5.i1.u69.p243!=1)||(i12.u123.p465!=1))||((i2.u43.p126==1)&&(i2.u43.p430==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !((((i5.i1.u69.p243!=1)||(i12.u123.p465!=1))||((i2.u43.p126==1)&&(i2.u43.p430==1)))))] = FALSE
(forward)formula 15,0,4.53654,130040,1,0,242203,15281,9441,518061,1653,53186,569612
FORMULA Vasy2003-PT-none-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1590538547511

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="Vasy2003-PT-none"
export BK_EXAMINATION="CTLFireability"
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 Vasy2003-PT-none, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r193-csrt-159033389000604"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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