fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r075-tall-162039097400216
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for DLCround-PT-12b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
445.712 3600000.00 68341.00 540.80 TTTTFTFTTTFTTFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r075-tall-162039097400216.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 DLCround-PT-12b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097400216
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 123K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K May 5 16:58 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 3.1K Mar 28 15:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 08:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 08:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 16:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 22 16:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.9M 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 DLCround-PT-12b-ReachabilityFireability-00
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-01
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-02
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-03
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-04
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-05
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-06
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-07
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-08
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-09
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-10
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-11
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-12
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-13
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-14
FORMULA_NAME DLCround-PT-12b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620545609140

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-09 07:33:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-09 07:33:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 07:33:31] [INFO ] Load time of PNML (sax parser for PT used): 339 ms
[2021-05-09 07:33:31] [INFO ] Transformed 4848 places.
[2021-05-09 07:33:31] [INFO ] Transformed 7836 transitions.
[2021-05-09 07:33:31] [INFO ] Found NUPN structural information;
[2021-05-09 07:33:31] [INFO ] Parsed PT model containing 4848 places and 7836 transitions in 521 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 297 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 145 ms. (steps per millisecond=68 ) properties seen :[1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1]
FORMULA DLCround-PT-12b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 7836 rows 4848 cols
[2021-05-09 07:33:32] [INFO ] Computed 277 place invariants in 115 ms
[2021-05-09 07:33:34] [INFO ] [Real]Absence check using 277 positive place invariants in 1045 ms returned sat
[2021-05-09 07:33:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:33:37] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 07:33:37] [INFO ] [Real]Absence check using state equation in 3188 ms returned (error "Failed to check-sat")
[2021-05-09 07:33:38] [INFO ] [Real]Absence check using 277 positive place invariants in 879 ms returned sat
[2021-05-09 07:33:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:33:42] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 07:33:42] [INFO ] [Real]Absence check using state equation in 3526 ms returned (error "Failed to check-sat")
[2021-05-09 07:33:43] [INFO ] [Real]Absence check using 277 positive place invariants in 819 ms returned sat
[2021-05-09 07:33:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:33:47] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 07:33:47] [INFO ] [Real]Absence check using state equation in 3599 ms returned (error "Failed to check-sat")
[2021-05-09 07:33:48] [INFO ] [Real]Absence check using 277 positive place invariants in 819 ms returned sat
[2021-05-09 07:33:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:33:52] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 07:33:52] [INFO ] [Real]Absence check using state equation in 3617 ms returned (error "Failed to check-sat")
[2021-05-09 07:33:53] [INFO ] [Real]Absence check using 277 positive place invariants in 833 ms returned sat
[2021-05-09 07:33:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:33:57] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 07:33:57] [INFO ] [Real]Absence check using state equation in 3554 ms returned (error "Failed to check-sat")
[2021-05-09 07:33:58] [INFO ] [Real]Absence check using 277 positive place invariants in 825 ms returned sat
[2021-05-09 07:33:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:34:02] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 07:34:02] [INFO ] [Real]Absence check using state equation in 3609 ms returned (error "Failed to check-sat")
[2021-05-09 07:34:03] [INFO ] [Real]Absence check using 277 positive place invariants in 663 ms returned unsat
FORMULA DLCround-PT-12b-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 28 out of 4848 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4848/4848 places, 7836/7836 transitions.
Graph (trivial) has 4365 edges and 4848 vertex of which 695 / 4848 are part of one of the 56 SCC in 26 ms
Free SCC test removed 639 places
Drop transitions removed 718 transitions
Reduce isomorphic transitions removed 718 transitions.
Performed 1756 Post agglomeration using F-continuation condition.Transition count delta: 1756
Iterating post reduction 0 with 2474 rules applied. Total rules applied 2475 place count 4209 transition count 5362
Reduce places removed 1756 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Iterating post reduction 1 with 1837 rules applied. Total rules applied 4312 place count 2453 transition count 5281
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 40 rules applied. Total rules applied 4352 place count 2419 transition count 5275
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 4355 place count 2416 transition count 5275
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 4355 place count 2416 transition count 5252
Deduced a syphon composed of 23 places in 73 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 4401 place count 2393 transition count 5252
Symmetric choice reduction at 4 with 667 rule applications. Total rules 5068 place count 2393 transition count 5252
Deduced a syphon composed of 667 places in 100 ms
Reduce places removed 667 places and 667 transitions.
Iterating global reduction 4 with 1334 rules applied. Total rules applied 6402 place count 1726 transition count 4585
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 6 rules applied. Total rules applied 6408 place count 1726 transition count 4579
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 6411 place count 1724 transition count 4578
Performed 295 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 295 Pre rules applied. Total rules applied 6411 place count 1724 transition count 4283
Deduced a syphon composed of 295 places in 28 ms
Reduce places removed 295 places and 0 transitions.
Iterating global reduction 6 with 590 rules applied. Total rules applied 7001 place count 1429 transition count 4283
Symmetric choice reduction at 6 with 83 rule applications. Total rules 7084 place count 1429 transition count 4283
Deduced a syphon composed of 83 places in 27 ms
Reduce places removed 83 places and 1292 transitions.
Iterating global reduction 6 with 166 rules applied. Total rules applied 7250 place count 1346 transition count 2991
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 6 with 24 rules applied. Total rules applied 7274 place count 1346 transition count 2967
Performed 355 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 355 places in 0 ms
Reduce places removed 355 places and 0 transitions.
Iterating global reduction 7 with 710 rules applied. Total rules applied 7984 place count 991 transition count 2601
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 7993 place count 991 transition count 2592
Renaming transitions due to excessive name length > 1024 char.
Symmetric choice reduction at 8 with 5 rule applications. Total rules 7998 place count 991 transition count 2592
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 80 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 8008 place count 986 transition count 2512
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -186
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 8 with 42 rules applied. Total rules applied 8050 place count 965 transition count 2698
Drop transitions removed 16 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 8071 place count 965 transition count 2677
Free-agglomeration rule applied 534 times with reduction of 219 identical transitions.
Iterating global reduction 9 with 534 rules applied. Total rules applied 8605 place count 965 transition count 1924
Reduce places removed 534 places and 0 transitions.
Drop transitions removed 560 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 572 transitions.
Discarding 27 places :
Also discarding 53 output transitions
Drop transitions removed 53 transitions
Graph (complete) has 1617 edges and 431 vertex of which 404 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.6 ms
Iterating post reduction 9 with 1107 rules applied. Total rules applied 9712 place count 404 transition count 1299
Drop transitions removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 10 with 46 rules applied. Total rules applied 9758 place count 404 transition count 1253
Symmetric choice reduction at 11 with 1 rule applications. Total rules 9759 place count 404 transition count 1253
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 13 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 9761 place count 403 transition count 1240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 9762 place count 403 transition count 1239
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 9764 place count 402 transition count 1238
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 9766 place count 401 transition count 1250
Drop transitions removed 13 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 12 with 14 rules applied. Total rules applied 9780 place count 401 transition count 1236
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 13 with 29 rules applied. Total rules applied 9809 place count 401 transition count 1657
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 454 transitions
Reduce isomorphic transitions removed 454 transitions.
Iterating post reduction 13 with 483 rules applied. Total rules applied 10292 place count 372 transition count 1203
Symmetric choice reduction at 14 with 7 rule applications. Total rules 10299 place count 372 transition count 1203
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 14 with 14 rules applied. Total rules applied 10313 place count 365 transition count 1196
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 14 with 96 rules applied. Total rules applied 10409 place count 365 transition count 1100
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 15 with 10 rules applied. Total rules applied 10419 place count 360 transition count 1095
Drop transitions removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Discarding 24 places :
Also discarding 0 output transitions
Graph (complete) has 1251 edges and 360 vertex of which 336 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Iterating post reduction 15 with 81 rules applied. Total rules applied 10500 place count 336 transition count 1015
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 10503 place count 336 transition count 1015
Drop transitions removed 97 transitions
Redundant transition composition rules discarded 97 transitions
Iterating global reduction 16 with 97 rules applied. Total rules applied 10600 place count 336 transition count 918
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 16 with 11 rules applied. Total rules applied 10611 place count 326 transition count 917
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 10612 place count 325 transition count 917
Symmetric choice reduction at 18 with 1 rule applications. Total rules 10613 place count 325 transition count 917
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 10615 place count 324 transition count 916
Symmetric choice reduction at 18 with 1 rule applications. Total rules 10616 place count 324 transition count 916
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 16 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 10618 place count 323 transition count 900
Free-agglomeration rule applied 1 times.
Iterating global reduction 18 with 1 rules applied. Total rules applied 10619 place count 323 transition count 899
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Discarding 9 places :
Also discarding 0 output transitions
Graph (complete) has 1120 edges and 322 vertex of which 313 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Iterating post reduction 18 with 18 rules applied. Total rules applied 10637 place count 313 transition count 883
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 10638 place count 313 transition count 882
Applied a total of 10638 rules in 2266 ms. Remains 313 /4848 variables (removed 4535) and now considering 882/7836 (removed 6954) transitions.
Finished structural reductions, in 1 iterations. Remains : 313/4848 places, 882/7836 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 6872 ms. (steps per millisecond=145 ) properties seen :[0, 1, 1, 1, 1, 0]
FORMULA DLCround-PT-12b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-12b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 3128 ms. (steps per millisecond=319 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 3341 ms. (steps per millisecond=299 ) properties seen :[0, 1]
FORMULA DLCround-PT-12b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2021-05-09 07:34:19] [INFO ] Flow matrix only has 241 transitions (discarded 641 similar events)
// Phase 1: matrix 241 rows 313 cols
[2021-05-09 07:34:19] [INFO ] Computed 216 place invariants in 2 ms
[2021-05-09 07:34:19] [INFO ] [Real]Absence check using 216 positive place invariants in 76 ms returned sat
[2021-05-09 07:34:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:34:19] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2021-05-09 07:34:19] [INFO ] State equation strengthened by 72 read => feed constraints.
[2021-05-09 07:34:19] [INFO ] [Real]Added 72 Read/Feed constraints in 28 ms returned sat
[2021-05-09 07:34:19] [INFO ] Computed and/alt/rep : 878/13605/237 causal constraints in 47 ms.
[2021-05-09 07:34:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:34:19] [INFO ] [Nat]Absence check using 216 positive place invariants in 79 ms returned sat
[2021-05-09 07:34:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:34:20] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2021-05-09 07:34:20] [INFO ] [Nat]Added 72 Read/Feed constraints in 25 ms returned sat
[2021-05-09 07:34:20] [INFO ] Computed and/alt/rep : 878/13605/237 causal constraints in 36 ms.
[2021-05-09 07:34:21] [INFO ] Added : 207 causal constraints over 42 iterations in 1315 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 26 ms.
Finished Parikh walk after 30 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=30 )
FORMULA DLCround-PT-12b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_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="DLCround-PT-12b"
export BK_EXAMINATION="ReachabilityFireability"
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 DLCround-PT-12b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r075-tall-162039097400216"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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