About the Execution of ITS-Tools for ASLink-PT-02b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 281190.00 | 0.00 | 0.00 | F | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r007-tall-174853737100193.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
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 r007-tall-174853737100193
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 800K
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 417K May 29 14:32 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 1748541572819
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ASLink-PT-02b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202505121319
[2025-05-29 17:59:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2025-05-29 17:59:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 17:59:34] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2025-05-29 17:59:34] [INFO ] Transformed 1242 places.
[2025-05-29 17:59:34] [INFO ] Transformed 1621 transitions.
[2025-05-29 17:59:34] [INFO ] Found NUPN structural information;
[2025-05-29 17:59:34] [INFO ] Parsed PT model containing 1242 places and 1621 transitions and 5041 arcs in 235 ms.
Structural test allowed to assert that 146 places are NOT stable. Took 21 ms.
[2025-05-29 17:59:35] [INFO ] Flatten gal took : 317 ms
RANDOM walk for 40000 steps (169 resets) in 2673 ms. (14 steps per ms) remains 199/1096 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 199/199 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 199/199 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 199/199 properties
BEST_FIRST walk for 403 steps (8 resets) in 18 ms. (21 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 199/199 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 199/199 properties
BEST_FIRST walk for 403 steps (8 resets) in 18 ms. (21 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 199/199 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 199/199 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 199/199 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 199/199 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 199/199 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 199/199 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 199/199 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 22 ms. (17 steps per ms) remains 199/199 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 199/199 properties
[2025-05-29 17:59:35] [INFO ] Flatten gal took : 125 ms
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 199/199 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 199/199 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 199/199 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 199/199 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 199/199 properties
BEST_FIRST walk for 402 steps (8 resets) in 5 ms. (67 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 199/199 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 199/199 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 199/199 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 199/199 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 199/199 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 199/199 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 199/199 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 199/199 properties
[2025-05-29 17:59:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12335175415622356040.gal : 68 ms
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 199/199 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 199/199 properties
[2025-05-29 17:59:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3117343408819549264.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12335175415622356040.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3117343408819549264.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
// Phase 1: matrix 1621 rows 1242 cols
[2025-05-29 17:59:35] [INFO ] Computed 121 invariants in 94 ms
Loading property file /tmp/ReachabilityCardinality3117343408819549264.prop.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,199 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,199 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,199 properties remain. new max is 16
SDD size :8 after 14
SDD proceeding with computation,199 properties remain. new max is 32
SDD size :14 after 47
SDD proceeding with computation,199 properties remain. new max is 64
SDD size :47 after 194
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 199 unsolved
SDD proceeding with computation,199 properties remain. new max is 128
SDD size :194 after 321
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 6/205 constraints. Problems are: Problem set: 0 solved, 199 unsolved
SDD proceeding with computation,199 properties remain. new max is 256
SDD size :321 after 964
SDD proceeding with computation,199 properties remain. new max is 512
SDD size :964 after 14485
SDD proceeding with computation,199 properties remain. new max is 1024
SDD size :14485 after 399017
SDD proceeding with computation,199 properties remain. new max is 2048
SDD size :399017 after 1.00084e+07
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (OVERLAPS) 66/265 variables, 8/213 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 66/279 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (OVERLAPS) 218/483 variables, 19/299 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 218/517 constraints. Problems are: Problem set: 0 solved, 199 unsolved
SDD proceeding with computation,199 properties remain. new max is 4096
SDD size :1.00084e+07 after 6.03131e+09
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/2863 variables, and 517 constraints, problems are : Problem set: 0 solved, 199 unsolved in 5040 ms.
Refiners :[Domain max(s): 483/1242 constraints, Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 7/94 constraints, State Equation: 0/1242 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 6/205 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (OVERLAPS) 66/265 variables, 8/213 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 66/279 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (OVERLAPS) 218/483 variables, 19/299 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 218/517 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/2863 variables, and 517 constraints, problems are : Problem set: 0 solved, 199 unsolved in 5017 ms.
Refiners :[Domain max(s): 483/1242 constraints, Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 7/94 constraints, State Equation: 0/1242 constraints, PredecessorRefiner: 0/199 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10305ms problems are : Problem set: 0 solved, 199 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 199 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 242 transitions
Trivial Post-agglo rules discarded 242 transitions
Performed 242 trivial Post agglomeration. Transition count delta: 242
Iterating post reduction 0 with 242 rules applied. Total rules applied 242 place count 1242 transition count 1379
Reduce places removed 242 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 256 rules applied. Total rules applied 498 place count 1000 transition count 1365
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 502 place count 996 transition count 1365
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 234 Pre rules applied. Total rules applied 502 place count 996 transition count 1131
Deduced a syphon composed of 234 places in 3 ms
Ensure Unique test removed 20 places
Reduce places removed 254 places and 0 transitions.
Iterating global reduction 3 with 488 rules applied. Total rules applied 990 place count 742 transition count 1131
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 3 with 15 rules applied. Total rules applied 1005 place count 741 transition count 1117
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 1019 place count 727 transition count 1117
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 1019 place count 727 transition count 1110
Deduced a syphon composed of 7 places in 15 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 1040 place count 713 transition count 1110
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 1040 place count 713 transition count 1103
Deduced a syphon composed of 7 places in 15 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 1054 place count 706 transition count 1103
Discarding 31 places :
Symmetric choice reduction at 5 with 31 rule applications. Total rules 1085 place count 675 transition count 1072
Iterating global reduction 5 with 31 rules applied. Total rules applied 1116 place count 675 transition count 1072
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1117 place count 675 transition count 1071
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 1117 place count 675 transition count 1060
Deduced a syphon composed of 11 places in 14 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 23 rules applied. Total rules applied 1140 place count 663 transition count 1060
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1140 place count 663 transition count 1059
Deduced a syphon composed of 1 places in 15 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 1143 place count 661 transition count 1059
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1146 place count 658 transition count 1038
Iterating global reduction 6 with 3 rules applied. Total rules applied 1149 place count 658 transition count 1038
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1149 place count 658 transition count 1037
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1151 place count 657 transition count 1037
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1152 place count 656 transition count 1029
Iterating global reduction 6 with 1 rules applied. Total rules applied 1153 place count 656 transition count 1029
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1154 place count 655 transition count 1021
Iterating global reduction 6 with 1 rules applied. Total rules applied 1155 place count 655 transition count 1021
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1156 place count 654 transition count 1013
Iterating global reduction 6 with 1 rules applied. Total rules applied 1157 place count 654 transition count 1013
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1158 place count 653 transition count 1005
Iterating global reduction 6 with 1 rules applied. Total rules applied 1159 place count 653 transition count 1005
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1160 place count 652 transition count 997
Iterating global reduction 6 with 1 rules applied. Total rules applied 1161 place count 652 transition count 997
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1162 place count 651 transition count 989
Iterating global reduction 6 with 1 rules applied. Total rules applied 1163 place count 651 transition count 989
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1164 place count 650 transition count 981
Iterating global reduction 6 with 1 rules applied. Total rules applied 1165 place count 650 transition count 981
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1166 place count 649 transition count 973
Iterating global reduction 6 with 1 rules applied. Total rules applied 1167 place count 649 transition count 973
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1168 place count 648 transition count 965
Iterating global reduction 6 with 1 rules applied. Total rules applied 1169 place count 648 transition count 965
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1170 place count 647 transition count 957
Iterating global reduction 6 with 1 rules applied. Total rules applied 1171 place count 647 transition count 957
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1172 place count 646 transition count 949
Iterating global reduction 6 with 1 rules applied. Total rules applied 1173 place count 646 transition count 949
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1174 place count 645 transition count 941
Iterating global reduction 6 with 1 rules applied. Total rules applied 1175 place count 645 transition count 941
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1176 place count 644 transition count 933
Iterating global reduction 6 with 1 rules applied. Total rules applied 1177 place count 644 transition count 933
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1178 place count 643 transition count 925
Iterating global reduction 6 with 1 rules applied. Total rules applied 1179 place count 643 transition count 925
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1180 place count 642 transition count 917
Iterating global reduction 6 with 1 rules applied. Total rules applied 1181 place count 642 transition count 917
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1182 place count 641 transition count 909
Iterating global reduction 6 with 1 rules applied. Total rules applied 1183 place count 641 transition count 909
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 6 with 114 rules applied. Total rules applied 1297 place count 584 transition count 852
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 6 with 2 rules applied. Total rules applied 1299 place count 583 transition count 861
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 1304 place count 583 transition count 856
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1309 place count 578 transition count 856
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1310 place count 577 transition count 855
Reduce places removed 3 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 4 rules applied. Total rules applied 1314 place count 574 transition count 854
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1315 place count 573 transition count 854
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 4 Pre rules applied. Total rules applied 1315 place count 573 transition count 850
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 1323 place count 569 transition count 850
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 9 with 2 rules applied. Total rules applied 1325 place count 567 transition count 850
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 10 with 6 rules applied. Total rules applied 1331 place count 564 transition count 847
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1333 place count 562 transition count 845
Iterating global reduction 10 with 2 rules applied. Total rules applied 1335 place count 562 transition count 845
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1337 place count 562 transition count 843
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1339 place count 560 transition count 843
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1340 place count 560 transition count 843
Applied a total of 1340 rules in 759 ms. Remains 560 /1242 variables (removed 682) and now considering 843/1621 (removed 778) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 770 ms. Remains : 560/1242 places, 843/1621 transitions.
SDD proceeding with computation,199 properties remain. new max is 8192
SDD size :6.03131e+09 after 7.20811e+13
SDD proceeding with computation,199 properties remain. new max is 16384
SDD size :7.20811e+13 after 7.24711e+13
RANDOM walk for 4000000 steps (64378 resets) in 49106 ms. (81 steps per ms) remains 66/199 properties
SDD proceeding with computation,199 properties remain. new max is 32768
SDD size :7.24711e+13 after 7.27837e+13
BEST_FIRST walk for 400002 steps (2209 resets) in 1385 ms. (288 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2208 resets) in 1338 ms. (298 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2232 resets) in 1446 ms. (276 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2240 resets) in 1372 ms. (291 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2208 resets) in 1529 ms. (261 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2221 resets) in 1338 ms. (298 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2236 resets) in 1527 ms. (261 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2203 resets) in 1372 ms. (291 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2217 resets) in 1427 ms. (280 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2158 resets) in 1625 ms. (246 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2216 resets) in 1336 ms. (299 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2217 resets) in 1293 ms. (309 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2242 resets) in 1358 ms. (294 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2196 resets) in 1399 ms. (285 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2204 resets) in 1476 ms. (270 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2259 resets) in 1360 ms. (293 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2227 resets) in 1384 ms. (288 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2232 resets) in 1238 ms. (322 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2191 resets) in 1228 ms. (325 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2222 resets) in 1385 ms. (288 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2198 resets) in 1284 ms. (311 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2183 resets) in 1453 ms. (275 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2196 resets) in 1358 ms. (294 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2181 resets) in 1282 ms. (311 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2206 resets) in 1329 ms. (300 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2214 resets) in 1407 ms. (284 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2215 resets) in 1315 ms. (303 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2243 resets) in 1312 ms. (304 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2206 resets) in 1221 ms. (327 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2235 resets) in 1472 ms. (271 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2251 resets) in 1434 ms. (278 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2218 resets) in 1362 ms. (293 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400000 steps (2198 resets) in 1503 ms. (265 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2206 resets) in 1371 ms. (291 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2225 resets) in 1323 ms. (302 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2218 resets) in 1315 ms. (303 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2238 resets) in 1505 ms. (265 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2219 resets) in 1396 ms. (286 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2212 resets) in 1266 ms. (315 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2195 resets) in 1318 ms. (303 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2205 resets) in 1383 ms. (289 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2230 resets) in 1364 ms. (293 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2203 resets) in 1455 ms. (274 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2179 resets) in 1357 ms. (294 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2209 resets) in 1271 ms. (314 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2201 resets) in 1266 ms. (315 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2220 resets) in 1358 ms. (294 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2238 resets) in 1343 ms. (297 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2194 resets) in 1375 ms. (290 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2256 resets) in 1297 ms. (308 steps per ms) remains 66/66 properties
// Phase 1: matrix 843 rows 560 cols
[2025-05-29 18:00:25] [INFO ] Computed 86 invariants in 28 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 48/114 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 3/117 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 141/258 variables, 19/31 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 26/284 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 11 (OVERLAPS) 2/286 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/286 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 13 (OVERLAPS) 101/387 variables, 12/49 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/387 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 15 (OVERLAPS) 83/470 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 66 unsolved
SDD proceeding with computation,199 properties remain. new max is 65536
At refinement iteration 16 (INCLUDED_ONLY) 0/470 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 66 unsolved
SDD size :7.27837e+13 after 8.14381e+13
At refinement iteration 17 (OVERLAPS) 9/479 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/479 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 19 (OVERLAPS) 79/558 variables, 26/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/558 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 21 (OVERLAPS) 1/559 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/559 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 23 (OVERLAPS) 1/560 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/560 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 25 (OVERLAPS) 843/1403 variables, 560/646 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1403 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 27 (OVERLAPS) 0/1403 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1403/1403 variables, and 646 constraints, problems are : Problem set: 0 solved, 66 unsolved in 7967 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 560/560 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 48/114 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 3/117 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 141/258 variables, 19/31 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:00:34] [INFO ] Deduced a trap composed of 67 places in 133 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:00:34] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:00:34] [INFO ] Deduced a trap composed of 73 places in 106 ms of which 25 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 26/284 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/284 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 12 (OVERLAPS) 2/286 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/286 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 14 (OVERLAPS) 101/387 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/387 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 16 (OVERLAPS) 83/470 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:00:38] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 12 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/470 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/470 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 19 (OVERLAPS) 9/479 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/479 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 21 (OVERLAPS) 79/558 variables, 26/88 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/558 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 23 (OVERLAPS) 1/559 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/559 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 25 (OVERLAPS) 1/560 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/560 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 27 (OVERLAPS) 843/1403 variables, 560/650 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1403 variables, 66/716 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:00:47] [INFO ] Deduced a trap composed of 75 places in 252 ms of which 57 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1403 variables, 1/717 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:00:51] [INFO ] Deduced a trap composed of 68 places in 161 ms of which 37 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/1403 variables, 1/718 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1403 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:00:57] [INFO ] Deduced a trap composed of 75 places in 252 ms of which 62 ms to minimize.
At refinement iteration 32 (OVERLAPS) 0/1403 variables, 1/719 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1403 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 66 unsolved
SDD proceeding with computation,199 properties remain. new max is 131072
SDD size :8.14381e+13 after 9.19489e+13
At refinement iteration 34 (OVERLAPS) 0/1403 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1403/1403 variables, and 719 constraints, problems are : Problem set: 0 solved, 66 unsolved in 39259 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 560/560 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47287ms problems are : Problem set: 0 solved, 66 unsolved
Fused 66 Parikh solutions to 59 different solutions.
Parikh walk visited 0 properties in 17632 ms.
Support contains 66 out of 560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 843/843 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 560 transition count 817
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 534 transition count 817
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 52 place count 534 transition count 784
Deduced a syphon composed of 33 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 67 rules applied. Total rules applied 119 place count 500 transition count 784
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 1 rules applied. Total rules applied 120 place count 500 transition count 783
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 121 place count 499 transition count 783
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 141 place count 489 transition count 773
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 142 place count 488 transition count 772
Ensure Unique test removed 1 places
Iterating global reduction 4 with 2 rules applied. Total rules applied 144 place count 487 transition count 772
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 145 place count 486 transition count 771
Iterating global reduction 4 with 1 rules applied. Total rules applied 146 place count 486 transition count 771
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 4 with 2 rules applied. Total rules applied 148 place count 486 transition count 769
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 149 place count 485 transition count 769
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 150 place count 485 transition count 768
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 151 place count 484 transition count 768
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 152 place count 484 transition count 768
Applied a total of 152 rules in 107 ms. Remains 484 /560 variables (removed 76) and now considering 768/843 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 484/560 places, 768/843 transitions.
RANDOM walk for 4000000 steps (65021 resets) in 33671 ms. (118 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2224 resets) in 1608 ms. (248 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2173 resets) in 1323 ms. (302 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400000 steps (2228 resets) in 1338 ms. (298 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2238 resets) in 1450 ms. (275 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2223 resets) in 1347 ms. (296 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2240 resets) in 1231 ms. (324 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2230 resets) in 1276 ms. (313 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2231 resets) in 1633 ms. (244 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2252 resets) in 1387 ms. (288 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2195 resets) in 1447 ms. (276 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2274 resets) in 1334 ms. (299 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2203 resets) in 1524 ms. (262 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2222 resets) in 1601 ms. (249 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2221 resets) in 1388 ms. (287 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2188 resets) in 1406 ms. (284 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2208 resets) in 1432 ms. (279 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2233 resets) in 1274 ms. (313 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2202 resets) in 1289 ms. (310 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2240 resets) in 1237 ms. (323 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2205 resets) in 1344 ms. (297 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2204 resets) in 1241 ms. (322 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2196 resets) in 1193 ms. (335 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2217 resets) in 1131 ms. (353 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2206 resets) in 1373 ms. (291 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2246 resets) in 1296 ms. (308 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2257 resets) in 1361 ms. (293 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2202 resets) in 1304 ms. (306 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2201 resets) in 1373 ms. (291 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2208 resets) in 1298 ms. (307 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2222 resets) in 1140 ms. (350 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2224 resets) in 1205 ms. (331 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2221 resets) in 1293 ms. (309 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2215 resets) in 1413 ms. (282 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2192 resets) in 1354 ms. (295 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2231 resets) in 1440 ms. (277 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2247 resets) in 1551 ms. (257 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2256 resets) in 1446 ms. (276 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2233 resets) in 1277 ms. (312 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2170 resets) in 1350 ms. (296 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2248 resets) in 1499 ms. (266 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2202 resets) in 1295 ms. (308 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2214 resets) in 1512 ms. (264 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2258 resets) in 1261 ms. (316 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2231 resets) in 1215 ms. (328 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2228 resets) in 1543 ms. (259 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2236 resets) in 1282 ms. (311 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2207 resets) in 1383 ms. (289 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2281 resets) in 1527 ms. (261 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2198 resets) in 1340 ms. (298 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2214 resets) in 1317 ms. (303 steps per ms) remains 66/66 properties
SDD proceeding with computation,199 properties remain. new max is 262144
SDD size :9.19489e+13 after 1.19753e+14
Interrupted probabilistic random walk after 17298572 steps, run timeout after 96001 ms. (steps per millisecond=180 ) properties seen :64 out of 66
Probabilistic random walk after 17298572 steps, saw 3815104 distinct states, run finished after 96009 ms. (steps per millisecond=180 ) properties seen :64
// Phase 1: matrix 768 rows 484 cols
[2025-05-29 18:03:39] [INFO ] Computed 84 invariants in 9 ms
Starting Z3 with timeout 75.0 s and query timeout 7500.0 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) 7/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 43/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 33/85 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/86 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 113/199 variables, 21/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 45/244 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/246 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 113/359 variables, 14/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/359 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 53/412 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/412 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/414 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/414 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 68/482 variables, 23/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/482 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 1/483 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/483 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 1/484 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/484 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 768/1252 variables, 484/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1252 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/1252 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1252/1252 variables, and 568 constraints, problems are : Problem set: 0 solved, 2 unsolved in 450 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 484/484 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
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) 7/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 43/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 33/85 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/86 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 113/199 variables, 21/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 45/244 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/246 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 113/359 variables, 14/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/359 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 53/412 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/412 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/414 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/414 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 68/482 variables, 23/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/482 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 1/483 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/483 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 1/484 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/484 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 768/1252 variables, 484/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1252 variables, 2/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1252 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/1252 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1252/1252 variables, and 570 constraints, problems are : Problem set: 0 solved, 2 unsolved in 777 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 484/484 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1249ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 328 ms.
Support contains 2 out of 484 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 484/484 places, 768/768 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 484 transition count 754
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 470 transition count 754
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 28 place count 470 transition count 738
Deduced a syphon composed of 16 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 62 place count 452 transition count 738
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 64 place count 451 transition count 737
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 65 place count 450 transition count 737
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 65 place count 450 transition count 736
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 68 place count 448 transition count 736
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 68 place count 448 transition count 735
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 70 place count 447 transition count 735
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 87 place count 438 transition count 727
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 87 place count 438 transition count 724
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 7 rules applied. Total rules applied 94 place count 434 transition count 724
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 95 place count 433 transition count 724
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 95 place count 433 transition count 723
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 97 place count 432 transition count 723
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 99 place count 431 transition count 722
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 100 place count 431 transition count 721
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 101 place count 430 transition count 721
Applied a total of 101 rules in 84 ms. Remains 430 /484 variables (removed 54) and now considering 721/768 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 430/484 places, 721/768 transitions.
RANDOM walk for 4000000 steps (64858 resets) in 11557 ms. (346 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000002 steps (22156 resets) in 4548 ms. (879 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000003 steps (22086 resets) in 4543 ms. (880 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 3643801 steps, run timeout after 18001 ms. (steps per millisecond=202 ) properties seen :0 out of 2
Probabilistic random walk after 3643801 steps, saw 997652 distinct states, run finished after 18001 ms. (steps per millisecond=202 ) properties seen :0
// Phase 1: matrix 721 rows 430 cols
[2025-05-29 18:04:05] [INFO ] Computed 77 invariants in 14 ms
Starting Z3 with timeout 90.0 s and query timeout 9000.0 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) 33/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/60 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/61 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 88/149 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 41/190 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/192 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 123/315 variables, 14/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/315 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 46/361 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/361 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 67/428 variables, 23/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/428 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/429 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/429 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/430 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/430 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 721/1151 variables, 430/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1151 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/1151 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1151/1151 variables, and 507 constraints, problems are : Problem set: 0 solved, 2 unsolved in 425 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 59/59 constraints, State Equation: 430/430 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
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) 33/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/60 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/61 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 88/149 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 41/190 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/192 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 123/315 variables, 14/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/315 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 46/361 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/361 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 67/428 variables, 23/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:04:06] [INFO ] Deduced a trap composed of 155 places in 233 ms of which 71 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/428 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/428 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/429 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/429 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1/430 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/430 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 721/1151 variables, 430/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1151 variables, 2/510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1151 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/1151 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1151/1151 variables, and 510 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1036 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 59/59 constraints, State Equation: 430/430 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1484ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 342 ms.
Support contains 2 out of 430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 721/721 transitions.
Applied a total of 0 rules in 20 ms. Remains 430 /430 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 430/430 places, 721/721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 721/721 transitions.
Applied a total of 0 rules in 11 ms. Remains 430 /430 variables (removed 0) and now considering 721/721 (removed 0) transitions.
[2025-05-29 18:04:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:04:07] [INFO ] Implicit Places using invariants in 432 ms returned [0, 18, 19, 32, 49, 67, 136, 140, 149, 150, 152, 169, 187, 256, 260, 261, 264, 275, 276, 277, 295, 297, 301, 319, 320, 321, 322, 334, 340, 346, 352, 358, 364, 370, 376, 382, 388, 394]
[2025-05-29 18:04:07] [INFO ] Actually due to overlaps returned [295, 277, 32, 49, 169, 301, 152, 149, 275, 319, 150, 276, 297, 320, 0, 19, 260, 261, 67, 187, 321, 364, 382, 394, 18, 264, 322, 334, 340, 346, 352, 358, 370, 376, 388]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 440 ms to find 35 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 395/430 places, 721/721 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 393 transition count 659
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 127 place count 331 transition count 658
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 127 place count 331 transition count 643
Deduced a syphon composed of 15 places in 1 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 158 place count 315 transition count 643
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 170 place count 311 transition count 635
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 178 place count 303 transition count 635
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 193 place count 288 transition count 620
Iterating global reduction 4 with 15 rules applied. Total rules applied 208 place count 288 transition count 620
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 211 place count 288 transition count 617
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 211 place count 288 transition count 616
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 213 place count 287 transition count 616
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 216 place count 284 transition count 610
Iterating global reduction 5 with 3 rules applied. Total rules applied 219 place count 284 transition count 610
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 220 place count 283 transition count 609
Iterating global reduction 5 with 1 rules applied. Total rules applied 221 place count 283 transition count 609
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 222 place count 282 transition count 607
Iterating global reduction 5 with 1 rules applied. Total rules applied 223 place count 282 transition count 607
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 267 place count 260 transition count 585
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 260 transition count 584
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 270 place count 258 transition count 582
Iterating global reduction 6 with 2 rules applied. Total rules applied 272 place count 258 transition count 582
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 274 place count 258 transition count 580
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 7 with 4 rules applied. Total rules applied 278 place count 256 transition count 581
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 282 place count 256 transition count 577
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 287 place count 251 transition count 577
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 293 place count 251 transition count 577
Applied a total of 293 rules in 99 ms. Remains 251 /395 variables (removed 144) and now considering 577/721 (removed 144) transitions.
// Phase 1: matrix 577 rows 251 cols
[2025-05-29 18:04:07] [INFO ] Computed 34 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:04:07] [INFO ] Implicit Places using invariants in 187 ms returned [74, 91, 97, 100, 102, 103, 106, 107, 159, 176, 182, 185, 187]
[2025-05-29 18:04:07] [INFO ] Actually due to overlaps returned [106, 107, 91, 97, 102, 176, 182, 187, 74, 103, 159]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 189 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 240/430 places, 577/721 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 232 transition count 569
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 232 transition count 569
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 230 transition count 567
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 230 transition count 567
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 28 place count 226 transition count 563
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 226 transition count 557
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 40 place count 220 transition count 557
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 220 transition count 555
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 44 place count 218 transition count 555
Applied a total of 44 rules in 88 ms. Remains 218 /240 variables (removed 22) and now considering 555/577 (removed 22) transitions.
// Phase 1: matrix 555 rows 218 cols
[2025-05-29 18:04:07] [INFO ] Computed 23 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:04:08] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-05-29 18:04:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:04:08] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 218/430 places, 555/721 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1383 ms. Remains : 218/430 places, 555/721 transitions.
RANDOM walk for 4000000 steps (101609 resets) in 8347 ms. (479 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000004 steps (38665 resets) in 3953 ms. (1011 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000003 steps (38677 resets) in 4301 ms. (929 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 38772 steps, run visited all 2 properties in 208 ms. (steps per millisecond=186 )
Probabilistic random walk after 38772 steps, saw 20269 distinct states, run finished after 211 ms. (steps per millisecond=183 ) properties seen :2
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query StableMarking after proving 1097 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 279956 ms.
BK_STOP 1748541854009
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
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="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
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 r007-tall-174853737100193"
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.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 '
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 ;