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.r016-tajo-165245743200013.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 itstools
Input is ASLink-PT-01b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-tajo-165245743200013
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.1K Apr 30 07:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 30 07:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 30 07:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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 06:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 06:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 06:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 06:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 06:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 06:59 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 293K 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 booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1652771227946

Running Version 202205111006
[2022-05-17 07:07:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -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, 1800]
[2022-05-17 07:07:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 07:07:09] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2022-05-17 07:07:09] [INFO ] Transformed 846 places.
[2022-05-17 07:07:09] [INFO ] Transformed 1148 transitions.
[2022-05-17 07:07:09] [INFO ] Found NUPN structural information;
[2022-05-17 07:07:09] [INFO ] Parsed PT model containing 846 places and 1148 transitions in 259 ms.
Structural test allowed to assert that 96 places are NOT stable. Took 11 ms.
Incomplete random walk after 10000 steps, including 64 resets, run finished after 611 ms. (steps per millisecond=16 ) properties (out of 750) seen :685
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 65) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 57) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 53) seen :0
Running SMT prover for 53 properties.
// Phase 1: matrix 1148 rows 846 cols
[2022-05-17 07:07:10] [INFO ] Computed 82 place invariants in 40 ms
[2022-05-17 07:07:11] [INFO ] After 966ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:53
[2022-05-17 07:07:12] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2022-05-17 07:07:12] [INFO ] [Nat]Absence check using 19 positive and 63 generalized place invariants in 34 ms returned sat
[2022-05-17 07:07:16] [INFO ] After 3212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :53
[2022-05-17 07:07:19] [INFO ] Deduced a trap composed of 165 places in 289 ms of which 10 ms to minimize.
[2022-05-17 07:07:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 410 ms
[2022-05-17 07:07:20] [INFO ] Deduced a trap composed of 93 places in 386 ms of which 2 ms to minimize.
[2022-05-17 07:07:20] [INFO ] Deduced a trap composed of 94 places in 359 ms of which 1 ms to minimize.
[2022-05-17 07:07:21] [INFO ] Deduced a trap composed of 205 places in 354 ms of which 2 ms to minimize.
[2022-05-17 07:07:21] [INFO ] Deduced a trap composed of 247 places in 367 ms of which 1 ms to minimize.
[2022-05-17 07:07:21] [INFO ] Deduced a trap composed of 156 places in 348 ms of which 1 ms to minimize.
[2022-05-17 07:07:22] [INFO ] Deduced a trap composed of 223 places in 309 ms of which 1 ms to minimize.
[2022-05-17 07:07:22] [INFO ] Deduced a trap composed of 246 places in 304 ms of which 2 ms to minimize.
[2022-05-17 07:07:22] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2809 ms
[2022-05-17 07:07:23] [INFO ] Deduced a trap composed of 65 places in 172 ms of which 1 ms to minimize.
[2022-05-17 07:07:23] [INFO ] Deduced a trap composed of 81 places in 163 ms of which 0 ms to minimize.
[2022-05-17 07:07:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 503 ms
[2022-05-17 07:07:25] [INFO ] Deduced a trap composed of 181 places in 362 ms of which 1 ms to minimize.
[2022-05-17 07:07:25] [INFO ] Deduced a trap composed of 115 places in 348 ms of which 2 ms to minimize.
[2022-05-17 07:07:25] [INFO ] Deduced a trap composed of 200 places in 302 ms of which 1 ms to minimize.
[2022-05-17 07:07:26] [INFO ] Deduced a trap composed of 132 places in 300 ms of which 2 ms to minimize.
[2022-05-17 07:07:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1573 ms
[2022-05-17 07:07:28] [INFO ] Deduced a trap composed of 138 places in 185 ms of which 1 ms to minimize.
[2022-05-17 07:07:28] [INFO ] Deduced a trap composed of 144 places in 182 ms of which 1 ms to minimize.
[2022-05-17 07:07:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 506 ms
[2022-05-17 07:07:31] [INFO ] After 18606ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :53
Attempting to minimize the solution found.
Minimization took 2094 ms.
[2022-05-17 07:07:33] [INFO ] After 21949ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :53
Fused 53 Parikh solutions to 52 different solutions.
Parikh walk visited 0 properties in 14751 ms.
Support contains 53 out of 846 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 846/846 places, 1148/1148 transitions.
Drop transitions removed 170 transitions
Trivial Post-agglo rules discarded 170 transitions
Performed 170 trivial Post agglomeration. Transition count delta: 170
Iterating post reduction 0 with 170 rules applied. Total rules applied 170 place count 846 transition count 978
Reduce places removed 170 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 180 rules applied. Total rules applied 350 place count 676 transition count 968
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 353 place count 673 transition count 968
Performed 182 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 182 Pre rules applied. Total rules applied 353 place count 673 transition count 786
Deduced a syphon composed of 182 places in 2 ms
Ensure Unique test removed 13 places
Reduce places removed 195 places and 0 transitions.
Iterating global reduction 3 with 377 rules applied. Total rules applied 730 place count 478 transition count 786
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 3 with 11 rules applied. Total rules applied 741 place count 477 transition count 776
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 751 place count 467 transition count 776
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 751 place count 467 transition count 772
Deduced a syphon composed of 4 places in 8 ms
Ensure Unique test removed 4 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 763 place count 459 transition count 772
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 763 place count 459 transition count 768
Deduced a syphon composed of 4 places in 8 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 771 place count 455 transition count 768
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 796 place count 430 transition count 743
Iterating global reduction 5 with 25 rules applied. Total rules applied 821 place count 430 transition count 743
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 822 place count 430 transition count 742
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 10 Pre rules applied. Total rules applied 822 place count 430 transition count 732
Deduced a syphon composed of 10 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 21 rules applied. Total rules applied 843 place count 419 transition count 732
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 843 place count 419 transition count 731
Deduced a syphon composed of 1 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 846 place count 417 transition count 731
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 848 place count 415 transition count 716
Iterating global reduction 6 with 2 rules applied. Total rules applied 850 place count 415 transition count 716
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 850 place count 415 transition count 715
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 852 place count 414 transition count 715
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 853 place count 413 transition count 707
Iterating global reduction 6 with 1 rules applied. Total rules applied 854 place count 413 transition count 707
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 855 place count 412 transition count 699
Iterating global reduction 6 with 1 rules applied. Total rules applied 856 place count 412 transition count 699
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 857 place count 411 transition count 691
Iterating global reduction 6 with 1 rules applied. Total rules applied 858 place count 411 transition count 691
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 859 place count 410 transition count 683
Iterating global reduction 6 with 1 rules applied. Total rules applied 860 place count 410 transition count 683
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 861 place count 409 transition count 675
Iterating global reduction 6 with 1 rules applied. Total rules applied 862 place count 409 transition count 675
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 863 place count 408 transition count 667
Iterating global reduction 6 with 1 rules applied. Total rules applied 864 place count 408 transition count 667
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 865 place count 407 transition count 659
Iterating global reduction 6 with 1 rules applied. Total rules applied 866 place count 407 transition count 659
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 867 place count 406 transition count 651
Iterating global reduction 6 with 1 rules applied. Total rules applied 868 place count 406 transition count 651
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 869 place count 405 transition count 643
Iterating global reduction 6 with 1 rules applied. Total rules applied 870 place count 405 transition count 643
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 871 place count 404 transition count 635
Iterating global reduction 6 with 1 rules applied. Total rules applied 872 place count 404 transition count 635
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 873 place count 403 transition count 627
Iterating global reduction 6 with 1 rules applied. Total rules applied 874 place count 403 transition count 627
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 875 place count 402 transition count 619
Iterating global reduction 6 with 1 rules applied. Total rules applied 876 place count 402 transition count 619
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 877 place count 401 transition count 611
Iterating global reduction 6 with 1 rules applied. Total rules applied 878 place count 401 transition count 611
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 879 place count 400 transition count 603
Iterating global reduction 6 with 1 rules applied. Total rules applied 880 place count 400 transition count 603
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 881 place count 399 transition count 595
Iterating global reduction 6 with 1 rules applied. Total rules applied 882 place count 399 transition count 595
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 883 place count 398 transition count 587
Iterating global reduction 6 with 1 rules applied. Total rules applied 884 place count 398 transition count 587
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 3 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 6 with 78 rules applied. Total rules applied 962 place count 359 transition count 548
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 963 place count 358 transition count 547
Ensure Unique test removed 1 places
Iterating global reduction 6 with 2 rules applied. Total rules applied 965 place count 357 transition count 547
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 966 place count 356 transition count 546
Iterating global reduction 6 with 1 rules applied. Total rules applied 967 place count 356 transition count 546
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 969 place count 356 transition count 544
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 970 place count 355 transition count 544
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 972 place count 354 transition count 553
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 974 place count 354 transition count 551
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 976 place count 352 transition count 551
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 977 place count 352 transition count 551
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 978 place count 351 transition count 550
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 3 rules applied. Total rules applied 981 place count 349 transition count 549
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 982 place count 348 transition count 549
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 3 Pre rules applied. Total rules applied 982 place count 348 transition count 546
Deduced a syphon composed of 3 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 7 rules applied. Total rules applied 989 place count 344 transition count 546
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 11 with 2 rules applied. Total rules applied 991 place count 342 transition count 546
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 991 place count 342 transition count 545
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 993 place count 341 transition count 545
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 999 place count 338 transition count 542
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1000 place count 337 transition count 541
Iterating global reduction 12 with 1 rules applied. Total rules applied 1001 place count 337 transition count 541
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1002 place count 337 transition count 540
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1003 place count 336 transition count 540
Applied a total of 1003 rules in 576 ms. Remains 336 /846 variables (removed 510) and now considering 540/1148 (removed 608) transitions.
Finished structural reductions, in 1 iterations. Remains : 336/846 places, 540/1148 transitions.
Incomplete random walk after 1000000 steps, including 21322 resets, run finished after 15125 ms. (steps per millisecond=66 ) properties (out of 53) seen :50
Interrupted Best-First random walk after 770785 steps, including 7125 resets, run timeout after 5001 ms. (steps per millisecond=154 ) properties seen 0
Interrupted Best-First random walk after 754058 steps, including 6967 resets, run timeout after 5001 ms. (steps per millisecond=150 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 9156 resets, run finished after 4990 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 540 rows 336 cols
[2022-05-17 07:08:19] [INFO ] Computed 56 place invariants in 10 ms
[2022-05-17 07:08:19] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 07:08:19] [INFO ] [Nat]Absence check using 16 positive place invariants in 17 ms returned sat
[2022-05-17 07:08:19] [INFO ] [Nat]Absence check using 16 positive and 40 generalized place invariants in 13 ms returned sat
[2022-05-17 07:08:19] [INFO ] After 250ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 07:08:20] [INFO ] After 334ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 39 ms.
[2022-05-17 07:08:20] [INFO ] After 662ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 585 ms.
Support contains 3 out of 336 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 336/336 places, 540/540 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 336 transition count 522
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 318 transition count 522
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 36 place count 318 transition count 514
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 52 place count 310 transition count 514
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 308 transition count 512
Applied a total of 56 rules in 24 ms. Remains 308 /336 variables (removed 28) and now considering 512/540 (removed 28) transitions.
Finished structural reductions, in 1 iterations. Remains : 308/336 places, 512/540 transitions.
Incomplete random walk after 1000000 steps, including 21490 resets, run finished after 10885 ms. (steps per millisecond=91 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 848150 steps, including 7866 resets, run timeout after 5001 ms. (steps per millisecond=169 ) properties seen 0
Interrupted Best-First random walk after 681322 steps, including 6426 resets, run timeout after 5001 ms. (steps per millisecond=136 ) properties seen 0
Interrupted Best-First random walk after 827371 steps, including 7649 resets, run timeout after 5001 ms. (steps per millisecond=165 ) properties seen 0
Finished probabilistic random walk after 66919 steps, run visited all 3 properties in 519 ms. (steps per millisecond=128 )
Probabilistic random walk after 66919 steps, saw 27000 distinct states, run finished after 519 ms. (steps per millisecond=128 ) properties seen :3
Able to resolve query StableMarking after proving 751 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 97796 ms.

BK_STOP 1652771327128

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination StableMarking -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 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-01b"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 itstools"
echo " Input is ASLink-PT-01b, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r016-tajo-165245743200013"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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