Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r016-smll-174853764300054.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 BlocksWorld-PT-07, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-smll-174853764300054
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K 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.7K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 494K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.7M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.6K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.5M 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 BlocksWorld-PT-07-ReachabilityCardinality-2025-00
FORMULA_NAME BlocksWorld-PT-07-ReachabilityCardinality-2025-01
FORMULA_NAME BlocksWorld-PT-07-ReachabilityCardinality-2025-02
FORMULA_NAME BlocksWorld-PT-07-ReachabilityCardinality-2025-03
FORMULA_NAME BlocksWorld-PT-07-ReachabilityCardinality-2025-04
FORMULA_NAME BlocksWorld-PT-07-ReachabilityCardinality-2025-05
FORMULA_NAME BlocksWorld-PT-07-ReachabilityCardinality-2025-06
FORMULA_NAME BlocksWorld-PT-07-ReachabilityCardinality-2025-07
FORMULA_NAME BlocksWorld-PT-07-ReachabilityCardinality-2025-08
FORMULA_NAME BlocksWorld-PT-07-ReachabilityCardinality-2025-09
FORMULA_NAME BlocksWorld-PT-07-ReachabilityCardinality-2025-10
FORMULA_NAME BlocksWorld-PT-07-ReachabilityCardinality-2025-11
FORMULA_NAME BlocksWorld-PT-07-ReachabilityCardinality-2025-12
FORMULA_NAME BlocksWorld-PT-07-ReachabilityCardinality-2025-13
FORMULA_NAME BlocksWorld-PT-07-ReachabilityCardinality-2025-14
FORMULA_NAME BlocksWorld-PT-07-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748603353791

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-05-30 11:09:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 11:09:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:09:17] [INFO ] Load time of PNML (sax parser for PT used): 496 ms
[2025-05-30 11:09:17] [INFO ] Transformed 1559 places.
[2025-05-30 11:09:17] [INFO ] Transformed 2965 transitions.
[2025-05-30 11:09:17] [INFO ] Found NUPN structural information;
[2025-05-30 11:09:17] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8, pred_on_table_9, pred_on_table_10, pred_on_table_11, pred_on_table_12, pred_on_table_13, pred_on_table_14, pred_on_table_15, pred_on_table_16, pred_on_table_17, pred_on_table_18, pred_on_table_19, pred_on_table_20, pred_on_table_21, pred_on_table_22, pred_on_table_23, pred_on_table_24, pred_on_table_25, pred_on_table_26, pred_on_table_27, pred_on_table_28, pred_on_table_29, pred_on_table_30, pred_on_table_31, pred_on_table_32, pred_on_table_33, pred_on_table_34, pred_on_table_35, pred_on_table_36, pred_on_table_37]
[2025-05-30 11:09:17] [INFO ] Parsed PT model containing 1559 places and 2965 transitions and 14810 arcs in 761 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
[2025-05-30 11:09:19] [INFO ] Flatten gal took : 1169 ms
[2025-05-30 11:09:19] [INFO ] Flatten gal took : 412 ms
RANDOM walk for 40000 steps (8 resets) in 7392 ms. (5 steps per ms) remains 5/16 properties
FORMULA BlocksWorld-PT-07-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-07-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-07-ReachabilityCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-07-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-07-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-07-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-07-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-07-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-07-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-07-ReachabilityCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-07-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-05-30 11:09:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3507844841339993396.gal : 275 ms
[2025-05-30 11:09:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10472886376255091108.prop : 4 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/ReachabilityCardinality3507844841339993396.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10472886376255091108.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (8 resets) in 874 ms. (45 steps per ms) remains 5/5 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
BEST_FIRST walk for 40004 steps (8 resets) in 1198 ms. (33 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 798 ms. (50 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 512 ms. (77 steps per ms) remains 5/5 properties
Loading property file /tmp/ReachabilityCardinality10472886376255091108.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 683 ms. (58 steps per ms) remains 4/5 properties
FORMULA BlocksWorld-PT-07-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 2965 rows 1559 cols
[2025-05-30 11:09:21] [INFO ] Computed 77 invariants in 78 ms
[2025-05-30 11:09:21] [INFO ] State equation strengthened by 63 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem BlocksWorld-PT-07-ReachabilityCardinality-2025-05 is UNSAT
FORMULA BlocksWorld-PT-07-ReachabilityCardinality-2025-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-07-ReachabilityCardinality-2025-10 is UNSAT
FORMULA BlocksWorld-PT-07-ReachabilityCardinality-2025-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 1354/1400 variables, 53/53 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1400 variables, 0/53 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 159/1559 variables, 24/77 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1559 variables, 0/77 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2964/4523 variables, 1559/1636 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4523 variables, 62/1698 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4523 variables, 0/1698 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/4524 variables, 1/1699 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4524 variables, 0/1699 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/4524 variables, 0/1699 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4524/4524 variables, and 1699 constraints, problems are : Problem set: 2 solved, 2 unsolved in 3315 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, State Equation: 1559/1559 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 4
At refinement iteration 1 (OVERLAPS) 1143/1170 variables, 39/39 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :4 after 15
[2025-05-30 11:09:25] [INFO ] Deduced a trap composed of 39 places in 309 ms of which 37 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1170 variables, 1/40 constraints. Problems are: Problem set: 2 solved, 2 unsolved
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :15 after 39
At refinement iteration 3 (INCLUDED_ONLY) 0/1170 variables, 0/40 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 389/1559 variables, 38/78 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :39 after 43
[2025-05-30 11:09:25] [INFO ] Deduced a trap composed of 39 places in 194 ms of which 25 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1559 variables, 1/79 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:09:26] [INFO ] Deduced a trap composed of 39 places in 229 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:09:26] [INFO ] Deduced a trap composed of 76 places in 133 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1559 variables, 2/81 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1559 variables, 0/81 constraints. Problems are: Problem set: 2 solved, 2 unsolved
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :43 after 81
At refinement iteration 8 (OVERLAPS) 2964/4523 variables, 1559/1640 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4523 variables, 62/1702 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4523 variables, 1/1703 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :81 after 184
[2025-05-30 11:09:29] [INFO ] Deduced a trap composed of 76 places in 943 ms of which 125 ms to minimize.
SMT process timed out in 8869ms, After SMT, problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 27 out of 1559 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1559/1559 places, 2965/2965 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1559 transition count 2964
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :184 after 354
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :354 after 547
Applied a total of 1 rules in 11654 ms. Remains 1559 /1559 variables (removed 0) and now considering 2964/2965 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11672 ms. Remains : 1559/1559 places, 2964/2965 transitions.
RANDOM walk for 40000 steps (8 resets) in 3252 ms. (12 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 496 ms. (80 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 432 ms. (92 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 176811 steps, run timeout after 3017 ms. (steps per millisecond=58 ) properties seen :0 out of 2
Probabilistic random walk after 176811 steps, saw 147225 distinct states, run finished after 3029 ms. (steps per millisecond=58 ) properties seen :0
// Phase 1: matrix 2964 rows 1559 cols
[2025-05-30 11:09:45] [INFO ] Computed 77 invariants in 41 ms
[2025-05-30 11:09:45] [INFO ] State equation strengthened by 62 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
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/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1143/1170 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 389/1559 variables, 38/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1559 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2964/4523 variables, 1559/1636 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4523 variables, 62/1698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4523 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/4523 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4523/4523 variables, and 1698 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2371 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, State Equation: 1559/1559 constraints, ReadFeed: 62/62 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/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1143/1170 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:09:48] [INFO ] Deduced a trap composed of 39 places in 228 ms of which 26 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1170 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1170 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 389/1559 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:09:49] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 19 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1559 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:09:49] [INFO ] Deduced a trap composed of 39 places in 214 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:09:49] [INFO ] Deduced a trap composed of 76 places in 152 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1559 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1559 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2964/4523 variables, 1559/1640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4523 variables, 62/1702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4523 variables, 1/1703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:09:53] [INFO ] Deduced a trap composed of 76 places in 1330 ms of which 201 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:09:55] [INFO ] Deduced a trap composed of 175 places in 1512 ms of which 360 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:09:56] [INFO ] Deduced a trap composed of 256 places in 838 ms of which 160 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/4523 variables, 3/1706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4523 variables, 0/1706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/4523 variables, 0/1706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4523/4523 variables, and 1706 constraints, problems are : Problem set: 0 solved, 2 unsolved in 10988 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, State Equation: 1559/1559 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13474ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 231 ms.
Support contains 27 out of 1559 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1559/1559 places, 2964/2964 transitions.
Applied a total of 0 rules in 7623 ms. Remains 1559 /1559 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7624 ms. Remains : 1559/1559 places, 2964/2964 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1559/1559 places, 2964/2964 transitions.
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :547 after 4378
Applied a total of 0 rules in 7123 ms. Remains 1559 /1559 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
[2025-05-30 11:10:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:10:17] [INFO ] Implicit Places using invariants in 3047 ms returned []
[2025-05-30 11:10:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:10:20] [INFO ] State equation strengthened by 62 read => feed constraints.
[2025-05-30 11:10:24] [INFO ] Implicit Places using invariants and state equation in 7124 ms returned []
Implicit Place search using SMT with State Equation took 10195 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:10:24] [INFO ] Redundant transitions in 284 ms returned []
Running 2957 sub problems to find dead transitions.
[2025-05-30 11:10:24] [INFO ] Invariant cache hit.
[2025-05-30 11:10:24] [INFO ] State equation strengthened by 62 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Problem TDEAD115 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1704 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1842 is UNSAT
Problem TDEAD1908 is UNSAT
Problem TDEAD1972 is UNSAT
Problem TDEAD2034 is UNSAT
Problem TDEAD2094 is UNSAT
Problem TDEAD2152 is UNSAT
Problem TDEAD2208 is UNSAT
Problem TDEAD2262 is UNSAT
Problem TDEAD2314 is UNSAT
Problem TDEAD2364 is UNSAT
Problem TDEAD2412 is UNSAT
Problem TDEAD2458 is UNSAT
Problem TDEAD2502 is UNSAT
Problem TDEAD2544 is UNSAT
Problem TDEAD2622 is UNSAT
Problem TDEAD2658 is UNSAT
Problem TDEAD2754 is UNSAT
Problem TDEAD2808 is UNSAT
Problem TDEAD2832 is UNSAT
Problem TDEAD2854 is UNSAT
Problem TDEAD2874 is UNSAT
Problem TDEAD2892 is UNSAT
Problem TDEAD2908 is UNSAT
Problem TDEAD2922 is UNSAT
Problem TDEAD2934 is UNSAT
Problem TDEAD2944 is UNSAT
Problem TDEAD2952 is UNSAT
Problem TDEAD2958 is UNSAT
Problem TDEAD2962 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 64/64 constraints. Problems are: Problem set: 64 solved, 2893 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1552/4523 variables, and 64 constraints, problems are : Problem set: 64 solved, 2893 unsolved in 30191 ms.
Refiners :[Positive P Invariants (semi-flows): 64/77 constraints, State Equation: 0/1559 constraints, ReadFeed: 0/62 constraints, PredecessorRefiner: 2925/1482 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 64 solved, 2893 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 7/7 constraints. Problems are: Problem set: 64 solved, 2893 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1520/4523 variables, and 7 constraints, problems are : Problem set: 64 solved, 2893 unsolved in 30104 ms.
Refiners :[Positive P Invariants (semi-flows): 7/77 constraints, State Equation: 0/1559 constraints, ReadFeed: 0/62 constraints, PredecessorRefiner: 1443/1482 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 68156ms problems are : Problem set: 64 solved, 2893 unsolved
Search for dead transitions found 64 dead transitions in 68186ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 1559/1559 places, 2900/2964 transitions.
Graph (complete) has 7352 edges and 1559 vertex of which 1529 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.5 ms
Discarding 30 places :
Also discarding 0 output transitions
Deduced a syphon composed of 2 places in 2 ms
Applied a total of 1 rules in 7000 ms. Remains 1529 /1559 variables (removed 30) and now considering 2900/2900 (removed 0) transitions.
// Phase 1: matrix 2900 rows 1529 cols
[2025-05-30 11:11:39] [INFO ] Computed 79 invariants in 46 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:11:42] [INFO ] Implicit Places using invariants in 3064 ms returned []
[2025-05-30 11:11:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:11:44] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-05-30 11:11:48] [INFO ] Implicit Places using invariants and state equation in 5471 ms returned []
Implicit Place search using SMT with State Equation took 8541 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1529/1559 places, 2900/2964 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 101363 ms. Remains : 1529/1559 places, 2900/2964 transitions.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
RANDOM walk for 40000 steps (8 resets) in 2508 ms. (15 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 400 ms. (99 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 321 ms. (124 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 204368 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 2
Probabilistic random walk after 204368 steps, saw 171917 distinct states, run finished after 3010 ms. (steps per millisecond=67 ) properties seen :0
// Phase 1: matrix 2900 rows 1527 cols
[2025-05-30 11:11:52] [INFO ] Computed 77 invariants in 21 ms
[2025-05-30 11:11:52] [INFO ] State equation strengthened by 12 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
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/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1080/1105 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1105 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 422/1527 variables, 40/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1527 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2900/4427 variables, 1527/1604 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4427 variables, 12/1616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4427 variables, 0/1616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/4427 variables, 0/1616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4427/4427 variables, and 1616 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2208 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, State Equation: 1527/1527 constraints, ReadFeed: 12/12 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/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1080/1105 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1105 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 422/1527 variables, 40/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:11:55] [INFO ] Deduced a trap composed of 77 places in 233 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:11:55] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1527 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:11:56] [INFO ] Deduced a trap composed of 111 places in 274 ms of which 35 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1527 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1527 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2900/4427 variables, 1527/1607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4427 variables, 12/1619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4427 variables, 1/1620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:11:57] [INFO ] Deduced a trap composed of 76 places in 176 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:11:59] [INFO ] Deduced a trap composed of 76 places in 1177 ms of which 152 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:12:00] [INFO ] Deduced a trap composed of 231 places in 1411 ms of which 312 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:12:01] [INFO ] Deduced a trap composed of 256 places in 619 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:12:01] [INFO ] Deduced a trap composed of 204 places in 435 ms of which 63 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/4427 variables, 5/1625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:12:04] [INFO ] Deduced a trap composed of 231 places in 2045 ms of which 413 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:12:07] [INFO ] Deduced a trap composed of 231 places in 3147 ms of which 673 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:12:08] [INFO ] Deduced a trap composed of 231 places in 514 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:12:09] [INFO ] Deduced a trap composed of 144 places in 1521 ms of which 261 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/4427 variables, 4/1629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:12:12] [INFO ] Deduced a trap composed of 279 places in 2435 ms of which 507 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:12:13] [INFO ] Deduced a trap composed of 204 places in 424 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:12:14] [INFO ] Deduced a trap composed of 319 places in 1242 ms of which 272 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:12:16] [INFO ] Deduced a trap composed of 175 places in 2006 ms of which 371 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/4427 variables, 4/1633 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4427 variables, 0/1633 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:12:19] [INFO ] Deduced a trap composed of 144 places in 1235 ms of which 189 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:12:19] [INFO ] Deduced a trap composed of 279 places in 721 ms of which 161 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:12:20] [INFO ] Deduced a trap composed of 175 places in 570 ms of which 105 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/4427 variables, 3/1636 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:12:23] [INFO ] Deduced a trap composed of 144 places in 2459 ms of which 398 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,5 properties remain. new max is 2048
[2025-05-30 11:12:25] [INFO ] Deduced a trap composed of 76 places in 1754 ms of which 200 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD size :4378 after 20219
[2025-05-30 11:12:27] [INFO ] Deduced a trap composed of 391 places in 2376 ms of which 620 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:12:30] [INFO ] Deduced a trap composed of 111 places in 2315 ms of which 294 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:12:32] [INFO ] Deduced a trap composed of 399 places in 1909 ms of which 411 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/4427 variables, 5/1641 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:12:33] [INFO ] Deduced a trap composed of 111 places in 751 ms of which 137 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:12:35] [INFO ] Deduced a trap composed of 175 places in 1683 ms of which 293 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:12:37] [INFO ] Deduced a trap composed of 400 places in 2115 ms of which 560 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:12:39] [INFO ] Deduced a trap composed of 375 places in 1593 ms of which 344 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:12:41] [INFO ] Deduced a trap composed of 144 places in 1955 ms of which 372 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:12:42] [INFO ] Deduced a trap composed of 175 places in 1132 ms of which 205 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:12:44] [INFO ] Deduced a trap composed of 144 places in 1491 ms of which 253 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:12:45] [INFO ] Deduced a trap composed of 256 places in 1629 ms of which 385 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:12:47] [INFO ] Deduced a trap composed of 396 places in 1736 ms of which 337 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/4427 variables, 9/1650 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:12:48] [INFO ] Deduced a trap composed of 300 places in 857 ms of which 156 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/4427 variables, 1/1651 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:12:49] [INFO ] Deduced a trap composed of 111 places in 324 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:12:50] [INFO ] Deduced a trap composed of 300 places in 1022 ms of which 199 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/4427 variables, 2/1653 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:12:53] [INFO ] Deduced a trap composed of 399 places in 1885 ms of which 363 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/4427 variables, 1/1654 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4427 variables, 0/1654 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/4427 variables, 0/1654 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4427/4427 variables, and 1654 constraints, problems are : Problem set: 0 solved, 2 unsolved in 60543 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, State Equation: 1527/1527 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62810ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 760 ms.
Support contains 25 out of 1527 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1527/1527 places, 2900/2900 transitions.
Applied a total of 0 rules in 6560 ms. Remains 1527 /1527 variables (removed 0) and now considering 2900/2900 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6560 ms. Remains : 1527/1527 places, 2900/2900 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1527/1527 places, 2900/2900 transitions.
Applied a total of 0 rules in 6539 ms. Remains 1527 /1527 variables (removed 0) and now considering 2900/2900 (removed 0) transitions.
[2025-05-30 11:13:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:13:11] [INFO ] Implicit Places using invariants in 2676 ms returned []
[2025-05-30 11:13:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:13:13] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-05-30 11:13:16] [INFO ] Implicit Places using invariants and state equation in 4950 ms returned []
Implicit Place search using SMT with State Equation took 7632 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:13:16] [INFO ] Redundant transitions in 260 ms returned []
Running 2893 sub problems to find dead transitions.
[2025-05-30 11:13:17] [INFO ] Invariant cache hit.
[2025-05-30 11:13:17] [INFO ] State equation strengthened by 12 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 2893 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1520/4427 variables, and 64 constraints, problems are : Problem set: 0 solved, 2893 unsolved in 30109 ms.
Refiners :[Positive P Invariants (semi-flows): 64/77 constraints, State Equation: 0/1527 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 2893/1450 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2893 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 2893 unsolved
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :20219 after 42389
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1520/4427 variables, and 64 constraints, problems are : Problem set: 0 solved, 2893 unsolved in 30103 ms.
Refiners :[Positive P Invariants (semi-flows): 64/77 constraints, State Equation: 0/1527 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 1443/1450 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 66117ms problems are : Problem set: 0 solved, 2893 unsolved
Search for dead transitions found 0 dead transitions in 66129ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80579 ms. Remains : 1527/1527 places, 2900/2900 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 7892 ms. Remains 1527 /1527 variables (removed 0) and now considering 2900/2900 (removed 0) transitions.
Running SMT prover for 2 properties.
Excessive predecessor constraint size, skipping predecessor.
[2025-05-30 11:14:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 11:14:31] [INFO ] After 357ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 11:14:31] [INFO ] [Nat]Absence check using 77 positive place invariants in 70 ms returned sat
[2025-05-30 11:14:33] [INFO ] After 1863ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:14:35] [INFO ] Deduced a trap composed of 320 places in 925 ms of which 192 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:14:35] [INFO ] Deduced a trap composed of 77 places in 372 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:14:35] [INFO ] Deduced a trap composed of 111 places in 226 ms of which 31 ms to minimize.
[2025-05-30 11:14:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1961 ms
TRAPS : Iteration 1
[2025-05-30 11:14:36] [INFO ] After 4531ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-30 11:14:36] [INFO ] After 5291ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 13590 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-30 11:14:37] [INFO ] Flatten gal took : 173 ms
[2025-05-30 11:14:37] [INFO ] Applying decomposition
[2025-05-30 11:14:37] [INFO ] Flatten gal took : 160 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/graph13442419442948822213.txt' '-o' '/tmp/graph13442419442948822213.bin' '-w' '/tmp/graph13442419442948822213.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13442419442948822213.bin' '-l' '-1' '-v' '-w' '/tmp/graph13442419442948822213.weights' '-q' '0' '-e' '0.001'
[2025-05-30 11:14:38] [INFO ] Decomposing Gal with order
[2025-05-30 11:14:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 11:14:38] [INFO ] Removed a total of 147 redundant transitions.
[2025-05-30 11:14:38] [INFO ] Flatten gal took : 497 ms
[2025-05-30 11:14:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 148 labels/synchronizations in 19 ms.
[2025-05-30 11:14:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4849803188049115273.gal : 41 ms
[2025-05-30 11:14:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12323705971616212353.prop : 4 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/ReachabilityCardinality4849803188049115273.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12323705971616212353.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality12323705971616212353.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 15
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :15 after 36
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :36 after 43
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :43 after 86
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :86 after 111
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :111 after 256
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :256 after 457
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :457 after 1218
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1218 after 9826
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :9826 after 32218
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :32218 after 71952
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :71952 after 131696
ITS-tools command line returned an error code 137
[2025-05-30 11:44:25] [INFO ] Flatten gal took : 2504 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2306297517855842710
[2025-05-30 11:44:26] [INFO ] Too many transitions (2900) to apply POR reductions. Disabling POR matrices.
[2025-05-30 11:44:27] [INFO ] Applying decomposition
[2025-05-30 11:44:27] [INFO ] Built C files in 1481ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2306297517855842710
Running compilation step : cd /tmp/ltsmin2306297517855842710;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-05-30 11:44:28] [INFO ] Flatten gal took : 1570 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/graph17791172010068224392.txt' '-o' '/tmp/graph17791172010068224392.bin' '-w' '/tmp/graph17791172010068224392.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17791172010068224392.bin' '-l' '-1' '-v' '-w' '/tmp/graph17791172010068224392.weights' '-q' '0' '-e' '0.001'
[2025-05-30 11:44:35] [INFO ] Decomposing Gal with order
[2025-05-30 11:44:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 11:44:36] [INFO ] Removed a total of 146 redundant transitions.
[2025-05-30 11:44:37] [INFO ] Flatten gal took : 1091 ms
[2025-05-30 11:44:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 146 labels/synchronizations in 16 ms.
[2025-05-30 11:44:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7725041432688520453.gal : 58 ms
[2025-05-30 11:44:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality239797567191232919.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7725041432688520453.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality239797567191232919.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 ...327
Loading property file /tmp/ReachabilityCardinality239797567191232919.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 15
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :15 after 36
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :36 after 43
Compilation finished in 14917 ms.
Running link step : cd /tmp/ltsmin2306297517855842710;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 85 ms.
Running LTSmin : cd /tmp/ltsmin2306297517855842710;'/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' 'BlocksWorldPT07ReachabilityCardinality202504==true'
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :43 after 86
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :86 after 112
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :112 after 275
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :275 after 503
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :503 after 1258
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1258 after 11178
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :11178 after 47588
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin2306297517855842710;'/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' 'BlocksWorldPT07ReachabilityCardinality202504==true'
Running LTSmin : cd /tmp/ltsmin2306297517855842710;'/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' 'BlocksWorldPT07ReachabilityCardinality202512==true'
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :47588 after 76117

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
+ [[ 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="BlocksWorld-PT-07"
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 BlocksWorld-PT-07, 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 r016-smll-174853764300054"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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