Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 800K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.7K 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.3K 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 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.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 364K 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-030B-ReachabilityCardinality-2025-00
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2025-01
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2025-02
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2025-03
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2025-04
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2025-05
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2025-06
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2025-07
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2025-08
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2025-09
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2025-10
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2025-11
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2025-12
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2025-13
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2025-14
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749115628110

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-030B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-05 09:27:09] [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 09:27:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 09:27:09] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2025-06-05 09:27:09] [INFO ] Transformed 1503 places.
[2025-06-05 09:27:09] [INFO ] Transformed 1503 transitions.
[2025-06-05 09:27:09] [INFO ] Found NUPN structural information;
[2025-06-05 09:27:09] [INFO ] Parsed PT model containing 1503 places and 1503 transitions and 3546 arcs in 358 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1834 ms. (21 steps per ms) remains 9/15 properties
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 445 ms. (89 steps per ms) remains 9/9 properties
[2025-06-05 09:27:10] [INFO ] Flatten gal took : 293 ms
BEST_FIRST walk for 40004 steps (8 resets) in 332 ms. (120 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 9/9 properties
[2025-06-05 09:27:10] [INFO ] Flatten gal took : 170 ms
BEST_FIRST walk for 40004 steps (8 resets) in 650 ms. (61 steps per ms) remains 9/9 properties
[2025-06-05 09:27:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality269140515227936177.gal : 73 ms
[2025-06-05 09:27:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11359159750927732627.prop : 2 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/ReachabilityCardinality269140515227936177.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11359159750927732627.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 9/9 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 ...328
BEST_FIRST walk for 40002 steps (8 resets) in 130 ms. (305 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 159 ms. (250 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 9/9 properties
Loading property file /tmp/ReachabilityCardinality11359159750927732627.prop.
// Phase 1: matrix 1503 rows 1503 cols
[2025-06-05 09:27:11] [INFO ] Computed 121 invariants in 29 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/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1377/1503 variables, 121/247 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1503 variables, 1377/1624 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1503 variables, 0/1624 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :36 after 239
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :239 after 2.01901e+06
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :2.01901e+06 after 9.61669e+12
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :9.61669e+12 after 3.00562e+26
At refinement iteration 5 (OVERLAPS) 1503/3006 variables, 1503/3127 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3006 variables, 0/3127 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/3006 variables, 0/3127 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3006/3006 variables, and 3127 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2438 ms.
Refiners :[Domain max(s): 1503/1503 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 1503/1503 constraints, PredecessorRefiner: 9/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1377/1503 variables, 121/247 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1503 variables, 1377/1624 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:14] [INFO ] Deduced a trap composed of 19 places in 344 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:15] [INFO ] Deduced a trap composed of 23 places in 364 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:15] [INFO ] Deduced a trap composed of 25 places in 329 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:15] [INFO ] Deduced a trap composed of 27 places in 303 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:16] [INFO ] Deduced a trap composed of 21 places in 300 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:16] [INFO ] Deduced a trap composed of 20 places in 290 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:16] [INFO ] Deduced a trap composed of 27 places in 295 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:16] [INFO ] Deduced a trap composed of 27 places in 255 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:17] [INFO ] Deduced a trap composed of 28 places in 299 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:17] [INFO ] Deduced a trap composed of 30 places in 249 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:17] [INFO ] Deduced a trap composed of 31 places in 251 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:18] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:18] [INFO ] Deduced a trap composed of 33 places in 258 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:18] [INFO ] Deduced a trap composed of 27 places in 245 ms of which 31 ms to minimize.
SMT process timed out in 7576ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 126 out of 1503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 368 transitions
Trivial Post-agglo rules discarded 368 transitions
Performed 368 trivial Post agglomeration. Transition count delta: 368
Iterating post reduction 0 with 368 rules applied. Total rules applied 368 place count 1503 transition count 1135
Reduce places removed 368 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 370 rules applied. Total rules applied 738 place count 1135 transition count 1133
Reduce places removed 1 places and 0 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Iterating post reduction 2 with 34 rules applied. Total rules applied 772 place count 1134 transition count 1100
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 805 place count 1101 transition count 1100
Performed 128 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 128 Pre rules applied. Total rules applied 805 place count 1101 transition count 972
Deduced a syphon composed of 128 places in 2 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 4 with 256 rules applied. Total rules applied 1061 place count 973 transition count 972
Discarding 165 places :
Symmetric choice reduction at 4 with 165 rule applications. Total rules 1226 place count 808 transition count 807
Iterating global reduction 4 with 165 rules applied. Total rules applied 1391 place count 808 transition count 807
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 62 Pre rules applied. Total rules applied 1391 place count 808 transition count 745
Deduced a syphon composed of 62 places in 3 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 1515 place count 746 transition count 745
Performed 243 Post agglomeration using F-continuation condition.Transition count delta: 243
Deduced a syphon composed of 243 places in 3 ms
Reduce places removed 243 places and 0 transitions.
Iterating global reduction 4 with 486 rules applied. Total rules applied 2001 place count 503 transition count 502
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 65 places in 2 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 4 with 130 rules applied. Total rules applied 2131 place count 438 transition count 540
Free-agglomeration rule applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 2141 place count 438 transition count 530
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2151 place count 428 transition count 530
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 2155 place count 428 transition count 526
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 2158 place count 428 transition count 526
Applied a total of 2158 rules in 370 ms. Remains 428 /1503 variables (removed 1075) and now considering 526/1503 (removed 977) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 376 ms. Remains : 428/1503 places, 526/1503 transitions.
RANDOM walk for 40000 steps (9 resets) in 652 ms. (61 steps per ms) remains 8/9 properties
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 213 ms. (186 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (9 resets) in 225 ms. (177 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 201 ms. (198 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 163 ms. (243 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 262 ms. (152 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 237 ms. (168 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 7/8 properties
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 526 rows 428 cols
[2025-06-05 09:27:19] [INFO ] Computed 121 invariants in 2 ms
[2025-06-05 09:27:19] [INFO ] State equation strengthened by 172 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/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 211/315 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 113/428 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 526/954 variables, 428/549 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/954 variables, 172/721 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/954 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/954 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 954/954 variables, and 721 constraints, problems are : Problem set: 0 solved, 7 unsolved in 770 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 428/428 constraints, ReadFeed: 172/172 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 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 211/315 variables, 69/69 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 09:27:20] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:20] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:20] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:21] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:21] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:21] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:21] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:21] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:21] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:21] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:21] [INFO ] Deduced a trap composed of 5 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 09:27:21] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:21] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:21] [INFO ] Deduced a trap composed of 10 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 09:27:21] [INFO ] Deduced a trap composed of 12 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 09:27:21] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:21] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 17/86 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 09:27:22] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:22] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:22] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:22] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:22] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:22] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 113/428 variables, 52/144 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 09:27:22] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:22] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:22] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:22] [INFO ] Deduced a trap composed of 14 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 09:27:22] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:22] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:23] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 7/151 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 526/954 variables, 428/579 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/954 variables, 172/751 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/954 variables, 6/757 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 09:27:24] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:24] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:24] [INFO ] Deduced a trap composed of 14 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 09:27:25] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:25] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:25] [INFO ] Deduced a trap composed of 10 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 09:27:25] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:25] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/954 variables, 8/765 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 09:27:26] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/954 variables, 1/766 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 09:27:26] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:26] [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 09:27:27] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:27] [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 09:27:27] [INFO ] Deduced a trap along path composed of 6 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:27] [INFO ] Deduced a trap along path composed of 4 places in 16 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:27] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:27] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/954 variables, 8/774 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 09:27:28] [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 09:27:28] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/954 variables, 2/776 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/954 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/954 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 954/954 variables, and 776 constraints, problems are : Problem set: 0 solved, 7 unsolved in 9727 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 428/428 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 7/6 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 10/10 constraints]
After SMT, in 10530ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2515 ms.
Support contains 104 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 526/526 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 428 transition count 521
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 423 transition count 519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 421 transition count 519
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 14 place count 421 transition count 513
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 26 place count 415 transition count 513
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 27 place count 414 transition count 512
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 414 transition count 512
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 50 place count 403 transition count 501
Renaming transitions due to excessive name length > 1024 char.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 58 place count 399 transition count 504
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 399 transition count 503
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 398 transition count 503
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 61 place count 397 transition count 502
Applied a total of 61 rules in 63 ms. Remains 397 /428 variables (removed 31) and now considering 502/526 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 397/428 places, 502/526 transitions.
RANDOM walk for 40000 steps (9 resets) in 306 ms. (130 steps per ms) remains 4/7 properties
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 154 ms. (258 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
// Phase 1: matrix 502 rows 397 cols
[2025-06-05 09:27:33] [INFO ] Computed 121 invariants in 5 ms
[2025-06-05 09:27:33] [INFO ] State equation strengthened by 153 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/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 177/260 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 107/367 variables, 46/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 473/840 variables, 367/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/840 variables, 146/620 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/840 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 50/890 variables, 24/644 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/890 variables, 11/655 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/890 variables, 7/662 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/890 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/892 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/892 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 7/899 variables, 6/669 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/899 variables, 2/671 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/899 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/899 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 899/899 variables, and 671 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2242 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 397/397 constraints, ReadFeed: 153/153 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 177/260 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:35] [INFO ] Deduced a trap composed of 8 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 09:27:35] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:35] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:35] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:35] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:35] [INFO ] Deduced a trap composed of 10 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 09:27:35] [INFO ] Deduced a trap composed of 9 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 09:27:35] [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 09:27:36] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:36] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:36] [INFO ] Deduced a trap composed of 7 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 09:27:36] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:36] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 13/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 107/367 variables, 46/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:36] [INFO ] Deduced a trap composed of 5 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 09:27:36] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:36] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:36] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 473/840 variables, 367/491 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/840 variables, 146/637 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/840 variables, 3/640 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:37] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:37] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:37] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:37] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:37] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:37] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/840 variables, 6/646 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:38] [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 09:27:38] [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 09:27:38] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:38] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:38] [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 09:27:38] [INFO ] Deduced a trap along path composed of 6 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:38] [INFO ] Deduced a trap along path composed of 4 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 09:27:39] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/840 variables, 8/654 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/840 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 50/890 variables, 24/678 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/890 variables, 11/689 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/890 variables, 7/696 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:40] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:40] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 8 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/890 variables, 2/698 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/890 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/892 variables, 1/699 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/892 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 7/899 variables, 6/705 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/899 variables, 2/707 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/899 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/899 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 899/899 variables, and 707 constraints, problems are : Problem set: 0 solved, 4 unsolved in 7161 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 397/397 constraints, ReadFeed: 153/153 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 10/10 constraints]
After SMT, in 9431ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 890 ms.
Support contains 83 out of 397 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 397/397 places, 502/502 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 397 transition count 494
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 389 transition count 494
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 16 place count 389 transition count 488
Deduced a syphon composed of 6 places in 6 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 28 place count 383 transition count 488
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 60 place count 367 transition count 472
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 68 place count 363 transition count 477
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 362 transition count 476
Applied a total of 69 rules in 61 ms. Remains 362 /397 variables (removed 35) and now considering 476/502 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 362/397 places, 476/502 transitions.
RANDOM walk for 40000 steps (9 resets) in 241 ms. (165 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 169 ms. (235 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 153 ms. (259 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 285514 steps, run timeout after 3010 ms. (steps per millisecond=94 ) properties seen :0 out of 4
Probabilistic random walk after 285514 steps, saw 119756 distinct states, run finished after 3017 ms. (steps per millisecond=94 ) properties seen :0
// Phase 1: matrix 476 rows 362 cols
[2025-06-05 09:27:46] [INFO ] Computed 121 invariants in 1 ms
[2025-06-05 09:27:46] [INFO ] State equation strengthened by 163 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 159/242 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 92/334 variables, 46/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 449/783 variables, 334/441 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/783 variables, 160/601 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/783 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 49/832 variables, 24/625 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/832 variables, 12/637 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/832 variables, 3/640 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/832 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 6/838 variables, 4/644 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/838 variables, 2/646 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/838 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/838 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 838/838 variables, and 646 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1422 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 362/362 constraints, ReadFeed: 163/163 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 159/242 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:48] [INFO ] Deduced a trap composed of 8 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 09:27:48] [INFO ] Deduced a trap composed of 9 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 09:27:48] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:48] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:48] [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 09:27:48] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:48] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:48] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:48] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:49] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 92/334 variables, 46/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:49] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:49] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:49] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:49] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 449/783 variables, 334/455 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/783 variables, 160/615 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/783 variables, 3/618 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:49] [INFO ] Deduced a trap along path composed of 3 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 09:27:50] [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 09:27:50] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:50] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:50] [INFO ] Deduced a trap along path composed of 6 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 09:27:50] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/783 variables, 6/624 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:50] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/783 variables, 1/625 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:51] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/783 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:52] [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 09:27:52] [INFO ] Deduced a trap along path composed of 6 places in 16 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/783 variables, 2/628 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/783 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 49/832 variables, 24/652 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/832 variables, 12/664 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/832 variables, 3/667 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/832 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 6/838 variables, 4/671 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/838 variables, 2/673 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/838 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/838 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 838/838 variables, and 673 constraints, problems are : Problem set: 0 solved, 4 unsolved in 6102 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 362/362 constraints, ReadFeed: 163/163 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 7540ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1799 ms.
Support contains 83 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 476/476 transitions.
Applied a total of 0 rules in 9 ms. Remains 362 /362 variables (removed 0) and now considering 476/476 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 362/362 places, 476/476 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 476/476 transitions.
Applied a total of 0 rules in 8 ms. Remains 362 /362 variables (removed 0) and now considering 476/476 (removed 0) transitions.
[2025-06-05 09:27:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 09:27:56] [INFO ] Implicit Places using invariants in 181 ms returned []
[2025-06-05 09:27:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 09:27:56] [INFO ] State equation strengthened by 163 read => feed constraints.
[2025-06-05 09:27:57] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 09:27:57] [INFO ] Redundant transitions in 41 ms returned []
Running 470 sub problems to find dead transitions.
[2025-06-05 09:27:57] [INFO ] Invariant cache hit.
[2025-06-05 09:27:57] [INFO ] State equation strengthened by 163 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 6/362 variables, 107/121 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:28:04] [INFO ] Deduced a trap composed of 8 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 09:28:05] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:28:05] [INFO ] Deduced a trap composed of 7 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 09:28:05] [INFO ] Deduced a trap composed of 9 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 09:28:05] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:28:05] [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 09:28:05] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:28:06] [INFO ] Deduced a trap composed of 7 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 09:28:06] [INFO ] Deduced a trap composed of 10 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 09:28:06] [INFO ] Deduced a trap composed of 9 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 09:28:06] [INFO ] Deduced a trap composed of 7 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 09:28:07] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 12/133 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (OVERLAPS) 476/838 variables, 362/495 constraints. Problems are: Problem set: 0 solved, 470 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/838 variables, 163/658 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/838 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 838/838 variables, and 658 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 362/362 constraints, ReadFeed: 163/163 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 470 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 6/362 variables, 107/121 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 12/133 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:28:31] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 6 (OVERLAPS) 476/838 variables, 362/496 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/838 variables, 163/659 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/838 variables, 470/1129 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:28:49] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/838 variables, 1/1130 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:28:57] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:28:57] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 838/838 variables, and 1132 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 362/362 constraints, ReadFeed: 163/163 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60160ms problems are : Problem set: 0 solved, 470 unsolved
Search for dead transitions found 0 dead transitions in 60163ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61011 ms. Remains : 362/362 places, 476/476 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 1110 edges and 362 vertex of which 361 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 18 place count 361 transition count 459
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 31 place count 361 transition count 459
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 39 place count 361 transition count 451
Applied a total of 39 rules in 28 ms. Remains 361 /362 variables (removed 1) and now considering 451/476 (removed 25) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 451 rows 361 cols
[2025-06-05 09:28:57] [INFO ] Computed 120 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 09:28:57] [INFO ] After 63ms 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 09:28:57] [INFO ] [Nat]Absence check using 120 positive place invariants in 15 ms returned sat
[2025-06-05 09:28:57] [INFO ] After 234ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2025-06-05 09:28:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 09:28:57] [INFO ] After 118ms SMT Verify possible using 1 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 09:28:57] [INFO ] Deduced a trap composed of 6 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 09:28:58] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 2 ms to minimize.
[2025-06-05 09:28:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 150 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:28:58] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 3 ms to minimize.
[2025-06-05 09:28:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:28:58] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:28:58] [INFO ] Deduced a trap composed of 8 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 09:28:58] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:28:58] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 3 ms to minimize.
[2025-06-05 09:28:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 323 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:28:58] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 4 ms to minimize.
[2025-06-05 09:28:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:28:58] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 3 ms to minimize.
[2025-06-05 09:28:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
TRAPS : Iteration 2
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:28:59] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 3 ms to minimize.
[2025-06-05 09:28:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:28:59] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
[2025-06-05 09:28:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:28:59] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 2 ms to minimize.
[2025-06-05 09:28:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
TRAPS : Iteration 3
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:28:59] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 3 ms to minimize.
[2025-06-05 09:28:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:28:59] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 4 ms to minimize.
[2025-06-05 09:28:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
TRAPS : Iteration 4
[2025-06-05 09:28:59] [INFO ] After 2070ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2025-06-05 09:28:59] [INFO ] After 2517ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2025-06-05 09:28:59] [INFO ] Flatten gal took : 28 ms
[2025-06-05 09:28:59] [INFO ] Flatten gal took : 27 ms
[2025-06-05 09:28:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14220850526860287759.gal : 4 ms
[2025-06-05 09:28:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17075708228424090675.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/ReachabilityCardinality14220850526860287759.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17075708228424090675.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 ...330
Loading property file /tmp/ReachabilityCardinality17075708228424090675.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 9
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :9 after 79
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :79 after 235
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :235 after 5617
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :5617 after 7.78378e+06
Detected timeout of ITS tools.
[2025-06-05 09:29:15] [INFO ] Flatten gal took : 24 ms
[2025-06-05 09:29:15] [INFO ] Applying decomposition
[2025-06-05 09:29:15] [INFO ] Flatten gal took : 55 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/graph16617590570514065378.txt' '-o' '/tmp/graph16617590570514065378.bin' '-w' '/tmp/graph16617590570514065378.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16617590570514065378.bin' '-l' '-1' '-v' '-w' '/tmp/graph16617590570514065378.weights' '-q' '0' '-e' '0.001'
[2025-06-05 09:29:15] [INFO ] Decomposing Gal with order
[2025-06-05 09:29:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 09:29:15] [INFO ] Removed a total of 353 redundant transitions.
[2025-06-05 09:29:15] [INFO ] Flatten gal took : 81 ms
[2025-06-05 09:29:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 20 ms.
[2025-06-05 09:29:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9356426245221971647.gal : 7 ms
[2025-06-05 09:29:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18435581235724552207.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/ReachabilityCardinality9356426245221971647.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18435581235724552207.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/ReachabilityCardinality18435581235724552207.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 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 131
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :131 after 1171
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :1171 after 589681
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :2.27822e+13 after 1.49488e+19
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,2.86235e+49,0.979022,44532,863,49,85161,425,1094,179076,101,1613,0
Total reachable state count : 2.862346774618225624487231799095750586094e+49

Verifying 4 reachability properties.
Invariant property ShieldRVt-PT-030B-ReachabilityCardinality-2025-01 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-030B-ReachabilityCardinality-2025-01,1.37545e+48,0.986531,44532,688,47,85161,425,1146,179076,110,1613,853
Invariant property ShieldRVt-PT-030B-ReachabilityCardinality-2025-02 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-030B-ReachabilityCardinality-2025-02,4.20869e+47,0.993124,44532,842,48,85161,425,1174,179076,111,1613,1915
Invariant property ShieldRVt-PT-030B-ReachabilityCardinality-2025-10 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-030B-ReachabilityCardinality-2025-10,0,0.99381,44532,1,0,85161,425,1176,179076,111,1613,2079
Invariant property ShieldRVt-PT-030B-ReachabilityCardinality-2025-12 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-030B-ReachabilityCardinality-2025-12,1.69291e+46,1.01075,44532,1025,41,85161,425,1227,179076,113,1613,4178
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2025-10 TRUE TECHNIQUES OVER_APPROXIMATION
Over-approximation ignoring read arcs solved -1 properties in 19171 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-05 09:29:16] [INFO ] Flatten gal took : 35 ms
[2025-06-05 09:29:16] [INFO ] Applying decomposition
[2025-06-05 09:29:16] [INFO ] Flatten gal took : 32 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/graph15899165721286733857.txt' '-o' '/tmp/graph15899165721286733857.bin' '-w' '/tmp/graph15899165721286733857.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15899165721286733857.bin' '-l' '-1' '-v' '-w' '/tmp/graph15899165721286733857.weights' '-q' '0' '-e' '0.001'
[2025-06-05 09:29:16] [INFO ] Decomposing Gal with order
[2025-06-05 09:29:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 09:29:16] [INFO ] Removed a total of 180 redundant transitions.
[2025-06-05 09:29:16] [INFO ] Flatten gal took : 76 ms
[2025-06-05 09:29:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2025-06-05 09:29:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12860229532189326751.gal : 15 ms
[2025-06-05 09:29:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9288334922276529017.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/ReachabilityCardinality12860229532189326751.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9288334922276529017.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/ReachabilityCardinality9288334922276529017.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 79591
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :79591 after 235621
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :235621 after 1.95119e+07
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :3.19657e+73 after 3.69185e+73
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :3.69185e+73 after 4.99358e+73
Invariant property ShieldRVt-PT-030B-ReachabilityCardinality-2025-12 does not hold.
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2025-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :4.99358e+73 after 4.01442e+76
Detected timeout of ITS tools.
[2025-06-05 09:59:19] [INFO ] Flatten gal took : 317 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14773451953029296256
[2025-06-05 09:59:19] [INFO ] Applying decomposition
[2025-06-05 09:59:20] [INFO ] Computing symmetric may disable matrix : 476 transitions.
[2025-06-05 09:59:20] [INFO ] Flatten gal took : 290 ms
[2025-06-05 09:59:20] [INFO ] Computation of Complete disable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 09:59:20] [INFO ] Computing symmetric may enable matrix : 476 transitions.
[2025-06-05 09:59:20] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 09:59:21] [INFO ] Computing Do-Not-Accords matrix : 476 transitions.
[2025-06-05 09:59:21] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 09:59:22] [INFO ] Built C files in 2298ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14773451953029296256
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/graph1220133991481378123.txt' '-o' '/tmp/graph1220133991481378123.bin' '-w' '/tmp/graph1220133991481378123.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1220133991481378123.bin' '-l' '-1' '-v' '-w' '/tmp/graph1220133991481378123.weights' '-q' '0' '-e' '0.001'
Running compilation step : cd /tmp/ltsmin14773451953029296256;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' '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 09:59:22] [INFO ] Decomposing Gal with order
[2025-06-05 09:59:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 09:59:22] [INFO ] Removed a total of 535 redundant transitions.
[2025-06-05 09:59:22] [INFO ] Flatten gal took : 113 ms
[2025-06-05 09:59:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 278 labels/synchronizations in 82 ms.
[2025-06-05 09:59:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17409846430674207870.gal : 9 ms
[2025-06-05 09:59:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6389285117870075278.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/ReachabilityCardinality17409846430674207870.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6389285117870075278.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/ReachabilityCardinality6389285117870075278.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 22
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :22 after 1562
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1562 after 2342
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2342 after 1.17936e+06
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2.05168e+13 after 1.04857e+20
Compilation finished in 1381 ms.
Running link step : cd /tmp/ltsmin14773451953029296256;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin14773451953029296256;'/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' 'ShieldRVtPT030BReachabilityCardinality202501==true'
Invariant property ShieldRVt-PT-030B-ReachabilityCardinality-2025-02 does not hold.
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldRVt-PT-030B-ReachabilityCardinality-2025-01 does not hold.
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
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,6.25026e+47,1.46945,48308,1000,156,86428,1095,957,255073,144,4478,0
Total reachable state count : 6.250260180385379852060219597992800509736e+47

Verifying 2 reachability properties.
Invariant property ShieldRVt-PT-030B-ReachabilityCardinality-2025-01 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-030B-ReachabilityCardinality-2025-01,3.09352e+46,1.51417,48564,833,167,86428,1095,1105,255073,164,4478,0
Invariant property ShieldRVt-PT-030B-ReachabilityCardinality-2025-02 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-030B-ReachabilityCardinality-2025-02,5.12697e+45,1.69494,48564,660,142,86428,1095,1188,255073,164,4478,0
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1945497 ms.

BK_STOP 1749117575039

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-030B"
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-030B, 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-174901994100302"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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