Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r058-smll-174854064000358.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-50b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854064000358
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.4K 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.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K 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.5K 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 18K 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 139K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K 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 127K 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-50b-ReachabilityCardinality-2025-00
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-2025-01
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-2025-02
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-2025-03
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-2025-04
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-2025-05
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-2025-06
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-2025-07
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-2025-08
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-2025-09
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-2025-10
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-2025-11
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-2025-12
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-2025-13
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-2025-14
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748749995048

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-50b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-01 03:53:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 03:53:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 03:53:18] [INFO ] Load time of PNML (sax parser for PT used): 225 ms
[2025-06-01 03:53:18] [INFO ] Transformed 479 places.
[2025-06-01 03:53:18] [INFO ] Transformed 430 transitions.
[2025-06-01 03:53:18] [INFO ] Found NUPN structural information;
[2025-06-01 03:53:18] [INFO ] Parsed PT model containing 479 places and 430 transitions and 1463 arcs in 451 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 46 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-50b-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (332 resets) in 2190 ms. (18 steps per ms) remains 6/15 properties
FORMULA DES-PT-50b-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (46 resets) in 658 ms. (60 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (47 resets) in 855 ms. (46 steps per ms) remains 6/6 properties
[2025-06-01 03:53:19] [INFO ] Flatten gal took : 397 ms
BEST_FIRST walk for 40004 steps (45 resets) in 431 ms. (92 steps per ms) remains 6/6 properties
[2025-06-01 03:53:19] [INFO ] Flatten gal took : 135 ms
[2025-06-01 03:53:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14608379138888842021.gal : 114 ms
BEST_FIRST walk for 40003 steps (46 resets) in 673 ms. (59 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (58 resets) in 868 ms. (46 steps per ms) remains 6/6 properties
[2025-06-01 03:53:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1084435231160037802.prop : 18 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/ReachabilityCardinality14608379138888842021.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1084435231160037802.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (46 resets) in 369 ms. (108 steps per ms) remains 6/6 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality1084435231160037802.prop.
// Phase 1: matrix 430 rows 479 cols
[2025-06-01 03:53:20] [INFO ] Computed 65 invariants in 52 ms
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :4 after 5
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :5 after 21
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :21 after 45
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :45 after 49
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :49 after 116
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :116 after 636
SDD proceeding with computation,6 properties remain. new max is 1024
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD size :636 after 15462
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :15462 after 239543
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :239543 after 1.32889e+07
At refinement iteration 2 (OVERLAPS) 349/437 variables, 40/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/437 variables, 349/477 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 42/479 variables, 24/502 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 42/544 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :1.32889e+07 after 2.2342e+08
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :2.2342e+08 after 5.98609e+08
At refinement iteration 9 (OVERLAPS) 430/909 variables, 479/1023 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 909/909 variables, and 1023 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5071 ms.
Refiners :[Domain max(s): 479/479 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 479/479 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem DES-PT-50b-ReachabilityCardinality-2025-12 is UNSAT
FORMULA DES-PT-50b-ReachabilityCardinality-2025-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 349/437 variables, 40/128 constraints. Problems are: Problem set: 1 solved, 5 unsolved
SDD proceeding with computation,6 properties remain. new max is 32768
At refinement iteration 3 (INCLUDED_ONLY) 0/437 variables, 349/477 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 1/478 constraints. Problems are: Problem set: 1 solved, 5 unsolved
SDD size :5.98609e+08 after 2.12934e+12
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:53:26] [INFO ] Deduced a trap composed of 9 places in 248 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:53:26] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:53:26] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:53:26] [INFO ] Deduced a trap composed of 20 places in 196 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:53:27] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 15 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 5/483 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/483 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 42/479 variables, 24/507 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 42/549 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:53:28] [INFO ] Deduced a trap composed of 8 places in 396 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:53:29] [INFO ] Deduced a trap composed of 25 places in 292 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:53:29] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 14 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/479 variables, 3/552 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/909 variables, and 552 constraints, problems are : Problem set: 1 solved, 5 unsolved in 5017 ms.
Refiners :[Domain max(s): 479/479 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/479 constraints, PredecessorRefiner: 1/5 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10253ms problems are : Problem set: 1 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 66 out of 479 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 479/479 places, 430/430 transitions.
Graph (complete) has 1098 edges and 479 vertex of which 468 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
SDD proceeding with computation,6 properties remain. new max is 65536
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 468 transition count 413
Reduce places removed 11 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 457 transition count 410
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 454 transition count 410
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 30 place count 454 transition count 402
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 46 place count 446 transition count 402
SDD size :2.12934e+12 after 1.51934e+13
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 63 place count 429 transition count 385
Iterating global reduction 3 with 17 rules applied. Total rules applied 80 place count 429 transition count 385
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 80 place count 429 transition count 384
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 428 transition count 384
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 95 place count 415 transition count 371
Iterating global reduction 3 with 13 rules applied. Total rules applied 108 place count 415 transition count 371
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 14 rules applied. Total rules applied 122 place count 415 transition count 357
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 125 place count 413 transition count 356
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 125 place count 413 transition count 353
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 131 place count 410 transition count 353
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 5 with 88 rules applied. Total rules applied 219 place count 366 transition count 309
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 221 place count 365 transition count 309
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 224 place count 365 transition count 306
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 227 place count 362 transition count 306
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 228 place count 362 transition count 306
Applied a total of 228 rules in 334 ms. Remains 362 /479 variables (removed 117) and now considering 306/430 (removed 124) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 345 ms. Remains : 362/479 places, 306/430 transitions.
RANDOM walk for 40000 steps (737 resets) in 920 ms. (43 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (136 resets) in 109 ms. (363 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (162 resets) in 181 ms. (219 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (147 resets) in 117 ms. (339 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (138 resets) in 137 ms. (289 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (145 resets) in 384 ms. (103 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 483108 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :0 out of 5
Probabilistic random walk after 483108 steps, saw 84240 distinct states, run finished after 3010 ms. (steps per millisecond=160 ) properties seen :0
// Phase 1: matrix 306 rows 362 cols
[2025-06-01 03:53:34] [INFO ] Computed 60 invariants in 10 ms
[2025-06-01 03:53:34] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 95/160 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 159/319 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 306/625 variables, 319/379 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/625 variables, 3/382 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/625 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 43/668 variables, 43/425 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/668 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/668 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,6 properties remain. new max is 131072
No progress, stopping.
SDD size :1.51934e+13 after 2.07218e+14
After SMT solving in domain Real declared 668/668 variables, and 425 constraints, problems are : Problem set: 0 solved, 5 unsolved in 8204 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 362/362 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 95/160 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 159/319 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:53:43] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 15 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 306/625 variables, 319/380 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/625 variables, 3/383 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/625 variables, 3/386 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:53:46] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/625 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:53:47] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/625 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/625 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 43/668 variables, 43/431 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/668 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/668 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/668 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 668/668 variables, and 432 constraints, problems are : Problem set: 0 solved, 5 unsolved in 12927 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 362/362 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21173ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
SDD proceeding with computation,6 properties remain. new max is 262144
SDD size :2.07218e+14 after 3.61746e+14
Parikh walk visited 0 properties in 32370 ms.
Support contains 65 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 306/306 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 360 transition count 304
Applied a total of 4 rules in 35 ms. Remains 360 /362 variables (removed 2) and now considering 304/306 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 360/362 places, 304/306 transitions.
RANDOM walk for 40000 steps (761 resets) in 309 ms. (129 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (132 resets) in 118 ms. (336 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (158 resets) in 106 ms. (373 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (135 resets) in 97 ms. (408 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (143 resets) in 124 ms. (320 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (139 resets) in 295 ms. (135 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 513274 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :0 out of 5
Probabilistic random walk after 513274 steps, saw 89257 distinct states, run finished after 3001 ms. (steps per millisecond=171 ) properties seen :0
// Phase 1: matrix 304 rows 360 cols
[2025-06-01 03:54:31] [INFO ] Computed 60 invariants in 11 ms
[2025-06-01 03:54:31] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 92/157 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 160/317 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 304/621 variables, 317/377 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/621 variables, 3/380 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/621 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 43/664 variables, 43/423 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/664 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/664 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 664/664 variables, and 423 constraints, problems are : Problem set: 0 solved, 5 unsolved in 8605 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 360/360 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 92/157 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:54:40] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:54:40] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:54:40] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:54:40] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:54:40] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:54:40] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,6 properties remain. new max is 524288
At refinement iteration 5 (OVERLAPS) 160/317 variables, 25/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:54:40] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD size :3.61746e+14 after 5.27516e+14
At refinement iteration 8 (OVERLAPS) 304/621 variables, 317/384 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/621 variables, 3/387 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/621 variables, 3/390 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:54:44] [INFO ] Deduced a trap along path composed of 4 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:54:45] [INFO ] Deduced a trap along path composed of 3 places in 54 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/621 variables, 2/392 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/621 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 43/664 variables, 43/435 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/664 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/664 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/664 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 664/664 variables, and 436 constraints, problems are : Problem set: 0 solved, 5 unsolved in 22255 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 360/360 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 30908ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 30121 ms.
Support contains 65 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 304/304 transitions.
Applied a total of 0 rules in 23 ms. Remains 360 /360 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 360/360 places, 304/304 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 304/304 transitions.
Applied a total of 0 rules in 20 ms. Remains 360 /360 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2025-06-01 03:55:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:55:32] [INFO ] Implicit Places using invariants in 348 ms returned [215]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 368 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 359/360 places, 304/304 transitions.
Applied a total of 0 rules in 17 ms. Remains 359 /359 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 406 ms. Remains : 359/360 places, 304/304 transitions.
RANDOM walk for 40000 steps (737 resets) in 239 ms. (166 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (137 resets) in 125 ms. (317 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (157 resets) in 81 ms. (487 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (136 resets) in 93 ms. (425 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (141 resets) in 105 ms. (377 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (148 resets) in 299 ms. (133 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 487311 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :0 out of 5
Probabilistic random walk after 487311 steps, saw 84805 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :0
// Phase 1: matrix 304 rows 359 cols
[2025-06-01 03:55:36] [INFO ] Computed 59 invariants in 9 ms
[2025-06-01 03:55:36] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 92/157 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 159/316 variables, 25/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 304/620 variables, 316/375 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/620 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/620 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 43/663 variables, 43/420 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/663 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/663 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 663/663 variables, and 420 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3653 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 359/359 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 92/157 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 159/316 variables, 25/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:55:40] [INFO ] Deduced a trap composed of 5 places in 214 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 304/620 variables, 316/376 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/620 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/620 variables, 3/381 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:55:42] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/620 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:55:44] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:55:44] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:55:44] [INFO ] Deduced a trap along path composed of 2 places in 74 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/620 variables, 3/385 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:55:46] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/620 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/620 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 43/663 variables, 43/429 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/663 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-06-01 03:55:50] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 12 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/663 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/663 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/663 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 663/663 variables, and 431 constraints, problems are : Problem set: 0 solved, 5 unsolved in 18446 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 359/359 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 22127ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 20793 ms.
Support contains 65 out of 359 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 304/304 transitions.
Applied a total of 0 rules in 21 ms. Remains 359 /359 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 359/359 places, 304/304 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 304/304 transitions.
Applied a total of 0 rules in 16 ms. Remains 359 /359 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2025-06-01 03:56:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:56:19] [INFO ] Implicit Places using invariants in 829 ms returned []
[2025-06-01 03:56:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:56:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-01 03:56:20] [INFO ] Implicit Places using invariants and state equation in 990 ms returned []
Implicit Place search using SMT with State Equation took 1824 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 03:56:21] [INFO ] Redundant transitions in 35 ms returned []
Running 303 sub problems to find dead transitions.
[2025-06-01 03:56:21] [INFO ] Invariant cache hit.
[2025-06-01 03:56:21] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (OVERLAPS) 1/359 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 303 unsolved
SDD proceeding with computation,6 properties remain. new max is 1048576
SDD size :5.27516e+14 after 1.36356e+16
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/359 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (OVERLAPS) 304/663 variables, 359/418 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/663 variables, 2/420 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:56:39] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:56:45] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/663 variables, 2/422 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:56:49] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 663/663 variables, and 423 constraints, problems are : Problem set: 0 solved, 303 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 359/359 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (OVERLAPS) 1/359 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/359 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:56:55] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:56:55] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:56:55] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:56:55] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:56:55] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:56:55] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:56:56] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:56:56] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:56:56] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:56:56] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:56:56] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:56:59] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:56:59] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:57:00] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 14/76 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:57:03] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:57:04] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:57:08] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:57:11] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 10 (OVERLAPS) 304/663 variables, 359/439 constraints. Problems are: Problem set: 0 solved, 303 unsolved
SMT process timed out in 60576ms, After SMT, problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 60591ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62487 ms. Remains : 359/359 places, 304/304 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 26 ms. Remains 359 /359 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Running SMT prover for 5 properties.
[2025-06-01 03:57:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 03:57:21] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned sat
[2025-06-01 03:57:21] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 47 ms returned sat
[2025-06-01 03:57:21] [INFO ] After 270ms 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-06-01 03:57:22] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2025-06-01 03:57:22] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 41 ms returned sat
[2025-06-01 03:57:22] [INFO ] After 802ms 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-06-01 03:57:23] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:57:23] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 5 ms to minimize.
[2025-06-01 03:57:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 205 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:57:24] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 3 ms to minimize.
[2025-06-01 03:57:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
TRAPS : Iteration 2
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:57:25] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:57:25] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:57:26] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:57:26] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 13 ms to minimize.
[2025-06-01 03:57:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 952 ms
TRAPS : Iteration 3
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:57:26] [INFO ] Deduced a trap composed of 16 places in 189 ms of which 13 ms to minimize.
[2025-06-01 03:57:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:57:27] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 12 ms to minimize.
[2025-06-01 03:57:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
TRAPS : Iteration 4
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:57:28] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 12 ms to minimize.
[2025-06-01 03:57:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 334 ms
TRAPS : Iteration 5
[2025-06-01 03:57:30] [INFO ] After 7947ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2025-06-01 03:57:31] [INFO ] After 9107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2025-06-01 03:57:31] [INFO ] Flatten gal took : 61 ms
[2025-06-01 03:57:31] [INFO ] Flatten gal took : 53 ms
[2025-06-01 03:57:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9085895680616401478.gal : 10 ms
[2025-06-01 03:57:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7728447132670077951.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/ReachabilityCardinality9085895680616401478.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7728447132670077951.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/ReachabilityCardinality7728447132670077951.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 3
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :3 after 6
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :6 after 7
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :7 after 11
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :11 after 223
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :223 after 1187
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :1187 after 21031
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :21031 after 28935
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :28935 after 5.71829e+06
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :5.71829e+06 after 1.96891e+07
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :1.96891e+07 after 2.84106e+07
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :2.84106e+07 after 3.39782e+08
SDD proceeding with computation,5 properties remain. new max is 32768
SDD size :3.39782e+08 after 4.20282e+08
SDD proceeding with computation,5 properties remain. new max is 65536
SDD size :4.20282e+08 after 3.48449e+09
Detected timeout of ITS tools.
[2025-06-01 03:57:46] [INFO ] Flatten gal took : 31 ms
[2025-06-01 03:57:46] [INFO ] Applying decomposition
[2025-06-01 03:57:46] [INFO ] Flatten gal took : 27 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/graph9817507302653503886.txt' '-o' '/tmp/graph9817507302653503886.bin' '-w' '/tmp/graph9817507302653503886.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9817507302653503886.bin' '-l' '-1' '-v' '-w' '/tmp/graph9817507302653503886.weights' '-q' '0' '-e' '0.001'
[2025-06-01 03:57:46] [INFO ] Decomposing Gal with order
[2025-06-01 03:57:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 03:57:46] [INFO ] Removed a total of 21 redundant transitions.
[2025-06-01 03:57:46] [INFO ] Flatten gal took : 111 ms
[2025-06-01 03:57:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 11 ms.
[2025-06-01 03:57:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality363259285291177764.gal : 9 ms
[2025-06-01 03:57:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9312852514646468318.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/ReachabilityCardinality363259285291177764.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9312852514646468318.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/ReachabilityCardinality9312852514646468318.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 7
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :7 after 135
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :135 after 855
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :3003 after 1.79897e+07
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :1.79897e+07 after 6.26785e+10
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :6.26785e+10 after 1.25372e+11
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :1.25372e+11 after 2.01997e+11
Reachability property DES-PT-50b-ReachabilityCardinality-2025-09 is true.
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :2.5729e+13 after 7.31406e+13
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 40215 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-01 03:58:02] [INFO ] Flatten gal took : 31 ms
[2025-06-01 03:58:02] [INFO ] Applying decomposition
[2025-06-01 03:58:02] [INFO ] Flatten gal took : 28 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/graph1481799188845128635.txt' '-o' '/tmp/graph1481799188845128635.bin' '-w' '/tmp/graph1481799188845128635.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1481799188845128635.bin' '-l' '-1' '-v' '-w' '/tmp/graph1481799188845128635.weights' '-q' '0' '-e' '0.001'
[2025-06-01 03:58:02] [INFO ] Decomposing Gal with order
[2025-06-01 03:58:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 03:58:02] [INFO ] Removed a total of 30 redundant transitions.
[2025-06-01 03:58:02] [INFO ] Flatten gal took : 51 ms
[2025-06-01 03:58:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 7 ms.
[2025-06-01 03:58:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14928117516111918764.gal : 11 ms
[2025-06-01 03:58:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5944104482136926741.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/ReachabilityCardinality14928117516111918764.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5944104482136926741.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/ReachabilityCardinality5944104482136926741.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :1 after 1283
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :1283 after 41299
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :41299 after 8.36977e+06
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :1.52316e+13 after 2.00295e+13
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :2.00295e+13 after 5.98523e+17
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :5.98523e+17 after 1.16619e+18
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :1.16619e+18 after 1.94978e+18
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :1.94978e+18 after 3.06919e+18
Reachability property DES-PT-50b-ReachabilityCardinality-2025-09 is true.
FORMULA DES-PT-50b-ReachabilityCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :3.06919e+18 after 5.30005e+18
Invariant property DES-PT-50b-ReachabilityCardinality-2025-11 does not hold.
FORMULA DES-PT-50b-ReachabilityCardinality-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :2.27922e+22 after 2.28582e+22
Detected timeout of ITS tools.
[2025-06-01 04:28:02] [INFO ] Flatten gal took : 26 ms
Using solver Z3 to compute partial order matrices.
[2025-06-01 04:28:02] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin14252681132466552715
[2025-06-01 04:28:02] [INFO ] Computing symmetric may disable matrix : 304 transitions.
[2025-06-01 04:28:02] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 04:28:02] [INFO ] Flatten gal took : 34 ms
[2025-06-01 04:28:02] [INFO ] Computing symmetric may enable matrix : 304 transitions.
[2025-06-01 04:28:02] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 04:28:02] [INFO ] Computing Do-Not-Accords matrix : 304 transitions.
[2025-06-01 04:28:02] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4894331910096191110.txt' '-o' '/tmp/graph4894331910096191110.bin' '-w' '/tmp/graph4894331910096191110.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4894331910096191110.bin' '-l' '-1' '-v' '-w' '/tmp/graph4894331910096191110.weights' '-q' '0' '-e' '0.001'
[2025-06-01 04:28:02] [INFO ] Decomposing Gal with order
[2025-06-01 04:28:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 04:28:02] [INFO ] Built C files in 171ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14252681132466552715
Running compilation step : cd /tmp/ltsmin14252681132466552715;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-01 04:28:02] [INFO ] Removed a total of 24 redundant transitions.
[2025-06-01 04:28:02] [INFO ] Flatten gal took : 55 ms
[2025-06-01 04:28:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 26 ms.
[2025-06-01 04:28:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5659993414727015463.gal : 4 ms
[2025-06-01 04:28:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16676447648070013098.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5659993414727015463.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16676447648070013098.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/ReachabilityCardinality16676447648070013098.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 7
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :7 after 43
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :43 after 731
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :2403 after 244403
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :1.45583e+07 after 1.79897e+07
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :1.79897e+07 after 4.86287e+10
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :4.86287e+10 after 1.07342e+11
Compilation finished in 1474 ms.
Running link step : cd /tmp/ltsmin14252681132466552715;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
SDD proceeding with computation,3 properties remain. new max is 1024
Running LTSmin : cd /tmp/ltsmin14252681132466552715;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DESPT50bReachabilityCardinality202501==true'
SDD size :1.07342e+11 after 1.72623e+11
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1.72623e+11 after 3.09341e+11
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :1.67722e+15 after 1.68397e+15
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.6632e+15,62.3939,122984,6459,9603,272881,33199,667,226888,522,316032,0
Total reachable state count : 3663195108193203

Verifying 3 reachability properties.
Reachability property DES-PT-50b-ReachabilityCardinality-2025-01 is true.
FORMULA DES-PT-50b-ReachabilityCardinality-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-50b-ReachabilityCardinality-2025-01,607104,62.4424,123240,161,260,272881,33199,668,226888,526,316032,4091
Reachability property DES-PT-50b-ReachabilityCardinality-2025-04 is true.
FORMULA DES-PT-50b-ReachabilityCardinality-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-50b-ReachabilityCardinality-2025-04,76544,62.4507,123240,162,201,272881,33199,671,226888,529,316032,4322
Invariant property DES-PT-50b-ReachabilityCardinality-2025-15 does not hold.
FORMULA DES-PT-50b-ReachabilityCardinality-2025-15 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-50b-ReachabilityCardinality-2025-15,7.69281e+13,64.1604,123240,2017,1558,272881,33199,730,226888,555,316032,174710
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 2227656 ms.

BK_STOP 1748752225393

--------------------
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-50b"
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-50b, 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-174854064000358"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50b.tgz
mv DES-PT-50b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;