About the Execution of ITS-Tools for FunctionPointer-PT-b128
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | TF??TTFT?TTTFTTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r100-smll-174867007400110.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 FunctionPointer-PT-b128, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867007400110
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 772K
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 391K 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
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-2024-06
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-2024-11
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-2024-12
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-2024-13
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-2025-00
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-2025-01
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-2025-02
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-2025-03
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-2025-04
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-2025-05
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-2025-07
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-2025-08
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-2025-09
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-2025-10
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-2025-14
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-2025-15
=== Now, execution of the tool begins
BK_START 1748806871986
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b128
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-01 19:41:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 19:41:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 19:41:15] [INFO ] Load time of PNML (sax parser for PT used): 304 ms
[2025-06-01 19:41:15] [INFO ] Transformed 306 places.
[2025-06-01 19:41:15] [INFO ] Transformed 840 transitions.
[2025-06-01 19:41:15] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 530 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 41 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 84 places in 13 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40077 steps (16 resets) in 1490 ms. (26 steps per ms) remains 10/12 properties
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 744 ms. (53 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (26 resets) in 338 ms. (118 steps per ms) remains 10/10 properties
[2025-06-01 19:41:16] [INFO ] Flatten gal took : 363 ms
BEST_FIRST walk for 40004 steps (30 resets) in 819 ms. (48 steps per ms) remains 10/10 properties
[2025-06-01 19:41:16] [INFO ] Flatten gal took : 185 ms
[2025-06-01 19:41:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16256672264619021065.gal : 116 ms
BEST_FIRST walk for 40004 steps (12 resets) in 750 ms. (53 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (19 resets) in 375 ms. (106 steps per ms) remains 10/10 properties
[2025-06-01 19:41:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality403877390911553661.prop : 11 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/ReachabilityCardinality16256672264619021065.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality403877390911553661.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 ...328
BEST_FIRST walk for 40004 steps (23 resets) in 312 ms. (127 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (23 resets) in 234 ms. (170 steps per ms) remains 10/10 properties
Loading property file /tmp/ReachabilityCardinality403877390911553661.prop.
BEST_FIRST walk for 40004 steps (19 resets) in 353 ms. (113 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (20 resets) in 240 ms. (165 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (17 resets) in 253 ms. (157 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 31
[2025-06-01 19:41:17] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2025-06-01 19:41:17] [INFO ] Computed 4 invariants in 24 ms
[2025-06-01 19:41:17] [INFO ] State equation strengthened by 65 read => feed constraints.
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :31 after 1115
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 59/144 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 357/501 variables, 144/148 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 60/208 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 126/627 variables, 69/277 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/627 variables, 5/282 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/627 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 9/636 variables, 9/291 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/636 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/636 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 636/636 variables, and 291 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1584 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 222/222 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 10/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem FunctionPointer-PT-b128-ReachabilityCardinality-2025-01 is UNSAT
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-2025-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 59/144 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 357/501 variables, 144/148 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 60/208 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 1/209 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:41:19] [INFO ] Deduced a trap along path composed of 3 places in 59 ms of which 26 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 1/210 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 0/210 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 126/627 variables, 69/279 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/627 variables, 5/284 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/627 variables, 7/291 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:41:20] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:41:20] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/627 variables, 2/293 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:41:21] [INFO ] Deduced a trap along path composed of 3 places in 43 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/627 variables, 1/294 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/627 variables, 0/294 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 9/636 variables, 9/303 constraints. Problems are: Problem set: 1 solved, 9 unsolved
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :1115 after 336018
At refinement iteration 16 (INCLUDED_ONLY) 0/636 variables, 0/303 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 0/636 variables, 0/303 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 636/636 variables, and 303 constraints, problems are : Problem set: 1 solved, 9 unsolved in 4358 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 222/222 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 6138ms problems are : Problem set: 1 solved, 9 unsolved
Parikh walk visited 0 properties in 45175 ms.
Support contains 74 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 648/648 transitions.
Graph (complete) has 932 edges and 222 vertex of which 215 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 0 output transitions
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 16 place count 200 transition count 560
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 200 transition count 560
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 51 place count 200 transition count 540
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 58 place count 193 transition count 526
Iterating global reduction 1 with 7 rules applied. Total rules applied 65 place count 193 transition count 526
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 191 transition count 522
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 191 transition count 522
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 85 place count 191 transition count 506
Applied a total of 85 rules in 170 ms. Remains 191 /222 variables (removed 31) and now considering 506/648 (removed 142) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 191/222 places, 506/648 transitions.
RANDOM walk for 40086 steps (31 resets) in 196 ms. (203 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (21 resets) in 80 ms. (493 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (30 resets) in 190 ms. (209 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (27 resets) in 144 ms. (275 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (19 resets) in 102 ms. (388 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (19 resets) in 79 ms. (500 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (22 resets) in 77 ms. (512 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (36 resets) in 126 ms. (314 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (17 resets) in 92 ms. (430 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (25 resets) in 108 ms. (367 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 185583 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 9
Probabilistic random walk after 185583 steps, saw 146966 distinct states, run finished after 3010 ms. (steps per millisecond=61 ) properties seen :0
[2025-06-01 19:42:12] [INFO ] Flow matrix only has 336 transitions (discarded 170 similar events)
// Phase 1: matrix 336 rows 191 cols
[2025-06-01 19:42:12] [INFO ] Computed 3 invariants in 8 ms
[2025-06-01 19:42:12] [INFO ] State equation strengthened by 61 read => feed constraints.
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/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 56/130 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 297/427 variables, 130/133 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/427 variables, 56/189 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 93/520 variables, 54/243 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 5/248 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 7/527 variables, 7/255 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/527 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/527 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 527/527 variables, and 255 constraints, problems are : Problem set: 0 solved, 9 unsolved in 898 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 191/191 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 9/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 56/130 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 297/427 variables, 130/133 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/427 variables, 56/189 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 93/520 variables, 54/244 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 5/249 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/520 variables, 7/256 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:42:13] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:42:13] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:42:13] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/520 variables, 3/259 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/520 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 7/527 variables, 7/266 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/527 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/527 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 527/527 variables, and 266 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2302 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 191/191 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 9/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 3247ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 7 different solutions.
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-2024-11 FALSE TECHNIQUES PARIKH_WALK
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-2024-06 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 39943 ms.
Support contains 42 out of 191 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 506/506 transitions.
Graph (complete) has 777 edges and 191 vertex of which 175 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 175 transition count 475
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 169 transition count 435
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 169 transition count 435
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 166 transition count 427
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 166 transition count 427
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 165 transition count 425
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 165 transition count 425
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 164 transition count 421
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 164 transition count 421
Applied a total of 54 rules in 54 ms. Remains 164 /191 variables (removed 27) and now considering 421/506 (removed 85) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 164/191 places, 421/506 transitions.
RANDOM walk for 40000 steps (8 resets) in 244 ms. (163 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (13 resets) in 63 ms. (625 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (9 resets) in 161 ms. (246 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (10 resets) in 68 ms. (579 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (12 resets) in 53 ms. (740 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (11 resets) in 59 ms. (666 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (10 resets) in 70 ms. (563 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 221171 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 7
Probabilistic random walk after 221171 steps, saw 171173 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
[2025-06-01 19:42:58] [INFO ] Flow matrix only has 275 transitions (discarded 146 similar events)
// Phase 1: matrix 275 rows 164 cols
[2025-06-01 19:42:58] [INFO ] Computed 2 invariants in 2 ms
[2025-06-01 19:42:58] [INFO ] State equation strengthened by 47 read => feed constraints.
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/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 46/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 20/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 227/335 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 35/145 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 85/420 variables, 42/187 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 11/198 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 18/438 variables, 13/211 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/438 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/438 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 1/439 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/439 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/439 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 213 constraints, problems are : Problem set: 0 solved, 7 unsolved in 601 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 7/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 46/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 20/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 227/335 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 35/145 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 85/420 variables, 42/187 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 11/198 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 6/204 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:42:59] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:42:59] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:42:59] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:42:59] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:42:59] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/420 variables, 5/209 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/420 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 18/438 variables, 13/222 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/438 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:43:00] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/438 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/438 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 1/439 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/439 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 0/439 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 439/439 variables, and 225 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1841 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 7/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 2462ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-2025-09 FALSE TECHNIQUES PARIKH_WALK
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-2025-03 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 40669 ms.
Support contains 41 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 421/421 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 163 transition count 417
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 163 transition count 417
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 162 transition count 415
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 162 transition count 415
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 161 transition count 411
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 161 transition count 411
Applied a total of 6 rules in 37 ms. Remains 161 /164 variables (removed 3) and now considering 411/421 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 161/164 places, 411/421 transitions.
RANDOM walk for 40004 steps (9 resets) in 177 ms. (224 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (11 resets) in 172 ms. (231 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (12 resets) in 61 ms. (645 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (10 resets) in 69 ms. (571 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 69 ms. (571 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (12 resets) in 79 ms. (500 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 246820 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 5
Probabilistic random walk after 246820 steps, saw 190698 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
[2025-06-01 19:43:44] [INFO ] Flow matrix only has 269 transitions (discarded 142 similar events)
// Phase 1: matrix 269 rows 161 cols
[2025-06-01 19:43:44] [INFO ] Computed 2 invariants in 6 ms
[2025-06-01 19:43:44] [INFO ] State equation strengthened by 47 read => feed constraints.
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/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 46/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 20/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 223/330 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 35/144 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 81/411 variables, 40/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 11/195 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 18/429 variables, 13/208 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/429 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/429 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 1/430 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/430 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/430 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 210 constraints, problems are : Problem set: 0 solved, 5 unsolved in 451 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 46/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 20/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 223/330 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 35/144 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 81/411 variables, 40/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 11/195 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:43:45] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:43:45] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:43:45] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:43:45] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/411 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/411 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 18/429 variables, 13/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/429 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:43:46] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/429 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/429 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 1/430 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/430 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/430 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 219 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1266 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 1737ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-2025-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-2025-08 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 28454 ms.
Support contains 39 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 411/411 transitions.
Graph (complete) has 655 edges and 161 vertex of which 158 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 158 transition count 406
Applied a total of 6 rules in 19 ms. Remains 158 /161 variables (removed 3) and now considering 406/411 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 158/161 places, 406/411 transitions.
RANDOM walk for 40000 steps (12 resets) in 223 ms. (178 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (11 resets) in 184 ms. (216 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (10 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 318469 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :0 out of 3
Probabilistic random walk after 318469 steps, saw 241674 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
[2025-06-01 19:44:18] [INFO ] Flow matrix only has 264 transitions (discarded 142 similar events)
// Phase 1: matrix 264 rows 158 cols
[2025-06-01 19:44:18] [INFO ] Computed 2 invariants in 2 ms
[2025-06-01 19:44:18] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 46/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 20/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 218/323 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 33/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 80/403 variables, 39/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/403 variables, 10/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 18/421 variables, 13/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/421 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/421 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1/422 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/422 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 204 constraints, problems are : Problem set: 0 solved, 3 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 46/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 20/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 218/323 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 33/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 80/403 variables, 39/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/403 variables, 10/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:44:19] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:44:19] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:44:19] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:44:19] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/403 variables, 4/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/403 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 18/421 variables, 13/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/421 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:44:19] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:44:19] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/421 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/421 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1/422 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/422 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/422 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 212 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1174 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 1507ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 18110 ms.
Support contains 39 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 406/406 transitions.
Applied a total of 0 rules in 12 ms. Remains 158 /158 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 158/158 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 406/406 transitions.
Applied a total of 0 rules in 13 ms. Remains 158 /158 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2025-06-01 19:44:38] [INFO ] Flow matrix only has 264 transitions (discarded 142 similar events)
[2025-06-01 19:44:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:44:38] [INFO ] Implicit Places using invariants in 159 ms returned []
[2025-06-01 19:44:38] [INFO ] Flow matrix only has 264 transitions (discarded 142 similar events)
[2025-06-01 19:44:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:44:38] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-01 19:44:38] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 19:44:38] [INFO ] Redundant transitions in 28 ms returned []
Running 404 sub problems to find dead transitions.
[2025-06-01 19:44:38] [INFO ] Flow matrix only has 264 transitions (discarded 142 similar events)
[2025-06-01 19:44:38] [INFO ] Invariant cache hit.
[2025-06-01 19:44:38] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 3 (OVERLAPS) 264/420 variables, 156/158 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 44/202 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 404 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/422 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 8 (OVERLAPS) 0/422 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 404 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 204 constraints, problems are : Problem set: 0 solved, 404 unsolved in 17137 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 404 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 3 (OVERLAPS) 264/420 variables, 156/158 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 44/202 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 32/234 constraints. Problems are: Problem set: 0 solved, 404 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:45:07] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:45:07] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:45:07] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 3/237 constraints. Problems are: Problem set: 0 solved, 404 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:45:18] [INFO ] Deduced a trap along path composed of 3 places in 16 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 19:45:18] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 404 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/422 variables, and 239 constraints, problems are : Problem set: 0 solved, 404 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 156/158 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 32/404 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 47481ms problems are : Problem set: 0 solved, 404 unsolved
Search for dead transitions found 0 dead transitions in 47493ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48135 ms. Remains : 158/158 places, 406/406 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 142 transitions
Reduce isomorphic transitions removed 142 transitions.
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 0 with 150 rules applied. Total rules applied 150 place count 158 transition count 256
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 158 place count 150 transition count 256
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 158 place count 150 transition count 233
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 204 place count 127 transition count 233
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 238 place count 110 transition count 216
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 245 place count 103 transition count 202
Iterating global reduction 2 with 7 rules applied. Total rules applied 252 place count 103 transition count 202
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 259 place count 96 transition count 188
Iterating global reduction 2 with 7 rules applied. Total rules applied 266 place count 96 transition count 188
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 272 place count 90 transition count 176
Iterating global reduction 2 with 6 rules applied. Total rules applied 278 place count 90 transition count 176
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 282 place count 90 transition count 172
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 3 with 4 rules applied. Total rules applied 286 place count 88 transition count 174
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 296 place count 88 transition count 164
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 300 place count 88 transition count 160
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 304 place count 84 transition count 160
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 306 place count 84 transition count 158
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 308 place count 84 transition count 158
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 309 place count 84 transition count 157
Applied a total of 309 rules in 58 ms. Remains 84 /158 variables (removed 74) and now considering 157/406 (removed 249) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 157 rows 84 cols
[2025-06-01 19:45:26] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 19:45:26] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 19:45:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 19:45:26] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 19:45:26] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2025-06-01 19:45:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-01 19:45:26] [INFO ] After 29ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2025-06-01 19:45:26] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2025-06-01 19:45:26] [INFO ] After 244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2025-06-01 19:45:26] [INFO ] Flatten gal took : 26 ms
[2025-06-01 19:45:26] [INFO ] Flatten gal took : 24 ms
[2025-06-01 19:45:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11405191694300543261.gal : 4 ms
[2025-06-01 19:45:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2098820583678525613.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/ReachabilityCardinality11405191694300543261.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2098820583678525613.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
Loading property file /tmp/ReachabilityCardinality2098820583678525613.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :9 after 19
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :19 after 55
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :55 after 275
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :275 after 1539
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :1539 after 9880
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :9880 after 73150
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :73150 after 1.20828e+07
Detected timeout of ITS tools.
[2025-06-01 19:45:41] [INFO ] Flatten gal took : 14 ms
[2025-06-01 19:45:41] [INFO ] Applying decomposition
[2025-06-01 19:45:41] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1227997482986613256.txt' '-o' '/tmp/graph1227997482986613256.bin' '-w' '/tmp/graph1227997482986613256.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1227997482986613256.bin' '-l' '-1' '-v' '-w' '/tmp/graph1227997482986613256.weights' '-q' '0' '-e' '0.001'
[2025-06-01 19:45:41] [INFO ] Decomposing Gal with order
[2025-06-01 19:45:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 19:45:41] [INFO ] Removed a total of 141 redundant transitions.
[2025-06-01 19:45:41] [INFO ] Flatten gal took : 78 ms
[2025-06-01 19:45:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 8 ms.
[2025-06-01 19:45:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality443684635937536937.gal : 3 ms
[2025-06-01 19:45:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16678945233775931177.prop : 0 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/ReachabilityCardinality443684635937536937.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16678945233775931177.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 ...328
Loading property file /tmp/ReachabilityCardinality16678945233775931177.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 15
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :15 after 70
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :70 after 493
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :493 after 3059
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :3059 after 31463
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :31463 after 367290
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :367290 after 5.35909e+06
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :5.35909e+06 after 2.87279e+10
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :2.87279e+10 after 3.07501e+13
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :3.07501e+13 after 2.29307e+16
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30817 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-01 19:45:57] [INFO ] Flatten gal took : 54 ms
[2025-06-01 19:45:57] [INFO ] Applying decomposition
[2025-06-01 19:45:57] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5424103002372068694.txt' '-o' '/tmp/graph5424103002372068694.bin' '-w' '/tmp/graph5424103002372068694.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5424103002372068694.bin' '-l' '-1' '-v' '-w' '/tmp/graph5424103002372068694.weights' '-q' '0' '-e' '0.001'
[2025-06-01 19:45:57] [INFO ] Decomposing Gal with order
[2025-06-01 19:45:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 19:45:57] [INFO ] Removed a total of 205 redundant transitions.
[2025-06-01 19:45:57] [INFO ] Flatten gal took : 93 ms
[2025-06-01 19:45:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 144 labels/synchronizations in 11 ms.
[2025-06-01 19:45:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6262689382634977308.gal : 9 ms
[2025-06-01 19:45:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3454276488021424925.prop : 0 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/ReachabilityCardinality6262689382634977308.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3454276488021424925.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 ...328
Loading property file /tmp/ReachabilityCardinality3454276488021424925.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 18
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :18 after 328
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :328 after 37312
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :37312 after 2.71017e+08
Detected timeout of ITS tools.
[2025-06-01 20:16:01] [INFO ] Flatten gal took : 650 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12340585260044453458
[2025-06-01 20:16:02] [INFO ] Applying decomposition
[2025-06-01 20:16:02] [INFO ] Flatten gal took : 296 ms
[2025-06-01 20:16:03] [INFO ] Computing symmetric may disable matrix : 406 transitions.
[2025-06-01 20:16:03] [INFO ] Computation of Complete disable matrix. took 48 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 20:16:03] [INFO ] Computing symmetric may enable matrix : 406 transitions.
[2025-06-01 20:16:03] [INFO ] Computation of Complete enable matrix. took 39 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 20:16:04] [INFO ] Computing Do-Not-Accords matrix : 406 transitions.
[2025-06-01 20:16:04] [INFO ] Computation of Completed DNA matrix. took 80 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 20:16:04] [INFO ] Built C files in 1592ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12340585260044453458
Running compilation step : cd /tmp/ltsmin12340585260044453458;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16836985482619865012.txt' '-o' '/tmp/graph16836985482619865012.bin' '-w' '/tmp/graph16836985482619865012.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16836985482619865012.bin' '-l' '-1' '-v' '-w' '/tmp/graph16836985482619865012.weights' '-q' '0' '-e' '0.001'
[2025-06-01 20:16:04] [INFO ] Decomposing Gal with order
[2025-06-01 20:16:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 20:16:05] [INFO ] Removed a total of 396 redundant transitions.
[2025-06-01 20:16:05] [INFO ] Flatten gal took : 350 ms
[2025-06-01 20:16:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 149 labels/synchronizations in 57 ms.
[2025-06-01 20:16:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality233829428878654636.gal : 14 ms
[2025-06-01 20:16:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1129267470681292085.prop : 6 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/ReachabilityCardinality233829428878654636.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1129267470681292085.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 ...327
Loading property file /tmp/ReachabilityCardinality1129267470681292085.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :9 after 45
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :45 after 460
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :460 after 5643
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :5643 after 125970
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :125970 after 7.88872e+06
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :7.88872e+06 after 8.86305e+08
Compilation finished in 2292 ms.
Running link step : cd /tmp/ltsmin12340585260044453458;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin12340585260044453458;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'FunctionPointerPTb128ReachabilityCardinality202504==true'
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :8.86305e+08 after 1.32549e+11
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :1.32549e+11 after 8.47379e+15
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin12340585260044453458;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'FunctionPointerPTb128ReachabilityCardinality202504==true'
Running LTSmin : cd /tmp/ltsmin12340585260044453458;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'FunctionPointerPTb128ReachabilityCardinality202412==true'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin12340585260044453458;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'FunctionPointerPTb128ReachabilityCardinality202412==true'
Running LTSmin : cd /tmp/ltsmin12340585260044453458;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'FunctionPointerPTb128ReachabilityCardinality202413==true'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin12340585260044453458;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'FunctionPointerPTb128ReachabilityCardinality202413==true'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin12340585260044453458;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'FunctionPointerPTb128ReachabilityCardinality202504==true'
BK_TIME_CONFINEMENT_REACHED
--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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 ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="FunctionPointer-PT-b128"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-b128, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r100-smll-174867007400110"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b128.tgz
mv FunctionPointer-PT-b128 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;