fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r010-tajo-165245701500028
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for ASLink-PT-05a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
987.119 61242.00 86482.00 71.90 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r010-tajo-165245701500028.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-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 gold2021
Input is ASLink-PT-05a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-tajo-165245701500028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 740K
-rw-r--r-- 1 mcc users 6.1K Apr 30 07:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 30 07:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 30 07:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 30 07:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 516K May 10 09:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-05a-UpperBounds-00
FORMULA_NAME ASLink-PT-05a-UpperBounds-01
FORMULA_NAME ASLink-PT-05a-UpperBounds-02
FORMULA_NAME ASLink-PT-05a-UpperBounds-03
FORMULA_NAME ASLink-PT-05a-UpperBounds-04
FORMULA_NAME ASLink-PT-05a-UpperBounds-05
FORMULA_NAME ASLink-PT-05a-UpperBounds-06
FORMULA_NAME ASLink-PT-05a-UpperBounds-07
FORMULA_NAME ASLink-PT-05a-UpperBounds-08
FORMULA_NAME ASLink-PT-05a-UpperBounds-09
FORMULA_NAME ASLink-PT-05a-UpperBounds-10
FORMULA_NAME ASLink-PT-05a-UpperBounds-11
FORMULA_NAME ASLink-PT-05a-UpperBounds-12
FORMULA_NAME ASLink-PT-05a-UpperBounds-13
FORMULA_NAME ASLink-PT-05a-UpperBounds-14
FORMULA_NAME ASLink-PT-05a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652727412065

Running Version 0
[2022-05-16 18:56:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 18:56:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 18:56:54] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2022-05-16 18:56:54] [INFO ] Transformed 1211 places.
[2022-05-16 18:56:54] [INFO ] Transformed 1827 transitions.
[2022-05-16 18:56:54] [INFO ] Found NUPN structural information;
[2022-05-16 18:56:54] [INFO ] Parsed PT model containing 1211 places and 1827 transitions in 227 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 19 transitions
Reduce redundant transitions removed 19 transitions.
// Phase 1: matrix 1808 rows 1211 cols
[2022-05-16 18:56:54] [INFO ] Computed 232 place invariants in 156 ms
Incomplete random walk after 10000 steps, including 58 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 16) seen :12
FORMULA ASLink-PT-05a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
// Phase 1: matrix 1808 rows 1211 cols
[2022-05-16 18:56:54] [INFO ] Computed 232 place invariants in 31 ms
[2022-05-16 18:56:55] [INFO ] [Real]Absence check using 56 positive place invariants in 34 ms returned sat
[2022-05-16 18:56:55] [INFO ] [Real]Absence check using 56 positive and 176 generalized place invariants in 35 ms returned sat
[2022-05-16 18:56:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:56:56] [INFO ] [Real]Absence check using state equation in 757 ms returned sat
[2022-05-16 18:56:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:56:56] [INFO ] [Nat]Absence check using 56 positive place invariants in 31 ms returned sat
[2022-05-16 18:56:56] [INFO ] [Nat]Absence check using 56 positive and 176 generalized place invariants in 49 ms returned sat
[2022-05-16 18:56:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:01] [INFO ] [Nat]Absence check using state equation in 4715 ms returned unknown
[2022-05-16 18:57:01] [INFO ] [Real]Absence check using 56 positive place invariants in 28 ms returned sat
[2022-05-16 18:57:01] [INFO ] [Real]Absence check using 56 positive and 176 generalized place invariants in 48 ms returned sat
[2022-05-16 18:57:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:02] [INFO ] [Real]Absence check using state equation in 598 ms returned sat
[2022-05-16 18:57:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:02] [INFO ] [Nat]Absence check using 56 positive place invariants in 30 ms returned sat
[2022-05-16 18:57:02] [INFO ] [Nat]Absence check using 56 positive and 176 generalized place invariants in 47 ms returned sat
[2022-05-16 18:57:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:04] [INFO ] [Nat]Absence check using state equation in 1603 ms returned sat
[2022-05-16 18:57:04] [INFO ] Computed and/alt/rep : 734/2638/734 causal constraints (skipped 1073 transitions) in 147 ms.
[2022-05-16 18:57:07] [INFO ] Added : 30 causal constraints over 6 iterations in 3041 ms. Result :unknown
[2022-05-16 18:57:07] [INFO ] [Real]Absence check using 56 positive place invariants in 29 ms returned sat
[2022-05-16 18:57:07] [INFO ] [Real]Absence check using 56 positive and 176 generalized place invariants in 47 ms returned sat
[2022-05-16 18:57:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:08] [INFO ] [Real]Absence check using state equation in 742 ms returned sat
[2022-05-16 18:57:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:08] [INFO ] [Nat]Absence check using 56 positive place invariants in 25 ms returned sat
[2022-05-16 18:57:08] [INFO ] [Nat]Absence check using 56 positive and 176 generalized place invariants in 44 ms returned sat
[2022-05-16 18:57:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:13] [INFO ] [Nat]Absence check using state equation in 4698 ms returned unknown
[2022-05-16 18:57:13] [INFO ] [Real]Absence check using 56 positive place invariants in 22 ms returned sat
[2022-05-16 18:57:13] [INFO ] [Real]Absence check using 56 positive and 176 generalized place invariants in 38 ms returned sat
[2022-05-16 18:57:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:14] [INFO ] [Real]Absence check using state equation in 575 ms returned sat
[2022-05-16 18:57:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:14] [INFO ] [Nat]Absence check using 56 positive place invariants in 29 ms returned sat
[2022-05-16 18:57:14] [INFO ] [Nat]Absence check using 56 positive and 176 generalized place invariants in 45 ms returned sat
[2022-05-16 18:57:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:19] [INFO ] [Nat]Absence check using state equation in 4737 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 333400 steps, including 3764 resets, run finished after 1132 ms. (steps per millisecond=294 ) properties (out of 4) seen :2 could not realise parikh vector
FORMULA ASLink-PT-05a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-05a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 1211 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1211/1211 places, 1808/1808 transitions.
Ensure Unique test removed 20 places
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1181 transition count 1700
Reduce places removed 108 places and 0 transitions.
Iterating post reduction 1 with 108 rules applied. Total rules applied 246 place count 1073 transition count 1700
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 109 Pre rules applied. Total rules applied 246 place count 1073 transition count 1591
Deduced a syphon composed of 109 places in 4 ms
Ensure Unique test removed 43 places
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 261 rules applied. Total rules applied 507 place count 921 transition count 1591
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 508 place count 921 transition count 1590
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 509 place count 920 transition count 1590
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 517 place count 912 transition count 1549
Ensure Unique test removed 1 places
Iterating global reduction 4 with 9 rules applied. Total rules applied 526 place count 911 transition count 1549
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 6 rules applied. Total rules applied 532 place count 910 transition count 1544
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 535 place count 907 transition count 1544
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 536 place count 906 transition count 1536
Iterating global reduction 6 with 1 rules applied. Total rules applied 537 place count 906 transition count 1536
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 538 place count 905 transition count 1528
Iterating global reduction 6 with 1 rules applied. Total rules applied 539 place count 905 transition count 1528
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 540 place count 904 transition count 1520
Iterating global reduction 6 with 1 rules applied. Total rules applied 541 place count 904 transition count 1520
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 542 place count 903 transition count 1512
Iterating global reduction 6 with 1 rules applied. Total rules applied 543 place count 903 transition count 1512
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 544 place count 902 transition count 1504
Iterating global reduction 6 with 1 rules applied. Total rules applied 545 place count 902 transition count 1504
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 546 place count 901 transition count 1496
Iterating global reduction 6 with 1 rules applied. Total rules applied 547 place count 901 transition count 1496
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 548 place count 900 transition count 1488
Iterating global reduction 6 with 1 rules applied. Total rules applied 549 place count 900 transition count 1488
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 550 place count 899 transition count 1480
Iterating global reduction 6 with 1 rules applied. Total rules applied 551 place count 899 transition count 1480
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 552 place count 898 transition count 1472
Iterating global reduction 6 with 1 rules applied. Total rules applied 553 place count 898 transition count 1472
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 554 place count 897 transition count 1464
Iterating global reduction 6 with 1 rules applied. Total rules applied 555 place count 897 transition count 1464
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 556 place count 896 transition count 1456
Iterating global reduction 6 with 1 rules applied. Total rules applied 557 place count 896 transition count 1456
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 558 place count 895 transition count 1448
Iterating global reduction 6 with 1 rules applied. Total rules applied 559 place count 895 transition count 1448
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 560 place count 894 transition count 1440
Iterating global reduction 6 with 1 rules applied. Total rules applied 561 place count 894 transition count 1440
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 562 place count 893 transition count 1432
Iterating global reduction 6 with 1 rules applied. Total rules applied 563 place count 893 transition count 1432
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 564 place count 892 transition count 1424
Iterating global reduction 6 with 1 rules applied. Total rules applied 565 place count 892 transition count 1424
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 566 place count 891 transition count 1416
Iterating global reduction 6 with 1 rules applied. Total rules applied 567 place count 891 transition count 1416
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 6 with 70 rules applied. Total rules applied 637 place count 856 transition count 1381
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 641 place count 856 transition count 1377
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 645 place count 852 transition count 1377
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 651 place count 852 transition count 1377
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 652 place count 851 transition count 1376
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 662 place count 841 transition count 1376
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 20 Pre rules applied. Total rules applied 662 place count 841 transition count 1356
Deduced a syphon composed of 20 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 8 with 41 rules applied. Total rules applied 703 place count 820 transition count 1356
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 8 with 6 rules applied. Total rules applied 709 place count 814 transition count 1356
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 709 place count 814 transition count 1355
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 711 place count 813 transition count 1355
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 9 with 12 rules applied. Total rules applied 723 place count 807 transition count 1349
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 728 place count 802 transition count 1344
Iterating global reduction 9 with 5 rules applied. Total rules applied 733 place count 802 transition count 1344
Free-agglomeration rule applied 5 times.
Iterating global reduction 9 with 5 rules applied. Total rules applied 738 place count 802 transition count 1339
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 743 place count 797 transition count 1339
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 748 place count 797 transition count 1339
Applied a total of 748 rules in 1316 ms. Remains 797 /1211 variables (removed 414) and now considering 1339/1808 (removed 469) transitions.
Finished structural reductions, in 1 iterations. Remains : 797/1211 places, 1339/1808 transitions.
// Phase 1: matrix 1339 rows 797 cols
[2022-05-16 18:57:21] [INFO ] Computed 140 place invariants in 108 ms
Incomplete random walk after 1000000 steps, including 11926 resets, run finished after 3029 ms. (steps per millisecond=330 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2292 resets, run finished after 1084 ms. (steps per millisecond=922 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2318 resets, run finished after 1081 ms. (steps per millisecond=925 ) properties (out of 2) seen :0
// Phase 1: matrix 1339 rows 797 cols
[2022-05-16 18:57:27] [INFO ] Computed 140 place invariants in 47 ms
[2022-05-16 18:57:27] [INFO ] [Real]Absence check using 34 positive place invariants in 13 ms returned sat
[2022-05-16 18:57:27] [INFO ] [Real]Absence check using 34 positive and 106 generalized place invariants in 26 ms returned sat
[2022-05-16 18:57:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:27] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2022-05-16 18:57:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:27] [INFO ] [Nat]Absence check using 34 positive place invariants in 11 ms returned sat
[2022-05-16 18:57:27] [INFO ] [Nat]Absence check using 34 positive and 106 generalized place invariants in 19 ms returned sat
[2022-05-16 18:57:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:28] [INFO ] [Nat]Absence check using state equation in 469 ms returned sat
[2022-05-16 18:57:28] [INFO ] Computed and/alt/rep : 523/2009/523 causal constraints (skipped 787 transitions) in 99 ms.
[2022-05-16 18:57:35] [INFO ] Added : 40 causal constraints over 8 iterations in 6877 ms. Result :unknown
[2022-05-16 18:57:35] [INFO ] [Real]Absence check using 34 positive place invariants in 10 ms returned sat
[2022-05-16 18:57:35] [INFO ] [Real]Absence check using 34 positive and 106 generalized place invariants in 20 ms returned sat
[2022-05-16 18:57:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:35] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2022-05-16 18:57:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:35] [INFO ] [Nat]Absence check using 34 positive place invariants in 14 ms returned sat
[2022-05-16 18:57:35] [INFO ] [Nat]Absence check using 34 positive and 106 generalized place invariants in 24 ms returned sat
[2022-05-16 18:57:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:36] [INFO ] [Nat]Absence check using state equation in 522 ms returned sat
[2022-05-16 18:57:36] [INFO ] Computed and/alt/rep : 523/2009/523 causal constraints (skipped 787 transitions) in 92 ms.
[2022-05-16 18:57:40] [INFO ] Added : 156 causal constraints over 32 iterations in 3809 ms. Result :sat
Minimization took 643 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Incomplete Parikh walk after 152700 steps, including 2766 resets, run finished after 372 ms. (steps per millisecond=410 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 138500 steps, including 2846 resets, run finished after 297 ms. (steps per millisecond=466 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 797 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 797/797 places, 1339/1339 transitions.
Applied a total of 0 rules in 27 ms. Remains 797 /797 variables (removed 0) and now considering 1339/1339 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 797/797 places, 1339/1339 transitions.
Starting structural reductions, iteration 0 : 797/797 places, 1339/1339 transitions.
Applied a total of 0 rules in 26 ms. Remains 797 /797 variables (removed 0) and now considering 1339/1339 (removed 0) transitions.
// Phase 1: matrix 1339 rows 797 cols
[2022-05-16 18:57:41] [INFO ] Computed 140 place invariants in 20 ms
[2022-05-16 18:57:42] [INFO ] Implicit Places using invariants in 610 ms returned [0, 18, 19, 30, 48, 66, 135, 139, 148, 149, 150, 168, 186, 255, 259, 260, 271, 272, 273, 291, 309, 378, 382, 383, 394, 395, 396, 414, 432, 501, 505, 506, 517, 518, 519, 537, 555, 624, 628, 629, 632, 643, 644, 645, 663, 665, 668, 686, 687, 688, 689, 701, 707, 713, 719, 725, 731, 737, 743, 749, 755, 761]
Discarding 62 places :
Implicit Place search using SMT only with invariants took 624 ms to find 62 implicit places.
[2022-05-16 18:57:42] [INFO ] Redundant transitions in 114 ms returned []
// Phase 1: matrix 1339 rows 735 cols
[2022-05-16 18:57:42] [INFO ] Computed 78 place invariants in 23 ms
[2022-05-16 18:57:42] [INFO ] Dead Transitions using invariants and state equation in 494 ms returned []
Starting structural reductions, iteration 1 : 735/797 places, 1339/1339 transitions.
Drop transitions removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 107 place count 735 transition count 1232
Reduce places removed 107 places and 0 transitions.
Iterating post reduction 1 with 107 rules applied. Total rules applied 214 place count 628 transition count 1232
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 214 place count 628 transition count 1205
Deduced a syphon composed of 27 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 55 rules applied. Total rules applied 269 place count 600 transition count 1205
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 281 place count 596 transition count 1197
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 289 place count 588 transition count 1197
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 304 place count 573 transition count 1182
Iterating global reduction 4 with 15 rules applied. Total rules applied 319 place count 573 transition count 1182
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 322 place count 573 transition count 1179
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 322 place count 573 transition count 1178
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 324 place count 572 transition count 1178
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 327 place count 569 transition count 1175
Iterating global reduction 5 with 3 rules applied. Total rules applied 330 place count 569 transition count 1175
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 331 place count 568 transition count 1174
Iterating global reduction 5 with 1 rules applied. Total rules applied 332 place count 568 transition count 1174
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 333 place count 567 transition count 1173
Iterating global reduction 5 with 1 rules applied. Total rules applied 334 place count 567 transition count 1173
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 424 place count 522 transition count 1128
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 428 place count 522 transition count 1124
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 432 place count 518 transition count 1120
Iterating global reduction 6 with 4 rules applied. Total rules applied 436 place count 518 transition count 1120
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 440 place count 518 transition count 1116
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 441 place count 518 transition count 1115
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 7 with 11 rules applied. Total rules applied 452 place count 518 transition count 1104
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 464 place count 506 transition count 1104
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 480 place count 506 transition count 1104
Applied a total of 480 rules in 410 ms. Remains 506 /735 variables (removed 229) and now considering 1104/1339 (removed 235) transitions.
// Phase 1: matrix 1104 rows 506 cols
[2022-05-16 18:57:43] [INFO ] Computed 72 place invariants in 26 ms
[2022-05-16 18:57:43] [INFO ] Implicit Places using invariants in 323 ms returned [89, 95, 98, 100, 104, 105, 157, 174, 180, 183, 185, 190, 191, 243, 260, 266, 269, 271, 276, 277, 329, 346, 352, 355, 357, 362, 363, 415, 432, 438, 441, 443]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 332 ms to find 32 implicit places.
Starting structural reductions, iteration 2 : 474/797 places, 1104/1339 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 459 transition count 1089
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 459 transition count 1089
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 454 transition count 1084
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 454 transition count 1084
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 58 place count 445 transition count 1075
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 73 place count 445 transition count 1060
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 88 place count 430 transition count 1060
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 92 place count 430 transition count 1056
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 96 place count 426 transition count 1056
Applied a total of 96 rules in 142 ms. Remains 426 /474 variables (removed 48) and now considering 1056/1104 (removed 48) transitions.
// Phase 1: matrix 1056 rows 426 cols
[2022-05-16 18:57:43] [INFO ] Computed 40 place invariants in 14 ms
[2022-05-16 18:57:44] [INFO ] Implicit Places using invariants in 250 ms returned []
// Phase 1: matrix 1056 rows 426 cols
[2022-05-16 18:57:44] [INFO ] Computed 40 place invariants in 10 ms
[2022-05-16 18:57:44] [INFO ] Implicit Places using invariants and state equation in 671 ms returned []
Implicit Place search using SMT with State Equation took 924 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 426/797 places, 1056/1339 transitions.
Successfully produced net in file /tmp/petri1000_14592568851435656499.dot
Successfully produced net in file /tmp/petri1001_3987265486327190847.dot
Successfully produced net in file /tmp/petri1002_555672243669506028.dot
Successfully produced net in file /tmp/petri1003_7045360986550636157.dot
Successfully produced net in file /tmp/petri1004_16477540193560141990.dot
Drop transitions removed 5 transitions
Dominated transitions for bounds rules discarded 5 transitions
// Phase 1: matrix 1051 rows 426 cols
[2022-05-16 18:57:44] [INFO ] Computed 40 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 18329 resets, run finished after 2244 ms. (steps per millisecond=445 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 4796 resets, run finished after 834 ms. (steps per millisecond=1199 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 4760 resets, run finished after 838 ms. (steps per millisecond=1193 ) properties (out of 2) seen :0
// Phase 1: matrix 1051 rows 426 cols
[2022-05-16 18:57:48] [INFO ] Computed 40 place invariants in 9 ms
[2022-05-16 18:57:48] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2022-05-16 18:57:48] [INFO ] [Real]Absence check using 11 positive and 29 generalized place invariants in 18 ms returned sat
[2022-05-16 18:57:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:49] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2022-05-16 18:57:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-16 18:57:49] [INFO ] [Nat]Absence check using 11 positive and 29 generalized place invariants in 8 ms returned sat
[2022-05-16 18:57:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:49] [INFO ] [Nat]Absence check using state equation in 487 ms returned sat
[2022-05-16 18:57:49] [INFO ] Computed and/alt/rep : 223/1032/223 causal constraints (skipped 802 transitions) in 88 ms.
[2022-05-16 18:57:50] [INFO ] Added : 54 causal constraints over 12 iterations in 1037 ms. Result :sat
Minimization took 182 ms.
[2022-05-16 18:57:51] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-16 18:57:51] [INFO ] [Real]Absence check using 11 positive and 29 generalized place invariants in 11 ms returned sat
[2022-05-16 18:57:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:51] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2022-05-16 18:57:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-05-16 18:57:51] [INFO ] [Nat]Absence check using 11 positive and 29 generalized place invariants in 8 ms returned sat
[2022-05-16 18:57:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:51] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
[2022-05-16 18:57:51] [INFO ] Computed and/alt/rep : 223/1032/223 causal constraints (skipped 802 transitions) in 63 ms.
[2022-05-16 18:57:52] [INFO ] Added : 24 causal constraints over 5 iterations in 679 ms. Result :sat
Minimization took 216 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Incomplete Parikh walk after 78300 steps, including 1755 resets, run finished after 164 ms. (steps per millisecond=477 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 80600 steps, including 1536 resets, run finished after 164 ms. (steps per millisecond=491 ) properties (out of 2) seen :2 could not realise parikh vector
FORMULA ASLink-PT-05a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-05a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652727473307

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="ASLink-PT-05a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is ASLink-PT-05a, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r010-tajo-165245701500028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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