About the Execution of 2020-gold for QuasiCertifProtocol-PT-28
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
7132.544 | 3600000.00 | 3641712.00 | 715.40 | TT??FT?TFFF?FFTF | 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.r189-tajo-162089432500053.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 QuasiCertifProtocol-PT-28, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tajo-162089432500053
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 333K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.0M May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 71K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 419K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 27K Mar 28 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 118K Mar 28 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 28 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 35K Mar 28 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Mar 27 10:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 27 10:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 25 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 25 13:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 22 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.9K Mar 22 08:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.4M 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 QuasiCertifProtocol-PT-28-00
FORMULA_NAME QuasiCertifProtocol-PT-28-01
FORMULA_NAME QuasiCertifProtocol-PT-28-02
FORMULA_NAME QuasiCertifProtocol-PT-28-03
FORMULA_NAME QuasiCertifProtocol-PT-28-04
FORMULA_NAME QuasiCertifProtocol-PT-28-05
FORMULA_NAME QuasiCertifProtocol-PT-28-06
FORMULA_NAME QuasiCertifProtocol-PT-28-07
FORMULA_NAME QuasiCertifProtocol-PT-28-08
FORMULA_NAME QuasiCertifProtocol-PT-28-09
FORMULA_NAME QuasiCertifProtocol-PT-28-10
FORMULA_NAME QuasiCertifProtocol-PT-28-11
FORMULA_NAME QuasiCertifProtocol-PT-28-12
FORMULA_NAME QuasiCertifProtocol-PT-28-13
FORMULA_NAME QuasiCertifProtocol-PT-28-14
FORMULA_NAME QuasiCertifProtocol-PT-28-15
=== Now, execution of the tool begins
BK_START 1621409240137
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 07:27:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-19 07:27:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 07:27:21] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2021-05-19 07:27:21] [INFO ] Transformed 2998 places.
[2021-05-19 07:27:21] [INFO ] Transformed 446 transitions.
[2021-05-19 07:27:22] [INFO ] Parsed PT model containing 2998 places and 446 transitions in 168 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 51 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 3023 resets, run finished after 1334 ms. (steps per millisecond=74 ) properties seen :[0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 446 rows 2998 cols
[2021-05-19 07:27:23] [INFO ] Computed 2553 place invariants in 179 ms
[2021-05-19 07:27:24] [INFO ] [Real]Absence check using 32 positive place invariants in 127 ms returned sat
[2021-05-19 07:27:29] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4646 ms returned sat
[2021-05-19 07:27:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:27:43] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:27:43] [INFO ] [Real]Absence check using state equation in 14474 ms returned (error "Failed to check-sat")
[2021-05-19 07:27:44] [INFO ] [Real]Absence check using 32 positive place invariants in 111 ms returned unsat
[2021-05-19 07:27:44] [INFO ] [Real]Absence check using 32 positive place invariants in 123 ms returned sat
[2021-05-19 07:27:48] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4308 ms returned sat
[2021-05-19 07:27:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:28:04] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:28:04] [INFO ] [Real]Absence check using state equation in 15283 ms returned (error "Failed to check-sat")
[2021-05-19 07:28:04] [INFO ] [Real]Absence check using 32 positive place invariants in 119 ms returned sat
[2021-05-19 07:28:09] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4998 ms returned sat
[2021-05-19 07:28:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:28:24] [INFO ] [Real]Absence check using state equation in 14581 ms returned (error "Failed to check-sat")
[2021-05-19 07:28:24] [INFO ] [Real]Absence check using 32 positive place invariants in 128 ms returned sat
[2021-05-19 07:28:29] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4625 ms returned sat
[2021-05-19 07:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:28:44] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:28:44] [INFO ] [Real]Absence check using state equation in 14893 ms returned (error "Failed to check-sat")
[2021-05-19 07:28:44] [INFO ] [Real]Absence check using 32 positive place invariants in 48 ms returned unsat
[2021-05-19 07:28:45] [INFO ] [Real]Absence check using 32 positive place invariants in 125 ms returned sat
[2021-05-19 07:28:49] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4255 ms returned sat
[2021-05-19 07:28:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:29:04] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:29:04] [INFO ] [Real]Absence check using state equation in 15243 ms returned unknown
[2021-05-19 07:29:04] [INFO ] [Real]Absence check using 32 positive place invariants in 121 ms returned sat
[2021-05-19 07:29:09] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4210 ms returned sat
[2021-05-19 07:29:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:29:23] [INFO ] [Real]Absence check using state equation in 14247 ms returned sat
[2021-05-19 07:29:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:29:23] [INFO ] [Nat]Absence check using 32 positive place invariants in 99 ms returned sat
[2021-05-19 07:29:28] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 4338 ms returned sat
[2021-05-19 07:29:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:29:43] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:29:43] [INFO ] [Nat]Absence check using state equation in 15377 ms returned unknown
[2021-05-19 07:29:44] [INFO ] [Real]Absence check using 32 positive place invariants in 114 ms returned sat
[2021-05-19 07:29:48] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4788 ms returned sat
[2021-05-19 07:29:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:30:03] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:30:03] [INFO ] [Real]Absence check using state equation in 14811 ms returned (error "Failed to check-sat")
[2021-05-19 07:30:04] [INFO ] [Real]Absence check using 32 positive place invariants in 131 ms returned sat
[2021-05-19 07:30:08] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4363 ms returned sat
[2021-05-19 07:30:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:30:23] [INFO ] [Real]Absence check using state equation in 15091 ms returned sat
[2021-05-19 07:30:27] [INFO ] Deduced a trap composed of 10 places in 4040 ms
[2021-05-19 07:30:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s213 s214 s219 s220 s2624 s2829 s2833 s2863 s2919 s2961) 0)") while checking expression at index 9
[2021-05-19 07:30:28] [INFO ] [Real]Absence check using 32 positive place invariants in 97 ms returned sat
[2021-05-19 07:30:32] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4290 ms returned sat
[2021-05-19 07:30:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:30:46] [INFO ] [Real]Absence check using state equation in 14506 ms returned sat
[2021-05-19 07:30:47] [INFO ] Computed and/alt/rep : 416/3055/416 causal constraints in 50 ms.
[2021-05-19 07:30:47] [INFO ] Added : 25 causal constraints over 5 iterations in 668 ms. Result :(error "Solver has unexpectedly terminated")
[2021-05-19 07:30:48] [INFO ] [Real]Absence check using 32 positive place invariants in 115 ms returned sat
[2021-05-19 07:30:52] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4313 ms returned sat
[2021-05-19 07:30:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:31:07] [INFO ] [Real]Absence check using state equation in 14991 ms returned sat
[2021-05-19 07:31:07] [INFO ] Computed and/alt/rep : 416/3055/416 causal constraints in 62 ms.
[2021-05-19 07:31:07] [INFO ] Added : 5 causal constraints over 1 iterations in 160 ms. Result :unknown
[2021-05-19 07:31:08] [INFO ] [Real]Absence check using 32 positive place invariants in 91 ms returned sat
[2021-05-19 07:31:12] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4164 ms returned sat
[2021-05-19 07:31:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:31:27] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:31:27] [INFO ] [Real]Absence check using state equation in 15505 ms returned (error "Failed to check-sat")
[2021-05-19 07:31:28] [INFO ] [Real]Absence check using 32 positive place invariants in 26 ms returned unsat
[2021-05-19 07:31:28] [INFO ] [Real]Absence check using 32 positive place invariants in 18 ms returned unsat
[2021-05-19 07:31:28] [INFO ] [Real]Absence check using 32 positive place invariants in 117 ms returned sat
[2021-05-19 07:31:34] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 5302 ms returned sat
[2021-05-19 07:31:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:31:48] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:31:48] [INFO ] [Real]Absence check using state equation in 14326 ms returned (error "Failed to check-sat")
[2021-05-19 07:31:48] [INFO ] [Real]Absence check using 32 positive place invariants in 121 ms returned sat
[2021-05-19 07:31:53] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4338 ms returned sat
[2021-05-19 07:31:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:32:08] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:32:08] [INFO ] [Real]Absence check using state equation in 15298 ms returned unknown
[2021-05-19 07:32:08] [INFO ] [Real]Absence check using 32 positive place invariants in 46 ms returned unsat
[2021-05-19 07:32:09] [INFO ] [Real]Absence check using 32 positive place invariants in 116 ms returned sat
[2021-05-19 07:32:13] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4242 ms returned sat
[2021-05-19 07:32:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:32:14] [INFO ] [Real]Absence check using state equation in 685 ms returned unsat
[2021-05-19 07:32:14] [INFO ] [Real]Absence check using 32 positive place invariants in 116 ms returned sat
[2021-05-19 07:32:19] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4584 ms returned sat
[2021-05-19 07:32:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:32:34] [INFO ] [Real]Absence check using state equation in 14939 ms returned (error "Solver has unexpectedly terminated")
[2021-05-19 07:32:34] [INFO ] [Real]Absence check using 32 positive place invariants in 19 ms returned unsat
[2021-05-19 07:32:35] [INFO ] [Real]Absence check using 32 positive place invariants in 109 ms returned sat
[2021-05-19 07:32:40] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 5012 ms returned sat
[2021-05-19 07:32:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:32:54] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:32:54] [INFO ] [Real]Absence check using state equation in 14556 ms returned unknown
[2021-05-19 07:32:55] [INFO ] [Real]Absence check using 32 positive place invariants in 118 ms returned sat
[2021-05-19 07:32:59] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4636 ms returned sat
[2021-05-19 07:32:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:33:14] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:33:14] [INFO ] [Real]Absence check using state equation in 14972 ms returned (error "Failed to check-sat")
[2021-05-19 07:33:14] [INFO ] [Real]Absence check using 32 positive place invariants in 119 ms returned sat
[2021-05-19 07:33:19] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4798 ms returned sat
[2021-05-19 07:33:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:33:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (= s2819 (- t368 0))") while checking expression at index 23
[2021-05-19 07:33:35] [INFO ] [Real]Absence check using 32 positive place invariants in 110 ms returned unsat
[2021-05-19 07:33:35] [INFO ] [Real]Absence check using 32 positive place invariants in 116 ms returned sat
[2021-05-19 07:33:39] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 3879 ms returned sat
[2021-05-19 07:33:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:33:55] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:33:55] [INFO ] [Real]Absence check using state equation in 15668 ms returned (error "Failed to check-sat")
[2021-05-19 07:33:55] [INFO ] [Real]Absence check using 32 positive place invariants in 116 ms returned sat
[2021-05-19 07:33:59] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4364 ms returned sat
[2021-05-19 07:33:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:34:15] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:34:15] [INFO ] [Real]Absence check using state equation in 15237 ms returned (error "Failed to check-sat")
[2021-05-19 07:34:15] [INFO ] [Real]Absence check using 32 positive place invariants in 118 ms returned sat
[2021-05-19 07:34:20] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4502 ms returned sat
[2021-05-19 07:34:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:34:20] [INFO ] [Real]Absence check using state equation in 877 ms returned unsat
[2021-05-19 07:34:21] [INFO ] [Real]Absence check using 32 positive place invariants in 83 ms returned sat
[2021-05-19 07:34:25] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4461 ms returned sat
[2021-05-19 07:34:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:34:26] [INFO ] [Real]Absence check using state equation in 769 ms returned unsat
[2021-05-19 07:34:26] [INFO ] [Real]Absence check using 32 positive place invariants in 117 ms returned sat
[2021-05-19 07:34:31] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4307 ms returned sat
[2021-05-19 07:34:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:34:46] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:34:46] [INFO ] [Real]Absence check using state equation in 15264 ms returned (error "Failed to check-sat")
[2021-05-19 07:34:46] [INFO ] [Real]Absence check using 32 positive place invariants in 116 ms returned sat
[2021-05-19 07:34:51] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4190 ms returned sat
[2021-05-19 07:34:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:35:06] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:35:06] [INFO ] [Real]Absence check using state equation in 15414 ms returned (error "Failed to check-sat")
[2021-05-19 07:35:06] [INFO ] [Real]Absence check using 32 positive place invariants in 117 ms returned sat
[2021-05-19 07:35:11] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4420 ms returned sat
[2021-05-19 07:35:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:35:26] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:35:26] [INFO ] [Real]Absence check using state equation in 15166 ms returned unknown
[2021-05-19 07:35:26] [INFO ] [Real]Absence check using 32 positive place invariants in 118 ms returned sat
[2021-05-19 07:35:31] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 4861 ms returned sat
[2021-05-19 07:35:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:35:46] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:35:46] [INFO ] [Real]Absence check using state equation in 14747 ms returned unknown
Successfully simplified 10 atomic propositions for a total of 14 simplifications.
[2021-05-19 07:35:46] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2021-05-19 07:35:47] [INFO ] Flatten gal took : 276 ms
FORMULA QuasiCertifProtocol-PT-28-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 07:35:47] [INFO ] Flatten gal took : 143 ms
[2021-05-19 07:35:47] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 5 ms.
[2021-05-19 07:35:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 21 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ QuasiCertifProtocol-PT-28 @ 3570 seconds
FORMULA QuasiCertifProtocol-PT-28-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-28-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-28-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-28-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427488 kB
MemFree: 12122804 kB
After kill :
MemTotal: 16427488 kB
MemFree: 16104856 kB
--------------------
content from stderr:
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="LTLCardinality"
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 QuasiCertifProtocol-PT-28, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r189-tajo-162089432500053"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;