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.r113-smll-162075355700072.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is FlexibleBarrier-PT-20b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r113-smll-162075355700072
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 114K 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.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 11:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 11:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 19:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 19:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 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.5M 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 FlexibleBarrier-PT-20b-ReachabilityFireability-00
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-01
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-02
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-03
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-04
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-05
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-06
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-07
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-08
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-09
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-10
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-11
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-12
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-13
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-14
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620939493443

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 20:58:16] [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-13 20:58:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 20:58:16] [INFO ] Load time of PNML (sax parser for PT used): 428 ms
[2021-05-13 20:58:16] [INFO ] Transformed 5372 places.
[2021-05-13 20:58:16] [INFO ] Transformed 6193 transitions.
[2021-05-13 20:58:16] [INFO ] Found NUPN structural information;
[2021-05-13 20:58:16] [INFO ] Parsed PT model containing 5372 places and 6193 transitions in 529 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 137 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 75 resets, run finished after 177 ms. (steps per millisecond=56 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0]
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 6193 rows 5372 cols
[2021-05-13 20:58:18] [INFO ] Computed 22 place invariants in 922 ms
[2021-05-13 20:58:20] [INFO ] [Real]Absence check using 22 positive place invariants in 485 ms returned sat
[2021-05-13 20:58:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:58:23] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 20:58:23] [INFO ] [Real]Absence check using state equation in 2847 ms returned (error "Failed to check-sat")
[2021-05-13 20:58:25] [INFO ] [Real]Absence check using 22 positive place invariants in 610 ms returned sat
[2021-05-13 20:58:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:58:28] [INFO ] [Real]Absence check using state equation in 3140 ms returned (error "Solver has unexpectedly terminated")
[2021-05-13 20:58:30] [INFO ] [Real]Absence check using 22 positive place invariants in 453 ms returned sat
[2021-05-13 20:58:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:58:33] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 20:58:33] [INFO ] [Real]Absence check using state equation in 3474 ms returned (error "Failed to check-sat")
[2021-05-13 20:58:35] [INFO ] [Real]Absence check using 22 positive place invariants in 451 ms returned sat
[2021-05-13 20:58:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:58:38] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 20:58:38] [INFO ] [Real]Absence check using state equation in 3600 ms returned (error "Failed to check-sat")
[2021-05-13 20:58:40] [INFO ] [Real]Absence check using 22 positive place invariants in 457 ms returned sat
[2021-05-13 20:58:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:58:43] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 20:58:43] [INFO ] [Real]Absence check using state equation in 3497 ms returned (error "Failed to check-sat")
[2021-05-13 20:58:45] [INFO ] [Real]Absence check using 22 positive place invariants in 563 ms returned unsat
[2021-05-13 20:58:46] [INFO ] [Real]Absence check using 22 positive place invariants in 454 ms returned sat
[2021-05-13 20:58:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:58:50] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 20:58:50] [INFO ] [Real]Absence check using state equation in 3654 ms returned (error "Failed to check-sat")
[2021-05-13 20:58:52] [INFO ] [Real]Absence check using 22 positive place invariants in 452 ms returned sat
[2021-05-13 20:58:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:58:55] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 20:58:55] [INFO ] [Real]Absence check using state equation in 3474 ms returned (error "Failed to check-sat")
[2021-05-13 20:58:57] [INFO ] [Real]Absence check using 22 positive place invariants in 449 ms returned sat
[2021-05-13 20:58:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:59:00] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 20:59:00] [INFO ] [Real]Absence check using state equation in 3532 ms returned (error "Failed to check-sat")
[2021-05-13 20:59:02] [INFO ] [Real]Absence check using 22 positive place invariants in 451 ms returned sat
[2021-05-13 20:59:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:59:05] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 20:59:05] [INFO ] [Real]Absence check using state equation in 3491 ms returned (error "Failed to check-sat")
[2021-05-13 20:59:06] [INFO ] [Real]Absence check using 22 positive place invariants in 450 ms returned sat
[2021-05-13 20:59:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:59:10] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 20:59:10] [INFO ] [Real]Absence check using state equation in 3619 ms returned (error "Failed to check-sat")
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 31 out of 5372 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5372/5372 places, 6193/6193 transitions.
Graph (trivial) has 4464 edges and 5372 vertex of which 116 / 5372 are part of one of the 19 SCC in 28 ms
Free SCC test removed 97 places
Drop transitions removed 117 transitions
Reduce isomorphic transitions removed 117 transitions.
Performed 904 Post agglomeration using F-continuation condition.Transition count delta: 904
Iterating post reduction 0 with 1021 rules applied. Total rules applied 1022 place count 5275 transition count 5172
Reduce places removed 904 places and 0 transitions.
Iterating post reduction 1 with 904 rules applied. Total rules applied 1926 place count 4371 transition count 5172
Performed 762 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 762 Pre rules applied. Total rules applied 1926 place count 4371 transition count 4410
Deduced a syphon composed of 762 places in 9 ms
Reduce places removed 762 places and 0 transitions.
Iterating global reduction 2 with 1524 rules applied. Total rules applied 3450 place count 3609 transition count 4410
Symmetric choice reduction at 2 with 2200 rule applications. Total rules 5650 place count 3609 transition count 4410
Deduced a syphon composed of 2200 places in 11 ms
Reduce places removed 2200 places and 2200 transitions.
Iterating global reduction 2 with 4400 rules applied. Total rules applied 10050 place count 1409 transition count 2210
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 10050 place count 1409 transition count 2195
Deduced a syphon composed of 15 places in 6 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 10080 place count 1394 transition count 2195
Symmetric choice reduction at 2 with 353 rule applications. Total rules 10433 place count 1394 transition count 2195
Deduced a syphon composed of 353 places in 5 ms
Reduce places removed 353 places and 353 transitions.
Iterating global reduction 2 with 706 rules applied. Total rules applied 11139 place count 1041 transition count 1842
Ensure Unique test removed 348 transitions
Reduce isomorphic transitions removed 348 transitions.
Iterating post reduction 2 with 348 rules applied. Total rules applied 11487 place count 1041 transition count 1494
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 1 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 214 rules applied. Total rules applied 11701 place count 934 transition count 1387
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 11720 place count 934 transition count 1368
Symmetric choice reduction at 4 with 19 rule applications. Total rules 11739 place count 934 transition count 1368
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 19 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 11777 place count 915 transition count 1349
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 11779 place count 914 transition count 1349
Free-agglomeration rule applied 389 times.
Iterating global reduction 4 with 389 rules applied. Total rules applied 12168 place count 914 transition count 960
Reduce places removed 389 places and 0 transitions.
Iterating post reduction 4 with 389 rules applied. Total rules applied 12557 place count 525 transition count 960
Symmetric choice reduction at 5 with 80 rule applications. Total rules 12637 place count 525 transition count 960
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 80 transitions.
Iterating global reduction 5 with 160 rules applied. Total rules applied 12797 place count 445 transition count 880
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 5 with 80 rules applied. Total rules applied 12877 place count 445 transition count 800
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 12879 place count 445 transition count 800
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 12880 place count 445 transition count 799
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 12888 place count 445 transition count 791
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 12889 place count 444 transition count 790
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 101 edges and 443 vertex of which 38 / 443 are part of one of the 19 SCC in 1 ms
Free SCC test removed 19 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 7 with 4 rules applied. Total rules applied 12893 place count 424 transition count 788
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 8 with 40 rules applied. Total rules applied 12933 place count 422 transition count 750
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 20 Pre rules applied. Total rules applied 12933 place count 422 transition count 730
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 9 with 40 rules applied. Total rules applied 12973 place count 402 transition count 730
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 9 with 40 rules applied. Total rules applied 13013 place count 382 transition count 710
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 13015 place count 381 transition count 710
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 9 with 19 rules applied. Total rules applied 13034 place count 381 transition count 691
Free-agglomeration rule applied 19 times.
Iterating global reduction 9 with 19 rules applied. Total rules applied 13053 place count 381 transition count 672
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 9 with 71 rules applied. Total rules applied 13124 place count 355 transition count 627
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 10 with 41 rules applied. Total rules applied 13165 place count 334 transition count 607
Symmetric choice reduction at 11 with 97 rule applications. Total rules 13262 place count 334 transition count 607
Deduced a syphon composed of 97 places in 1 ms
Reduce places removed 97 places and 97 transitions.
Iterating global reduction 11 with 194 rules applied. Total rules applied 13456 place count 237 transition count 510
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 11 with 97 rules applied. Total rules applied 13553 place count 237 transition count 413
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 12 with 13 rules applied. Total rules applied 13566 place count 237 transition count 400
Applied a total of 13566 rules in 2148 ms. Remains 237 /5372 variables (removed 5135) and now considering 400/6193 (removed 5793) transitions.
Finished structural reductions, in 1 iterations. Remains : 237/5372 places, 400/6193 transitions.
Incomplete random walk after 1000000 steps, including 69115 resets, run finished after 4289 ms. (steps per millisecond=233 ) properties seen :[1, 1, 1, 1, 0, 1, 1, 1, 0, 1]
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2455 resets, run finished after 852 ms. (steps per millisecond=1173 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 803 ms. (steps per millisecond=1245 ) properties seen :[0, 0]
// Phase 1: matrix 400 rows 237 cols
[2021-05-13 20:59:18] [INFO ] Computed 14 place invariants in 6 ms
[2021-05-13 20:59:18] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2021-05-13 20:59:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:59:19] [INFO ] [Real]Absence check using state equation in 315 ms returned sat
[2021-05-13 20:59:19] [INFO ] Computed and/alt/rep : 392/509/392 causal constraints in 49 ms.
[2021-05-13 20:59:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:59:19] [INFO ] [Nat]Absence check using 14 positive place invariants in 24 ms returned sat
[2021-05-13 20:59:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:59:19] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2021-05-13 20:59:19] [INFO ] Computed and/alt/rep : 392/509/392 causal constraints in 44 ms.
[2021-05-13 20:59:20] [INFO ] Added : 40 causal constraints over 8 iterations in 289 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 33 ms.
[2021-05-13 20:59:20] [INFO ] [Real]Absence check using 14 positive place invariants in 18 ms returned sat
[2021-05-13 20:59:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:59:20] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2021-05-13 20:59:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:59:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 36 ms returned sat
[2021-05-13 20:59:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:59:21] [INFO ] [Nat]Absence check using state equation in 403 ms returned sat
[2021-05-13 20:59:21] [INFO ] Computed and/alt/rep : 392/509/392 causal constraints in 38 ms.
[2021-05-13 20:59:21] [INFO ] Added : 32 causal constraints over 7 iterations in 263 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
Incomplete Parikh walk after 7400 steps, including 742 resets, run finished after 55 ms. (steps per millisecond=134 ) properties seen :[0, 1] could not realise parikh vector
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 2024 steps, including 195 resets, run visited all 1 properties in 14 ms. (steps per millisecond=144 )
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-05 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="FlexibleBarrier-PT-20b"
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 FlexibleBarrier-PT-20b, 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 r113-smll-162075355700072"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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