Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r012-smll-171620123700013.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
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 r012-smll-171620123700013
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 808K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 18:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 11 18:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 11 18:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 11 18:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 293K May 18 16:42 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 1716242498740

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ASLink-PT-01b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-20 22:01:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-20 22:01:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 22:01:40] [INFO ] Load time of PNML (sax parser for PT used): 304 ms
[2024-05-20 22:01:41] [INFO ] Transformed 846 places.
[2024-05-20 22:01:41] [INFO ] Transformed 1148 transitions.
[2024-05-20 22:01:41] [INFO ] Found NUPN structural information;
[2024-05-20 22:01:41] [INFO ] Parsed PT model containing 846 places and 1148 transitions and 3624 arcs in 557 ms.
Structural test allowed to assert that 96 places are NOT stable. Took 17 ms.
RANDOM walk for 40000 steps (237 resets) in 3026 ms. (13 steps per ms) remains 63/750 properties
BEST_FIRST walk for 4001 steps (8 resets) in 74 ms. (53 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (10 resets) in 35 ms. (111 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (9 resets) in 52 ms. (75 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (9 resets) in 56 ms. (70 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (9 resets) in 33 ms. (117 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (11 resets) in 34 ms. (114 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (9 resets) in 19 ms. (200 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (9 resets) in 19 ms. (200 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (9 resets) in 26 ms. (148 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (9 resets) in 30 ms. (129 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (9 resets) in 17 ms. (222 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (9 resets) in 16 ms. (235 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (9 resets) in 34 ms. (114 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (10 resets) in 22 ms. (174 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (9 resets) in 40 ms. (97 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (9 resets) in 16 ms. (235 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (10 resets) in 30 ms. (129 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (9 resets) in 23 ms. (166 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (10 resets) in 19 ms. (200 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (10 resets) in 21 ms. (181 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (9 resets) in 12 ms. (307 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (9 resets) in 39 ms. (100 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (9 resets) in 22 ms. (174 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (9 resets) in 29 ms. (133 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (9 resets) in 37 ms. (105 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (10 resets) in 15 ms. (250 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (9 resets) in 21 ms. (181 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (9 resets) in 16 ms. (235 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (11 resets) in 16 ms. (235 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (9 resets) in 20 ms. (190 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (9 resets) in 25 ms. (154 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (10 resets) in 14 ms. (266 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (9 resets) in 43 ms. (90 steps per ms) remains 63/63 properties
// Phase 1: matrix 1148 rows 846 cols
[2024-05-20 22:01:43] [INFO ] Computed 82 invariants in 90 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 96/159 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 96/167 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 142/301 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 142/322 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 530/831 variables, 56/378 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/831 variables, 530/908 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/831 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 12 (OVERLAPS) 15/846 variables, 5/913 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/846 variables, 15/928 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 846/1994 variables, and 928 constraints, problems are : Problem set: 0 solved, 63 unsolved in 5121 ms.
Refiners :[Domain max(s): 846/846 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 0/846 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 96/159 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 96/167 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 142/301 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 142/322 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 530/831 variables, 56/378 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/831 variables, 530/908 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-05-20 22:01:50] [INFO ] Deduced a trap composed of 270 places in 718 ms of which 87 ms to minimize.
[2024-05-20 22:01:51] [INFO ] Deduced a trap composed of 150 places in 717 ms of which 31 ms to minimize.
[2024-05-20 22:01:52] [INFO ] Deduced a trap composed of 230 places in 637 ms of which 8 ms to minimize.
[2024-05-20 22:01:53] [INFO ] Deduced a trap composed of 222 places in 1441 ms of which 8 ms to minimize.
SMT process timed out in 10887ms, After SMT, problems are : Problem set: 0 solved, 63 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 63 out of 846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 846/846 places, 1148/1148 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 171 transitions
Trivial Post-agglo rules discarded 171 transitions
Performed 171 trivial Post agglomeration. Transition count delta: 171
Iterating post reduction 0 with 171 rules applied. Total rules applied 171 place count 846 transition count 977
Reduce places removed 171 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 181 rules applied. Total rules applied 352 place count 675 transition count 967
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 355 place count 672 transition count 967
Performed 178 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 178 Pre rules applied. Total rules applied 355 place count 672 transition count 789
Deduced a syphon composed of 178 places in 4 ms
Ensure Unique test removed 13 places
Reduce places removed 191 places and 0 transitions.
Iterating global reduction 3 with 369 rules applied. Total rules applied 724 place count 481 transition count 789
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) 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 735 place count 480 transition count 779
Reduce places removed 10 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 12 rules applied. Total rules applied 747 place count 469 transition count 778
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 748 place count 468 transition count 778
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 748 place count 468 transition count 774
Deduced a syphon composed of 4 places in 3 ms
Ensure Unique test removed 4 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 760 place count 460 transition count 774
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 760 place count 460 transition count 770
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 768 place count 456 transition count 770
Discarding 24 places :
Symmetric choice reduction at 6 with 24 rule applications. Total rules 792 place count 432 transition count 746
Iterating global reduction 6 with 24 rules applied. Total rules applied 816 place count 432 transition count 746
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 817 place count 432 transition count 745
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 10 Pre rules applied. Total rules applied 817 place count 432 transition count 735
Deduced a syphon composed of 10 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 21 rules applied. Total rules applied 838 place count 421 transition count 735
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 838 place count 421 transition count 734
Deduced a syphon composed of 1 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 841 place count 419 transition count 734
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 843 place count 417 transition count 719
Iterating global reduction 7 with 2 rules applied. Total rules applied 845 place count 417 transition count 719
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 845 place count 417 transition count 718
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 847 place count 416 transition count 718
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 848 place count 415 transition count 710
Iterating global reduction 7 with 1 rules applied. Total rules applied 849 place count 415 transition count 710
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 850 place count 414 transition count 702
Iterating global reduction 7 with 1 rules applied. Total rules applied 851 place count 414 transition count 702
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 852 place count 413 transition count 694
Iterating global reduction 7 with 1 rules applied. Total rules applied 853 place count 413 transition count 694
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 854 place count 412 transition count 686
Iterating global reduction 7 with 1 rules applied. Total rules applied 855 place count 412 transition count 686
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 856 place count 411 transition count 678
Iterating global reduction 7 with 1 rules applied. Total rules applied 857 place count 411 transition count 678
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 858 place count 410 transition count 670
Iterating global reduction 7 with 1 rules applied. Total rules applied 859 place count 410 transition count 670
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 860 place count 409 transition count 662
Iterating global reduction 7 with 1 rules applied. Total rules applied 861 place count 409 transition count 662
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 862 place count 408 transition count 654
Iterating global reduction 7 with 1 rules applied. Total rules applied 863 place count 408 transition count 654
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 864 place count 407 transition count 646
Iterating global reduction 7 with 1 rules applied. Total rules applied 865 place count 407 transition count 646
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 866 place count 406 transition count 638
Iterating global reduction 7 with 1 rules applied. Total rules applied 867 place count 406 transition count 638
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 868 place count 405 transition count 630
Iterating global reduction 7 with 1 rules applied. Total rules applied 869 place count 405 transition count 630
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 870 place count 404 transition count 622
Iterating global reduction 7 with 1 rules applied. Total rules applied 871 place count 404 transition count 622
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 872 place count 403 transition count 614
Iterating global reduction 7 with 1 rules applied. Total rules applied 873 place count 403 transition count 614
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 874 place count 402 transition count 606
Iterating global reduction 7 with 1 rules applied. Total rules applied 875 place count 402 transition count 606
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 876 place count 401 transition count 598
Iterating global reduction 7 with 1 rules applied. Total rules applied 877 place count 401 transition count 598
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 878 place count 400 transition count 590
Iterating global reduction 7 with 1 rules applied. Total rules applied 879 place count 400 transition count 590
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 7 with 76 rules applied. Total rules applied 955 place count 362 transition count 552
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 956 place count 361 transition count 551
Ensure Unique test removed 1 places
Iterating global reduction 7 with 2 rules applied. Total rules applied 958 place count 360 transition count 551
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 959 place count 359 transition count 550
Iterating global reduction 7 with 1 rules applied. Total rules applied 960 place count 359 transition count 550
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 962 place count 359 transition count 548
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 963 place count 358 transition count 548
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
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 965 place count 357 transition count 557
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 967 place count 357 transition count 555
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 969 place count 355 transition count 555
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 970 place count 354 transition count 554
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 3 rules applied. Total rules applied 973 place count 352 transition count 553
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 974 place count 351 transition count 553
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 3 Pre rules applied. Total rules applied 974 place count 351 transition count 550
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 980 place count 348 transition count 550
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 12 with 2 rules applied. Total rules applied 982 place count 346 transition count 550
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 982 place count 346 transition count 549
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 984 place count 345 transition count 549
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 13 with 4 rules applied. Total rules applied 988 place count 343 transition count 547
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 989 place count 342 transition count 546
Iterating global reduction 13 with 1 rules applied. Total rules applied 990 place count 342 transition count 546
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 991 place count 342 transition count 545
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 992 place count 341 transition count 545
Applied a total of 992 rules in 612 ms. Remains 341 /846 variables (removed 505) and now considering 545/1148 (removed 603) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 627 ms. Remains : 341/846 places, 545/1148 transitions.
RANDOM walk for 4000000 steps (84294 resets) in 26816 ms. (149 steps per ms) remains 12/63 properties
BEST_FIRST walk for 4000003 steps (36891 resets) in 7790 ms. (513 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (37045 resets) in 8155 ms. (490 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000002 steps (36916 resets) in 7820 ms. (511 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (37049 resets) in 7611 ms. (525 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000002 steps (36998 resets) in 8854 ms. (451 steps per ms) remains 2/12 properties
// Phase 1: matrix 545 rows 341 cols
[2024-05-20 22:02:16] [INFO ] Computed 56 invariants in 21 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 14/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/36 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 131/167 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 66/233 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/235 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 104/339 variables, 28/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/339 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/340 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/340 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/341 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/341 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 545/886 variables, 341/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/886 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/886 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 886/886 variables, and 397 constraints, problems are : Problem set: 0 solved, 2 unsolved in 472 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 341/341 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 14/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/36 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 131/167 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 66/233 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/235 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 104/339 variables, 28/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/339 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/340 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/340 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/341 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/341 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 545/886 variables, 341/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/886 variables, 2/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/886 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/886 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 886/886 variables, and 399 constraints, problems are : Problem set: 0 solved, 2 unsolved in 568 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 341/341 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1082ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 508 ms.
Support contains 2 out of 341 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 341/341 places, 545/545 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 341 transition count 527
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 323 transition count 527
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 36 place count 323 transition count 516
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 58 place count 312 transition count 516
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 68 place count 307 transition count 511
Applied a total of 68 rules in 32 ms. Remains 307 /341 variables (removed 34) and now considering 511/545 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 307/341 places, 511/545 transitions.
RANDOM walk for 4000000 steps (85125 resets) in 9999 ms. (400 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000004 steps (37250 resets) in 4834 ms. (827 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000003 steps (36976 resets) in 4234 ms. (944 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 88050 steps, run visited all 2 properties in 798 ms. (steps per millisecond=110 )
Probabilistic random walk after 88050 steps, saw 34564 distinct states, run finished after 805 ms. (steps per millisecond=109 ) properties seen :2
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 43363 ms.
ITS solved all properties within timeout

BK_STOP 1716242543912

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML

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="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
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 r012-smll-171620123700013"
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 ;