About the Execution of ITS-Tools for DES-PT-20b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1609079.00 | 0.00 | 0.00 | TFFFFTTFTTFFTFFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r058-smll-174854063900310.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 DES-PT-20b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854063900310
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 91K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2025-00
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2025-01
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2025-02
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2025-03
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2025-04
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2025-05
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2025-06
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2025-07
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2025-08
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2025-09
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2025-10
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2025-11
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2025-12
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2025-13
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2025-14
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2025-15
=== Now, execution of the tool begins
BK_START 1748704186944
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-20b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-05-31 15:09:49] [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-05-31 15:09:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 15:09:49] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2025-05-31 15:09:49] [INFO ] Transformed 360 places.
[2025-05-31 15:09:49] [INFO ] Transformed 311 transitions.
[2025-05-31 15:09:49] [INFO ] Found NUPN structural information;
[2025-05-31 15:09:49] [INFO ] Parsed PT model containing 360 places and 311 transitions and 987 arcs in 311 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-20b-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (338 resets) in 3382 ms. (11 steps per ms) remains 6/14 properties
FORMULA DES-PT-20b-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (45 resets) in 589 ms. (67 steps per ms) remains 6/6 properties
[2025-05-31 15:09:50] [INFO ] Flatten gal took : 247 ms
BEST_FIRST walk for 40004 steps (44 resets) in 384 ms. (103 steps per ms) remains 6/6 properties
[2025-05-31 15:09:51] [INFO ] Flatten gal took : 192 ms
BEST_FIRST walk for 40003 steps (52 resets) in 604 ms. (66 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (43 resets) in 172 ms. (231 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (50 resets) in 419 ms. (95 steps per ms) remains 5/6 properties
FORMULA DES-PT-20b-ReachabilityCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (48 resets) in 94 ms. (421 steps per ms) remains 5/5 properties
[2025-05-31 15:09:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17237124218556442276.gal : 54 ms
[2025-05-31 15:09:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9235451103041376040.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/ReachabilityCardinality17237124218556442276.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9235451103041376040.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
// Phase 1: matrix 311 rows 360 cols
Loading property file /tmp/ReachabilityCardinality9235451103041376040.prop.
[2025-05-31 15:09:51] [INFO ] Computed 65 invariants in 55 ms
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :4 after 16
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :16 after 19
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :19 after 35
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :35 after 169
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :169 after 235
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :235 after 1349
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :1349 after 22055
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :22055 after 206107
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 223/258 variables, 33/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 4096
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 223/291 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD size :206107 after 1.80704e+08
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 34/292 variables, 6/297 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 34/331 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 67/359 variables, 25/356 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 67/423 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/359 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :1.80704e+08 after 3.10347e+08
At refinement iteration 11 (OVERLAPS) 1/360 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/360 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/360 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 311/671 variables, 360/785 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :3.10347e+08 after 2.15649e+12
At refinement iteration 15 (INCLUDED_ONLY) 0/671 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/671 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 671/671 variables, and 785 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2962 ms.
Refiners :[Domain max(s): 360/360 constraints, Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 223/258 variables, 33/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 223/291 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:09:55] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 34/292 variables, 6/298 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 34/332 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 67/359 variables, 25/357 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/359 variables, 67/424 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:09:56] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:09:56] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 13 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/359 variables, 2/426 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:09:56] [INFO ] Deduced a trap composed of 30 places in 170 ms of which 17 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/359 variables, 1/427 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 32768
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD size :2.29329e+13 after 7.00515e+13
[2025-05-31 15:09:56] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 14 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/359 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/359 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 1/360 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/360 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:09:57] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:09:57] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 12 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/360 variables, 2/432 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:09:57] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:09:58] [INFO ] Deduced a trap composed of 12 places in 204 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:09:58] [INFO ] Deduced a trap composed of 50 places in 224 ms of which 48 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/360 variables, 3/435 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:09:58] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:09:58] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 7 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/360 variables, 2/437 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/360 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 311/671 variables, 360/797 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 671/671 variables, and 802 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5022 ms.
Refiners :[Domain max(s): 360/360 constraints, Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8162ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 311/311 transitions.
Graph (complete) has 741 edges and 360 vertex of which 354 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 354 transition count 287
Reduce places removed 18 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 336 transition count 285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 334 transition count 285
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 43 place count 334 transition count 279
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 55 place count 328 transition count 279
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 72 place count 311 transition count 262
Iterating global reduction 3 with 17 rules applied. Total rules applied 89 place count 311 transition count 262
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 101 place count 299 transition count 250
Iterating global reduction 3 with 12 rules applied. Total rules applied 113 place count 299 transition count 250
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 3 with 11 rules applied. Total rules applied 124 place count 299 transition count 239
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 125 place count 298 transition count 239
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 125 place count 298 transition count 237
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 129 place count 296 transition count 237
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 5 with 118 rules applied. Total rules applied 247 place count 237 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 248 place count 237 transition count 177
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 252 place count 235 transition count 178
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 256 place count 235 transition count 174
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 260 place count 231 transition count 174
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 261 place count 231 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 262 place count 230 transition count 173
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 263 place count 229 transition count 172
Applied a total of 263 rules in 257 ms. Remains 229 /360 variables (removed 131) and now considering 172/311 (removed 139) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 270 ms. Remains : 229/360 places, 172/311 transitions.
RANDOM walk for 40000 steps (813 resets) in 847 ms. (47 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (133 resets) in 309 ms. (129 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (131 resets) in 128 ms. (310 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (154 resets) in 414 ms. (96 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (98 resets) in 187 ms. (212 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (144 resets) in 159 ms. (250 steps per ms) remains 5/5 properties
SDD proceeding with computation,5 properties remain. new max is 65536
SDD size :7.00515e+13 after 1.19879e+14
Interrupted probabilistic random walk after 555120 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :0 out of 5
Probabilistic random walk after 555120 steps, saw 84168 distinct states, run finished after 3008 ms. (steps per millisecond=184 ) properties seen :0
// Phase 1: matrix 172 rows 229 cols
[2025-05-31 15:10:03] [INFO ] Computed 65 invariants in 14 ms
[2025-05-31 15:10:03] [INFO ] State equation strengthened by 6 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/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 140/175 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 10/185 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 40/225 variables, 25/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 3/228 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/229 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 172/401 variables, 229/294 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/401 variables, 6/300 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/401 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/401 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 300 constraints, problems are : Problem set: 0 solved, 5 unsolved in 976 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 229/229 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 140/175 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:04] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 10/185 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:05] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 40/225 variables, 25/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:05] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:05] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 3/228 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:05] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:05] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:05] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:05] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:05] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:05] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:06] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 7/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1/229 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:06] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/229 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:06] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 7 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/229 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/229 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 172/401 variables, 229/307 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/401 variables, 6/313 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/401 variables, 5/318 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:06] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/401 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/401 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/401 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 319 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4826 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 229/229 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5835ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 10695 ms.
Support contains 35 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 172/172 transitions.
Applied a total of 0 rules in 11 ms. Remains 229 /229 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 229/229 places, 172/172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 172/172 transitions.
Applied a total of 0 rules in 10 ms. Remains 229 /229 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2025-05-31 15:10:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 15:10:20] [INFO ] Implicit Places using invariants in 224 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 242 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 228/229 places, 172/172 transitions.
Applied a total of 0 rules in 13 ms. Remains 228 /228 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 265 ms. Remains : 228/229 places, 172/172 transitions.
RANDOM walk for 40000 steps (779 resets) in 283 ms. (140 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (144 resets) in 81 ms. (487 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (143 resets) in 76 ms. (519 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (158 resets) in 190 ms. (209 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (101 resets) in 104 ms. (380 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (138 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 601851 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :0 out of 5
Probabilistic random walk after 601851 steps, saw 89417 distinct states, run finished after 3001 ms. (steps per millisecond=200 ) properties seen :0
// Phase 1: matrix 172 rows 228 cols
[2025-05-31 15:10:23] [INFO ] Computed 64 invariants in 5 ms
[2025-05-31 15:10:23] [INFO ] State equation strengthened by 6 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/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 127/162 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 10/172 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 53/225 variables, 25/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 3/228 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 172/400 variables, 228/292 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 6/298 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/400 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 298 constraints, problems are : Problem set: 0 solved, 5 unsolved in 755 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 228/228 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 127/162 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 10/172 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 53/225 variables, 25/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:24] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:24] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:25] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:25] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:25] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:25] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 3/228 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:25] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:25] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:25] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:25] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:25] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:26] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:26] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:26] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:26] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 9/79 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:26] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 172/400 variables, 228/308 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/400 variables, 6/314 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/400 variables, 5/319 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:27] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/400 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:27] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 4 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/400 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/400 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/400 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 321 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5005 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 228/228 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 5782ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 10441 ms.
Support contains 35 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 172/172 transitions.
Applied a total of 0 rules in 15 ms. Remains 228 /228 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 228/228 places, 172/172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 172/172 transitions.
Applied a total of 0 rules in 11 ms. Remains 228 /228 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2025-05-31 15:10:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 15:10:40] [INFO ] Implicit Places using invariants in 272 ms returned []
[2025-05-31 15:10:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 15:10:40] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-31 15:10:40] [INFO ] Implicit Places using invariants and state equation in 597 ms returned []
Implicit Place search using SMT with State Equation took 872 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 15:10:40] [INFO ] Redundant transitions in 7 ms returned []
Running 167 sub problems to find dead transitions.
[2025-05-31 15:10:40] [INFO ] Invariant cache hit.
[2025-05-31 15:10:40] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (OVERLAPS) 6/228 variables, 35/49 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 15/64 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:44] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:45] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:45] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:45] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:45] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:45] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:45] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:45] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:45] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:45] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:45] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:46] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:46] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:46] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:46] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:46] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 16/80 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:47] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:49] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:49] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:49] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (OVERLAPS) 172/400 variables, 228/312 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 6/318 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:53] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:53] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:54] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 11 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:55] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:55] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:56] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:10:56] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 10 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/400 variables, 4/325 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/400 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 14 (OVERLAPS) 0/400 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 325 constraints, problems are : Problem set: 0 solved, 167 unsolved in 23422 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 228/228 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 6/228 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 15/68 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 23/91 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:11:05] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:11:06] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:11:06] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:11:06] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:11:07] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:11:07] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:11:07] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:11:08] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:11:08] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:11:09] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 13 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:11:10] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:11:11] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 12 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:11:12] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:11:12] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:11:12] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 13 (OVERLAPS) 172/400 variables, 228/334 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/400 variables, 6/340 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/400 variables, 167/507 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 400/400 variables, and 507 constraints, problems are : Problem set: 0 solved, 167 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 228/228 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53541ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 53544ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54450 ms. Remains : 228/228 places, 172/172 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 606 edges and 228 vertex of which 227 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 227 /228 variables (removed 1) and now considering 172/172 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 172 rows 227 cols
[2025-05-31 15:11:34] [INFO ] Computed 63 invariants in 11 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 15:11:34] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 15:11:34] [INFO ] [Nat]Absence check using 38 positive place invariants in 13 ms returned sat
[2025-05-31 15:11:34] [INFO ] [Nat]Absence check using 38 positive and 25 generalized place invariants in 41 ms returned sat
[2025-05-31 15:11:35] [INFO ] After 265ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:11:35] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:11:35] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:11:35] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:11:35] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 10 ms to minimize.
[2025-05-31 15:11:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 558 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:11:35] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 4 ms to minimize.
[2025-05-31 15:11:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:11:36] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:11:36] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 9 ms to minimize.
[2025-05-31 15:11:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 215 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:11:36] [INFO ] Deduced a trap composed of 5 places in 543 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:11:36] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:11:37] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 9 ms to minimize.
[2025-05-31 15:11:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 819 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:11:37] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 11 ms to minimize.
[2025-05-31 15:11:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:11:37] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 6 ms to minimize.
[2025-05-31 15:11:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:11:37] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:11: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-05-31 15:11:37] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:11:37] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 5 ms to minimize.
[2025-05-31 15:11:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 321 ms
TRAPS : Iteration 2
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:11:37] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 12 ms to minimize.
[2025-05-31 15:11:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:11:38] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 3 ms to minimize.
[2025-05-31 15:11:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 15:11:38] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 4 ms to minimize.
[2025-05-31 15:11:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
TRAPS : Iteration 3
[2025-05-31 15:11:38] [INFO ] After 3596ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2025-05-31 15:11:38] [INFO ] After 4079ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2025-05-31 15:11:38] [INFO ] Flatten gal took : 35 ms
[2025-05-31 15:11:38] [INFO ] Flatten gal took : 26 ms
[2025-05-31 15:11:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17220054059075530936.gal : 16 ms
[2025-05-31 15:11:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality759293850396102383.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/ReachabilityCardinality17220054059075530936.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality759293850396102383.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/ReachabilityCardinality759293850396102383.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :4 after 12
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :12 after 95
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :95 after 116
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :116 after 372
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :372 after 2450
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :2450 after 182664
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :182664 after 211080
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :211080 after 5.09213e+06
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :5.09213e+06 after 1.79955e+07
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :8.31984e+08 after 1.71758e+10
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :1.71758e+10 after 2.5592e+10
SDD proceeding with computation,5 properties remain. new max is 32768
SDD size :6.193e+10 after 2.13759e+11
SDD proceeding with computation,5 properties remain. new max is 65536
SDD size :5.85784e+11 after 1.06542e+12
SDD proceeding with computation,5 properties remain. new max is 131072
SDD size :2.22175e+12 after 3.5827e+12
Detected timeout of ITS tools.
[2025-05-31 15:11:53] [INFO ] Flatten gal took : 26 ms
[2025-05-31 15:11:53] [INFO ] Applying decomposition
[2025-05-31 15:11:53] [INFO ] Flatten gal took : 23 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/graph2949445892476070928.txt' '-o' '/tmp/graph2949445892476070928.bin' '-w' '/tmp/graph2949445892476070928.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2949445892476070928.bin' '-l' '-1' '-v' '-w' '/tmp/graph2949445892476070928.weights' '-q' '0' '-e' '0.001'
[2025-05-31 15:11:54] [INFO ] Decomposing Gal with order
[2025-05-31 15:11:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 15:11:54] [INFO ] Removed a total of 42 redundant transitions.
[2025-05-31 15:11:54] [INFO ] Flatten gal took : 86 ms
[2025-05-31 15:11:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 15 ms.
[2025-05-31 15:11:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality929149936940471598.gal : 8 ms
[2025-05-31 15:11:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9226687378031627815.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/ReachabilityCardinality929149936940471598.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9226687378031627815.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 ...306
Loading property file /tmp/ReachabilityCardinality9226687378031627815.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 90
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :90 after 3410
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :3410 after 15074
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :15074 after 1.06176e+06
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :1.06176e+06 after 2.10645e+10
Invariant property DES-PT-20b-ReachabilityCardinality-2025-07 does not hold.
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :2.10645e+10 after 6.0677e+10
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :6.0677e+10 after 9.03864e+10
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1.25953e+13 after 2.34534e+13
Reachability property DES-PT-20b-ReachabilityCardinality-2025-15 is true.
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :8.40928e+13 after 8.41301e+13
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :1.32779e+14 after 1.32831e+14
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.14472e+14,7.0496,125948,7695,1767,282634,6988,578,258636,257,49361,0
Total reachable state count : 214471950822112
Verifying 5 reachability properties.
Invariant property DES-PT-20b-ReachabilityCardinality-2025-03 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-20b-ReachabilityCardinality-2025-03,2.16963e+11,7.07643,125948,1326,378,282634,6988,580,258636,260,49361,0
Invariant property DES-PT-20b-ReachabilityCardinality-2025-07 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
DES-PT-20b-ReachabilityCardinality-2025-07,4.56869e+06,7.07947,125948,487,262,282634,6988,584,258636,263,49361,0
Reachability property DES-PT-20b-ReachabilityCardinality-2025-08 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
DES-PT-20b-ReachabilityCardinality-2025-08,8,7.098,125948,73,103,282634,6988,660,258636,275,49361,2905
Invariant property DES-PT-20b-ReachabilityCardinality-2025-10 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
DES-PT-20b-ReachabilityCardinality-2025-10,4.57142e+06,7.0994,125948,410,157,282634,6988,660,258636,275,49361,2970
Reachability property DES-PT-20b-ReachabilityCardinality-2025-15 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
DES-PT-20b-ReachabilityCardinality-2025-15,3456,7.10085,125948,78,122,282634,6988,668,258636,277,49361,2995
Over-approximation ignoring read arcs solved 0 properties in 26951 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-31 15:12:01] [INFO ] Flatten gal took : 26 ms
[2025-05-31 15:12:01] [INFO ] Applying decomposition
[2025-05-31 15:12:01] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15196757364409228951.txt' '-o' '/tmp/graph15196757364409228951.bin' '-w' '/tmp/graph15196757364409228951.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15196757364409228951.bin' '-l' '-1' '-v' '-w' '/tmp/graph15196757364409228951.weights' '-q' '0' '-e' '0.001'
[2025-05-31 15:12:01] [INFO ] Decomposing Gal with order
[2025-05-31 15:12:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 15:12:01] [INFO ] Removed a total of 35 redundant transitions.
[2025-05-31 15:12:01] [INFO ] Flatten gal took : 48 ms
[2025-05-31 15:12:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 9 ms.
[2025-05-31 15:12:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2626013386777101813.gal : 12 ms
[2025-05-31 15:12:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13523934819765114233.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/ReachabilityCardinality2626013386777101813.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13523934819765114233.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/ReachabilityCardinality13523934819765114233.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :6 after 133
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :133 after 2029
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :2029 after 1.46767e+06
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :1.46767e+06 after 4.58199e+10
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :4.58199e+10 after 3.93241e+12
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :1.99163e+17 after 2.48576e+17
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :1.91404e+20 after 1.92085e+20
Reachability property DES-PT-20b-ReachabilityCardinality-2025-15 is true.
FORMULA DES-PT-20b-ReachabilityCardinality-2025-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property DES-PT-20b-ReachabilityCardinality-2025-07 does not hold.
FORMULA DES-PT-20b-ReachabilityCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :1.21875e+21 after 1.22072e+21
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :3.61942e+21 after 3.62005e+21
Reachability property DES-PT-20b-ReachabilityCardinality-2025-08 is true.
FORMULA DES-PT-20b-ReachabilityCardinality-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :4.57597e+21 after 4.57597e+21
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,8.22773e+21,1469.44,2210500,26702,1013,5.10565e+06,8801,722,3.02683e+06,235,46513,0
Total reachable state count : 8227725159067241388544
Verifying 5 reachability properties.
Invariant property DES-PT-20b-ReachabilityCardinality-2025-03 does not hold.
FORMULA DES-PT-20b-ReachabilityCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-20b-ReachabilityCardinality-2025-03,5.16597e+11,1470.54,2210500,244,174,5.10565e+06,8801,725,3.02683e+06,238,46513,0
Invariant property DES-PT-20b-ReachabilityCardinality-2025-07 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
DES-PT-20b-ReachabilityCardinality-2025-07,1.79141e+10,1470.66,2210500,205,88,5.10565e+06,8801,731,3.02683e+06,241,46513,0
Reachability property DES-PT-20b-ReachabilityCardinality-2025-08 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
DES-PT-20b-ReachabilityCardinality-2025-08,1.65888e+06,1471.15,2210500,125,119,5.10565e+06,8801,881,3.02683e+06,262,46513,76473
Invariant property DES-PT-20b-ReachabilityCardinality-2025-10 does not hold.
FORMULA DES-PT-20b-ReachabilityCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-20b-ReachabilityCardinality-2025-10,3.40332e+15,1471.28,2210500,583,127,5.10565e+06,8801,881,3.02683e+06,262,46513,79171
Reachability property DES-PT-20b-ReachabilityCardinality-2025-15 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
DES-PT-20b-ReachabilityCardinality-2025-15,6.23739e+08,1471.28,2210500,144,92,5.10565e+06,8801,887,3.02683e+06,264,46513,79187
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 1606759 ms.
BK_STOP 1748705796023
--------------------
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="DES-PT-20b"
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 DES-PT-20b, 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 r058-smll-174854063900310"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-20b.tgz
mv DES-PT-20b 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 ;