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-162089432400023.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-COL-22, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tajo-162089432400023
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 125K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K 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 3.6K Mar 28 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 10:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 10:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 13:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 13:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 104K 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-COL-22-ReachabilityCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1621408744054

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 07:19:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-19 07:19:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 07:19:05] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2021-05-19 07:19:06] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 642 ms
[2021-05-19 07:19:06] [INFO ] sort/places :
tsidxtsid->n9,n8,n7,
Dot->malicious_reservoir,CstopAbort,SstopAbort,AstopAbort,a5,a4,a3,a2,a1,Astart,AstopOK,
tsid->n6,n5,n4,n3,n2,n1,c1,Cstart,Sstart,s2,s3,s4,s5,s6,SstopOK,CstopOK,

[2021-05-19 07:19:06] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1966 PT places and 356.0 transition bindings in 21 ms.
[2021-05-19 07:19:06] [INFO ] Computed order based on color domains.
[2021-05-19 07:19:06] [INFO ] Unfolded HLPN to a Petri net with 1966 places and 356 transitions in 29 ms.
[2021-05-19 07:19:06] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 60 ms.
Working with output stream class java.io.PrintStream
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 369 resets, run finished after 398 ms. (steps per millisecond=25 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0]
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 49 ms. (steps per millisecond=204 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 102 ms. (steps per millisecond=98 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 132 ms. (steps per millisecond=75 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 97 ms. (steps per millisecond=103 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 107 ms. (steps per millisecond=93 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 45 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 356 rows 1966 cols
[2021-05-19 07:19:07] [INFO ] Computed 1611 place invariants in 74 ms
[2021-05-19 07:19:08] [INFO ] [Real]Absence check using 4 positive place invariants in 40 ms returned sat
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 1704 ms returned sat
[2021-05-19 07:19:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:12] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:19:12] [INFO ] [Real]Absence check using state equation in 3011 ms returned (error "Failed to check-sat")
[2021-05-19 07:19:12] [INFO ] [Real]Absence check using 4 positive place invariants in 22 ms returned sat
[2021-05-19 07:19:14] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 1781 ms returned sat
[2021-05-19 07:19:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:17] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:19:17] [INFO ] [Real]Absence check using state equation in 3016 ms returned (error "Failed to check-sat")
[2021-05-19 07:19:17] [INFO ] [Real]Absence check using 4 positive place invariants in 23 ms returned sat
[2021-05-19 07:19:19] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 1898 ms returned sat
[2021-05-19 07:19:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:22] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:19:22] [INFO ] [Real]Absence check using state equation in 2868 ms returned (error "Failed to check-sat")
[2021-05-19 07:19:22] [INFO ] [Real]Absence check using 4 positive place invariants in 26 ms returned sat
[2021-05-19 07:19:24] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 1675 ms returned sat
[2021-05-19 07:19:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:27] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:19:27] [INFO ] [Real]Absence check using state equation in 3107 ms returned (error "Failed to check-sat")
[2021-05-19 07:19:28] [INFO ] [Real]Absence check using 4 positive place invariants in 23 ms returned unsat
[2021-05-19 07:19:28] [INFO ] [Real]Absence check using 4 positive place invariants in 26 ms returned sat
[2021-05-19 07:19:30] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 1915 ms returned sat
[2021-05-19 07:19:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:33] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:19:33] [INFO ] [Real]Absence check using state equation in 2877 ms returned (error "Failed to check-sat")
[2021-05-19 07:19:33] [INFO ] [Real]Absence check using 4 positive place invariants in 19 ms returned sat
[2021-05-19 07:19:34] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 1700 ms returned sat
[2021-05-19 07:19:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:38] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:19:38] [INFO ] [Real]Absence check using state equation in 3136 ms returned (error "Failed to check-sat")
[2021-05-19 07:19:38] [INFO ] [Real]Absence check using 4 positive place invariants in 23 ms returned sat
[2021-05-19 07:19:40] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 2019 ms returned sat
[2021-05-19 07:19:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:43] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:19:43] [INFO ] [Real]Absence check using state equation in 2826 ms returned (error "Failed to check-sat")
[2021-05-19 07:19:43] [INFO ] [Real]Absence check using 4 positive place invariants in 16 ms returned unsat
[2021-05-19 07:19:43] [INFO ] [Real]Absence check using 4 positive place invariants in 21 ms returned unsat
[2021-05-19 07:19:43] [INFO ] [Real]Absence check using 4 positive place invariants in 16 ms returned unsat
[2021-05-19 07:19:43] [INFO ] [Real]Absence check using 4 positive place invariants in 25 ms returned sat
[2021-05-19 07:19:45] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 1787 ms returned sat
[2021-05-19 07:19:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:48] [INFO ] [Real]Absence check using state equation in 2966 ms returned (error "Solver has unexpectedly terminated")
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 1893 out of 1966 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1966/1966 places, 356/356 transitions.
Discarding 47 places :
Also discarding 0 output transitions
Graph (complete) has 16044 edges and 1966 vertex of which 1919 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.27 ms
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1919 transition count 355
Applied a total of 2 rules in 92 ms. Remains 1919 /1966 variables (removed 47) and now considering 355/356 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 1919/1966 places, 355/356 transitions.
Interrupted random walk after 937972 steps, including 34859 resets, run timeout after 30001 ms. (steps per millisecond=31 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2312 resets, run finished after 4038 ms. (steps per millisecond=247 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2240 resets, run finished after 3803 ms. (steps per millisecond=262 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 794 resets, run finished after 4838 ms. (steps per millisecond=206 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 515703 steps, including 1150 resets, run timeout after 5001 ms. (steps per millisecond=103 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 389134 steps, including 972 resets, run timeout after 5001 ms. (steps per millisecond=77 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 518120 steps, including 1149 resets, run timeout after 5001 ms. (steps per millisecond=103 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 484449 steps, including 1085 resets, run timeout after 5001 ms. (steps per millisecond=96 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3076 resets, run finished after 4533 ms. (steps per millisecond=220 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 9112185 steps, run timeout after 30001 ms. (steps per millisecond=303 ) properties seen :[1, 0, 0, 1, 0, 1, 1, 0]
Probabilistic random walk after 9112185 steps, saw 979348 distinct states, run finished after 30001 ms. (steps per millisecond=303 ) properties seen :[1, 0, 0, 1, 0, 1, 1, 0]
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 355 rows 1919 cols
[2021-05-19 07:21:25] [INFO ] Computed 1566 place invariants in 76 ms
[2021-05-19 07:21:26] [INFO ] [Real]Absence check using 3 positive place invariants in 35 ms returned sat
[2021-05-19 07:21:27] [INFO ] [Real]Absence check using 3 positive and 1563 generalized place invariants in 1691 ms returned sat
[2021-05-19 07:21:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:21:35] [INFO ] [Real]Absence check using state equation in 7280 ms returned sat
[2021-05-19 07:21:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:21:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 25 ms returned sat
[2021-05-19 07:21:37] [INFO ] [Nat]Absence check using 3 positive and 1563 generalized place invariants in 1636 ms returned sat
[2021-05-19 07:21:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:21:43] [INFO ] [Nat]Absence check using state equation in 6688 ms returned sat
[2021-05-19 07:21:43] [INFO ] Computed and/alt/rep : 331/1987/331 causal constraints in 33 ms.
[2021-05-19 07:21:45] [INFO ] Added : 84 causal constraints over 17 iterations in 1136 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 27 ms.
[2021-05-19 07:21:45] [INFO ] [Real]Absence check using 3 positive place invariants in 29 ms returned sat
[2021-05-19 07:21:47] [INFO ] [Real]Absence check using 3 positive and 1563 generalized place invariants in 1827 ms returned sat
[2021-05-19 07:21:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:22:09] [INFO ] [Real]Absence check using state equation in 22208 ms returned unsat
[2021-05-19 07:22:09] [INFO ] [Real]Absence check using 3 positive place invariants in 18 ms returned sat
[2021-05-19 07:22:11] [INFO ] [Real]Absence check using 3 positive and 1563 generalized place invariants in 2024 ms returned sat
[2021-05-19 07:22:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:22:19] [INFO ] [Real]Absence check using state equation in 7630 ms returned sat
[2021-05-19 07:22:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:22:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 23 ms returned sat
[2021-05-19 07:22:21] [INFO ] [Nat]Absence check using 3 positive and 1563 generalized place invariants in 1839 ms returned sat
[2021-05-19 07:22:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:22:33] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:22:36] [INFO ] [Nat]Absence check using state equation in 15137 ms returned unknown
[2021-05-19 07:22:36] [INFO ] [Real]Absence check using 3 positive place invariants in 23 ms returned sat
[2021-05-19 07:22:38] [INFO ] [Real]Absence check using 3 positive and 1563 generalized place invariants in 2208 ms returned sat
[2021-05-19 07:22:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:22:45] [INFO ] [Real]Absence check using state equation in 6441 ms returned sat
[2021-05-19 07:22:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:22:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 25 ms returned sat
[2021-05-19 07:22:47] [INFO ] [Nat]Absence check using 3 positive and 1563 generalized place invariants in 1681 ms returned sat
[2021-05-19 07:22:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:22:59] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 07:22:59] [INFO ] [Nat]Absence check using state equation in 12564 ms returned sat
[2021-05-19 07:23:00] [INFO ] Deduced a trap composed of 5 places in 888 ms
[2021-05-19 07:23:01] [INFO ] Deduced a trap composed of 9 places in 730 ms
[2021-05-19 07:23:02] [INFO ] Deduced a trap composed of 5 places in 688 ms
[2021-05-19 07:23:02] [INFO ] Deduced a trap composed of 5 places in 682 ms
[2021-05-19 07:23:03] [INFO ] Deduced a trap composed of 5 places in 695 ms
[2021-05-19 07:23:04] [INFO ] Deduced a trap composed of 5 places in 620 ms
[2021-05-19 07:23:04] [INFO ] Deduced a trap composed of 5 places in 601 ms
[2021-05-19 07:23:05] [INFO ] Deduced a trap composed of 5 places in 582 ms
[2021-05-19 07:23:06] [INFO ] Deduced a trap composed of 5 places in 547 ms
[2021-05-19 07:23:06] [INFO ] Deduced a trap composed of 5 places in 672 ms
[2021-05-19 07:23:07] [INFO ] Deduced a trap composed of 5 places in 634 ms
[2021-05-19 07:23:08] [INFO ] Deduced a trap composed of 5 places in 520 ms
[2021-05-19 07:23:08] [INFO ] Deduced a trap composed of 5 places in 506 ms
[2021-05-19 07:23:08] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 8941 ms
[2021-05-19 07:23:08] [INFO ] Computed and/alt/rep : 331/1987/331 causal constraints in 43 ms.
[2021-05-19 07:23:10] [INFO ] Added : 155 causal constraints over 32 iterations in 2230 ms. Result :sat
[2021-05-19 07:23:11] [INFO ] Deduced a trap composed of 9 places in 71 ms
[2021-05-19 07:23:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
Attempting to minimize the solution found.
Minimization took 41 ms.
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 16700 steps, including 184 resets, run finished after 192 ms. (steps per millisecond=86 ) properties seen :[1, 1, 0] could not realise parikh vector
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 8500 steps, including 118 resets, run finished after 46 ms. (steps per millisecond=184 ) properties seen :[0] could not realise parikh vector
Support contains 92 out of 1919 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1919/1919 places, 355/355 transitions.
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 15422 edges and 1919 vertex of which 1915 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.9 ms
Drop transitions removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Discarding 46 places :
Implicit places reduction removed 46 places
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Iterating post reduction 0 with 190 rules applied. Total rules applied 191 place count 1869 transition count 210
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 216 place count 1844 transition count 210
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 216 place count 1844 transition count 187
Deduced a syphon composed of 23 places in 1 ms
Ensure Unique test removed 23 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 69 rules applied. Total rules applied 285 place count 1798 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 286 place count 1798 transition count 186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 287 place count 1797 transition count 186
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Ensure Unique test removed 506 places
Reduce places removed 529 places and 0 transitions.
Iterating global reduction 4 with 552 rules applied. Total rules applied 839 place count 1268 transition count 163
Applied a total of 839 rules in 467 ms. Remains 1268 /1919 variables (removed 651) and now considering 163/355 (removed 192) transitions.
Finished structural reductions, in 1 iterations. Remains : 1268/1919 places, 163/355 transitions.
Finished random walk after 91 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=30 )
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

--------------------
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-COL-22"
export BK_EXAMINATION="ReachabilityCardinality"
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-COL-22, examination is ReachabilityCardinality"
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-162089432400023"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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