fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r035-tajo-162038167700053
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for BridgeAndVehicles-PT-V20P20N20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16238.172 3600000.00 3620127.00 16249.50 F?F???T?F??TFTF? 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/mcc2021-input.r035-tajo-162038167700053.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-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 gold2020
Input is BridgeAndVehicles-PT-V20P20N20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r035-tajo-162038167700053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.3M
-rw-r--r-- 1 mcc users 58K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 312K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 503K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.9M May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.2K Mar 28 15:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 28 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 29K Mar 28 15:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 90K Mar 28 15:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Mar 23 02:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 23 02:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 52K Mar 22 11:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 149K Mar 22 11:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.3K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.1M May 5 16:51 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 BridgeAndVehicles-PT-V20P20N20-CTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-CTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-CTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-CTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-CTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-CTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-CTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-CTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-CTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-CTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-CTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-CTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-CTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-CTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-CTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1620897538722

[2021-05-13 09:19:00] [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]
[2021-05-13 09:19:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 09:19:00] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2021-05-13 09:19:00] [INFO ] Transformed 78 places.
[2021-05-13 09:19:00] [INFO ] Transformed 968 transitions.
[2021-05-13 09:19:00] [INFO ] Parsed PT model containing 78 places and 968 transitions in 147 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 45 ms.
Incomplete random walk after 100000 steps, including 575 resets, run finished after 1551 ms. (steps per millisecond=64 ) properties seen :[1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0]
[2021-05-13 09:19:02] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 78 cols
[2021-05-13 09:19:02] [INFO ] Computed 7 place invariants in 8 ms
[2021-05-13 09:19:02] [INFO ] [Real]Absence check using 7 positive place invariants in 19 ms returned unsat
[2021-05-13 09:19:02] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 09:19:02] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned unsat
[2021-05-13 09:19:02] [INFO ] [Real]Absence check using 7 positive place invariants in 16 ms returned sat
[2021-05-13 09:19:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:19:02] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2021-05-13 09:19:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:19:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2021-05-13 09:19:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:19:02] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2021-05-13 09:19:02] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-13 09:19:02] [INFO ] [Nat]Added 42 Read/Feed constraints in 14 ms returned sat
[2021-05-13 09:19:02] [INFO ] Deduced a trap composed of 5 places in 196 ms
[2021-05-13 09:19:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2021-05-13 09:19:02] [INFO ] Computed and/alt/rep : 965/22439/167 causal constraints in 89 ms.
[2021-05-13 09:19:04] [INFO ] Added : 137 causal constraints over 28 iterations in 1840 ms. Result :sat
[2021-05-13 09:19:04] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 09:19:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:19:04] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-13 09:19:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:19:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2021-05-13 09:19:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:19:04] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2021-05-13 09:19:04] [INFO ] [Nat]Added 42 Read/Feed constraints in 11 ms returned sat
[2021-05-13 09:19:04] [INFO ] Deduced a trap composed of 24 places in 92 ms
[2021-05-13 09:19:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2021-05-13 09:19:04] [INFO ] Computed and/alt/rep : 965/22439/167 causal constraints in 44 ms.
[2021-05-13 09:19:08] [INFO ] Added : 143 causal constraints over 38 iterations in 3663 ms. Result :sat
[2021-05-13 09:19:08] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2021-05-13 09:19:08] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 09:19:08] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned unsat
[2021-05-13 09:19:08] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 09:19:08] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
[2021-05-13 09:19:08] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 09:19:08] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-13 09:19:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:19:08] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2021-05-13 09:19:08] [INFO ] [Real]Added 42 Read/Feed constraints in 8 ms returned sat
[2021-05-13 09:19:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:19:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 14 ms returned sat
[2021-05-13 09:19:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:19:08] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2021-05-13 09:19:08] [INFO ] [Nat]Added 42 Read/Feed constraints in 19 ms returned sat
[2021-05-13 09:19:09] [INFO ] Deduced a trap composed of 5 places in 114 ms
[2021-05-13 09:19:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2021-05-13 09:19:09] [INFO ] Computed and/alt/rep : 965/22439/167 causal constraints in 37 ms.
[2021-05-13 09:19:09] [INFO ] Added : 98 causal constraints over 21 iterations in 710 ms. Result :sat
[2021-05-13 09:19:09] [INFO ] Deduced a trap composed of 5 places in 105 ms
[2021-05-13 09:19:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2021-05-13 09:19:09] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:19:09] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2021-05-13 09:19:09] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2021-05-13 09:19:09] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 09:19:09] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 09:19:10] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned unsat
[2021-05-13 09:19:10] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned unsat
[2021-05-13 09:19:10] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 09:19:10] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 09:19:10] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:19:10] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2021-05-13 09:19:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:19:10] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2021-05-13 09:19:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:19:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2021-05-13 09:19:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:19:10] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2021-05-13 09:19:10] [INFO ] [Nat]Added 42 Read/Feed constraints in 16 ms returned sat
[2021-05-13 09:19:10] [INFO ] Computed and/alt/rep : 965/22439/167 causal constraints in 51 ms.
[2021-05-13 09:19:10] [INFO ] Added : 94 causal constraints over 19 iterations in 668 ms. Result :sat
[2021-05-13 09:19:11] [INFO ] Deduced a trap composed of 5 places in 163 ms
[2021-05-13 09:19:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2021-05-13 09:19:11] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 09:19:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:19:11] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2021-05-13 09:19:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:19:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-13 09:19:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:19:11] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2021-05-13 09:19:11] [INFO ] [Nat]Added 42 Read/Feed constraints in 25 ms returned sat
[2021-05-13 09:19:11] [INFO ] Deduced a trap composed of 5 places in 136 ms
[2021-05-13 09:19:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2021-05-13 09:19:11] [INFO ] Computed and/alt/rep : 965/22439/167 causal constraints in 40 ms.
[2021-05-13 09:19:12] [INFO ] Added : 139 causal constraints over 28 iterations in 1305 ms. Result :sat
[2021-05-13 09:19:12] [INFO ] Deduced a trap composed of 24 places in 134 ms
[2021-05-13 09:19:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2021-05-13 09:19:13] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 09:19:13] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 09:19:13] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:19:13] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 09:19:13] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:19:13] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:19:13] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 09:19:13] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 09:19:13] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:19:13] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:19:13] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 09:19:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:19:13] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2021-05-13 09:19:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:19:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-13 09:19:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:19:13] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2021-05-13 09:19:13] [INFO ] [Nat]Added 42 Read/Feed constraints in 10 ms returned sat
[2021-05-13 09:19:13] [INFO ] Deduced a trap composed of 5 places in 101 ms
[2021-05-13 09:19:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2021-05-13 09:19:13] [INFO ] Computed and/alt/rep : 965/22439/167 causal constraints in 37 ms.
[2021-05-13 09:19:15] [INFO ] Added : 140 causal constraints over 28 iterations in 1758 ms. Result :sat
[2021-05-13 09:19:15] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:19:15] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned unsat
[2021-05-13 09:19:15] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:19:15] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:19:15] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
[2021-05-13 09:19:15] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:19:15] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:19:15] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
[2021-05-13 09:19:15] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2021-05-13 09:19:15] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:19:15] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 09:19:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:19:15] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-13 09:19:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:19:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 09:19:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:19:15] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2021-05-13 09:19:15] [INFO ] [Nat]Added 42 Read/Feed constraints in 16 ms returned sat
[2021-05-13 09:19:15] [INFO ] Deduced a trap composed of 24 places in 66 ms
[2021-05-13 09:19:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2021-05-13 09:19:15] [INFO ] Computed and/alt/rep : 965/22439/167 causal constraints in 36 ms.
[2021-05-13 09:19:18] [INFO ] Added : 144 causal constraints over 40 iterations in 3255 ms. Result :sat
[2021-05-13 09:19:18] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:19:18] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2021-05-13 09:19:18] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:19:18] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned unsat
[2021-05-13 09:19:18] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:19:18] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 09:19:18] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:19:18] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2021-05-13 09:19:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:19:19] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2021-05-13 09:19:19] [INFO ] [Real]Added 42 Read/Feed constraints in 13 ms returned sat
[2021-05-13 09:19:19] [INFO ] Deduced a trap composed of 5 places in 158 ms
[2021-05-13 09:19:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2021-05-13 09:19:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:19:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2021-05-13 09:19:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:19:19] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2021-05-13 09:19:19] [INFO ] [Nat]Added 42 Read/Feed constraints in 15 ms returned sat
[2021-05-13 09:19:19] [INFO ] Computed and/alt/rep : 965/22439/167 causal constraints in 27 ms.
[2021-05-13 09:19:20] [INFO ] Added : 136 causal constraints over 28 iterations in 1030 ms. Result :sat
[2021-05-13 09:19:20] [INFO ] Deduced a trap composed of 5 places in 126 ms
[2021-05-13 09:19:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2021-05-13 09:19:20] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned unsat
[2021-05-13 09:19:20] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:19:20] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned unsat
[2021-05-13 09:19:20] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 09:19:20] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned unsat
[2021-05-13 09:19:20] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
Successfully simplified 52 atomic propositions for a total of 52 simplifications.
[2021-05-13 09:19:21] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-13 09:19:21] [INFO ] Flatten gal took : 145 ms
[2021-05-13 09:19:21] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-13 09:19:21] [INFO ] Flatten gal took : 90 ms
FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 09:19:21] [INFO ] Applying decomposition
[2021-05-13 09:19:21] [INFO ] Flatten gal took : 70 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/graph10645571648935553050.txt, -o, /tmp/graph10645571648935553050.bin, -w, /tmp/graph10645571648935553050.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/graph10645571648935553050.bin, -l, -1, -v, -w, /tmp/graph10645571648935553050.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 09:19:21] [INFO ] Decomposing Gal with order
[2021-05-13 09:19:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 09:19:22] [INFO ] Removed a total of 2696 redundant transitions.
[2021-05-13 09:19:22] [INFO ] Flatten gal took : 323 ms
[2021-05-13 09:19:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 162 labels/synchronizations in 19 ms.
[2021-05-13 09:19:22] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 2 ms
[2021-05-13 09:19:22] [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, --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,9.78361e+06,132.259,2297164,2,1.07477e+06,5,1.18954e+07,6,0,473,6.04719e+06,0


Converting to forward existential form...Done !
original formula: AX(AG(AF(((((((((((((((((((((((((((((((gu1.SORTI_B+gu1.ATTENTE_A)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu1.NB_ATTENTE_B_11)+gu1.NB_ATTENTE_B_12)+gu1.NB_ATTENTE_B_13)+gu1.NB_ATTENTE_B_14)+gu1.NB_ATTENTE_B_15)+gu1.NB_ATTENTE_B_16)+gu1.NB_ATTENTE_B_17)+gu1.NB_ATTENTE_B_18)+gu1.NB_ATTENTE_B_19)+gu1.NB_ATTENTE_B_20)+gu0.CHOIX_1)+gu0.CHOIX_2)+gu0.SUR_PONT_B)+gu0.SUR_PONT_A)+gu0.ROUTE_B)+gu1.SORTI_A)<=31)&&((((((((((((((((((((((((((((((gu1.VIDANGE_1+gu1.VIDANGE_2)+gu2.CAPACITE)+gu0.ROUTE_B)+gu1.SORTI_B)+gu1.CONTROLEUR_1)+gu1.CONTROLEUR_2)+gu1.ATTENTE_A)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu1.NB_ATTENTE_B_11)+gu1.NB_ATTENTE_B_12)+gu1.NB_ATTENTE_B_13)+gu1.NB_ATTENTE_B_14)+gu1.NB_ATTENTE_B_15)+gu1.NB_ATTENTE_B_16)+gu1.NB_ATTENTE_B_17)+gu1.NB_ATTENTE_B_18)+gu1.NB_ATTENTE_B_19)+gu1.NB_ATTENTE_B_20)+gu1.ATTENTE_B)>=33)))))
=> equivalent forward existential formula: [FwdG(FwdU(EY(Init),TRUE),!(((((((((((((((((((((((((((((((gu1.SORTI_B+gu1.ATTENTE_A)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu1.NB_ATTENTE_B_11)+gu1.NB_ATTENTE_B_12)+gu1.NB_ATTENTE_B_13)+gu1.NB_ATTENTE_B_14)+gu1.NB_ATTENTE_B_15)+gu1.NB_ATTENTE_B_16)+gu1.NB_ATTENTE_B_17)+gu1.NB_ATTENTE_B_18)+gu1.NB_ATTENTE_B_19)+gu1.NB_ATTENTE_B_20)+gu0.CHOIX_1)+gu0.CHOIX_2)+gu0.SUR_PONT_B)+gu0.SUR_PONT_A)+gu0.ROUTE_B)+gu1.SORTI_A)<=31)&&((((((((((((((((((((((((((((((gu1.VIDANGE_1+gu1.VIDANGE_2)+gu2.CAPACITE)+gu0.ROUTE_B)+gu1.SORTI_B)+gu1.CONTROLEUR_1)+gu1.CONTROLEUR_2)+gu1.ATTENTE_A)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu1.NB_ATTENTE_B_11)+gu1.NB_ATTENTE_B_12)+gu1.NB_ATTENTE_B_13)+gu1.NB_ATTENTE_B_14)+gu1.NB_ATTENTE_B_15)+gu1.NB_ATTENTE_B_16)+gu1.NB_ATTENTE_B_17)+gu1.NB_ATTENTE_B_18)+gu1.NB_ATTENTE_B_19)+gu1.NB_ATTENTE_B_20)+gu1.ATTENTE_B)>=33))))] = FALSE
Hit Full ! (commute/partial/dont) 0/0/16
(forward)formula 0,0,910.215,14326040,1,0,290,6.53761e+07,20,3,638973,4.58849e+07,290
FORMULA BridgeAndVehicles-PT-V20P20N20-CTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(!(AF(((((((((gu1.SORTI_A+gu0.ROUTE_B)+gu1.SORTI_B)+gu1.VIDANGE_1)+gu1.VIDANGE_2)+gu1.CONTROLEUR_1)+gu1.CONTROLEUR_2)<=(((((((((((((((((((((((((((((((((((((((((((((gu0.NB_ATTENTE_A_0+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_5)+gu0.NB_ATTENTE_A_6)+gu0.NB_ATTENTE_A_7)+gu0.NB_ATTENTE_A_8)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_10)+gu0.NB_ATTENTE_A_11)+gu0.NB_ATTENTE_A_12)+gu0.NB_ATTENTE_A_13)+gu0.NB_ATTENTE_A_14)+gu0.NB_ATTENTE_A_15)+gu0.NB_ATTENTE_A_16)+gu0.NB_ATTENTE_A_17)+gu0.NB_ATTENTE_A_18)+gu0.NB_ATTENTE_A_19)+gu0.NB_ATTENTE_A_20)+gu1.CONTROLEUR_1)+gu1.CONTROLEUR_2)+gu0.CHOIX_1)+gu0.CHOIX_2)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu1.NB_ATTENTE_B_11)+gu1.NB_ATTENTE_B_12)+gu1.NB_ATTENTE_B_13)+gu1.NB_ATTENTE_B_14)+gu1.NB_ATTENTE_B_15)+gu1.NB_ATTENTE_B_16)+gu1.NB_ATTENTE_B_17)+gu1.NB_ATTENTE_B_18)+gu1.NB_ATTENTE_B_19)+gu1.NB_ATTENTE_B_20))||((((gu1.SORTI_B+gu1.CONTROLEUR_1)+gu1.CONTROLEUR_2)+gu1.ATTENTE_B)<2)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(!(EG(!(((((((((gu1.SORTI_A+gu0.ROUTE_B)+gu1.SORTI_B)+gu1.VIDANGE_1)+gu1.VIDANGE_2)+gu1.CONTROLEUR_1)+gu1.CONTROLEUR_2)<=(((((((((((((((((((((((((((((((((((((((((((((gu0.NB_ATTENTE_A_0+gu0.NB_ATTENTE_A_1)+gu0.NB_ATTENTE_A_2)+gu0.NB_ATTENTE_A_3)+gu0.NB_ATTENTE_A_4)+gu0.NB_ATTENTE_A_5)+gu0.NB_ATTENTE_A_6)+gu0.NB_ATTENTE_A_7)+gu0.NB_ATTENTE_A_8)+gu0.NB_ATTENTE_A_9)+gu0.NB_ATTENTE_A_10)+gu0.NB_ATTENTE_A_11)+gu0.NB_ATTENTE_A_12)+gu0.NB_ATTENTE_A_13)+gu0.NB_ATTENTE_A_14)+gu0.NB_ATTENTE_A_15)+gu0.NB_ATTENTE_A_16)+gu0.NB_ATTENTE_A_17)+gu0.NB_ATTENTE_A_18)+gu0.NB_ATTENTE_A_19)+gu0.NB_ATTENTE_A_20)+gu1.CONTROLEUR_1)+gu1.CONTROLEUR_2)+gu0.CHOIX_1)+gu0.CHOIX_2)+gu1.NB_ATTENTE_B_0)+gu1.NB_ATTENTE_B_1)+gu1.NB_ATTENTE_B_2)+gu1.NB_ATTENTE_B_3)+gu1.NB_ATTENTE_B_4)+gu1.NB_ATTENTE_B_5)+gu1.NB_ATTENTE_B_6)+gu1.NB_ATTENTE_B_7)+gu1.NB_ATTENTE_B_8)+gu1.NB_ATTENTE_B_9)+gu1.NB_ATTENTE_B_10)+gu1.NB_ATTENTE_B_11)+gu1.NB_ATTENTE_B_12)+gu1.NB_ATTENTE_B_13)+gu1.NB_ATTENTE_B_14)+gu1.NB_ATTENTE_B_15)+gu1.NB_ATTENTE_B_16)+gu1.NB_ATTENTE_B_17)+gu1.NB_ATTENTE_B_18)+gu1.NB_ATTENTE_B_19)+gu1.NB_ATTENTE_B_20))||((((gu1.SORTI_B+gu1.CONTROLEUR_1)+gu1.CONTROLEUR_2)+gu1.ATTENTE_B)<2))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions enregistrement_A_20, liberation_A, basculement_1, basculement_2, liberation_B, enregistrement_B_11, altern_cpt_1_20, altern_cpt_2_20, timeout_A_1_2_0_1, timeout_A_1_20_0_1, timeout_B_2_2_5_0, timeout_B_2_20_5_0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/4/12/16
Detected timeout of ITS tools.
[2021-05-13 09:39:31] [INFO ] Flatten gal took : 402 ms
[2021-05-13 09:39:32] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 94 ms
[2021-05-13 09:39:32] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 25 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 8 CTL formulae.
Detected timeout of ITS tools.
[2021-05-13 09:59:39] [INFO ] Flatten gal took : 131 ms
[2021-05-13 09:59:40] [INFO ] Input system was already deterministic with 968 transitions.
[2021-05-13 09:59:40] [INFO ] Transformed 78 places.
[2021-05-13 09:59:40] [INFO ] Transformed 968 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-13 09:59:40] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 14 ms
[2021-05-13 09:59:40] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 3 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 8 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="BridgeAndVehicles-PT-V20P20N20"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is BridgeAndVehicles-PT-V20P20N20, 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 r035-tajo-162038167700053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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