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

About the Execution of 2020-gold for DLCflexbar-PT-4b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1253.088 3600000.00 126270.00 357.10 FTTFTTTFFTTTTTFT 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-162039097200104.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 DLCflexbar-PT-4b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097200104
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.5M
-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 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 86K 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.6K Mar 28 15:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 03:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 03:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 22 13:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 13:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 4.1M 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 DLCflexbar-PT-4b-ReachabilityFireability-00
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityFireability-01
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityFireability-02
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityFireability-03
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityFireability-04
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityFireability-05
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityFireability-06
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityFireability-07
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityFireability-08
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityFireability-09
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityFireability-10
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityFireability-11
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityFireability-12
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityFireability-13
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityFireability-14
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620524020108

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-09 01:33:41] [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 01:33:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 01:33:42] [INFO ] Load time of PNML (sax parser for PT used): 650 ms
[2021-05-09 01:33:42] [INFO ] Transformed 11440 places.
[2021-05-09 01:33:42] [INFO ] Transformed 17128 transitions.
[2021-05-09 01:33:42] [INFO ] Found NUPN structural information;
[2021-05-09 01:33:43] [INFO ] Parsed PT model containing 11440 places and 17128 transitions in 1223 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 785 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 262 ms. (steps per millisecond=38 ) properties seen :[0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0]
FORMULA DLCflexbar-PT-4b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 59 ms. (steps per millisecond=169 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 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, 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, 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, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 17128 rows 11440 cols
[2021-05-09 01:33:45] [INFO ] Computed 608 place invariants in 654 ms
[2021-05-09 01:33:50] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 01:33:50] [INFO ] [Real]Absence check using 608 positive place invariants in 3612 ms returned (error "Failed to check-sat")
[2021-05-09 01:33:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 01:33:50] [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-09 01:33:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (= 1 (+ s0 s1 s5303 s5304 s5305 s5306 s5307 s5308 s5309 s5310 s5311 s5312 s5313 s5314 s5315 s5316 s5317 s5318 s5319 s5320 s5321 s5322 s5323 s5324 s5325 s5326 s5327 s5328 s5329 s5330 s5331 s5332 s5333 s5334 s5335 s5336 s5337 s5338 s5339 s5340 s5341 s5342 s5343 s5344 s5345 s5346 s5347 s5348 s5349 s5350 s5351 s5352 s5353 s5354 s5355 s5356 s5357 s5358 s5359 s5360 s5361 s5362 s5363 s5364 s5365 s5366 s5367 s5368 s5369 s5370 s5371 s5372 s5373 s5374 s5375 s5376 s5377 s5378 s5379 s5380 s5381 s5382 s5383 s5384 s5385 s5386 s5387 s5388 s5389 s5390 s5391 s5392 s5393 s5394 s5395 s5396 s5397 s5398 s5399 s5400 s5401 s5402 s5403 s5404 s5405 s5406 s5407 s5408 s5409 s5410 s5411 s5412 s5413 s5414 s5415 s5416 s5417 s5418 s5419 s5420 s5421 s5422 s5423 s5424 s5425 s5426 s5427 s5428 s5429 s5430 s5431 s5432 s5433 s5434 s5435 s5436 s5437 s5438 s5439 s5440 s5441 s5442 s5443 s5444 s5445 s5446 s5447 s5448 s5449 s5450 s5451 s5452 s5453 s5454 s5455 s5456 s5457 s5458 s5459 s5460 s5461 s5462 s5463 s5464 s5465 s5466 s5467 s5468 s5469 s5470 s5471 s5472 s5473 s5474 s5475 s5476 s5477 s5478 s5479 s5480 s5481 s5482 s5483 s5484 s5485 s5486 s5487 s5488 s5489 s5490 s5491 s5492 s5493 s5494 s5495 s5496 s5497 s5498 s5499 s5500 s5501 s5502 s5503 s5504 s5505 s5506 s5507 s5508 s5509 s5510 s5511 s5512 s5513 s5514 s5515 s5516 s5517 s5518 s5519 s5520 s5521 s5522 s5523 s5524 s5525 s5526 s5527 s5528 s5529 s5530 s5531 s5532 s5533 s5534 s5535 s5536 s5537 s5538 s5539 s5540 s5541 s5542 s5543 s5544 s5545 s5546 s5547 s5548 s5549 s5550 s5551 s5552 s5553 s5554 s5555 s5556 s5557 s5558 s5559 s5560 s5561 s5562 s5563 s5564 s5565 s5566 s5567 s5568 s5569 s5570 s5571 s5572 s5573 s5574 s5575 s5576 s5577 s5578 s5579 s5580 s5581 s5582 s8640 s8641 s8642 s8643 s8644 s8645 s8646 s8647 s8648 s8649))") while checking expression at index 1
[2021-05-09 01:34:00] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 01:34:00] [INFO ] [Real]Absence check using 608 positive place invariants in 3622 ms returned (error "Failed to check-sat")
[2021-05-09 01:34:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 01:34:00] [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 2
[2021-05-09 01:34:05] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 01:34:05] [INFO ] [Real]Absence check using 608 positive place invariants in 3652 ms returned (error "Failed to check-sat")
[2021-05-09 01:34:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 01:34:05] [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 3
[2021-05-09 01:34:10] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 01:34:10] [INFO ] [Real]Absence check using 608 positive place invariants in 3662 ms returned (error "Failed to check-sat")
[2021-05-09 01:34:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 01:34:10] [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 4
[2021-05-09 01:34:15] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 01:34:15] [INFO ] [Real]Absence check using 608 positive place invariants in 3657 ms returned (error "Failed to check-sat")
[2021-05-09 01:34:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 01:34:15] [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 5
[2021-05-09 01:34:20] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 01:34:20] [INFO ] [Real]Absence check using 608 positive place invariants in 3648 ms returned (error "Failed to check-sat")
[2021-05-09 01:34:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 01:34:20] [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 6
[2021-05-09 01:34:25] [INFO ] [Real]Absence check using 608 positive place invariants in 3659 ms returned (error "Failed to check-sat")
[2021-05-09 01:34:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 01:34:25] [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 7
[2021-05-09 01:34:30] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 01:34:30] [INFO ] [Real]Absence check using 608 positive place invariants in 3659 ms returned (error "Failed to check-sat")
[2021-05-09 01:34:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 01:34:30] [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 8
[2021-05-09 01:34:35] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 01:34:35] [INFO ] [Real]Absence check using 608 positive place invariants in 3669 ms returned (error "Failed to check-sat")
[2021-05-09 01:34:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 01:34:35] [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 9
[2021-05-09 01:34:40] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 01:34:40] [INFO ] [Real]Absence check using 608 positive place invariants in 3669 ms returned (error "Failed to check-sat")
[2021-05-09 01:34:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 01:34:40] [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 10
[2021-05-09 01:34:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (= 1 (+ s0 s1 s5303 s5304 s5305 s5306 s5307 s5308 s5309 s5310 s5311 s5312 s5313 s5314 s5315 s5316 s5317 s5318 s5319 s5320 s5321 s5322 s5323 s5324 s5325 s5326 s5327 s5328 s5329 s5330 s5331 s5332 s5333 s5334 s5335 s5336 s5337 s5338 s5339 s5340 s5341 s5342 s5343 s5344 s5345 s5346 s5347 s5348 s5349 s5350 s5351 s5352 s5353 s5354 s5355 s5356 s5357 s5358 s5359 s5360 s5361 s5362 s5363 s5364 s5365 s5366 s5367 s5368 s5369 s5370 s5371 s5372 s5373 s5374 s5375 s5376 s5377 s5378 s5379 s5380 s5381 s5382 s5383 s5384 s5385 s5386 s5387 s5388 s5389 s5390 s5391 s5392 s5393 s5394 s5395 s5396 s5397 s5398 s5399 s5400 s5401 s5402 s5403 s5404 s5405 s5406 s5407 s5408 s5409 s5410 s5411 s5412 s5413 s5414 s5415 s5416 s5417 s5418 s5419 s5420 s5421 s5422 s5423 s5424 s5425 s5426 s5427 s5428 s5429 s5430 s5431 s5432 s5433 s5434 s5435 s5436 s5437 s5438 s5439 s5440 s5441 s5442 s5443 s5444 s5445 s5446 s5447 s5448 s5449 s5450 s5451 s5452 s5453 s5454 s5455 s5456 s5457 s5458 s5459 s5460 s5461 s5462 s5463 s5464 s5465 s5466 s5467 s5468 s5469 s5470 s5471 s5472 s5473 s5474 s5475 s5476 s5477 s5478 s5479 s5480 s5481 s5482 s5483 s5484 s5485 s5486 s5487 s5488 s5489 s5490 s5491 s5492 s9540 s9541 s9542 s9543 s9544 s9545 s9546 s9547 s9548 s9549))") while checking expression at index 11
Support contains 78 out of 11440 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11440/11440 places, 17128/17128 transitions.
Graph (trivial) has 10400 edges and 11440 vertex of which 916 / 11440 are part of one of the 68 SCC in 41 ms
Free SCC test removed 848 places
Drop transitions removed 962 transitions
Reduce isomorphic transitions removed 962 transitions.
Performed 5201 Post agglomeration using F-continuation condition.Transition count delta: 5201
Iterating post reduction 0 with 6163 rules applied. Total rules applied 6164 place count 10592 transition count 10965
Reduce places removed 5201 places and 0 transitions.
Ensure Unique test removed 137 transitions
Reduce isomorphic transitions removed 137 transitions.
Performed 135 Post agglomeration using F-continuation condition.Transition count delta: 135
Iterating post reduction 1 with 5473 rules applied. Total rules applied 11637 place count 5391 transition count 10693
Reduce places removed 135 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Iterating post reduction 2 with 214 rules applied. Total rules applied 11851 place count 5256 transition count 10614
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 11890 place count 5217 transition count 10614
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 92 Pre rules applied. Total rules applied 11890 place count 5217 transition count 10522
Deduced a syphon composed of 92 places in 193 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 4 with 184 rules applied. Total rules applied 12074 place count 5125 transition count 10522
Symmetric choice reduction at 4 with 1435 rule applications. Total rules 13509 place count 5125 transition count 10522
Deduced a syphon composed of 1435 places in 207 ms
Reduce places removed 1435 places and 1435 transitions.
Iterating global reduction 4 with 2870 rules applied. Total rules applied 16379 place count 3690 transition count 9087
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 4 with 19 rules applied. Total rules applied 16398 place count 3690 transition count 9068
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 16407 place count 3684 transition count 9065
Performed 596 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 596 Pre rules applied. Total rules applied 16407 place count 3684 transition count 8469
Deduced a syphon composed of 596 places in 132 ms
Reduce places removed 596 places and 0 transitions.
Iterating global reduction 6 with 1192 rules applied. Total rules applied 17599 place count 3088 transition count 8469
Symmetric choice reduction at 6 with 104 rule applications. Total rules 17703 place count 3088 transition count 8469
Deduced a syphon composed of 104 places in 127 ms
Reduce places removed 104 places and 1641 transitions.
Iterating global reduction 6 with 208 rules applied. Total rules applied 17911 place count 2984 transition count 6828
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 6 with 81 rules applied. Total rules applied 17992 place count 2984 transition count 6747
Performed 747 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 747 places in 1 ms
Reduce places removed 747 places and 0 transitions.
Iterating global reduction 7 with 1494 rules applied. Total rules applied 19486 place count 2237 transition count 5997
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 19488 place count 2237 transition count 5995
Renaming transitions due to excessive name length > 1024 char.
Symmetric choice reduction at 8 with 3 rule applications. Total rules 19491 place count 2237 transition count 5995
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 147 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 19497 place count 2234 transition count 5848
Performed 101 Post agglomeration using F-continuation condition with reduction of 180 identical transitions.
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 8 with 202 rules applied. Total rules applied 19699 place count 2133 transition count 6455
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 19701 place count 2133 transition count 6453
Performed 70 Post agglomeration using F-continuation condition with reduction of 60 identical transitions.
Deduced a syphon composed of 70 places in 2 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 9 with 140 rules applied. Total rules applied 19841 place count 2063 transition count 6983
Drop transitions removed 50 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 9 with 51 rules applied. Total rules applied 19892 place count 2063 transition count 6932
Free-agglomeration rule applied 1162 times with reduction of 582 identical transitions.
Iterating global reduction 10 with 1162 rules applied. Total rules applied 21054 place count 2063 transition count 5188
Reduce places removed 1162 places and 0 transitions.
Drop transitions removed 1422 transitions
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 1461 transitions.
Discarding 52 places :
Also discarding 26 output transitions
Drop transitions removed 26 transitions
Graph (complete) has 3894 edges and 901 vertex of which 849 are kept as prefixes of interest. Removing 52 places using SCC suffix rule.7 ms
Iterating post reduction 10 with 2624 rules applied. Total rules applied 23678 place count 849 transition count 3701
Drop transitions removed 286 transitions
Reduce isomorphic transitions removed 286 transitions.
Iterating post reduction 11 with 286 rules applied. Total rules applied 23964 place count 849 transition count 3415
Symmetric choice reduction at 12 with 17 rule applications. Total rules 23981 place count 849 transition count 3415
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 102 transitions.
Iterating global reduction 12 with 34 rules applied. Total rules applied 24015 place count 832 transition count 3313
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 12 with 65 rules applied. Total rules applied 24080 place count 832 transition count 3248
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 13 with 7 rules applied. Total rules applied 24087 place count 832 transition count 3584
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 330 transitions
Reduce isomorphic transitions removed 330 transitions.
Iterating post reduction 13 with 337 rules applied. Total rules applied 24424 place count 825 transition count 3254
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 14 with 7 rules applied. Total rules applied 24431 place count 825 transition count 3254
Drop transitions removed 87 transitions
Redundant transition composition rules discarded 87 transitions
Iterating global reduction 14 with 87 rules applied. Total rules applied 24518 place count 825 transition count 3167
Symmetric choice reduction at 14 with 3 rule applications. Total rules 24521 place count 825 transition count 3167
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 14 with 6 rules applied. Total rules applied 24527 place count 822 transition count 3164
Symmetric choice reduction at 14 with 3 rule applications. Total rules 24530 place count 822 transition count 3164
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 159 transitions.
Iterating global reduction 14 with 6 rules applied. Total rules applied 24536 place count 819 transition count 3005
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 14 with 3 rules applied. Total rules applied 24539 place count 819 transition count 3002
Applied a total of 24539 rules in 5021 ms. Remains 819 /11440 variables (removed 10621) and now considering 3002/17128 (removed 14126) transitions.
Finished structural reductions, in 1 iterations. Remains : 819/11440 places, 3002/17128 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 14637 ms. (steps per millisecond=68 ) properties seen :[0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1]
FORMULA DLCflexbar-PT-4b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-4b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 645483 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=129 ) properties seen :[1, 0, 0]
FORMULA DLCflexbar-PT-4b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 610533 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=122 ) properties seen :[1, 0]
FORMULA DLCflexbar-PT-4b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 830002 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=165 ) properties seen :[0]
[2021-05-09 01:35:20] [INFO ] Flow matrix only has 722 transitions (discarded 2280 similar events)
// Phase 1: matrix 722 rows 819 cols
[2021-05-09 01:35:20] [INFO ] Computed 582 place invariants in 5 ms
[2021-05-09 01:35:20] [INFO ] [Real]Absence check using 582 positive place invariants in 231 ms returned unsat
FORMULA DLCflexbar-PT-4b-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
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="DLCflexbar-PT-4b"
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 DLCflexbar-PT-4b, 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-162039097200104"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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