Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1008K
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 489K May 29 14:33 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 ShieldRVt-PT-040B-ReachabilityCardinality-2025-00
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2025-01
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2025-02
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2025-03
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2025-04
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2025-05
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2025-06
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2025-07
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2025-08
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2025-09
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2025-10
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2025-11
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2025-12
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2025-13
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2025-14
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749123682857

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-040B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-05 11:41:23] [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 11:41:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 11:41:24] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2025-06-05 11:41:24] [INFO ] Transformed 2003 places.
[2025-06-05 11:41:24] [INFO ] Transformed 2003 transitions.
[2025-06-05 11:41:24] [INFO ] Found NUPN structural information;
[2025-06-05 11:41:24] [INFO ] Parsed PT model containing 2003 places and 2003 transitions and 4726 arcs in 276 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1546 ms. (25 steps per ms) remains 10/13 properties
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 10/10 properties
[2025-06-05 11:41:25] [INFO ] Flatten gal took : 331 ms
BEST_FIRST walk for 40004 steps (8 resets) in 793 ms. (50 steps per ms) remains 10/10 properties
[2025-06-05 11:41:25] [INFO ] Flatten gal took : 108 ms
[2025-06-05 11:41:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17844014720586241926.gal : 68 ms
[2025-06-05 11:41:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8674241373308108616.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/ReachabilityCardinality17844014720586241926.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8674241373308108616.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
BEST_FIRST walk for 40004 steps (8 resets) in 1102 ms. (36 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 10/10 properties
Loading property file /tmp/ReachabilityCardinality8674241373308108616.prop.
BEST_FIRST walk for 40003 steps (8 resets) in 88 ms. (449 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 10/10 properties
// Phase 1: matrix 2003 rows 2003 cols
[2025-06-05 11:41:25] [INFO ] Computed 161 invariants in 27 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1816/1926 variables, 154/264 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1926 variables, 1816/2080 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1926 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 77/2003 variables, 7/2087 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2003 variables, 77/2164 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2003 variables, 0/2164 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :36 after 249
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :249 after 3.68688e+06
Reachability property ShieldRVt-PT-040B-ReachabilityCardinality-2025-12 is true.
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2025-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :3.68688e+06 after 3.36584e+13
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :3.36584e+13 after 3.07279e+20
At refinement iteration 8 (OVERLAPS) 2003/4006 variables, 2003/4167 constraints. Problems are: Problem set: 1 solved, 9 unsolved
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :3.07279e+20 after 2.561e+34
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :2.561e+34 after 3.40967e+62
At refinement iteration 9 (INCLUDED_ONLY) 0/4006 variables, 0/4167 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/4006 variables, 0/4167 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4006/4006 variables, and 4167 constraints, problems are : Problem set: 1 solved, 9 unsolved in 3092 ms.
Refiners :[Domain max(s): 2003/2003 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 2003/2003 constraints, PredecessorRefiner: 10/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 108/108 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/108 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1818/1926 variables, 154/262 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1926 variables, 1818/2080 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:30] [INFO ] Deduced a trap composed of 27 places in 516 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:30] [INFO ] Deduced a trap composed of 28 places in 355 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:30] [INFO ] Deduced a trap composed of 27 places in 366 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:31] [INFO ] Deduced a trap composed of 29 places in 314 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:31] [INFO ] Deduced a trap composed of 31 places in 286 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:31] [INFO ] Deduced a trap composed of 33 places in 290 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:32] [INFO ] Deduced a trap composed of 33 places in 311 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:32] [INFO ] Deduced a trap composed of 34 places in 268 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:32] [INFO ] Deduced a trap composed of 35 places in 261 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:33] [INFO ] Deduced a trap composed of 40 places in 249 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:33] [INFO ] Deduced a trap composed of 42 places in 247 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:33] [INFO ] Deduced a trap composed of 42 places in 238 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:33] [INFO ] Deduced a trap composed of 45 places in 226 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:34] [INFO ] Deduced a trap composed of 46 places in 220 ms of which 31 ms to minimize.
SMT process timed out in 8429ms, After SMT, problems are : Problem set: 1 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 108 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2003/2003 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 551 transitions
Trivial Post-agglo rules discarded 551 transitions
Performed 551 trivial Post agglomeration. Transition count delta: 551
Iterating post reduction 0 with 551 rules applied. Total rules applied 551 place count 2003 transition count 1452
Reduce places removed 551 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 553 rules applied. Total rules applied 1104 place count 1452 transition count 1450
Reduce places removed 1 places and 0 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 2 with 24 rules applied. Total rules applied 1128 place count 1451 transition count 1427
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 1151 place count 1428 transition count 1427
Performed 165 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 165 Pre rules applied. Total rules applied 1151 place count 1428 transition count 1262
Deduced a syphon composed of 165 places in 2 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 4 with 330 rules applied. Total rules applied 1481 place count 1263 transition count 1262
Discarding 245 places :
Symmetric choice reduction at 4 with 245 rule applications. Total rules 1726 place count 1018 transition count 1017
Iterating global reduction 4 with 245 rules applied. Total rules applied 1971 place count 1018 transition count 1017
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 97 Pre rules applied. Total rules applied 1971 place count 1018 transition count 920
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 2165 place count 921 transition count 920
Performed 335 Post agglomeration using F-continuation condition.Transition count delta: 335
Deduced a syphon composed of 335 places in 2 ms
Reduce places removed 335 places and 0 transitions.
Iterating global reduction 4 with 670 rules applied. Total rules applied 2835 place count 586 transition count 585
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -76
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 3037 place count 485 transition count 661
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3039 place count 484 transition count 662
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 3040 place count 484 transition count 661
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3044 place count 484 transition count 657
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 3048 place count 480 transition count 657
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 3050 place count 480 transition count 655
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 3051 place count 480 transition count 655
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3052 place count 479 transition count 654
Applied a total of 3052 rules in 506 ms. Remains 479 /2003 variables (removed 1524) and now considering 654/2003 (removed 1349) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 511 ms. Remains : 479/2003 places, 654/2003 transitions.
RANDOM walk for 40000 steps (10 resets) in 764 ms. (52 steps per ms) remains 8/9 properties
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 234 ms. (170 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 224 ms. (177 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 208 ms. (191 steps per ms) remains 8/8 properties
// Phase 1: matrix 654 rows 479 cols
[2025-06-05 11:41:35] [INFO ] Computed 161 invariants in 3 ms
[2025-06-05 11:41:35] [INFO ] State equation strengthened by 272 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/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 350/415 variables, 135/135 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 42/457 variables, 17/152 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 629/1086 variables, 457/609 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1086 variables, 267/876 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1086 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 40/1126 variables, 17/893 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1126 variables, 6/899 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1126 variables, 4/903 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1126 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 3/1129 variables, 2/905 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1129 variables, 1/906 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1129 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 4/1133 variables, 4/910 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1133 variables, 1/911 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1133 variables, 1/912 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1133 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 0/1133 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1133/1133 variables, and 912 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1688 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 479/479 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 350/415 variables, 135/135 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:37] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:37] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/415 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 42/457 variables, 17/154 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:37] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:37] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 629/1086 variables, 457/613 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1086 variables, 267/880 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1086 variables, 6/886 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:39] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:39] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:39] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1086 variables, 3/889 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:40] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:40] [INFO ] Deduced a trap along path composed of 3 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 11:41:40] [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 11:41:40] [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 11:41:40] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1086 variables, 5/894 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1086 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 40/1126 variables, 17/911 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1126 variables, 6/917 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1126 variables, 4/921 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1126 variables, 2/923 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:42] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1126 variables, 1/924 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:43] [INFO ] Deduced a trap composed of 8 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 11:41:43] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1126 variables, 2/926 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:44] [INFO ] Deduced a trap along path composed of 5 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 11:41:44] [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 11:41:44] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1126 variables, 3/929 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1126 variables, 0/929 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 3/1129 variables, 2/931 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1129 variables, 1/932 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1129 variables, 0/932 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (OVERLAPS) 4/1133 variables, 4/936 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1133 variables, 1/937 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1133 variables, 1/938 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1133 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (OVERLAPS) 0/1133 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1133/1133 variables, and 938 constraints, problems are : Problem set: 0 solved, 8 unsolved in 13897 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 479/479 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 15610ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 953 ms.
Support contains 65 out of 479 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 479/479 places, 654/654 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 479 transition count 641
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 466 transition count 640
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 465 transition count 640
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 28 place count 465 transition count 632
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 44 place count 457 transition count 632
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 104 place count 427 transition count 602
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 122 place count 418 transition count 610
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 418 transition count 609
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 418 transition count 609
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 127 place count 415 transition count 606
Applied a total of 127 rules in 88 ms. Remains 415 /479 variables (removed 64) and now considering 606/654 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 415/479 places, 606/654 transitions.
RANDOM walk for 40000 steps (8 resets) in 379 ms. (105 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 188 ms. (211 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 232 ms. (171 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 166 ms. (239 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (9 resets) in 214 ms. (186 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (9 resets) in 154 ms. (258 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 161350 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 8
Probabilistic random walk after 161350 steps, saw 93359 distinct states, run finished after 3006 ms. (steps per millisecond=53 ) properties seen :0
// Phase 1: matrix 606 rows 415 cols
[2025-06-05 11:41:55] [INFO ] Computed 161 invariants in 4 ms
[2025-06-05 11:41:55] [INFO ] State equation strengthened by 259 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/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 298/363 variables, 135/135 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 12/375 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 576/951 variables, 375/516 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/951 variables, 255/771 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/951 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 67/1018 variables, 38/809 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1018 variables, 19/828 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1018 variables, 4/832 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1018 variables, 0/832 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 3/1021 variables, 2/834 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1021 variables, 1/835 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1021 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 0/1021 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1021/1021 variables, and 835 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1234 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 415/415 constraints, ReadFeed: 259/259 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 298/363 variables, 135/135 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:57] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:57] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:57] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 12/375 variables, 6/144 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 576/951 variables, 375/519 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/951 variables, 255/774 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/951 variables, 4/778 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:58] [INFO ] Deduced a trap along path composed of 4 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 11:41:58] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/951 variables, 2/780 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:59] [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 11:41:59] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/951 variables, 2/782 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/951 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 67/1018 variables, 38/820 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1018 variables, 19/839 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1018 variables, 4/843 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1018 variables, 4/847 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:02] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:02] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1018 variables, 2/849 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1018 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 3/1021 variables, 2/851 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1021 variables, 1/852 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:09] [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 11:42:09] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1021 variables, 2/854 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1021 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (OVERLAPS) 0/1021 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1021/1021 variables, and 854 constraints, problems are : Problem set: 0 solved, 8 unsolved in 16383 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 415/415 constraints, ReadFeed: 259/259 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 17640ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2957 ms.
Support contains 65 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 606/606 transitions.
Applied a total of 0 rules in 11 ms. Remains 415 /415 variables (removed 0) and now considering 606/606 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 415/415 places, 606/606 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 606/606 transitions.
Applied a total of 0 rules in 13 ms. Remains 415 /415 variables (removed 0) and now considering 606/606 (removed 0) transitions.
[2025-06-05 11:42:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:42:16] [INFO ] Implicit Places using invariants in 205 ms returned []
[2025-06-05 11:42:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:42:16] [INFO ] State equation strengthened by 259 read => feed constraints.
[2025-06-05 11:42:17] [INFO ] Implicit Places using invariants and state equation in 1155 ms returned []
Implicit Place search using SMT with State Equation took 1372 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:42:17] [INFO ] Redundant transitions in 47 ms returned []
Running 596 sub problems to find dead transitions.
[2025-06-05 11:42:17] [INFO ] Invariant cache hit.
[2025-06-05 11:42:17] [INFO ] State equation strengthened by 259 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (OVERLAPS) 7/415 variables, 129/161 constraints. Problems are: Problem set: 0 solved, 596 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:28] [INFO ] Deduced a trap composed of 7 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 11:42:28] [INFO ] Deduced a trap composed of 12 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 11:42:28] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:28] [INFO ] Deduced a trap composed of 12 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 11:42:28] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:29] [INFO ] Deduced a trap composed of 11 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 11:42:29] [INFO ] Deduced a trap composed of 11 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 11:42:29] [INFO ] Deduced a trap composed of 11 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 11:42:29] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/415 variables, 9/170 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/415 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 5 (OVERLAPS) 606/1021 variables, 415/585 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1021 variables, 259/844 constraints. Problems are: Problem set: 0 solved, 596 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1021/1021 variables, and 844 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 415/415 constraints, ReadFeed: 259/259 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 596 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (OVERLAPS) 7/415 variables, 129/161 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/415 variables, 9/170 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/415 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 5 (OVERLAPS) 606/1021 variables, 415/585 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1021 variables, 259/844 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1021 variables, 596/1440 constraints. Problems are: Problem set: 0 solved, 596 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1021/1021 variables, and 1440 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 415/415 constraints, ReadFeed: 259/259 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60195ms problems are : Problem set: 0 solved, 596 unsolved
Search for dead transitions found 0 dead transitions in 60205ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61654 ms. Remains : 415/415 places, 606/606 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 106 edges and 415 vertex of which 2 / 415 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1386 edges and 414 vertex of which 413 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 105 edges and 412 vertex of which 2 / 412 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 411 transition count 602
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 410 transition count 599
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 410 transition count 598
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 409 transition count 598
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 407 transition count 597
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 19 place count 407 transition count 593
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 3 with 19 rules applied. Total rules applied 38 place count 407 transition count 574
Partial Free-agglomeration rule applied 21 times.
Drop transitions (Partial Free agglomeration) removed 21 transitions
Iterating global reduction 3 with 21 rules applied. Total rules applied 59 place count 407 transition count 574
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 76 place count 407 transition count 557
Applied a total of 76 rules in 139 ms. Remains 407 /415 variables (removed 8) and now considering 557/606 (removed 49) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 557 rows 407 cols
[2025-06-05 11:43:18] [INFO ] Computed 157 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 11:43:18] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 11:43:18] [INFO ] [Nat]Absence check using 157 positive place invariants in 22 ms returned sat
[2025-06-05 11:43:18] [INFO ] After 367ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2025-06-05 11:43:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 11:43:18] [INFO ] After 208ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:43:19] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 2 ms to minimize.
[2025-06-05 11:43:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:43:19] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 3 ms to minimize.
[2025-06-05 11:43:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:43:19] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 2 ms to minimize.
[2025-06-05 11:43:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:43:19] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 8 ms to minimize.
[2025-06-05 11:43:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
TRAPS : Iteration 2
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:43:19] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
[2025-06-05 11:43:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
TRAPS : Iteration 3
[2025-06-05 11:43:20] [INFO ] After 1733ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2025-06-05 11:43:20] [INFO ] After 2478ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2025-06-05 11:43:20] [INFO ] Flatten gal took : 35 ms
[2025-06-05 11:43:20] [INFO ] Flatten gal took : 31 ms
[2025-06-05 11:43:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18439258876283194618.gal : 6 ms
[2025-06-05 11:43:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8097827424740046508.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/ReachabilityCardinality18439258876283194618.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8097827424740046508.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/ReachabilityCardinality8097827424740046508.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 11
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :11 after 23
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :23 after 113
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :113 after 653
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :653 after 473865
Reachability property ShieldRVt-PT-040B-ReachabilityCardinality-2025-06 is true.
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :3.07065e+08 after 6.07616e+08
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :6.07616e+08 after 6.07637e+08
Detected timeout of ITS tools.
[2025-06-05 11:43:35] [INFO ] Flatten gal took : 27 ms
[2025-06-05 11:43:35] [INFO ] Applying decomposition
[2025-06-05 11:43:35] [INFO ] Flatten gal took : 25 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/graph9171418199100166950.txt' '-o' '/tmp/graph9171418199100166950.bin' '-w' '/tmp/graph9171418199100166950.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9171418199100166950.bin' '-l' '-1' '-v' '-w' '/tmp/graph9171418199100166950.weights' '-q' '0' '-e' '0.001'
[2025-06-05 11:43:36] [INFO ] Decomposing Gal with order
[2025-06-05 11:43:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:43:36] [INFO ] Removed a total of 521 redundant transitions.
[2025-06-05 11:43:36] [INFO ] Flatten gal took : 94 ms
[2025-06-05 11:43:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 45 ms.
[2025-06-05 11:43:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8867965271151779254.gal : 9 ms
[2025-06-05 11:43:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2713132870162271711.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/ReachabilityCardinality8867965271151779254.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2713132870162271711.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 ...307
Loading property file /tmp/ReachabilityCardinality2713132870162271711.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :2 after 16
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :16 after 28
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :28 after 460
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :460 after 1.27147e+10
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,4.09202e+58,0.683789,33512,697,28,57763,229,1071,125055,73,518,0
Total reachable state count : 4.092017988301923061183551572557387570436e+58

Verifying 7 reachability properties.
Reachability property ShieldRVt-PT-040B-ReachabilityCardinality-2025-00 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-040B-ReachabilityCardinality-2025-00,5.74072e+55,0.686647,33512,206,19,57763,229,1086,125055,79,518,280
Reachability property ShieldRVt-PT-040B-ReachabilityCardinality-2025-02 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-040B-ReachabilityCardinality-2025-02,2.06668e+57,0.686973,33512,273,22,57763,229,1086,125055,79,518,280
Invariant property ShieldRVt-PT-040B-ReachabilityCardinality-2025-03 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-040B-ReachabilityCardinality-2025-03,4.29734e+57,0.6907,33512,332,21,57763,229,1110,125055,81,518,1194
Reachability property ShieldRVt-PT-040B-ReachabilityCardinality-2025-07 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-040B-ReachabilityCardinality-2025-07,9.18523e+56,0.691049,33512,335,22,57763,229,1111,125055,81,518,1204
Invariant property ShieldRVt-PT-040B-ReachabilityCardinality-2025-08 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-040B-ReachabilityCardinality-2025-08,1.63134e+56,0.693086,33512,334,22,57763,229,1121,125055,82,518,1703
Reachability property ShieldRVt-PT-040B-ReachabilityCardinality-2025-09 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-040B-ReachabilityCardinality-2025-09,1.13021e+56,0.694898,33512,235,22,57763,229,1143,125055,83,518,2263
Invariant property ShieldRVt-PT-040B-ReachabilityCardinality-2025-11 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-040B-ReachabilityCardinality-2025-11,0,0.695633,33512,1,0,57763,229,1153,125055,83,518,2450
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2025-11 TRUE TECHNIQUES OVER_APPROXIMATION
Over-approximation ignoring read arcs solved -1 properties in 19096 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-05 11:43:37] [INFO ] Flatten gal took : 41 ms
[2025-06-05 11:43:37] [INFO ] Applying decomposition
[2025-06-05 11:43:37] [INFO ] Flatten gal took : 39 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/graph16310800690219485555.txt' '-o' '/tmp/graph16310800690219485555.bin' '-w' '/tmp/graph16310800690219485555.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16310800690219485555.bin' '-l' '-1' '-v' '-w' '/tmp/graph16310800690219485555.weights' '-q' '0' '-e' '0.001'
[2025-06-05 11:43:37] [INFO ] Decomposing Gal with order
[2025-06-05 11:43:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:43:37] [INFO ] Removed a total of 240 redundant transitions.
[2025-06-05 11:43:37] [INFO ] Flatten gal took : 92 ms
[2025-06-05 11:43:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2025-06-05 11:43:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17434389503688997900.gal : 20 ms
[2025-06-05 11:43:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5880094010780230785.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/ReachabilityCardinality17434389503688997900.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5880094010780230785.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/ReachabilityCardinality5880094010780230785.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :1 after 341
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :341 after 1.49229e+07
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :1.49229e+07 after 1.60757e+94
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :1.60757e+94 after 4.61128e+95
Detected timeout of ITS tools.
[2025-06-05 12:13:37] [INFO ] Flatten gal took : 44 ms
Using solver Z3 to compute partial order matrices.
[2025-06-05 12:13:37] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin7553275289915681664
[2025-06-05 12:13:37] [INFO ] Flatten gal took : 36 ms
[2025-06-05 12:13:37] [INFO ] Computing symmetric may disable matrix : 606 transitions.
[2025-06-05 12:13:37] [INFO ] Computation of Complete disable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:13:37] [INFO ] Computing symmetric may enable matrix : 606 transitions.
[2025-06-05 12:13:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph7315049785823623831.txt' '-o' '/tmp/graph7315049785823623831.bin' '-w' '/tmp/graph7315049785823623831.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7315049785823623831.bin' '-l' '-1' '-v' '-w' '/tmp/graph7315049785823623831.weights' '-q' '0' '-e' '0.001'
[2025-06-05 12:13:38] [INFO ] Decomposing Gal with order
[2025-06-05 12:13:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 12:13:38] [INFO ] Removed a total of 872 redundant transitions.
[2025-06-05 12:13:38] [INFO ] Flatten gal took : 34 ms
[2025-06-05 12:13:38] [INFO ] Computing Do-Not-Accords matrix : 606 transitions.
[2025-06-05 12:13:38] [INFO ] Computation of Completed DNA matrix. took 42 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:13:38] [INFO ] Built C files in 184ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7553275289915681664
Running compilation step : cd /tmp/ltsmin7553275289915681664;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '102' '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'
[2025-06-05 12:13:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 356 labels/synchronizations in 74 ms.
[2025-06-05 12:13:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1029919942092510355.gal : 5 ms
[2025-06-05 12:13:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9050925358559175157.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/ReachabilityCardinality1029919942092510355.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9050925358559175157.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 ...307
Loading property file /tmp/ReachabilityCardinality9050925358559175157.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :2 after 16
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :16 after 24
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :24 after 460
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :460 after 1.13728e+07
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.29841e+59,0.902227,44004,719,80,87088,535,1003,159177,132,2497,0
Total reachable state count : 3.298410059569368377852000942042123058572e+59

Verifying 7 reachability properties.
Reachability property ShieldRVt-PT-040B-ReachabilityCardinality-2025-00 is true.
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-040B-ReachabilityCardinality-2025-00,4.0499e+55,0.905647,44260,199,35,87088,535,1017,159177,138,2497,233
Reachability property ShieldRVt-PT-040B-ReachabilityCardinality-2025-02 is true.
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-040B-ReachabilityCardinality-2025-02,3.20679e+58,0.906026,44260,312,48,87088,535,1017,159177,138,2497,233
Invariant property ShieldRVt-PT-040B-ReachabilityCardinality-2025-03 does not hold.
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-040B-ReachabilityCardinality-2025-03,3.48938e+58,0.910534,44260,373,42,87088,535,1044,159177,142,2497,1381
Reachability property ShieldRVt-PT-040B-ReachabilityCardinality-2025-06 is true.
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-040B-ReachabilityCardinality-2025-06,8.55143e+58,0.911076,44260,280,42,87088,535,1045,159177,143,2497,1437
Reachability property ShieldRVt-PT-040B-ReachabilityCardinality-2025-07 is true.
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-040B-ReachabilityCardinality-2025-07,2.85048e+58,0.91146,44260,376,49,87088,535,1046,159177,143,2497,1453
Invariant property ShieldRVt-PT-040B-ReachabilityCardinality-2025-08 does not hold.
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-040B-ReachabilityCardinality-2025-08,1.24722e+57,0.914262,44260,364,42,87088,535,1056,159177,143,2497,1954
Reachability property ShieldRVt-PT-040B-ReachabilityCardinality-2025-09 is true.
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-040B-ReachabilityCardinality-2025-09,7.7766e+55,0.916607,44260,285,44,87088,535,1078,159177,144,2497,2481
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1935102 ms.

BK_STOP 1749125619146

--------------------
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="ShieldRVt-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 ShieldRVt-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 r212-tall-174901994100318"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-040B.tgz
mv ShieldRVt-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 ;