About the Execution of ITS-Tools for ShieldPPPt-PT-004B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 52764.00 | 0.00 | 0.00 | FTFTTFFFTTTFTTFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r198-tall-174894533500838.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 ShieldPPPt-PT-004B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894533500838
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K 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.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K 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 74K 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 ShieldPPPt-PT-004B-ReachabilityCardinality-2025-00
FORMULA_NAME ShieldPPPt-PT-004B-ReachabilityCardinality-2025-01
FORMULA_NAME ShieldPPPt-PT-004B-ReachabilityCardinality-2025-02
FORMULA_NAME ShieldPPPt-PT-004B-ReachabilityCardinality-2025-03
FORMULA_NAME ShieldPPPt-PT-004B-ReachabilityCardinality-2025-04
FORMULA_NAME ShieldPPPt-PT-004B-ReachabilityCardinality-2025-05
FORMULA_NAME ShieldPPPt-PT-004B-ReachabilityCardinality-2025-06
FORMULA_NAME ShieldPPPt-PT-004B-ReachabilityCardinality-2025-07
FORMULA_NAME ShieldPPPt-PT-004B-ReachabilityCardinality-2025-08
FORMULA_NAME ShieldPPPt-PT-004B-ReachabilityCardinality-2025-09
FORMULA_NAME ShieldPPPt-PT-004B-ReachabilityCardinality-2025-10
FORMULA_NAME ShieldPPPt-PT-004B-ReachabilityCardinality-2025-11
FORMULA_NAME ShieldPPPt-PT-004B-ReachabilityCardinality-2025-12
FORMULA_NAME ShieldPPPt-PT-004B-ReachabilityCardinality-2025-13
FORMULA_NAME ShieldPPPt-PT-004B-ReachabilityCardinality-2025-14
FORMULA_NAME ShieldPPPt-PT-004B-ReachabilityCardinality-2025-15
=== Now, execution of the tool begins
BK_START 1749299561841
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-004B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-07 12:32:42] [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-07 12:32:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 12:32:43] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2025-06-07 12:32:43] [INFO ] Transformed 315 places.
[2025-06-07 12:32:43] [INFO ] Transformed 287 transitions.
[2025-06-07 12:32:43] [INFO ] Found NUPN structural information;
[2025-06-07 12:32:43] [INFO ] Parsed PT model containing 315 places and 287 transitions and 718 arcs in 163 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-004B-ReachabilityCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-004B-ReachabilityCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-004B-ReachabilityCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1149 ms. (34 steps per ms) remains 2/13 properties
FORMULA ShieldPPPt-PT-004B-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-004B-ReachabilityCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-004B-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-004B-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-004B-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-004B-ReachabilityCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-004B-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-004B-ReachabilityCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-004B-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-004B-ReachabilityCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-004B-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-07 12:32:43] [INFO ] Flatten gal took : 123 ms
[2025-06-07 12:32:43] [INFO ] Flatten gal took : 62 ms
BEST_FIRST walk for 40004 steps (8 resets) in 571 ms. (69 steps per ms) remains 2/2 properties
[2025-06-07 12:32:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2140940584352319980.gal : 27 ms
[2025-06-07 12:32:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6432616089927255424.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/ReachabilityCardinality2140940584352319980.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6432616089927255424.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality6432616089927255424.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 13
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :13 after 76
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :76 after 1671
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1671 after 1.38945e+06
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.38945e+06 after 8.68056e+09
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :8.68056e+09 after 5.8901e+11
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :5.8901e+11 after 5.8901e+11
BEST_FIRST walk for 40003 steps (8 resets) in 880 ms. (45 steps per ms) remains 1/2 properties
FORMULA ShieldPPPt-PT-004B-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :5.8901e+11 after 5.8901e+11
// Phase 1: matrix 287 rows 315 cols
[2025-06-07 12:32:44] [INFO ] Computed 45 invariants in 13 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :5.8901e+11 after 5.8901e+11
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 190/219 variables, 26/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 190/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 96/315 variables, 19/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 96/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 287/602 variables, 315/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/602 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/602 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 602/602 variables, and 675 constraints, problems are : Problem set: 0 solved, 1 unsolved in 445 ms.
Refiners :[Domain max(s): 315/315 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 315/315 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 190/219 variables, 26/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 190/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:44] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:44] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:44] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:45] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:45] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 5/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 96/315 variables, 19/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 96/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:45] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:45] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:45] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 3/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 287/602 variables, 315/683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/602 variables, 1/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:45] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:45] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:45] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 7 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/602 variables, 3/687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/602 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/602 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 602/602 variables, and 687 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1566 ms.
Refiners :[Domain max(s): 315/315 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 315/315 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2090ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 35 ms.
Support contains 29 out of 315 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 315/315 places, 287/287 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 315 transition count 232
Reduce places removed 55 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 57 rules applied. Total rules applied 112 place count 260 transition count 230
Reduce places removed 1 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 7 rules applied. Total rules applied 119 place count 259 transition count 224
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 125 place count 253 transition count 224
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 125 place count 253 transition count 200
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 173 place count 229 transition count 200
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 196 place count 206 transition count 177
Iterating global reduction 4 with 23 rules applied. Total rules applied 219 place count 206 transition count 177
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 219 place count 206 transition count 167
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 239 place count 196 transition count 167
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 337 place count 147 transition count 118
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 355 place count 138 transition count 118
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 356 place count 138 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 357 place count 137 transition count 117
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 364 place count 137 transition count 117
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 365 place count 136 transition count 116
Applied a total of 365 rules in 147 ms. Remains 136 /315 variables (removed 179) and now considering 116/287 (removed 171) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 136/315 places, 116/287 transitions.
RANDOM walk for 40000 steps (8 resets) in 390 ms. (102 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1430893 steps, run timeout after 3001 ms. (steps per millisecond=476 ) properties seen :0 out of 1
Probabilistic random walk after 1430893 steps, saw 811154 distinct states, run finished after 3005 ms. (steps per millisecond=476 ) properties seen :0
// Phase 1: matrix 116 rows 136 cols
[2025-06-07 12:32:49] [INFO ] Computed 45 invariants in 3 ms
[2025-06-07 12:32:49] [INFO ] State equation strengthened by 14 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/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/93 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/121 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 109/230 variables, 121/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 13/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 19/249 variables, 12/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/250 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/252 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/252 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/252 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/252 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 195 constraints, problems are : Problem set: 0 solved, 1 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 136/136 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/93 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:49] [INFO ] Deduced a trap composed of 3 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-07 12:32:49] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:49] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:49] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/121 variables, 12/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:49] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:49] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:50] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:50] [INFO ] Deduced a trap composed of 6 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-07 12:32:50] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 109/230 variables, 121/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:50] [INFO ] Deduced a trap composed of 5 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-07 12:32:50] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:50] [INFO ] Deduced a trap along path composed of 4 places in 34 ms of which 8 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/230 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 19/249 variables, 12/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/249 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/249 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:50] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:50] [INFO ] Deduced a trap along path composed of 2 places in 15 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/249 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/249 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/250 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/250 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/250 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/252 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/252 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/252 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/252 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1117 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 136/136 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 1277ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 29 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 116/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 136 /136 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 136/136 places, 116/116 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 116/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 136 /136 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2025-06-07 12:32:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:32:50] [INFO ] Implicit Places using invariants in 153 ms returned [123]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 164 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 135/136 places, 116/116 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 135 transition count 114
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 133 transition count 114
Applied a total of 4 rules in 9 ms. Remains 133 /135 variables (removed 2) and now considering 114/116 (removed 2) transitions.
// Phase 1: matrix 114 rows 133 cols
[2025-06-07 12:32:51] [INFO ] Computed 44 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:32:51] [INFO ] Implicit Places using invariants in 198 ms returned [108, 112]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 202 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 131/136 places, 114/116 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 129 transition count 112
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 129 transition count 112
Applied a total of 4 rules in 6 ms. Remains 129 /131 variables (removed 2) and now considering 112/114 (removed 2) transitions.
// Phase 1: matrix 112 rows 129 cols
[2025-06-07 12:32:51] [INFO ] Computed 42 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:32:51] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-07 12:32:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:32:51] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-07 12:32:51] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 129/136 places, 112/116 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 613 ms. Remains : 129/136 places, 112/116 transitions.
RANDOM walk for 40000 steps (8 resets) in 220 ms. (180 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1683824 steps, run timeout after 3001 ms. (steps per millisecond=561 ) properties seen :0 out of 1
Probabilistic random walk after 1683824 steps, saw 932476 distinct states, run finished after 3001 ms. (steps per millisecond=561 ) properties seen :0
[2025-06-07 12:32:54] [INFO ] Invariant cache hit.
[2025-06-07 12:32:54] [INFO ] State equation strengthened by 12 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/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/86 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/114 variables, 12/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 105/219 variables, 114/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 11/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 19/238 variables, 12/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/239 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/239 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/239 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/241 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/241 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/241 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/241 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 183 constraints, problems are : Problem set: 0 solved, 1 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 129/129 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/86 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:54] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:54] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:54] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:54] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:54] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:55] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 28/114 variables, 12/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:55] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:55] [INFO ] Deduced a trap composed of 6 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-07 12:32:55] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:55] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:55] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 105/219 variables, 114/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 11/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 19/238 variables, 12/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 4/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/238 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:55] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/238 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/238 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/239 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/239 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:55] [INFO ] Deduced a trap along path composed of 2 places in 13 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/239 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/239 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/241 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/241 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/241 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/241 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/241 variables, and 197 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1039 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 129/129 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1250ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 29 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 112/112 transitions.
Applied a total of 0 rules in 3 ms. Remains 129 /129 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 129/129 places, 112/112 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 112/112 transitions.
Applied a total of 0 rules in 4 ms. Remains 129 /129 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2025-06-07 12:32:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:32:55] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-07 12:32:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:32:56] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-07 12:32:56] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 12:32:56] [INFO ] Redundant transitions in 2 ms returned []
Running 104 sub problems to find dead transitions.
[2025-06-07 12:32:56] [INFO ] Invariant cache hit.
[2025-06-07 12:32:56] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 8/129 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:57] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:57] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:57] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:57] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:57] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:57] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:57] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:57] [INFO ] Deduced a trap composed of 7 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-07 12:32:57] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:57] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:57] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:57] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:57] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:32:57] [INFO ] Deduced a trap composed of 7 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-07 12:32:57] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 112/241 variables, 129/187 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 12/199 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (OVERLAPS) 0/241 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 199 constraints, problems are : Problem set: 0 solved, 104 unsolved in 3284 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 129/129 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (OVERLAPS) 8/129 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 15/58 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 112/241 variables, 129/187 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 12/199 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 104/303 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:00] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:00] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:00] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:00] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:00] [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-07 12:33:00] [INFO ] Deduced a trap composed of 6 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-07 12:33:01] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 7/310 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:01] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:02] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:02] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/241 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:03] [INFO ] Deduced a trap composed of 4 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-07 12:33:03] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:03] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/241 variables, 3/316 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:04] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/241 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:05] [INFO ] Deduced a trap along path composed of 4 places in 18 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:05] [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-07 12:33:05] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:05] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:06] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:06] [INFO ] Deduced a trap along path composed of 2 places in 15 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:06] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:06] [INFO ] Deduced a trap along path composed of 3 places in 13 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:06] [INFO ] Deduced a trap along path composed of 3 places in 16 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:06] [INFO ] Deduced a trap along path composed of 3 places in 14 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:06] [INFO ] Deduced a trap along path composed of 2 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-07 12:33:06] [INFO ] Deduced a trap along path composed of 2 places in 16 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/241 variables, 12/329 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/241 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 16 (OVERLAPS) 0/241 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/241 variables, and 329 constraints, problems are : Problem set: 0 solved, 104 unsolved in 16554 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 129/129 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 12/12 constraints]
After SMT, in 19858ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 19859ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20161 ms. Remains : 129/129 places, 112/112 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 0 with 15 rules applied. Total rules applied 15 place count 129 transition count 112
Applied a total of 15 rules in 7 ms. Remains 129 /129 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 112 rows 129 cols
[2025-06-07 12:33:15] [INFO ] Computed 42 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-07 12:33:16] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-07 12:33:16] [INFO ] [Nat]Absence check using 42 positive place invariants in 5 ms returned sat
[2025-06-07 12:33:16] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-07 12:33:16] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 12:33:16] [INFO ] After 24ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:16] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:16] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 2 ms to minimize.
[2025-06-07 12:33:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 160 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:16] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:33:16] [INFO ] Deduced a trap composed of 8 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-07 12:33:16] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 2 ms to minimize.
[2025-06-07 12:33:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 241 ms
TRAPS : Iteration 2
[2025-06-07 12:33:16] [INFO ] After 491ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-07 12:33:16] [INFO ] After 680ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-07 12:33:16] [INFO ] Flatten gal took : 9 ms
[2025-06-07 12:33:16] [INFO ] Flatten gal took : 9 ms
[2025-06-07 12:33:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8228072565169589767.gal : 10 ms
[2025-06-07 12:33:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10743230809508994807.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/ReachabilityCardinality8228072565169589767.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10743230809508994807.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality10743230809508994807.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 72
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :72 after 17640
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :17640 after 65385
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :65385 after 66303
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :66303 after 315710
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :315710 after 2.99866e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.99866e+06 after 3.45223e+07
Detected timeout of ITS tools.
[2025-06-07 12:33:31] [INFO ] Flatten gal took : 8 ms
[2025-06-07 12:33:31] [INFO ] Applying decomposition
[2025-06-07 12:33:31] [INFO ] Flatten gal took : 8 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/graph1866390427747309797.txt' '-o' '/tmp/graph1866390427747309797.bin' '-w' '/tmp/graph1866390427747309797.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1866390427747309797.bin' '-l' '-1' '-v' '-w' '/tmp/graph1866390427747309797.weights' '-q' '0' '-e' '0.001'
[2025-06-07 12:33:31] [INFO ] Decomposing Gal with order
[2025-06-07 12:33:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 12:33:32] [INFO ] Removed a total of 20 redundant transitions.
[2025-06-07 12:33:32] [INFO ] Flatten gal took : 198 ms
[2025-06-07 12:33:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2025-06-07 12:33:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10429093903996245214.gal : 2 ms
[2025-06-07 12:33:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4683519978123727894.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/ReachabilityCardinality10429093903996245214.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4683519978123727894.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/ReachabilityCardinality4683519978123727894.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 1296
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1296 after 30240
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :30240 after 135648
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :135648 after 2.11622e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.11622e+06 after 2.81305e+11
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,7.84679e+15,2.31857,65196,501,204,94916,2529,458,255207,119,24436,0
Total reachable state count : 7846789453235568
Verifying 1 reachability properties.
Reachability property ShieldPPPt-PT-004B-ReachabilityCardinality-2025-02 does not hold.
No reachable states exhibit your property : ShieldPPPt-PT-004B-ReachabilityCardinality-2025-02
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldPPPt-PT-004B-ReachabilityCardinality-2025-02,0,2.32568,65196,1,0,94916,2529,502,255207,129,24436,1581
FORMULA ShieldPPPt-PT-004B-ReachabilityCardinality-2025-02 FALSE TECHNIQUES OVER_APPROXIMATION
Over-approximation ignoring read arcs solved -1 properties in 18578 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 51599 ms.
BK_STOP 1749299614605
--------------------
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="ShieldPPPt-PT-004B"
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 ShieldPPPt-PT-004B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r198-tall-174894533500838"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-004B.tgz
mv ShieldPPPt-PT-004B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;