Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r198-tall-174894533000566.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 ShieldIIPt-PT-040B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894533000566
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K 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 3.7K 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 686K 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 ShieldIIPt-PT-040B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-2025-00
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-2025-01
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-2025-02
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-2025-03
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-2025-04
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-2025-05
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-2025-06
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-2025-07
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-2025-08
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-2025-10
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-2025-11
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-2025-12
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-2025-13
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-2025-14
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749158510330

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-040B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-05 21:21:51] [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-05 21:21:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 21:21:51] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2025-06-05 21:21:51] [INFO ] Transformed 2803 places.
[2025-06-05 21:21:51] [INFO ] Transformed 2603 transitions.
[2025-06-05 21:21:51] [INFO ] Found NUPN structural information;
[2025-06-05 21:21:51] [INFO ] Parsed PT model containing 2803 places and 2603 transitions and 6486 arcs in 360 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1999 ms. (20 steps per ms) remains 7/12 properties
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 255 ms. (156 steps per ms) remains 7/7 properties
[2025-06-05 21:21:52] [INFO ] Flatten gal took : 292 ms
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 7/7 properties
[2025-06-05 21:21:53] [INFO ] Flatten gal took : 192 ms
BEST_FIRST walk for 40003 steps (8 resets) in 1004 ms. (39 steps per ms) remains 7/7 properties
[2025-06-05 21:21:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11010075506259174431.gal : 99 ms
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 7/7 properties
[2025-06-05 21:21:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4908849110201467887.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/ReachabilityCardinality11010075506259174431.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4908849110201467887.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 7/7 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
// Phase 1: matrix 2603 rows 2803 cols
[2025-06-05 21:21:53] [INFO ] Computed 361 invariants in 42 ms
Excessive predecessor constraint size, skipping predecessor.
Loading property file /tmp/ReachabilityCardinality4908849110201467887.prop.
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/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 949/1021 variables, 110/182 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 949/1131 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 0/1131 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1782/2803 variables, 251/1382 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2803 variables, 1782/3164 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2803 variables, 0/3164 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 2603/5406 variables, 2803/5967 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5406 variables, 0/5967 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/5406 variables, 0/5967 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5406/5406 variables, and 5967 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3467 ms.
Refiners :[Domain max(s): 2803/2803 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 2803/2803 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 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 949/1021 variables, 110/182 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 10
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 949/1131 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :36 after 65
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :65 after 729
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :729 after 68427
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :68427 after 2.31482e+09
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :2.31482e+09 after 3.23253e+17
[2025-06-05 21:21:57] [INFO ] Deduced a trap composed of 16 places in 220 ms of which 31 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :3.23253e+17 after 6.09057e+37
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:21:57] [INFO ] Deduced a trap composed of 22 places in 178 ms of which 14 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :6.09057e+37 after 2.95152e+78
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:21:58] [INFO ] Deduced a trap composed of 26 places in 198 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:21:58] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :2.95152e+78 after 7.31397e+116
[2025-06-05 21:21:58] [INFO ] Deduced a trap composed of 35 places in 176 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:21:58] [INFO ] Deduced a trap composed of 59 places in 151 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:21:58] [INFO ] Deduced a trap composed of 49 places in 142 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :7.31397e+116 after 7.31397e+116
[2025-06-05 21:21:58] [INFO ] Deduced a trap composed of 53 places in 150 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:21:59] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:21:59] [INFO ] Deduced a trap composed of 22 places in 174 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:21:59] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:21:59] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:21:59] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 13/1144 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:00] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1021 variables, 1/1145 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 32768
SDD size :7.31397e+116 after 7.31397e+116
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:00] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1021 variables, 1/1146 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1021 variables, 0/1146 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1782/2803 variables, 251/1397 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2803 variables, 1782/3179 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:01] [INFO ] Deduced a trap composed of 12 places in 412 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:02] [INFO ] Deduced a trap composed of 13 places in 447 ms of which 32 ms to minimize.
SMT process timed out in 9080ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 72 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 2603/2603 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 642 transitions
Trivial Post-agglo rules discarded 642 transitions
Performed 642 trivial Post agglomeration. Transition count delta: 642
Iterating post reduction 0 with 642 rules applied. Total rules applied 642 place count 2803 transition count 1961
Reduce places removed 642 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 644 rules applied. Total rules applied 1286 place count 2161 transition count 1959
Reduce places removed 1 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 2 with 13 rules applied. Total rules applied 1299 place count 2160 transition count 1947
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 1311 place count 2148 transition count 1947
Performed 165 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 165 Pre rules applied. Total rules applied 1311 place count 2148 transition count 1782
Deduced a syphon composed of 165 places in 4 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 4 with 330 rules applied. Total rules applied 1641 place count 1983 transition count 1782
SDD proceeding with computation,7 properties remain. new max is 65536
SDD size :7.31397e+116 after 7.31397e+116
Discarding 259 places :
Symmetric choice reduction at 4 with 259 rule applications. Total rules 1900 place count 1724 transition count 1523
Iterating global reduction 4 with 259 rules applied. Total rules applied 2159 place count 1724 transition count 1523
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 105 Pre rules applied. Total rules applied 2159 place count 1724 transition count 1418
Deduced a syphon composed of 105 places in 10 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 4 with 210 rules applied. Total rules applied 2369 place count 1619 transition count 1418
Performed 648 Post agglomeration using F-continuation condition.Transition count delta: 648
Deduced a syphon composed of 648 places in 3 ms
Reduce places removed 648 places and 0 transitions.
Iterating global reduction 4 with 1296 rules applied. Total rules applied 3665 place count 971 transition count 770
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -55
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3867 place count 870 transition count 825
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 3881 place count 863 transition count 830
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3882 place count 863 transition count 829
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3886 place count 863 transition count 825
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 3890 place count 859 transition count 825
Partial Free-agglomeration rule applied 37 times.
Drop transitions (Partial Free agglomeration) removed 37 transitions
Iterating global reduction 6 with 37 rules applied. Total rules applied 3927 place count 859 transition count 825
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3928 place count 858 transition count 824
Applied a total of 3928 rules in 932 ms. Remains 858 /2803 variables (removed 1945) and now considering 824/2603 (removed 1779) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 938 ms. Remains : 858/2803 places, 824/2603 transitions.
RANDOM walk for 40000 steps (8 resets) in 808 ms. (49 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 425 ms. (93 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 393 ms. (101 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 306 ms. (130 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 325 ms. (122 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 429 ms. (93 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 297 ms. (134 steps per ms) remains 6/7 properties
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 307 ms. (129 steps per ms) remains 6/6 properties
// Phase 1: matrix 824 rows 858 cols
[2025-06-05 21:22:04] [INFO ] Computed 361 invariants in 4 ms
[2025-06-05 21:22:04] [INFO ] State equation strengthened by 76 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/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 254/324 variables, 108/108 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 96/420 variables, 45/153 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 544/964 variables, 420/573 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/964 variables, 69/642 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/964 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 443/1407 variables, 261/903 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1407 variables, 116/1019 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1407 variables, 7/1026 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1407 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 10/1417 variables, 13/1039 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1417 variables, 10/1049 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1417 variables, 0/1049 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 14/1431 variables, 7/1056 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1431 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 199/1630 variables, 126/1182 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1630 variables, 43/1225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1630 variables, 0/1225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 9/1639 variables, 13/1238 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1639 variables, 9/1247 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1639 variables, 0/1247 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 10/1649 variables, 5/1252 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1649 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 33/1682 variables, 32/1284 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1682 variables, 11/1295 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1682 variables, 0/1295 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (OVERLAPS) 0/1682 variables, 0/1295 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1682/1682 variables, and 1295 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1845 ms.
Refiners :[Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 858/858 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 254/324 variables, 108/108 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:06] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:06] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:06] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:06] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:06] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:06] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 6/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 96/420 variables, 45/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:07] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:07] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:07] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:07] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 4/163 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 544/964 variables, 420/583 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/964 variables, 69/652 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/964 variables, 1/653 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:07] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/964 variables, 1/654 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/964 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 443/1407 variables, 261/915 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1407 variables, 116/1031 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1407 variables, 7/1038 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1407 variables, 4/1042 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:08] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:08] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:08] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:08] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:08] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 5 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1407 variables, 5/1047 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:08] [INFO ] Deduced a trap along path composed of 2 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:08] [INFO ] Deduced a trap along path composed of 2 places in 37 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:09] [INFO ] Deduced a trap along path composed of 2 places in 33 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:09] [INFO ] Deduced a trap along path composed of 2 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-05 21:22:09] [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-05 21:22:09] [INFO ] Deduced a trap along path composed of 2 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-05 21:22:09] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:09] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:09] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1407 variables, 9/1056 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Invariant property ShieldIIPt-PT-040B-ReachabilityCardinality-2025-04 does not hold.
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :7.31397e+116 after 7.31397e+116
[2025-06-05 21:22:09] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:09] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:09] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 4 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1407 variables, 3/1059 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:10] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1407 variables, 1/1060 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1407 variables, 0/1060 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 10/1417 variables, 13/1073 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1417 variables, 10/1083 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1417 variables, 0/1083 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 14/1431 variables, 7/1090 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1431 variables, 0/1090 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 199/1630 variables, 126/1216 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1630 variables, 43/1259 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:11] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:11] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:11] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:11] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:11] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:12] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:12] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:12] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/1630 variables, 8/1267 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:12] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1630 variables, 1/1268 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1630 variables, 0/1268 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 31 (OVERLAPS) 9/1639 variables, 13/1281 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1639 variables, 9/1290 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1639 variables, 0/1290 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 34 (OVERLAPS) 10/1649 variables, 5/1295 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1649 variables, 0/1295 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 36 (OVERLAPS) 33/1682 variables, 32/1327 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1682 variables, 11/1338 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:14] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:14] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/1682 variables, 2/1340 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1682 variables, 0/1340 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 40 (OVERLAPS) 0/1682 variables, 0/1340 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1682/1682 variables, and 1340 constraints, problems are : Problem set: 1 solved, 5 unsolved in 8927 ms.
Refiners :[Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 858/858 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 22/22 constraints]
After SMT, in 10802ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
SDD proceeding with computation,6 properties remain. new max is 131072
SDD size :7.31397e+116 after 7.31397e+116
Parikh walk visited 0 properties in 2531 ms.
Support contains 68 out of 858 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 858/858 places, 824/824 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 858 transition count 822
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 856 transition count 822
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 0 with 4 rules applied. Total rules applied 8 place count 854 transition count 820
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 852 transition count 824
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 851 transition count 823
Applied a total of 13 rules in 143 ms. Remains 851 /858 variables (removed 7) and now considering 823/824 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 851/858 places, 823/824 transitions.
RANDOM walk for 40000 steps (8 resets) in 531 ms. (75 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 332 ms. (120 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 281 ms. (141 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 289 ms. (137 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 410 ms. (97 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 243 ms. (163 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 132685 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 5
Probabilistic random walk after 132685 steps, saw 98944 distinct states, run finished after 3007 ms. (steps per millisecond=44 ) properties seen :0
// Phase 1: matrix 823 rows 851 cols
[2025-06-05 21:22:21] [INFO ] Computed 361 invariants in 4 ms
[2025-06-05 21:22:21] [INFO ] State equation strengthened by 77 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/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 249/317 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 96/413 variables, 45/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 535/948 variables, 413/564 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/948 variables, 70/634 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/948 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 419/1367 variables, 247/881 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1367 variables, 115/996 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1367 variables, 7/1003 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1367 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 7/1374 variables, 8/1011 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1374 variables, 7/1018 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1374 variables, 0/1018 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 12/1386 variables, 6/1024 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1386 variables, 0/1024 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 205/1591 variables, 124/1148 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1591 variables, 44/1192 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1591 variables, 0/1192 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 9/1600 variables, 12/1204 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1600 variables, 9/1213 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1600 variables, 0/1213 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 12/1612 variables, 6/1219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1612 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 56/1668 variables, 46/1265 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1668 variables, 16/1281 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1668 variables, 0/1281 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 1/1669 variables, 1/1282 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1669 variables, 1/1283 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1669 variables, 0/1283 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (OVERLAPS) 2/1671 variables, 1/1284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1671 variables, 0/1284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (OVERLAPS) 3/1674 variables, 4/1288 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1674 variables, 1/1289 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1674 variables, 0/1289 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (OVERLAPS) 0/1674 variables, 0/1289 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1674/1674 variables, and 1289 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2042 ms.
Refiners :[Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 851/851 constraints, ReadFeed: 77/77 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 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 249/317 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:23] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:23] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:23] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:23] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 96/413 variables, 45/155 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:24] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:24] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:24] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:24] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:24] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 5/160 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:24] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 535/948 variables, 413/574 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/948 variables, 70/644 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/948 variables, 1/645 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:24] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:24] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:25] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:25] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/948 variables, 4/649 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:25] [INFO ] Deduced a trap along path composed of 2 places in 33 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:25] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/948 variables, 2/651 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/948 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 419/1367 variables, 247/898 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1367 variables, 115/1013 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1367 variables, 7/1020 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1367 variables, 3/1023 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:25] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:25] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:26] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 6 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1367 variables, 3/1026 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:26] [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-05 21:22:26] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:26] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:26] [INFO ] Deduced a trap along path composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1367 variables, 4/1030 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1367 variables, 0/1030 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 7/1374 variables, 8/1038 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1374 variables, 7/1045 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:27] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1374 variables, 1/1046 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1374 variables, 0/1046 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 12/1386 variables, 6/1052 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:27] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:27] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1386 variables, 0/1052 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 205/1591 variables, 124/1176 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1591 variables, 44/1220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1591 variables, 2/1222 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:28] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:28] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:28] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:28] [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-05 21:22:28] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:28] [INFO ] Deduced a trap along path composed of 2 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-05 21:22:28] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 0 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/1591 variables, 7/1229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1591 variables, 0/1229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (OVERLAPS) 9/1600 variables, 12/1241 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1600 variables, 9/1250 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:29] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 0 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/1600 variables, 1/1251 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:29] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/1600 variables, 1/1252 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1600 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (OVERLAPS) 12/1612 variables, 6/1258 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1612 variables, 0/1258 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (OVERLAPS) 56/1668 variables, 46/1304 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1668 variables, 16/1320 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:31] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:31] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:31] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 5 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/1668 variables, 3/1323 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:31] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:31] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:31] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:31] [INFO ] Deduced a trap along path composed of 2 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-05 21:22:32] [INFO ] Deduced a trap along path composed of 2 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-05 21:22:32] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/1668 variables, 6/1329 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:32] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 5 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/1668 variables, 1/1330 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:32] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 5 ms to minimize.
At refinement iteration 44 (INCLUDED_ONLY) 0/1668 variables, 1/1331 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:33] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:22:33] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 7 ms to minimize.
At refinement iteration 45 (INCLUDED_ONLY) 0/1668 variables, 2/1333 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1668 variables, 0/1333 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 47 (OVERLAPS) 1/1669 variables, 1/1334 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1669 variables, 1/1335 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,6 properties remain. new max is 262144
SDD size :7.31397e+116 after 7.31397e+116
At refinement iteration 49 (INCLUDED_ONLY) 0/1669 variables, 0/1335 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 50 (OVERLAPS) 2/1671 variables, 1/1336 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1671 variables, 0/1336 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 52 (OVERLAPS) 3/1674 variables, 4/1340 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1674 variables, 1/1341 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1674 variables, 0/1341 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 55 (OVERLAPS) 0/1674 variables, 0/1341 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1674/1674 variables, and 1341 constraints, problems are : Problem set: 0 solved, 5 unsolved in 13935 ms.
Refiners :[Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 851/851 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 24/24 constraints]
After SMT, in 15995ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2004 ms.
Support contains 68 out of 851 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 851/851 places, 823/823 transitions.
Applied a total of 0 rules in 26 ms. Remains 851 /851 variables (removed 0) and now considering 823/823 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 851/851 places, 823/823 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 851/851 places, 823/823 transitions.
Applied a total of 0 rules in 18 ms. Remains 851 /851 variables (removed 0) and now considering 823/823 (removed 0) transitions.
[2025-06-05 21:22:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:22:40] [INFO ] Implicit Places using invariants in 442 ms returned []
[2025-06-05 21:22:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:22:40] [INFO ] State equation strengthened by 77 read => feed constraints.
[2025-06-05 21:22:41] [INFO ] Implicit Places using invariants and state equation in 1399 ms returned []
Implicit Place search using SMT with State Equation took 1854 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 21:22:41] [INFO ] Redundant transitions in 57 ms returned []
Running 800 sub problems to find dead transitions.
[2025-06-05 21:22:41] [INFO ] Invariant cache hit.
[2025-06-05 21:22:41] [INFO ] State equation strengthened by 77 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 241/241 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 2 (OVERLAPS) 23/851 variables, 120/361 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:23:09] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:23:09] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:23:09] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:23:09] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:23:09] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:23:09] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:23:10] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:23:10] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:23:10] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:23:10] [INFO ] Deduced a trap composed of 5 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-05 21:23:10] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:23:10] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:23:10] [INFO ] Deduced a trap composed of 5 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-05 21:23:11] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 851/1674 variables, and 375 constraints, problems are : Problem set: 0 solved, 800 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/851 constraints, ReadFeed: 0/77 constraints, PredecessorRefiner: 800/800 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 800 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 241/241 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 6/247 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Reachability property ShieldIIPt-PT-040B-ReachabilityCardinality-2025-11 is true.
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,5 properties remain. new max is 262144
SDD size :7.31397e+116 after 7.31397e+116
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 3 (OVERLAPS) 23/851 variables, 120/367 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/851 variables, 8/375 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:23:23] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:23:23] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:23:24] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:23:24] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:23:24] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:23:24] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:23:25] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:23:25] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:23:25] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/851 variables, 9/384 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:23:34] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:23:34] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 8 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 851/1674 variables, and 386 constraints, problems are : Problem set: 0 solved, 800 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/851 constraints, ReadFeed: 0/77 constraints, PredecessorRefiner: 0/800 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60211ms problems are : Problem set: 0 solved, 800 unsolved
Search for dead transitions found 0 dead transitions in 60218ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62169 ms. Remains : 851/851 places, 823/823 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 2207 edges and 851 vertex of which 849 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 849 transition count 822
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 848 transition count 822
Partial Free-agglomeration rule applied 113 times.
Drop transitions (Partial Free agglomeration) removed 113 transitions
Iterating global reduction 0 with 113 rules applied. Total rules applied 116 place count 848 transition count 822
Applied a total of 116 rules in 60 ms. Remains 848 /851 variables (removed 3) and now considering 822/823 (removed 1) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 822 rows 848 cols
[2025-06-05 21:23:41] [INFO ] Computed 359 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 21:23:41] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 21:23:42] [INFO ] [Nat]Absence check using 359 positive place invariants in 46 ms returned sat
[2025-06-05 21:23:42] [INFO ] After 386ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2025-06-05 21:23:42] [INFO ] State equation strengthened by 101 read => feed constraints.
[2025-06-05 21:23:42] [INFO ] After 344ms SMT Verify possible using 101 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:23:43] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:23:43] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:23:43] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 6 ms to minimize.
[2025-06-05 21:23:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 518 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:23:43] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:23:43] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 6 ms to minimize.
[2025-06-05 21:23:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 333 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:23:44] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 6 ms to minimize.
[2025-06-05 21:23:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:23:44] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 6 ms to minimize.
[2025-06-05 21:23:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
TRAPS : Iteration 2
[2025-06-05 21:23:44] [INFO ] After 2421ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2025-06-05 21:23:45] [INFO ] After 3280ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2025-06-05 21:23:45] [INFO ] Flatten gal took : 52 ms
[2025-06-05 21:23:45] [INFO ] Flatten gal took : 36 ms
[2025-06-05 21:23:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8317159243333811408.gal : 9 ms
[2025-06-05 21:23:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15271451296884640479.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/ReachabilityCardinality8317159243333811408.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15271451296884640479.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/ReachabilityCardinality15271451296884640479.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :3 after 9
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :9 after 63
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :63 after 567
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :567 after 10206
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :10206 after 9.92023e+06
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :9.92023e+06 after 9.87756e+10
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :9.87756e+10 after 9.87757e+10
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :9.87757e+10 after 9.88062e+10
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :9.88062e+10 after 1.23126e+11
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :1.23126e+11 after 5.28315e+13
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :5.28315e+13 after 3.42159e+16
Detected timeout of ITS tools.
[2025-06-05 21:24:00] [INFO ] Flatten gal took : 29 ms
[2025-06-05 21:24:00] [INFO ] Applying decomposition
[2025-06-05 21:24:00] [INFO ] Flatten gal took : 29 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/graph12616905013462529194.txt' '-o' '/tmp/graph12616905013462529194.bin' '-w' '/tmp/graph12616905013462529194.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12616905013462529194.bin' '-l' '-1' '-v' '-w' '/tmp/graph12616905013462529194.weights' '-q' '0' '-e' '0.001'
[2025-06-05 21:24:00] [INFO ] Decomposing Gal with order
[2025-06-05 21:24:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 21:24:00] [INFO ] Removed a total of 440 redundant transitions.
[2025-06-05 21:24:00] [INFO ] Flatten gal took : 108 ms
[2025-06-05 21:24:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 26 ms.
[2025-06-05 21:24:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18084399645216968557.gal : 21 ms
[2025-06-05 21:24:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8795660687136153346.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/ReachabilityCardinality18084399645216968557.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8795660687136153346.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityCardinality8795660687136153346.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :3 after 3
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :3 after 3
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :3 after 3
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :3 after 9
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :9 after 5103
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :5103 after 9.92023e+06
Reachability property ShieldIIPt-PT-040B-ReachabilityCardinality-2025-07 is true.
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :1.4726e+14 after 1.13632e+48
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 34300 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-05 21:24:16] [INFO ] Flatten gal took : 68 ms
[2025-06-05 21:24:16] [INFO ] Applying decomposition
[2025-06-05 21:24:16] [INFO ] Flatten gal took : 78 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/graph12846840678522969464.txt' '-o' '/tmp/graph12846840678522969464.bin' '-w' '/tmp/graph12846840678522969464.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12846840678522969464.bin' '-l' '-1' '-v' '-w' '/tmp/graph12846840678522969464.weights' '-q' '0' '-e' '0.001'
[2025-06-05 21:24:16] [INFO ] Decomposing Gal with order
[2025-06-05 21:24:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 21:24:16] [INFO ] Removed a total of 240 redundant transitions.
[2025-06-05 21:24:16] [INFO ] Flatten gal took : 124 ms
[2025-06-05 21:24:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2025-06-05 21:24:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17594596623038073852.gal : 22 ms
[2025-06-05 21:24:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7496992600570134985.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/ReachabilityCardinality17594596623038073852.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7496992600570134985.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityCardinality7496992600570134985.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :3 after 9378
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :6.33561e+08 after 3.61451e+96
Reachability property ShieldIIPt-PT-040B-ReachabilityCardinality-2025-07 is true.
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :8.32763e+120 after 3.52083e+129
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :3.52083e+129 after 3.52083e+129
ITS-tools command line returned an error code 137
[2025-06-05 21:53:52] [INFO ] Flatten gal took : 314 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4057217873443720731
[2025-06-05 21:53:53] [INFO ] Applying decomposition
[2025-06-05 21:53:53] [INFO ] Computing symmetric may disable matrix : 823 transitions.
[2025-06-05 21:53:53] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 21:53:53] [INFO ] Computing symmetric may enable matrix : 823 transitions.
[2025-06-05 21:53:53] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 21:53:53] [INFO ] Flatten gal took : 197 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/graph979557158188055311.txt' '-o' '/tmp/graph979557158188055311.bin' '-w' '/tmp/graph979557158188055311.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph979557158188055311.bin' '-l' '-1' '-v' '-w' '/tmp/graph979557158188055311.weights' '-q' '0' '-e' '0.001'
[2025-06-05 21:53:55] [INFO ] Computing Do-Not-Accords matrix : 823 transitions.
[2025-06-05 21:53:55] [INFO ] Decomposing Gal with order
[2025-06-05 21:53:55] [INFO ] Computation of Completed DNA matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 21:53:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 21:53:55] [INFO ] Removed a total of 728 redundant transitions.
[2025-06-05 21:53:55] [INFO ] Flatten gal took : 68 ms
[2025-06-05 21:53:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 236 labels/synchronizations in 21 ms.
[2025-06-05 21:53:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8537670313226669109.gal : 13 ms
[2025-06-05 21:53:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13207016381070569849.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/ReachabilityCardinality8537670313226669109.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13207016381070569849.prop' '--nowitness'

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 ...308
[2025-06-05 21:53:56] [INFO ] Built C files in 2797ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4057217873443720731
Loading property file /tmp/ReachabilityCardinality13207016381070569849.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 3
Running compilation step : cd /tmp/ltsmin4057217873443720731;'/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'
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :3 after 189
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :189 after 1701
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1701 after 5.95214e+07
Compilation finished in 3405 ms.
Running link step : cd /tmp/ltsmin4057217873443720731;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin4057217873443720731;'/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' 'ShieldIIPtPT040BReachabilityCardinality202500==true'
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :3.31892e+14 after 1.50621e+77
WARNING : LTSmin timed out (>300 s) on command cd /tmp/ltsmin4057217873443720731;'/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' 'ShieldIIPtPT040BReachabilityCardinality202500==true'
Running LTSmin : cd /tmp/ltsmin4057217873443720731;'/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' 'ShieldIIPtPT040BReachabilityCardinality202505==true'
WARNING : LTSmin timed out (>300 s) on command cd /tmp/ltsmin4057217873443720731;'/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' 'ShieldIIPtPT040BReachabilityCardinality202505==true'
Running LTSmin : cd /tmp/ltsmin4057217873443720731;'/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' 'ShieldIIPtPT040BReachabilityCardinality202409==true'
WARNING : LTSmin timed out (>300 s) on command cd /tmp/ltsmin4057217873443720731;'/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' 'ShieldIIPtPT040BReachabilityCardinality202409==true'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin4057217873443720731;'/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' 'ShieldIIPtPT040BReachabilityCardinality202500==true'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.027: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.097: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.098: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.099: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.102: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.102: Initializing POR dependencies: labels 827, guards 823
pins2lts-mc-linux64( 3/ 8), 0.100: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.101: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.105: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.108: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 17.031: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 7/ 8), 17.053: "ShieldIIPtPT040BReachabilityCardinality202500==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 17.053: "ShieldIIPtPT040BReachabilityCardinality202500==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 17.056: "ShieldIIPtPT040BReachabilityCardinality202500==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 17.055: "ShieldIIPtPT040BReachabilityCardinality202500==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 17.054: "ShieldIIPtPT040BReachabilityCardinality202500==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 17.054: "ShieldIIPtPT040BReachabilityCardinality202500==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 17.054: "ShieldIIPtPT040BReachabilityCardinality202500==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 17.056: There are 827 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 17.056: State length is 851, there are 823 groups
pins2lts-mc-linux64( 4/ 8), 17.054: "ShieldIIPtPT040BReachabilityCardinality202500==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 17.056: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 17.056: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 17.056: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 17.056: Visible groups: 0 / 823, labels: 1 / 827
pins2lts-mc-linux64( 0/ 8), 17.056: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 17.056: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 17.115: ~53 levels ~960 states ~1888 transitions
pins2lts-mc-linux64( 0/ 8), 17.176: ~55 levels ~1920 states ~5312 transitions
pins2lts-mc-linux64( 0/ 8), 17.303: ~57 levels ~3840 states ~12112 transitions
pins2lts-mc-linux64( 1/ 8), 17.626: ~11 levels ~7680 states ~27208 transitions
pins2lts-mc-linux64( 3/ 8), 18.110: ~9 levels ~15360 states ~56152 transitions
pins2lts-mc-linux64( 3/ 8), 19.114: ~10 levels ~30720 states ~122664 transitions
pins2lts-mc-linux64( 7/ 8), 20.972: ~12 levels ~61440 states ~287784 transitions
pins2lts-mc-linux64( 7/ 8), 24.825: ~13 levels ~122880 states ~628704 transitions
pins2lts-mc-linux64( 7/ 8), 32.326: ~14 levels ~245760 states ~1321312 transitions
pins2lts-mc-linux64( 1/ 8), 47.086: ~17 levels ~491520 states ~2527456 transitions
pins2lts-mc-linux64( 7/ 8), 77.219: ~16 levels ~983040 states ~6011472 transitions
pins2lts-mc-linux64( 2/ 8), 139.598: ~14 levels ~1966080 states ~13029840 transitions
pins2lts-mc-linux64( 7/ 8), 263.857: ~18 levels ~3932160 states ~26724592 transitions
pins2lts-mc-linux64( 2/ 8), 532.064: ~16 levels ~7864320 states ~58010592 transitions
pins2lts-mc-linux64( 3/ 8), 607.796: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 607.888:
pins2lts-mc-linux64( 0/ 8), 607.888: mean standard work distribution: 3.0% (states) 4.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 607.889:
pins2lts-mc-linux64( 0/ 8), 607.889: Explored 8608642 states 65289307 transitions, fanout: 7.584
pins2lts-mc-linux64( 0/ 8), 607.889: Total exploration time 590.810 sec (590.740 sec minimum, 590.765 sec on average)
pins2lts-mc-linux64( 0/ 8), 607.889: States per second: 14571, Transitions per second: 110508
pins2lts-mc-linux64( 0/ 8), 607.889: Ignoring proviso: 6077846
pins2lts-mc-linux64( 0/ 8), 607.889:
pins2lts-mc-linux64( 0/ 8), 607.889: Queue width: 8B, total height: 8018350, memory: 61.18MB
pins2lts-mc-linux64( 0/ 8), 607.889: Tree memory: 382.9MB, 24.1 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 607.889: Tree fill ratio (roots/leafs): 12.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 607.891: Stored 845 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 607.900: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 607.900: Est. total memory use: 444.0MB (~1085.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4057217873443720731;'/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' 'ShieldIIPtPT040BReachabilityCardinality202500==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4057217873443720731;'/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' 'ShieldIIPtPT040BReachabilityCardinality202500==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:121)
at java.base/java.lang.Thread.run(Thread.java:1583)

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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ 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="ShieldIIPt-PT-040B"
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 ShieldIIPt-PT-040B, 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 r198-tall-174894533000566"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-040B.tgz
mv ShieldIIPt-PT-040B 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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;