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-171620123700023.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-02b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r012-smll-171620123700023
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K 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 53K 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.2K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 11 18:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 18:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 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 417K 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 1716242837062

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-02b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-20 22:07:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-20 22:07:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 22:07:19] [INFO ] Load time of PNML (sax parser for PT used): 358 ms
[2024-05-20 22:07:19] [INFO ] Transformed 1242 places.
[2024-05-20 22:07:19] [INFO ] Transformed 1621 transitions.
[2024-05-20 22:07:20] [INFO ] Found NUPN structural information;
[2024-05-20 22:07:20] [INFO ] Parsed PT model containing 1242 places and 1621 transitions and 5041 arcs in 644 ms.
Structural test allowed to assert that 146 places are NOT stable. Took 29 ms.
RANDOM walk for 40000 steps (171 resets) in 3831 ms. (10 steps per ms) remains 257/1096 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 22 ms. (17 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 257/257 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 257/257 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 257/257 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 257/257 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 22 ms. (17 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 257/257 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 257/257 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 257/257 properties
// Phase 1: matrix 1621 rows 1242 cols
[2024-05-20 22:07:22] [INFO ] Computed 121 invariants in 158 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 257/257 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/257 variables, 9/266 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 257/2863 variables, and 266 constraints, problems are : Problem set: 0 solved, 257 unsolved in 5092 ms.
Refiners :[Domain max(s): 257/1242 constraints, Positive P Invariants (semi-flows): 0/27 constraints, Generalized P Invariants (flows): 9/94 constraints, State Equation: 0/1242 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 257/257 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/257 variables, 9/266 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 93/350 variables, 11/277 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 93/370 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 257 unsolved
SMT process timed out in 10582ms, After SMT, problems are : Problem set: 0 solved, 257 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 257 out of 1242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1242/1242 places, 1621/1621 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 232 transitions
Trivial Post-agglo rules discarded 232 transitions
Performed 232 trivial Post agglomeration. Transition count delta: 232
Iterating post reduction 0 with 232 rules applied. Total rules applied 232 place count 1242 transition count 1389
Reduce places removed 232 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 246 rules applied. Total rules applied 478 place count 1010 transition count 1375
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 482 place count 1006 transition count 1375
Performed 221 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 221 Pre rules applied. Total rules applied 482 place count 1006 transition count 1154
Deduced a syphon composed of 221 places in 6 ms
Ensure Unique test removed 18 places
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 3 with 460 rules applied. Total rules applied 942 place count 767 transition count 1154
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 3 with 13 rules applied. Total rules applied 955 place count 766 transition count 1142
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 967 place count 754 transition count 1142
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 967 place count 754 transition count 1135
Deduced a syphon composed of 7 places in 7 ms
Ensure Unique test removed 7 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 21 rules applied. Total rules applied 988 place count 740 transition count 1135
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 988 place count 740 transition count 1128
Deduced a syphon composed of 7 places in 7 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 1002 place count 733 transition count 1128
Discarding 27 places :
Symmetric choice reduction at 5 with 27 rule applications. Total rules 1029 place count 706 transition count 1101
Iterating global reduction 5 with 27 rules applied. Total rules applied 1056 place count 706 transition count 1101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1057 place count 706 transition count 1100
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 1057 place count 706 transition count 1091
Deduced a syphon composed of 9 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 19 rules applied. Total rules applied 1076 place count 696 transition count 1091
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1076 place count 696 transition count 1090
Deduced a syphon composed of 1 places in 7 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 1079 place count 694 transition count 1090
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1081 place count 692 transition count 1075
Iterating global reduction 6 with 2 rules applied. Total rules applied 1083 place count 692 transition count 1075
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1083 place count 692 transition count 1074
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1085 place count 691 transition count 1074
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1086 place count 690 transition count 1066
Iterating global reduction 6 with 1 rules applied. Total rules applied 1087 place count 690 transition count 1066
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1088 place count 689 transition count 1058
Iterating global reduction 6 with 1 rules applied. Total rules applied 1089 place count 689 transition count 1058
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1090 place count 688 transition count 1050
Iterating global reduction 6 with 1 rules applied. Total rules applied 1091 place count 688 transition count 1050
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1092 place count 687 transition count 1042
Iterating global reduction 6 with 1 rules applied. Total rules applied 1093 place count 687 transition count 1042
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1094 place count 686 transition count 1034
Iterating global reduction 6 with 1 rules applied. Total rules applied 1095 place count 686 transition count 1034
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1096 place count 685 transition count 1026
Iterating global reduction 6 with 1 rules applied. Total rules applied 1097 place count 685 transition count 1026
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1098 place count 684 transition count 1018
Iterating global reduction 6 with 1 rules applied. Total rules applied 1099 place count 684 transition count 1018
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1100 place count 683 transition count 1010
Iterating global reduction 6 with 1 rules applied. Total rules applied 1101 place count 683 transition count 1010
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1102 place count 682 transition count 1002
Iterating global reduction 6 with 1 rules applied. Total rules applied 1103 place count 682 transition count 1002
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1104 place count 681 transition count 994
Iterating global reduction 6 with 1 rules applied. Total rules applied 1105 place count 681 transition count 994
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1106 place count 680 transition count 986
Iterating global reduction 6 with 1 rules applied. Total rules applied 1107 place count 680 transition count 986
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1108 place count 679 transition count 978
Iterating global reduction 6 with 1 rules applied. Total rules applied 1109 place count 679 transition count 978
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1110 place count 678 transition count 970
Iterating global reduction 6 with 1 rules applied. Total rules applied 1111 place count 678 transition count 970
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1112 place count 677 transition count 962
Iterating global reduction 6 with 1 rules applied. Total rules applied 1113 place count 677 transition count 962
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1114 place count 676 transition count 954
Iterating global reduction 6 with 1 rules applied. Total rules applied 1115 place count 676 transition count 954
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1116 place count 675 transition count 946
Iterating global reduction 6 with 1 rules applied. Total rules applied 1117 place count 675 transition count 946
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 6 with 112 rules applied. Total rules applied 1229 place count 619 transition count 890
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1231 place count 618 transition count 899
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 1234 place count 618 transition count 896
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1237 place count 615 transition count 896
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1238 place count 614 transition count 895
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 7 with 3 rules applied. Total rules applied 1241 place count 612 transition count 894
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1242 place count 611 transition count 894
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 3 Pre rules applied. Total rules applied 1242 place count 611 transition count 891
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 1248 place count 608 transition count 891
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 9 with 1 rules applied. Total rules applied 1249 place count 607 transition count 891
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 1253 place count 605 transition count 889
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1254 place count 604 transition count 888
Iterating global reduction 10 with 1 rules applied. Total rules applied 1255 place count 604 transition count 888
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1256 place count 604 transition count 887
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1257 place count 603 transition count 887
Applied a total of 1257 rules in 998 ms. Remains 603 /1242 variables (removed 639) and now considering 887/1621 (removed 734) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1016 ms. Remains : 603/1242 places, 887/1621 transitions.
RANDOM walk for 4000000 steps (68308 resets) in 72501 ms. (55 steps per ms) remains 190/257 properties
BEST_FIRST walk for 40003 steps (229 resets) in 313 ms. (127 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40003 steps (231 resets) in 251 ms. (158 steps per ms) remains 167/190 properties
BEST_FIRST walk for 40001 steps (242 resets) in 233 ms. (170 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40002 steps (235 resets) in 232 ms. (171 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40003 steps (226 resets) in 234 ms. (170 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40002 steps (227 resets) in 238 ms. (167 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (233 resets) in 228 ms. (174 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40003 steps (231 resets) in 233 ms. (170 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (238 resets) in 227 ms. (175 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40003 steps (239 resets) in 245 ms. (162 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40002 steps (246 resets) in 228 ms. (174 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (216 resets) in 240 ms. (165 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40002 steps (220 resets) in 237 ms. (168 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40002 steps (235 resets) in 242 ms. (164 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40003 steps (231 resets) in 228 ms. (174 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40003 steps (226 resets) in 224 ms. (177 steps per ms) remains 90/167 properties
BEST_FIRST walk for 40002 steps (230 resets) in 168 ms. (236 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40002 steps (228 resets) in 161 ms. (246 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40002 steps (237 resets) in 169 ms. (235 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40003 steps (230 resets) in 171 ms. (232 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40003 steps (227 resets) in 163 ms. (243 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40002 steps (217 resets) in 168 ms. (236 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40003 steps (224 resets) in 168 ms. (236 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40002 steps (205 resets) in 172 ms. (231 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40003 steps (223 resets) in 159 ms. (250 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40003 steps (241 resets) in 161 ms. (246 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40002 steps (238 resets) in 166 ms. (239 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40002 steps (241 resets) in 160 ms. (248 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40003 steps (254 resets) in 152 ms. (261 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40003 steps (225 resets) in 166 ms. (239 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40002 steps (226 resets) in 167 ms. (238 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40004 steps (241 resets) in 160 ms. (248 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40001 steps (234 resets) in 169 ms. (235 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40002 steps (251 resets) in 155 ms. (256 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40002 steps (236 resets) in 163 ms. (243 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40003 steps (229 resets) in 170 ms. (233 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40004 steps (232 resets) in 163 ms. (243 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40002 steps (229 resets) in 175 ms. (227 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40003 steps (237 resets) in 162 ms. (245 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40002 steps (240 resets) in 162 ms. (245 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40004 steps (209 resets) in 176 ms. (226 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40003 steps (233 resets) in 163 ms. (243 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40003 steps (231 resets) in 162 ms. (245 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40001 steps (220 resets) in 171 ms. (232 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40002 steps (237 resets) in 171 ms. (232 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40001 steps (215 resets) in 174 ms. (228 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40004 steps (240 resets) in 160 ms. (248 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40002 steps (214 resets) in 166 ms. (239 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40003 steps (233 resets) in 168 ms. (236 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40001 steps (233 resets) in 162 ms. (245 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40003 steps (244 resets) in 158 ms. (251 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40003 steps (224 resets) in 170 ms. (233 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40003 steps (213 resets) in 168 ms. (236 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40002 steps (218 resets) in 167 ms. (238 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40003 steps (235 resets) in 167 ms. (238 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40004 steps (245 resets) in 161 ms. (246 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40001 steps (231 resets) in 169 ms. (235 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40004 steps (230 resets) in 162 ms. (245 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40004 steps (240 resets) in 165 ms. (240 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40001 steps (229 resets) in 162 ms. (245 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40003 steps (227 resets) in 167 ms. (238 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40002 steps (234 resets) in 167 ms. (238 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40003 steps (222 resets) in 176 ms. (226 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40004 steps (225 resets) in 165 ms. (240 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40003 steps (235 resets) in 162 ms. (245 steps per ms) remains 90/90 properties
// Phase 1: matrix 887 rows 603 cols
[2024-05-20 22:07:55] [INFO ] Computed 90 invariants in 44 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 12/102 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 149/251 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 30/281 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 2/283 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (OVERLAPS) 130/413 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 13 (OVERLAPS) 6/419 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/419 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 15 (OVERLAPS) 82/501 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/501 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 17 (OVERLAPS) 48/549 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/549 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 19 (OVERLAPS) 52/601 variables, 21/88 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/601 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 21 (OVERLAPS) 1/602 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/602 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 23 (OVERLAPS) 1/603 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/603 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 25 (OVERLAPS) 887/1490 variables, 603/693 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1490 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 27 (OVERLAPS) 0/1490 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1490/1490 variables, and 693 constraints, problems are : Problem set: 0 solved, 90 unsolved in 19039 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 603/603 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 12/102 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 149/251 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 30/281 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-20 22:08:15] [INFO ] Deduced a trap composed of 72 places in 172 ms of which 26 ms to minimize.
[2024-05-20 22:08:15] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 4 ms to minimize.
[2024-05-20 22:08:16] [INFO ] Deduced a trap composed of 85 places in 146 ms of which 3 ms to minimize.
[2024-05-20 22:08:16] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 3 ms to minimize.
[2024-05-20 22:08:16] [INFO ] Deduced a trap composed of 96 places in 125 ms of which 3 ms to minimize.
[2024-05-20 22:08:16] [INFO ] Deduced a trap composed of 79 places in 135 ms of which 3 ms to minimize.
[2024-05-20 22:08:17] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (OVERLAPS) 2/283 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-20 22:08:18] [INFO ] Deduced a trap composed of 47 places in 137 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 13 (OVERLAPS) 130/413 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 15 (OVERLAPS) 6/419 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/419 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 17 (OVERLAPS) 82/501 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/501 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 19 (OVERLAPS) 48/549 variables, 5/75 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/549 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 21 (OVERLAPS) 52/601 variables, 21/96 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/601 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 23 (OVERLAPS) 1/602 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/602 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 25 (OVERLAPS) 1/603 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/603 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 27 (OVERLAPS) 887/1490 variables, 603/701 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1490 variables, 90/791 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-20 22:08:33] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 3 ms to minimize.
[2024-05-20 22:08:35] [INFO ] Deduced a trap composed of 57 places in 181 ms of which 3 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1490 variables, 2/793 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1490 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 31 (OVERLAPS) 0/1490 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1490/1490 variables, and 793 constraints, problems are : Problem set: 0 solved, 90 unsolved in 41394 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 603/603 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 10/10 constraints]
After SMT, in 60519ms problems are : Problem set: 0 solved, 90 unsolved
Fused 90 Parikh solutions to 85 different solutions.
Parikh walk visited 12 properties in 30138 ms.
Support contains 78 out of 603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 603/603 places, 887/887 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 603 transition count 855
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 571 transition count 855
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 64 place count 571 transition count 811
Deduced a syphon composed of 44 places in 2 ms
Ensure Unique test removed 3 places
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 91 rules applied. Total rules applied 155 place count 524 transition count 811
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 2 with 3 rules applied. Total rules applied 158 place count 524 transition count 808
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 161 place count 521 transition count 808
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 163 place count 519 transition count 806
Iterating global reduction 4 with 2 rules applied. Total rules applied 165 place count 519 transition count 806
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 31 rules applied. Total rules applied 196 place count 503 transition count 791
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 196 place count 503 transition count 790
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 198 place count 502 transition count 790
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 199 place count 501 transition count 784
Iterating global reduction 4 with 1 rules applied. Total rules applied 200 place count 501 transition count 784
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 201 place count 500 transition count 784
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 5 with 4 rules applied. Total rules applied 205 place count 498 transition count 782
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 206 place count 497 transition count 781
Iterating global reduction 5 with 1 rules applied. Total rules applied 207 place count 497 transition count 781
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 209 place count 497 transition count 779
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 211 place count 495 transition count 779
Applied a total of 211 rules in 135 ms. Remains 495 /603 variables (removed 108) and now considering 779/887 (removed 108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 495/603 places, 779/887 transitions.
RANDOM walk for 4000000 steps (64913 resets) in 39815 ms. (100 steps per ms) remains 71/78 properties
BEST_FIRST walk for 400003 steps (2212 resets) in 2006 ms. (199 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2230 resets) in 1966 ms. (203 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2180 resets) in 1998 ms. (200 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400001 steps (2224 resets) in 2394 ms. (167 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400001 steps (2241 resets) in 2073 ms. (192 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2215 resets) in 2076 ms. (192 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400001 steps (2207 resets) in 1973 ms. (202 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2243 resets) in 2094 ms. (190 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2250 resets) in 1850 ms. (216 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2236 resets) in 1943 ms. (205 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2213 resets) in 2045 ms. (195 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2231 resets) in 1946 ms. (205 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2206 resets) in 1840 ms. (217 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2223 resets) in 2049 ms. (195 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400000 steps (2208 resets) in 1801 ms. (221 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2233 resets) in 1909 ms. (209 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2217 resets) in 2057 ms. (194 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2220 resets) in 2062 ms. (193 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2199 resets) in 2169 ms. (184 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2261 resets) in 1934 ms. (206 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2212 resets) in 1887 ms. (211 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2206 resets) in 2219 ms. (180 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2201 resets) in 1920 ms. (208 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2219 resets) in 2012 ms. (198 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2194 resets) in 1887 ms. (211 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2254 resets) in 2158 ms. (185 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2240 resets) in 1770 ms. (225 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400001 steps (2245 resets) in 1832 ms. (218 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2250 resets) in 1658 ms. (241 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2200 resets) in 1992 ms. (200 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2243 resets) in 2384 ms. (167 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2249 resets) in 1995 ms. (200 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2195 resets) in 1840 ms. (217 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400001 steps (2265 resets) in 2193 ms. (182 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400001 steps (2238 resets) in 1828 ms. (218 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2217 resets) in 1832 ms. (218 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2208 resets) in 1900 ms. (210 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2192 resets) in 2005 ms. (199 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2213 resets) in 2214 ms. (180 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2237 resets) in 2032 ms. (196 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2255 resets) in 1881 ms. (212 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2211 resets) in 2217 ms. (180 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2191 resets) in 2235 ms. (178 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2221 resets) in 1893 ms. (211 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2244 resets) in 2033 ms. (196 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2266 resets) in 2117 ms. (188 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2196 resets) in 2818 ms. (141 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2251 resets) in 2152 ms. (185 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2225 resets) in 1813 ms. (220 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2209 resets) in 2482 ms. (161 steps per ms) remains 71/71 properties
Interrupted probabilistic random walk after 14152544 steps, run timeout after 150001 ms. (steps per millisecond=94 ) properties seen :69 out of 71
Probabilistic random walk after 14152544 steps, saw 3080337 distinct states, run finished after 150010 ms. (steps per millisecond=94 ) properties seen :69
// Phase 1: matrix 779 rows 495 cols
[2024-05-20 22:12:46] [INFO ] Computed 85 invariants in 39 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) 10/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 46/58 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/96 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/97 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 113/210 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 45/255 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/255 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/257 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/257 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 123/380 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/380 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 46/426 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/426 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 67/493 variables, 23/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/493 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/494 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/494 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 1/495 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/495 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 779/1274 variables, 495/580 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1274 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/1274 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1274/1274 variables, and 580 constraints, problems are : Problem set: 0 solved, 2 unsolved in 803 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 495/495 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) 10/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 46/58 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/96 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/97 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 113/210 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 45/255 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/255 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/257 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/257 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 123/380 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/380 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 46/426 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/426 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 67/493 variables, 23/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/493 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/494 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/494 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 1/495 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/495 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 779/1274 variables, 495/580 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1274 variables, 2/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1274 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/1274 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1274/1274 variables, and 582 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1131 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1987ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 763 ms.
Support contains 2 out of 495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 779/779 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 495 transition count 761
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 477 transition count 761
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 36 place count 477 transition count 743
Deduced a syphon composed of 18 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 74 place count 457 transition count 743
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 2 with 2 rules applied. Total rules applied 76 place count 456 transition count 742
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 77 place count 455 transition count 742
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 77 place count 455 transition count 741
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 80 place count 453 transition count 741
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 80 place count 453 transition count 740
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 82 place count 452 transition count 740
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 19 rules applied. Total rules applied 101 place count 442 transition count 731
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 101 place count 442 transition count 729
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 106 place count 439 transition count 729
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 108 place count 437 transition count 729
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 108 place count 437 transition count 728
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 110 place count 436 transition count 728
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 111 place count 435 transition count 727
Ensure Unique test removed 1 places
Iterating global reduction 5 with 2 rules applied. Total rules applied 113 place count 434 transition count 727
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 121 place count 430 transition count 723
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 122 place count 429 transition count 722
Iterating global reduction 5 with 1 rules applied. Total rules applied 123 place count 429 transition count 722
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 124 place count 428 transition count 721
Iterating global reduction 5 with 1 rules applied. Total rules applied 125 place count 428 transition count 721
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 126 place count 428 transition count 720
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 127 place count 428 transition count 719
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 129 place count 427 transition count 718
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 130 place count 427 transition count 717
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 131 place count 426 transition count 717
Applied a total of 131 rules in 130 ms. Remains 426 /495 variables (removed 69) and now considering 717/779 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 426/495 places, 717/779 transitions.
RANDOM walk for 4000000 steps (64849 resets) in 18538 ms. (215 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000004 steps (22075 resets) in 8755 ms. (456 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000004 steps (22129 resets) in 8001 ms. (499 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 4059003 steps, run timeout after 33001 ms. (steps per millisecond=122 ) properties seen :0 out of 2
Probabilistic random walk after 4059003 steps, saw 1099767 distinct states, run finished after 33001 ms. (steps per millisecond=122 ) properties seen :0
// Phase 1: matrix 717 rows 426 cols
[2024-05-20 22:13:33] [INFO ] Computed 76 invariants in 28 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) 32/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/57 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/59 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 86/145 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 41/186 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/188 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 123/311 variables, 14/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/311 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 46/357 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/357 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 67/424 variables, 23/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/424 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/425 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/425 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/426 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/426 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 717/1143 variables, 426/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1143 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/1143 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1143/1143 variables, and 502 constraints, problems are : Problem set: 0 solved, 2 unsolved in 538 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 57/57 constraints, State Equation: 426/426 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) 32/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/57 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/59 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 86/145 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 41/186 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/188 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 123/311 variables, 14/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/311 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 46/357 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/357 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 67/424 variables, 23/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/424 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/425 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/425 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/426 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/426 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 717/1143 variables, 426/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1143 variables, 2/504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1143 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/1143 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1143/1143 variables, and 504 constraints, problems are : Problem set: 0 solved, 2 unsolved in 670 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 57/57 constraints, State Equation: 426/426 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1247ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1144 ms.
Support contains 2 out of 426 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 717/717 transitions.
Applied a total of 0 rules in 22 ms. Remains 426 /426 variables (removed 0) and now considering 717/717 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 426/426 places, 717/717 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 717/717 transitions.
Applied a total of 0 rules in 13 ms. Remains 426 /426 variables (removed 0) and now considering 717/717 (removed 0) transitions.
[2024-05-20 22:13:35] [INFO ] Invariant cache hit.
[2024-05-20 22:13:36] [INFO ] Implicit Places using invariants in 557 ms returned [0, 18, 19, 31, 49, 67, 86, 136, 145, 146, 148, 165, 183, 252, 256, 257, 260, 271, 272, 273, 291, 293, 297, 315, 316, 317, 318, 330, 336, 342, 348, 354, 360, 366, 372, 378, 384, 390]
[2024-05-20 22:13:36] [INFO ] Actually due to overlaps returned [291, 273, 49, 165, 297, 148, 31, 145, 271, 315, 146, 272, 293, 316, 0, 19, 256, 257, 183, 317, 360, 378, 390, 18, 67, 86, 260, 318, 330, 336, 342, 348, 354, 366, 372, 384]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 569 ms to find 36 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 390/426 places, 717/717 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 389 transition count 656
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 125 place count 328 transition count 654
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 125 place count 328 transition count 639
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 31 rules applied. Total rules applied 156 place count 312 transition count 639
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) 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 168 place count 308 transition count 631
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 176 place count 300 transition count 631
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 191 place count 285 transition count 616
Iterating global reduction 4 with 15 rules applied. Total rules applied 206 place count 285 transition count 616
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 209 place count 285 transition count 613
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 209 place count 285 transition count 612
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 211 place count 284 transition count 612
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 214 place count 281 transition count 606
Iterating global reduction 5 with 3 rules applied. Total rules applied 217 place count 281 transition count 606
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 218 place count 280 transition count 605
Iterating global reduction 5 with 1 rules applied. Total rules applied 219 place count 280 transition count 605
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 220 place count 279 transition count 603
Iterating global reduction 5 with 1 rules applied. Total rules applied 221 place count 279 transition count 603
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 265 place count 257 transition count 581
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 266 place count 256 transition count 580
Iterating global reduction 5 with 1 rules applied. Total rules applied 267 place count 256 transition count 580
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 268 place count 256 transition count 579
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 272 place count 254 transition count 580
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 277 place count 254 transition count 575
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 283 place count 248 transition count 575
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 289 place count 248 transition count 575
Applied a total of 289 rules in 113 ms. Remains 248 /390 variables (removed 142) and now considering 575/717 (removed 142) transitions.
// Phase 1: matrix 575 rows 248 cols
[2024-05-20 22:13:36] [INFO ] Computed 33 invariants in 5 ms
[2024-05-20 22:13:36] [INFO ] Implicit Places using invariants in 300 ms returned [88, 94, 97, 99, 100, 103, 104, 156, 173, 179, 182, 184]
[2024-05-20 22:13:36] [INFO ] Actually due to overlaps returned [103, 104, 88, 94, 99, 173, 179, 184, 100, 156]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 303 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 238/426 places, 575/717 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 230 transition count 567
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 230 transition count 567
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 228 transition count 565
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 228 transition count 565
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 225 transition count 562
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 225 transition count 556
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 38 place count 219 transition count 556
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 219 transition count 555
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 218 transition count 555
Applied a total of 40 rules in 59 ms. Remains 218 /238 variables (removed 20) and now considering 555/575 (removed 20) transitions.
// Phase 1: matrix 555 rows 218 cols
[2024-05-20 22:13:37] [INFO ] Computed 23 invariants in 5 ms
[2024-05-20 22:13:37] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-20 22:13:37] [INFO ] Invariant cache hit.
[2024-05-20 22:13:37] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 815 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 218/426 places, 555/717 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1873 ms. Remains : 218/426 places, 555/717 transitions.
RANDOM walk for 4000000 steps (100878 resets) in 16957 ms. (235 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000003 steps (38521 resets) in 7808 ms. (512 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000003 steps (38545 resets) in 8472 ms. (472 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 35670 steps, run visited all 2 properties in 302 ms. (steps per millisecond=118 )
Probabilistic random walk after 35670 steps, saw 21125 distinct states, run finished after 310 ms. (steps per millisecond=115 ) properties seen :2
Able to resolve query StableMarking after proving 1097 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 392930 ms.
ITS solved all properties within timeout

BK_STOP 1716243232309

--------------------
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-02b"
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-02b, 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-171620123700023"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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