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-162075355600016.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-06b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r113-smll-162075355600016
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 128K 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 100K 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.3K Mar 28 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 11:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 11:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 19:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 19:23 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 141K 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-06b-ReachabilityFireability-00
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-01
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-02
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-03
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-04
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-05
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-06
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-07
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-08
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-09
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-10
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-11
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-12
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-13
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-14
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620902346520

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 10:39:09] [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 10:39:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 10:39:09] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2021-05-13 10:39:09] [INFO ] Transformed 542 places.
[2021-05-13 10:39:09] [INFO ] Transformed 621 transitions.
[2021-05-13 10:39:09] [INFO ] Found NUPN structural information;
[2021-05-13 10:39:09] [INFO ] Parsed PT model containing 542 places and 621 transitions in 195 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 191 resets, run finished after 92 ms. (steps per millisecond=108 ) properties seen :[1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0]
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 1, 0, 0, 0]
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 621 rows 542 cols
[2021-05-13 10:39:09] [INFO ] Computed 8 place invariants in 29 ms
[2021-05-13 10:39:10] [INFO ] [Real]Absence check using 8 positive place invariants in 52 ms returned sat
[2021-05-13 10:39:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:39:11] [INFO ] [Real]Absence check using state equation in 944 ms returned sat
[2021-05-13 10:39:11] [INFO ] Deduced a trap composed of 163 places in 468 ms
[2021-05-13 10:39:12] [INFO ] Deduced a trap composed of 131 places in 275 ms
[2021-05-13 10:39:12] [INFO ] Deduced a trap composed of 65 places in 212 ms
[2021-05-13 10:39:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1109 ms
[2021-05-13 10:39:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:39:17] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 10:39:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 4897 ms returned (error "Solver has unexpectedly terminated")
[2021-05-13 10:39:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:39:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 0
[2021-05-13 10:39:17] [INFO ] [Real]Absence check using 8 positive place invariants in 28 ms returned sat
[2021-05-13 10:39:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:39:18] [INFO ] [Real]Absence check using state equation in 1047 ms returned sat
[2021-05-13 10:39:19] [INFO ] Deduced a trap composed of 214 places in 355 ms
[2021-05-13 10:39:19] [INFO ] Deduced a trap composed of 186 places in 311 ms
[2021-05-13 10:39:19] [INFO ] Deduced a trap composed of 189 places in 334 ms
[2021-05-13 10:39:20] [INFO ] Deduced a trap composed of 189 places in 273 ms
[2021-05-13 10:39:20] [INFO ] Deduced a trap composed of 194 places in 257 ms
[2021-05-13 10:39:20] [INFO ] Deduced a trap composed of 161 places in 229 ms
[2021-05-13 10:39:20] [INFO ] Deduced a trap composed of 163 places in 185 ms
[2021-05-13 10:39:21] [INFO ] Deduced a trap composed of 162 places in 183 ms
[2021-05-13 10:39:21] [INFO ] Deduced a trap composed of 163 places in 279 ms
[2021-05-13 10:39:21] [INFO ] Deduced a trap composed of 163 places in 225 ms
[2021-05-13 10:39:22] [INFO ] Deduced a trap composed of 161 places in 241 ms
[2021-05-13 10:39:22] [INFO ] Deduced a trap composed of 163 places in 205 ms
[2021-05-13 10:39:22] [INFO ] Deduced a trap composed of 161 places in 194 ms
[2021-05-13 10:39:22] [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 (> (+ s0 s1 s346 s347 s348 s349 s351 s352 s353 s354 s355 s357 s359 s360 s361 s362 s363 s364 s365 s367 s368 s369 s370 s371 s372 s373 s375 s376 s381 s382 s383 s384 s385 s386 s387 s388 s391 s392 s393 s394 s395 s396 s399 s400 s401 s402 s403 s404 s405 s406 s407 s408 s409 s410 s411 s412 s413 s414 s415 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427 s428 s429 s430 s431 s432 s433 s434 s435 s436 s437 s438 s439 s440 s441 s442 s443 s444 s445 s446 s447 s448 s449 s450 s451 s452 s453 s454 s455 s456 s457 s458 s459 s460 s461 s462 s463 s464 s465 s466 s467 s468 s469 s470 s471 s472 s473 s474 s475 s476 s477 s478 s479 s480 s481 s482 s483 s484 s485 s486 s487 s488 s489 s490 s491 s492 s493 s494 s495 s496 s497 s498 s500 s501 s502 s503 s508 s509 s510 s511 s512 s513 s518 s520 s521 s522 s523 s524 s525 s526 s527) 0)") while checking expression at index 1
[2021-05-13 10:39:22] [INFO ] [Real]Absence check using 8 positive place invariants in 29 ms returned unsat
[2021-05-13 10:39:22] [INFO ] [Real]Absence check using 8 positive place invariants in 29 ms returned sat
[2021-05-13 10:39:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:39:23] [INFO ] [Real]Absence check using state equation in 806 ms returned sat
[2021-05-13 10:39:24] [INFO ] Deduced a trap composed of 42 places in 467 ms
[2021-05-13 10:39:24] [INFO ] Deduced a trap composed of 186 places in 300 ms
[2021-05-13 10:39:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 864 ms
[2021-05-13 10:39:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:39:29] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 10:39:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 4851 ms returned unknown
[2021-05-13 10:39:29] [INFO ] [Real]Absence check using 8 positive place invariants in 28 ms returned sat
[2021-05-13 10:39:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:39:30] [INFO ] [Real]Absence check using state equation in 815 ms returned sat
[2021-05-13 10:39:30] [INFO ] Deduced a trap composed of 161 places in 316 ms
[2021-05-13 10:39:30] [INFO ] Deduced a trap composed of 46 places in 134 ms
[2021-05-13 10:39:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 524 ms
[2021-05-13 10:39:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:39:36] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 10:39:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 4918 ms returned unknown
[2021-05-13 10:39:36] [INFO ] [Real]Absence check using 8 positive place invariants in 27 ms returned sat
[2021-05-13 10:39:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:39:36] [INFO ] [Real]Absence check using state equation in 798 ms returned sat
[2021-05-13 10:39:37] [INFO ] Computed and/alt/rep : 620/2195/620 causal constraints in 69 ms.
[2021-05-13 10:39:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:39:42] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 10:39:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 4859 ms returned unknown
[2021-05-13 10:39:42] [INFO ] [Real]Absence check using 8 positive place invariants in 28 ms returned sat
[2021-05-13 10:39:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:39:43] [INFO ] [Real]Absence check using state equation in 823 ms returned sat
[2021-05-13 10:39:43] [INFO ] Deduced a trap composed of 214 places in 457 ms
[2021-05-13 10:39:44] [INFO ] Deduced a trap composed of 186 places in 304 ms
[2021-05-13 10:39:44] [INFO ] Deduced a trap composed of 189 places in 269 ms
[2021-05-13 10:39:44] [INFO ] Deduced a trap composed of 189 places in 261 ms
[2021-05-13 10:39:44] [INFO ] Deduced a trap composed of 194 places in 253 ms
[2021-05-13 10:39:45] [INFO ] Deduced a trap composed of 161 places in 215 ms
[2021-05-13 10:39:45] [INFO ] Deduced a trap composed of 163 places in 211 ms
[2021-05-13 10:39:45] [INFO ] Deduced a trap composed of 162 places in 210 ms
[2021-05-13 10:39:45] [INFO ] Deduced a trap composed of 163 places in 200 ms
[2021-05-13 10:39:46] [INFO ] Deduced a trap composed of 163 places in 224 ms
[2021-05-13 10:39:46] [INFO ] Deduced a trap composed of 161 places in 235 ms
[2021-05-13 10:39:46] [INFO ] Deduced a trap composed of 163 places in 262 ms
[2021-05-13 10:39:47] [INFO ] Deduced a trap composed of 161 places in 257 ms
[2021-05-13 10:39:47] [INFO ] Deduced a trap composed of 164 places in 287 ms
[2021-05-13 10:39:47] [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 (> (+ s0 s347 s348 s349 s351 s353 s354 s355 s357 s359 s360 s361 s362 s363 s365 s367 s368 s369 s370 s371 s372 s373 s375 s376 s381 s382 s383 s384 s385 s386 s387 s388 s391 s392 s393 s394 s395 s397 s398 s399 s400 s401 s402 s403 s404 s405 s406 s407 s408 s409 s410 s411 s412 s413 s414 s415 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427 s428 s429 s430 s431 s432 s433 s434 s435 s436 s437 s438 s439 s440 s441 s442 s443 s444 s445 s446 s447 s448 s449 s450 s451 s452 s453 s454 s455 s456 s457 s458 s459 s460 s461 s462 s463 s464 s465 s466 s467 s468 s469 s470 s471 s472 s473 s474 s475 s476 s477 s478 s479 s480 s481 s482 s483 s484 s485 s486 s487 s488 s489 s490 s491 s492 s493 s494 s495 s496 s497 s498 s500 s501 s502 s503 s504 s505 s506 s508 s509 s510 s511 s512 s513 s518 s519 s520 s521 s522 s523 s524 s525 s526 s527 s528 s529) 0)") while checking expression at index 6
[2021-05-13 10:39:47] [INFO ] [Real]Absence check using 8 positive place invariants in 50 ms returned sat
[2021-05-13 10:39:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:39:48] [INFO ] [Real]Absence check using state equation in 1221 ms returned sat
[2021-05-13 10:39:48] [INFO ] Computed and/alt/rep : 620/2195/620 causal constraints in 42 ms.
[2021-05-13 10:39:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:39:53] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 10:39:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 4908 ms returned unknown
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 23 out of 542 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 542/542 places, 621/621 transitions.
Graph (trivial) has 433 edges and 542 vertex of which 32 / 542 are part of one of the 5 SCC in 8 ms
Free SCC test removed 27 places
Drop transitions removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Iterating post reduction 0 with 149 rules applied. Total rules applied 150 place count 515 transition count 472
Reduce places removed 116 places and 0 transitions.
Iterating post reduction 1 with 116 rules applied. Total rules applied 266 place count 399 transition count 472
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 266 place count 399 transition count 423
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 364 place count 350 transition count 423
Symmetric choice reduction at 2 with 157 rule applications. Total rules 521 place count 350 transition count 423
Deduced a syphon composed of 157 places in 1 ms
Reduce places removed 157 places and 157 transitions.
Iterating global reduction 2 with 314 rules applied. Total rules applied 835 place count 193 transition count 266
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 835 place count 193 transition count 263
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 841 place count 190 transition count 263
Symmetric choice reduction at 2 with 19 rule applications. Total rules 860 place count 190 transition count 263
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 19 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 898 place count 171 transition count 244
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 914 place count 171 transition count 228
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 984 place count 136 transition count 193
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 989 place count 136 transition count 188
Symmetric choice reduction at 4 with 5 rule applications. Total rules 994 place count 136 transition count 188
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 1004 place count 131 transition count 183
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1008 place count 129 transition count 193
Free-agglomeration rule applied 35 times.
Iterating global reduction 4 with 35 rules applied. Total rules applied 1043 place count 129 transition count 158
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 4 with 35 rules applied. Total rules applied 1078 place count 94 transition count 158
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 1083 place count 94 transition count 153
Applied a total of 1083 rules in 249 ms. Remains 94 /542 variables (removed 448) and now considering 153/621 (removed 468) transitions.
Finished structural reductions, in 1 iterations. Remains : 94/542 places, 153/621 transitions.
Incomplete random walk after 1000000 steps, including 27478 resets, run finished after 1737 ms. (steps per millisecond=575 ) properties seen :[1, 1, 0, 1, 1, 1, 1]
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 4738 resets, run finished after 628 ms. (steps per millisecond=1592 ) properties seen :[0]
[2021-05-13 10:39:56] [INFO ] Flow matrix only has 149 transitions (discarded 4 similar events)
// Phase 1: matrix 149 rows 94 cols
[2021-05-13 10:39:56] [INFO ] Computed 8 place invariants in 3 ms
[2021-05-13 10:39:56] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-13 10:39:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:39:56] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2021-05-13 10:39:56] [INFO ] State equation strengthened by 56 read => feed constraints.
[2021-05-13 10:39:56] [INFO ] [Real]Added 56 Read/Feed constraints in 8 ms returned sat
[2021-05-13 10:39:56] [INFO ] Computed and/alt/rep : 151/720/147 causal constraints in 12 ms.
[2021-05-13 10:39:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:39:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 35 ms returned sat
[2021-05-13 10:39:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:39:56] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2021-05-13 10:39:56] [INFO ] [Nat]Added 56 Read/Feed constraints in 9 ms returned sat
[2021-05-13 10:39:56] [INFO ] Computed and/alt/rep : 151/720/147 causal constraints in 13 ms.
[2021-05-13 10:39:57] [INFO ] Added : 147 causal constraints over 30 iterations in 698 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
Incomplete Parikh walk after 20300 steps, including 666 resets, run finished after 59 ms. (steps per millisecond=344 ) properties seen :[0] could not realise parikh vector
Support contains 2 out of 94 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 94/94 places, 153/153 transitions.
Graph (trivial) has 61 edges and 94 vertex of which 2 / 94 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 93 transition count 146
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 88 transition count 146
Symmetric choice reduction at 2 with 4 rule applications. Total rules 17 place count 88 transition count 146
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 5 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 25 place count 84 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 84 transition count 140
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 26 place count 84 transition count 139
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 83 transition count 139
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 34 place count 83 transition count 133
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 56 place count 72 transition count 122
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 57 place count 72 transition count 121
Symmetric choice reduction at 5 with 5 rule applications. Total rules 62 place count 72 transition count 121
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 8 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 72 place count 67 transition count 113
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 76 place count 67 transition count 109
Free-agglomeration rule applied 29 times.
Iterating global reduction 6 with 29 rules applied. Total rules applied 105 place count 67 transition count 80
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Graph (complete) has 113 edges and 38 vertex of which 26 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.27 ms
Iterating post reduction 6 with 47 rules applied. Total rules applied 152 place count 26 transition count 61
Drop transitions removed 26 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 7 with 27 rules applied. Total rules applied 179 place count 26 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 180 place count 25 transition count 33
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 20 edges and 24 vertex of which 8 / 24 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 2 rules applied. Total rules applied 182 place count 20 transition count 33
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 190 place count 20 transition count 25
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 4 Pre rules applied. Total rules applied 190 place count 20 transition count 21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 198 place count 16 transition count 21
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 202 place count 16 transition count 17
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 210 place count 12 transition count 13
Free-agglomeration rule applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 214 place count 12 transition count 9
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 11 rules applied. Total rules applied 225 place count 5 transition count 5
Applied a total of 225 rules in 67 ms. Remains 5 /94 variables (removed 89) and now considering 5/153 (removed 148) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/94 places, 5/153 transitions.
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-05 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="FlexibleBarrier-PT-06b"
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-06b, 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-162075355600016"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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