About the Execution of ITS-Tools for ShieldPPPs-PT-040B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 3600000.00 | 0.00 | 0.00 | TFF?TTTFFTTTTFTT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r198-tall-174894533300743.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 ShieldPPPs-PT-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894533300743
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 708K May 29 14:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2025-00
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2025-01
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2025-02
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2025-03
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2025-04
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2025-05
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2025-06
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2025-07
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2025-08
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2025-09
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2025-10
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2025-11
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2025-12
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2025-13
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2025-14
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2025-15
=== Now, execution of the tool begins
BK_START 1749271038125
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-040B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-07 04:37:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 04:37:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 04:37:19] [INFO ] Load time of PNML (sax parser for PT used): 305 ms
[2025-06-07 04:37:19] [INFO ] Transformed 2723 places.
[2025-06-07 04:37:19] [INFO ] Transformed 2523 transitions.
[2025-06-07 04:37:19] [INFO ] Found NUPN structural information;
[2025-06-07 04:37:19] [INFO ] Parsed PT model containing 2723 places and 2523 transitions and 6966 arcs in 552 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 1627 ms. (24 steps per ms) remains 9/16 properties
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 503 ms. (79 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 590 ms. (67 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 291 ms. (137 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 9/9 properties
[2025-06-07 04:37:21] [INFO ] Flatten gal took : 301 ms
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 332 ms. (120 steps per ms) remains 9/9 properties
[2025-06-07 04:37:21] [INFO ] Flatten gal took : 178 ms
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 9/9 properties
// Phase 1: matrix 2523 rows 2723 cols
[2025-06-07 04:37:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7162848837169309646.gal : 109 ms
[2025-06-07 04:37:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17955040308730039585.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/ReachabilityCardinality7162848837169309646.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17955040308730039585.prop' '--nowitness' '--gen-order' 'FOLLOW'
[2025-06-07 04:37:21] [INFO ] Computed 441 invariants in 57 ms
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
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Loading property file /tmp/ReachabilityCardinality17955040308730039585.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 2330/2468 variables, 393/531 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2468 variables, 2330/2861 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2468 variables, 0/2861 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 255/2723 variables, 48/2909 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2723 variables, 255/3164 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2723 variables, 0/3164 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 2523/5246 variables, 2723/5887 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :36 after 108
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :108 after 422
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :422 after 606
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :606 after 1.18742e+08
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :1.18742e+08 after 2.07157e+16
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :2.07157e+16 after 1.08284e+33
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :1.08284e+33 after 5.69741e+70
At refinement iteration 9 (INCLUDED_ONLY) 0/5246 variables, 0/5887 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5246/5246 variables, and 5887 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5038 ms.
Refiners :[Domain max(s): 2723/2723 constraints, Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 2723/2723 constraints, PredecessorRefiner: 9/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 2330/2468 variables, 393/531 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2468 variables, 2330/2861 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:37:28] [INFO ] Deduced a trap composed of 16 places in 516 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:37:28] [INFO ] Deduced a trap composed of 21 places in 523 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:37:29] [INFO ] Deduced a trap composed of 22 places in 488 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:37:30] [INFO ] Deduced a trap composed of 22 places in 508 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:37:30] [INFO ] Deduced a trap composed of 22 places in 469 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:37:31] [INFO ] Deduced a trap composed of 24 places in 473 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:37:31] [INFO ] Deduced a trap composed of 24 places in 432 ms of which 46 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2468/5246 variables, and 2868 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5009 ms.
Refiners :[Domain max(s): 2468/2723 constraints, Positive P Invariants (semi-flows): 393/441 constraints, State Equation: 0/2723 constraints, PredecessorRefiner: 2/7 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10242ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 138 out of 2723 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2723/2723 places, 2523/2523 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 244 transitions
Trivial Post-agglo rules discarded 244 transitions
Performed 244 trivial Post agglomeration. Transition count delta: 244
Iterating post reduction 0 with 244 rules applied. Total rules applied 244 place count 2723 transition count 2279
Reduce places removed 244 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 253 rules applied. Total rules applied 497 place count 2479 transition count 2270
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 506 place count 2470 transition count 2270
Performed 204 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 204 Pre rules applied. Total rules applied 506 place count 2470 transition count 2066
Deduced a syphon composed of 204 places in 5 ms
Reduce places removed 204 places and 0 transitions.
Iterating global reduction 3 with 408 rules applied. Total rules applied 914 place count 2266 transition count 2066
Discarding 253 places :
Symmetric choice reduction at 3 with 253 rule applications. Total rules 1167 place count 2013 transition count 1813
Iterating global reduction 3 with 253 rules applied. Total rules applied 1420 place count 2013 transition count 1813
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 93 Pre rules applied. Total rules applied 1420 place count 2013 transition count 1720
Deduced a syphon composed of 93 places in 27 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 1606 place count 1920 transition count 1720
Performed 536 Post agglomeration using F-continuation condition.Transition count delta: 536
Deduced a syphon composed of 536 places in 2 ms
Reduce places removed 536 places and 0 transitions.
Iterating global reduction 3 with 1072 rules applied. Total rules applied 2678 place count 1384 transition count 1184
Partial Free-agglomeration rule applied 317 times.
Drop transitions (Partial Free agglomeration) removed 317 transitions
Iterating global reduction 3 with 317 rules applied. Total rules applied 2995 place count 1384 transition count 1184
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2996 place count 1383 transition count 1183
Applied a total of 2996 rules in 1578 ms. Remains 1383 /2723 variables (removed 1340) and now considering 1183/2523 (removed 1340) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1585 ms. Remains : 1383/2723 places, 1183/2523 transitions.
RANDOM walk for 40000 steps (8 resets) in 1153 ms. (34 steps per ms) remains 2/9 properties
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 492 ms. (81 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 585 ms. (68 steps per ms) remains 2/2 properties
// Phase 1: matrix 1183 rows 1383 cols
[2025-06-07 04:37:34] [INFO ] Computed 441 invariants in 47 ms
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/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 439/486 variables, 133/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 759/1245 variables, 254/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1245 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 34/1279 variables, 17/404 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1279 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1113/2392 variables, 1279/1683 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2392 variables, 0/1683 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 73/2465 variables, 35/1718 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2465 variables, 7/1725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2465 variables, 0/1725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/2469 variables, 4/1729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2469 variables, 1/1730 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2469 variables, 4/1734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2469 variables, 0/1734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 4/2473 variables, 2/1736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2473 variables, 4/1740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2473 variables, 0/1740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/2475 variables, 1/1741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2475 variables, 2/1743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2475 variables, 0/1743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 58/2533 variables, 35/1778 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2533 variables, 7/1785 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2533 variables, 0/1785 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 3/2536 variables, 7/1792 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2536 variables, 3/1795 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2536 variables, 0/1795 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 21/2557 variables, 8/1803 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2557 variables, 5/1808 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2557 variables, 0/1808 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 9/2566 variables, 16/1824 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2566 variables, 0/1824 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 0/2566 variables, 0/1824 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2566/2566 variables, and 1824 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3237 ms.
Refiners :[Positive P Invariants (semi-flows): 422/422 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 1383/1383 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 439/486 variables, 133/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:37:37] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:37:41] [INFO ] Deduced a trap composed of 9 places in 3481 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:37:41] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:37:41] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:37:41] [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-07 04:37:41] [INFO ] Deduced a trap composed of 13 places in 180 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:37:42] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:37:42] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 8/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 759/1245 variables, 254/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:37:43] [INFO ] Deduced a trap composed of 7 places in 393 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:37:43] [INFO ] Deduced a trap composed of 8 places in 264 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:37:44] [INFO ] Deduced a trap composed of 7 places in 417 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:37:50] [INFO ] Deduced a trap composed of 8 places in 6232 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:37:50] [INFO ] Deduced a trap composed of 8 places in 408 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:01] [INFO ] Deduced a trap composed of 7 places in 11011 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:02] [INFO ] Deduced a trap composed of 8 places in 456 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:02] [INFO ] Deduced a trap composed of 9 places in 393 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:03] [INFO ] Deduced a trap composed of 9 places in 263 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:03] [INFO ] Deduced a trap composed of 9 places in 455 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:04] [INFO ] Deduced a trap composed of 9 places in 448 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:04] [INFO ] Deduced a trap composed of 9 places in 460 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:04] [INFO ] Deduced a trap composed of 9 places in 403 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:05] [INFO ] Deduced a trap composed of 10 places in 449 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:05] [INFO ] Deduced a trap composed of 10 places in 445 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:11] [INFO ] Deduced a trap composed of 10 places in 5941 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:16] [INFO ] Deduced a trap composed of 10 places in 4295 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:16] [INFO ] Deduced a trap composed of 8 places in 348 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:19] [INFO ] Deduced a trap composed of 10 places in 3225 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:20] [INFO ] Deduced a trap composed of 10 places in 458 ms of which 33 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1245 variables, 20/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:20] [INFO ] Deduced a trap composed of 8 places in 408 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:21] [INFO ] Deduced a trap composed of 9 places in 414 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:21] [INFO ] Deduced a trap composed of 10 places in 417 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:22] [INFO ] Deduced a trap composed of 10 places in 403 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:22] [INFO ] Deduced a trap composed of 9 places in 410 ms of which 29 ms to minimize.
SMT process timed out in 48395ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 47 out of 1383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1383/1383 places, 1183/1183 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 1383 transition count 1176
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 1376 transition count 1176
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 14 place count 1376 transition count 1168
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 30 place count 1368 transition count 1168
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 1366 transition count 1166
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 1366 transition count 1166
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 34 place count 1366 transition count 1165
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 1365 transition count 1165
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 3 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 170 place count 1298 transition count 1098
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 20 times.
Drop transitions (Partial Free agglomeration) removed 20 transitions
Iterating global reduction 2 with 20 rules applied. Total rules applied 190 place count 1298 transition count 1098
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 192 place count 1296 transition count 1096
Applied a total of 192 rules in 877 ms. Remains 1296 /1383 variables (removed 87) and now considering 1096/1183 (removed 87) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 888 ms. Remains : 1296/1383 places, 1096/1183 transitions.
RANDOM walk for 40000 steps (8 resets) in 1478 ms. (27 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 466 ms. (85 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 484 ms. (82 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 110004 steps, run timeout after 3008 ms. (steps per millisecond=36 ) properties seen :0 out of 2
Probabilistic random walk after 110004 steps, saw 97412 distinct states, run finished after 3019 ms. (steps per millisecond=36 ) properties seen :0
// Phase 1: matrix 1096 rows 1296 cols
[2025-06-07 04:38:27] [INFO ] Computed 441 invariants in 40 ms
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/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 399/446 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 128/574 variables, 49/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/574 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 22/596 variables, 11/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/596 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 640/1236 variables, 596/790 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1236 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 457/1693 variables, 260/1050 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1693 variables, 69/1119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1693 variables, 1/1120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1693 variables, 0/1120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 16/1709 variables, 19/1139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1709 variables, 16/1155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1709 variables, 0/1155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 10/1719 variables, 5/1160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1719 variables, 6/1166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1719 variables, 0/1166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 8/1727 variables, 4/1170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1727 variables, 2/1172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1727 variables, 0/1172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1/1728 variables, 1/1173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1728 variables, 1/1174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1728 variables, 0/1174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 325/2053 variables, 189/1363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2053 variables, 47/1410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2053 variables, 3/1413 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2053 variables, 0/1413 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 15/2068 variables, 19/1432 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2068 variables, 15/1447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2068 variables, 0/1447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 10/2078 variables, 5/1452 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2078 variables, 6/1458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2078 variables, 0/1458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 4/2082 variables, 2/1460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2082 variables, 0/1460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 190/2272 variables, 119/1579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2272 variables, 28/1607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2272 variables, 0/1607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (OVERLAPS) 7/2279 variables, 10/1617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2279 variables, 7/1624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2279 variables, 0/1624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (OVERLAPS) 4/2283 variables, 2/1626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2283 variables, 2/1628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2283 variables, 0/1628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (OVERLAPS) 6/2289 variables, 3/1631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/2289 variables, 2/1633 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2289 variables, 0/1633 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (OVERLAPS) 2/2291 variables, 2/1635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/2291 variables, 2/1637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/2291 variables, 0/1637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (OVERLAPS) 78/2369 variables, 53/1690 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/2369 variables, 14/1704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2369 variables, 1/1705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/2369 variables, 0/1705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (OVERLAPS) 4/2373 variables, 6/1711 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/2373 variables, 4/1715 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/2373 variables, 0/1715 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (OVERLAPS) 19/2392 variables, 16/1731 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/2392 variables, 6/1737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/2392 variables, 0/1737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (OVERLAPS) 0/2392 variables, 0/1737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2392/2392 variables, and 1737 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2042 ms.
Refiners :[Positive P Invariants (semi-flows): 416/416 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 1296/1296 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 399/446 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:29] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:29] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:29] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:29] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:29] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:29] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 6/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 128/574 variables, 49/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:30] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:30] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:30] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:30] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:30] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:30] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/574 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 22/596 variables, 11/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/596 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 640/1236 variables, 596/802 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:31] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1236 variables, 1/803 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:31] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1236 variables, 1/804 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1236 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 457/1693 variables, 260/1064 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1693 variables, 69/1133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1693 variables, 1/1134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1693 variables, 1/1135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:31] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:31] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:32] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:32] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:32] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:32] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:32] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:32] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:33] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 17 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1693 variables, 9/1144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:33] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:33] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:33] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:33] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:33] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:34] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 13 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1693 variables, 6/1150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:34] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:34] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:34] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1693 variables, 3/1153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:34] [INFO ] Deduced a trap along path composed of 6 places in 25 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1693 variables, 1/1154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:34] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1693 variables, 1/1155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:35] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1693 variables, 1/1156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1693 variables, 0/1156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 16/1709 variables, 19/1175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1709 variables, 16/1191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:35] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 9 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1709 variables, 1/1192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1709 variables, 0/1192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 10/1719 variables, 5/1197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1719 variables, 6/1203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1719 variables, 0/1203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 8/1727 variables, 4/1207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1727 variables, 2/1209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1727 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 1/1728 variables, 1/1210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1728 variables, 1/1211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1728 variables, 0/1211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 325/2053 variables, 189/1400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2053 variables, 47/1447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2053 variables, 3/1450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:36] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 10 ms to minimize.
At refinement iteration 40 (INCLUDED_ONLY) 0/2053 variables, 1/1451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2053 variables, 0/1451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (OVERLAPS) 15/2068 variables, 19/1470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2068 variables, 15/1485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:37] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:37] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 9 ms to minimize.
At refinement iteration 44 (INCLUDED_ONLY) 0/2068 variables, 2/1487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2068 variables, 0/1487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (OVERLAPS) 10/2078 variables, 5/1492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/2078 variables, 6/1498 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2078 variables, 0/1498 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (OVERLAPS) 4/2082 variables, 2/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/2082 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (OVERLAPS) 190/2272 variables, 119/1619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/2272 variables, 28/1647 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:38] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:39] [INFO ] Deduced a trap composed of 29 places in 226 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:39] [INFO ] Deduced a trap composed of 18 places in 408 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:55] [INFO ] Deduced a trap composed of 6 places in 15293 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:55] [INFO ] Deduced a trap composed of 4 places in 342 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:38:55] [INFO ] Deduced a trap composed of 6 places in 426 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:39:04] [INFO ] Deduced a trap composed of 12 places in 8579 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:39:05] [INFO ] Deduced a trap composed of 10 places in 436 ms of which 28 ms to minimize.
At refinement iteration 53 (INCLUDED_ONLY) 0/2272 variables, 8/1655 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:39:05] [INFO ] Deduced a trap along path composed of 3 places in 230 ms of which 28 ms to minimize.
At refinement iteration 54 (INCLUDED_ONLY) 0/2272 variables, 1/1656 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:39:06] [INFO ] Deduced a trap composed of 8 places in 407 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:39:16] [INFO ] Deduced a trap composed of 5 places in 9417 ms of which 30 ms to minimize.
At refinement iteration 55 (INCLUDED_ONLY) 0/2272 variables, 2/1658 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:39:17] [INFO ] Deduced a trap composed of 6 places in 394 ms of which 25 ms to minimize.
At refinement iteration 56 (INCLUDED_ONLY) 0/2272 variables, 1/1659 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/2272 variables, 0/1659 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (OVERLAPS) 7/2279 variables, 10/1669 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/2279 variables, 7/1676 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/2279 variables, 0/1676 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (OVERLAPS) 4/2283 variables, 2/1678 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/2283 variables, 2/1680 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:39:25] [INFO ] Deduced a trap composed of 6 places in 5819 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:39:28] [INFO ] Deduced a trap composed of 6 places in 2393 ms of which 37 ms to minimize.
At refinement iteration 63 (INCLUDED_ONLY) 0/2283 variables, 2/1682 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:39:29] [INFO ] Deduced a trap along path composed of 3 places in 110 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:39:30] [INFO ] Deduced a trap along path composed of 2 places in 41 ms of which 0 ms to minimize.
At refinement iteration 64 (INCLUDED_ONLY) 0/2283 variables, 2/1684 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/2283 variables, 0/1684 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (OVERLAPS) 6/2289 variables, 3/1687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/2289 variables, 2/1689 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/2289 variables, 0/1689 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (OVERLAPS) 2/2291 variables, 2/1691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/2291 variables, 2/1693 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/2291 variables, 0/1693 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (OVERLAPS) 78/2369 variables, 53/1746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/2369 variables, 14/1760 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/2369 variables, 1/1761 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:39:33] [INFO ] Deduced a trap composed of 23 places in 534 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:39:33] [INFO ] Deduced a trap composed of 17 places in 461 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:39:34] [INFO ] Deduced a trap composed of 17 places in 371 ms of which 39 ms to minimize.
At refinement iteration 75 (INCLUDED_ONLY) 0/2369 variables, 3/1764 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:39:35] [INFO ] Deduced a trap along path composed of 2 places in 254 ms of which 32 ms to minimize.
At refinement iteration 76 (INCLUDED_ONLY) 0/2369 variables, 1/1765 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/2369 variables, 0/1765 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (OVERLAPS) 4/2373 variables, 6/1771 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/2373 variables, 4/1775 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/2373 variables, 0/1775 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (OVERLAPS) 19/2392 variables, 16/1791 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/2392 variables, 6/1797 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:39:42] [INFO ] Deduced a trap composed of 8 places in 6013 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:39:43] [INFO ] Deduced a trap composed of 17 places in 493 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:40:00] [INFO ] Deduced a trap composed of 8 places in 16574 ms of which 31 ms to minimize.
SMT process timed out in 92881ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 563 ms.
Support contains 47 out of 1296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 1096/1096 transitions.
Applied a total of 0 rules in 37 ms. Remains 1296 /1296 variables (removed 0) and now considering 1096/1096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 1296/1296 places, 1096/1096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1296/1296 places, 1096/1096 transitions.
Applied a total of 0 rules in 91 ms. Remains 1296 /1296 variables (removed 0) and now considering 1096/1096 (removed 0) transitions.
[2025-06-07 04:40:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:40:02] [INFO ] Implicit Places using invariants in 1296 ms returned []
[2025-06-07 04:40:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:40:04] [INFO ] Implicit Places using invariants and state equation in 2693 ms returned []
Implicit Place search using SMT with State Equation took 4038 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 04:40:04] [INFO ] Redundant transitions in 85 ms returned []
Running 1074 sub problems to find dead transitions.
[2025-06-07 04:40:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1276 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 1074 unsolved
SMT process timed out in 30584ms, After SMT, problems are : Problem set: 0 solved, 1074 unsolved
Search for dead transitions found 0 dead transitions in 30598ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34841 ms. Remains : 1296/1296 places, 1096/1096 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-07 04:40:35] [INFO ] Flatten gal took : 146 ms
[2025-06-07 04:40:35] [INFO ] Applying decomposition
[2025-06-07 04:40:35] [INFO ] Flatten gal took : 74 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/graph4722267478081464182.txt' '-o' '/tmp/graph4722267478081464182.bin' '-w' '/tmp/graph4722267478081464182.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4722267478081464182.bin' '-l' '-1' '-v' '-w' '/tmp/graph4722267478081464182.weights' '-q' '0' '-e' '0.001'
[2025-06-07 04:40:36] [INFO ] Decomposing Gal with order
[2025-06-07 04:40:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 04:40:37] [INFO ] Removed a total of 360 redundant transitions.
[2025-06-07 04:40:37] [INFO ] Flatten gal took : 416 ms
[2025-06-07 04:40:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 43 ms.
[2025-06-07 04:40:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9752456226757681834.gal : 67 ms
[2025-06-07 04:40:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3012724840008449963.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/ReachabilityCardinality9752456226757681834.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3012724840008449963.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality3012724840008449963.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1 after 7515
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :7515 after 9.34478e+111
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :9.34478e+111 after 7.31647e+112
Reachability property ShieldPPPs-PT-040B-ReachabilityFireability-2025-00 is true.
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :7.31647e+112 after 8.55355e+117
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :8.55355e+117 after 8.56157e+117
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :8.56157e+117 after 8.56781e+117
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :8.56781e+117 after 8.58333e+117
Detected timeout of ITS tools.
[2025-06-07 05:10:41] [INFO ] Flatten gal took : 704 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3327627419234128892
[2025-06-07 05:10:42] [INFO ] Applying decomposition
[2025-06-07 05:10:42] [INFO ] Computing symmetric may disable matrix : 1096 transitions.
[2025-06-07 05:10:42] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 05:10:42] [INFO ] Computing symmetric may enable matrix : 1096 transitions.
[2025-06-07 05:10:42] [INFO ] Computation of Complete enable matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 05:10:42] [INFO ] Flatten gal took : 783 ms
[2025-06-07 05:10:44] [INFO ] Computing Do-Not-Accords matrix : 1096 transitions.
[2025-06-07 05:10:44] [INFO ] Computation of Completed DNA matrix. took 80 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 05:10:45] [INFO ] Built C files in 3093ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3327627419234128892
Running compilation step : cd /tmp/ltsmin3327627419234128892;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' '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'
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/graph16514889023088130850.txt' '-o' '/tmp/graph16514889023088130850.bin' '-w' '/tmp/graph16514889023088130850.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16514889023088130850.bin' '-l' '-1' '-v' '-w' '/tmp/graph16514889023088130850.weights' '-q' '0' '-e' '0.001'
[2025-06-07 05:10:46] [INFO ] Decomposing Gal with order
[2025-06-07 05:10:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 05:11:07] [INFO ] Removed a total of 532 redundant transitions.
[2025-06-07 05:11:08] [INFO ] Flatten gal took : 1814 ms
Compilation finished in 23210 ms.
Running link step : cd /tmp/ltsmin3327627419234128892;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 137 ms.
Running LTSmin : cd /tmp/ltsmin3327627419234128892;'/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' 'ShieldPPPsPT040BReachabilityFireability202503==true'
[2025-06-07 05:11:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 888 labels/synchronizations in 1385 ms.
[2025-06-07 05:11:10] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability1150095992190871396.gal : 119 ms
[2025-06-07 05:11:10] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9685835747317439656.prop : 17 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/ReachabilityFireability1150095992190871396.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability9685835747317439656.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityFireability9685835747317439656.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 11
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :11 after 11
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :11 after 66
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :66 after 171072
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :171072 after 1.84758e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.99538e+12 after 5.22239e+27
BK_TIME_CONFINEMENT_REACHED
--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="ShieldPPPs-PT-040B"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldPPPs-PT-040B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r198-tall-174894533300743"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-040B.tgz
mv ShieldPPPs-PT-040B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;