Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K 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.6K 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 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 211K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.1M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 37K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 90K 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 2.3M 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-09-ReachabilityCardinality-2025-00
FORMULA_NAME BlocksWorld-PT-09-ReachabilityCardinality-2025-01
FORMULA_NAME BlocksWorld-PT-09-ReachabilityCardinality-2025-02
FORMULA_NAME BlocksWorld-PT-09-ReachabilityCardinality-2025-03
FORMULA_NAME BlocksWorld-PT-09-ReachabilityCardinality-2025-04
FORMULA_NAME BlocksWorld-PT-09-ReachabilityCardinality-2025-05
FORMULA_NAME BlocksWorld-PT-09-ReachabilityCardinality-2025-06
FORMULA_NAME BlocksWorld-PT-09-ReachabilityCardinality-2025-07
FORMULA_NAME BlocksWorld-PT-09-ReachabilityCardinality-2025-08
FORMULA_NAME BlocksWorld-PT-09-ReachabilityCardinality-2025-09
FORMULA_NAME BlocksWorld-PT-09-ReachabilityCardinality-2025-10
FORMULA_NAME BlocksWorld-PT-09-ReachabilityCardinality-2025-11
FORMULA_NAME BlocksWorld-PT-09-ReachabilityCardinality-2025-12
FORMULA_NAME BlocksWorld-PT-09-ReachabilityCardinality-2025-13
FORMULA_NAME BlocksWorld-PT-09-ReachabilityCardinality-2025-14
FORMULA_NAME BlocksWorld-PT-09-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748626028734

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-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-05-30 17:27:11] [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 17:27:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 17:27:12] [INFO ] Load time of PNML (sax parser for PT used): 854 ms
[2025-05-30 17:27:12] [INFO ] Transformed 2449 places.
[2025-05-30 17:27:12] [INFO ] Transformed 4705 transitions.
[2025-05-30 17:27:12] [INFO ] Found NUPN structural information;
[2025-05-30 17:27:12] [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, pred_on_table_38, pred_on_table_39, pred_on_table_40, pred_on_table_41, pred_on_table_42, pred_on_table_43, pred_on_table_44, pred_on_table_45, pred_on_table_46, pred_on_table_47]
[2025-05-30 17:27:12] [INFO ] Parsed PT model containing 2449 places and 4705 transitions and 23506 arcs in 1129 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 39 ms.
Working with output stream class java.io.PrintStream
[2025-05-30 17:27:14] [INFO ] Flatten gal took : 984 ms
[2025-05-30 17:27:15] [INFO ] Flatten gal took : 366 ms
RANDOM walk for 40000 steps (8 resets) in 9230 ms. (4 steps per ms) remains 6/16 properties
FORMULA BlocksWorld-PT-09-ReachabilityCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-09-ReachabilityCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-09-ReachabilityCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-09-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-09-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-09-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-09-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-09-ReachabilityCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-09-ReachabilityCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-09-ReachabilityCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-05-30 17:27:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11644968061373542136.gal : 319 ms
[2025-05-30 17:27:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3389200785058922746.prop : 10 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/ReachabilityCardinality11644968061373542136.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3389200785058922746.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
BEST_FIRST walk for 40004 steps (8 resets) in 1400 ms. (28 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1266 ms. (31 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1298 ms. (30 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 701 ms. (56 steps per ms) remains 6/6 properties
Loading property file /tmp/ReachabilityCardinality3389200785058922746.prop.
BEST_FIRST walk for 40003 steps (8 resets) in 1185 ms. (33 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 925 ms. (43 steps per ms) remains 5/6 properties
FORMULA BlocksWorld-PT-09-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 4705 rows 2449 cols
[2025-05-30 17:27:17] [INFO ] Computed 97 invariants in 127 ms
[2025-05-30 17:27:17] [INFO ] State equation strengthened by 91 read => feed constraints.
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/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem BlocksWorld-PT-09-ReachabilityCardinality-2025-00 is UNSAT
FORMULA BlocksWorld-PT-09-ReachabilityCardinality-2025-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-09-ReachabilityCardinality-2025-05 is UNSAT
FORMULA BlocksWorld-PT-09-ReachabilityCardinality-2025-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-09-ReachabilityCardinality-2025-10 is UNSAT
FORMULA BlocksWorld-PT-09-ReachabilityCardinality-2025-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-09-ReachabilityCardinality-2025-11 is UNSAT
FORMULA BlocksWorld-PT-09-ReachabilityCardinality-2025-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 2282/2448 variables, 96/96 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2448 variables, 0/96 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/2449 variables, 1/97 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2449 variables, 0/97 constraints. Problems are: Problem set: 4 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7153/7154 variables, and 2546 constraints, problems are : Problem set: 4 solved, 1 unsolved in 3634 ms.
Refiners :[Positive P Invariants (semi-flows): 97/97 constraints, State Equation: 2449/2449 constraints, ReadFeed: 0/91 constraints, PredecessorRefiner: 5/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1038/1053 variables, 24/24 constraints. Problems are: Problem set: 4 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:27:21] [INFO ] Deduced a trap composed of 96 places in 219 ms of which 33 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1053 variables, 1/25 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1053 variables, 0/25 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1396/2449 variables, 73/98 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2449 variables, 0/98 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4704/7153 variables, 2449/2547 constraints. Problems are: Problem set: 4 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 7153/7154 variables, and 2637 constraints, problems are : Problem set: 4 solved, 1 unsolved in 3935 ms.
Refiners :[Positive P Invariants (semi-flows): 97/97 constraints, State Equation: 2449/2449 constraints, ReadFeed: 90/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7978ms problems are : Problem set: 4 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 2449 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2449/2449 places, 4705/4705 transitions.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :4 after 28
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :28 after 37
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :37 after 43
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :43 after 53
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 2449 transition count 4704
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :53 after 70
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :70 after 201
Applied a total of 1 rules in 27254 ms. Remains 2449 /2449 variables (removed 0) and now considering 4704/4705 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27267 ms. Remains : 2449/2449 places, 4704/4705 transitions.
RANDOM walk for 40000 steps (8 resets) in 3577 ms. (11 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 634 ms. (62 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 214876 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 1
Probabilistic random walk after 214876 steps, saw 173018 distinct states, run finished after 3010 ms. (steps per millisecond=71 ) properties seen :0
// Phase 1: matrix 4704 rows 2449 cols
[2025-05-30 17:27:57] [INFO ] Computed 97 invariants in 79 ms
[2025-05-30 17:27:57] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1038/1053 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1053 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1396/2449 variables, 73/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2449 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4704/7153 variables, 2449/2546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7153 variables, 90/2636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7153 variables, 0/2636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/7153 variables, 0/2636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7153/7153 variables, and 2636 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3382 ms.
Refiners :[Positive P Invariants (semi-flows): 97/97 constraints, State Equation: 2449/2449 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1038/1053 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:28:00] [INFO ] Deduced a trap composed of 96 places in 172 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1053 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1053 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1396/2449 variables, 73/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2449 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :201 after 770
At refinement iteration 6 (OVERLAPS) 4704/7153 variables, 2449/2547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7153 variables, 90/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:28:04] [INFO ] Deduced a trap composed of 141 places in 252 ms of which 32 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/7153 variables, 1/2638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/7153 variables, 0/2638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/7153 variables, 0/2638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7153/7153 variables, and 2638 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6126 ms.
Refiners :[Positive P Invariants (semi-flows): 97/97 constraints, State Equation: 2449/2449 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9678ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 311 ms.
Support contains 15 out of 2449 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2449/2449 places, 4704/4704 transitions.
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :770 after 1176
Applied a total of 0 rules in 19482 ms. Remains 2449 /2449 variables (removed 0) and now considering 4704/4704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19484 ms. Remains : 2449/2449 places, 4704/4704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2449/2449 places, 4704/4704 transitions.
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :1176 after 2828
Applied a total of 0 rules in 19341 ms. Remains 2449 /2449 variables (removed 0) and now considering 4704/4704 (removed 0) transitions.
[2025-05-30 17:28:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:28:51] [INFO ] Implicit Places using invariants in 5359 ms returned []
[2025-05-30 17:28:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:28:54] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-30 17:29:04] [INFO ] Implicit Places using invariants and state equation in 13840 ms returned []
Implicit Place search using SMT with State Equation took 19218 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 17:29:05] [INFO ] Redundant transitions in 633 ms returned []
Running 4701 sub problems to find dead transitions.
[2025-05-30 17:29:05] [INFO ] Invariant cache hit.
[2025-05-30 17:29:05] [INFO ] State equation strengthened by 90 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Problem TDEAD1 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1615 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1713 is UNSAT
Problem TDEAD1762 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1860 is UNSAT
Problem TDEAD1909 is UNSAT
Problem TDEAD1958 is UNSAT
Problem TDEAD2007 is UNSAT
Problem TDEAD2056 is UNSAT
Problem TDEAD2105 is UNSAT
Problem TDEAD2154 is UNSAT
Problem TDEAD2203 is UNSAT
Problem TDEAD2252 is UNSAT
Problem TDEAD2301 is UNSAT
Problem TDEAD2399 is UNSAT
Problem TDEAD2448 is UNSAT
Problem TDEAD2542 is UNSAT
Problem TDEAD2634 is UNSAT
Problem TDEAD2724 is UNSAT
Problem TDEAD2812 is UNSAT
Problem TDEAD2898 is UNSAT
Problem TDEAD2982 is UNSAT
Problem TDEAD3064 is UNSAT
Problem TDEAD3144 is UNSAT
Problem TDEAD3222 is UNSAT
Problem TDEAD3298 is UNSAT
Problem TDEAD3372 is UNSAT
Problem TDEAD3444 is UNSAT
Problem TDEAD3514 is UNSAT
Problem TDEAD3582 is UNSAT
Problem TDEAD3648 is UNSAT
Problem TDEAD3712 is UNSAT
Problem TDEAD3774 is UNSAT
Problem TDEAD3892 is UNSAT
Problem TDEAD3948 is UNSAT
Problem TDEAD4002 is UNSAT
Problem TDEAD4054 is UNSAT
Problem TDEAD4104 is UNSAT
Problem TDEAD4198 is UNSAT
Problem TDEAD4242 is UNSAT
Problem TDEAD4284 is UNSAT
Problem TDEAD4324 is UNSAT
Problem TDEAD4362 is UNSAT
Problem TDEAD4398 is UNSAT
Problem TDEAD4432 is UNSAT
Problem TDEAD4464 is UNSAT
Problem TDEAD4494 is UNSAT
Problem TDEAD4522 is UNSAT
Problem TDEAD4548 is UNSAT
Problem TDEAD4572 is UNSAT
Problem TDEAD4594 is UNSAT
Problem TDEAD4614 is UNSAT
Problem TDEAD4632 is UNSAT
Problem TDEAD4648 is UNSAT
Problem TDEAD4662 is UNSAT
Problem TDEAD4674 is UNSAT
Problem TDEAD4684 is UNSAT
Problem TDEAD4692 is UNSAT
Problem TDEAD4702 is UNSAT
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :2828 after 6729
At refinement iteration 0 (INCLUDED_ONLY) 0/2446 variables, 91/91 constraints. Problems are: Problem set: 90 solved, 4611 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2446/7153 variables, and 91 constraints, problems are : Problem set: 90 solved, 4611 unsolved in 30232 ms.
Refiners :[Positive P Invariants (semi-flows): 91/97 constraints, State Equation: 0/2449 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 4656/2352 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 90 solved, 4611 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2401 variables, 4/4 constraints. Problems are: Problem set: 90 solved, 4611 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2401/7153 variables, and 4 constraints, problems are : Problem set: 90 solved, 4611 unsolved in 30151 ms.
Refiners :[Positive P Invariants (semi-flows): 4/97 constraints, State Equation: 0/2449 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 2304/2352 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 73654ms problems are : Problem set: 90 solved, 4611 unsolved
Search for dead transitions found 90 dead transitions in 73696ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) removed 90 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 2449/2449 places, 4614/4704 transitions.
Graph (complete) has 11673 edges and 2449 vertex of which 2404 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.8 ms
Discarding 45 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 19069 ms. Remains 2404 /2449 variables (removed 45) and now considering 4614/4614 (removed 0) transitions.
// Phase 1: matrix 4614 rows 2404 cols
[2025-05-30 17:30:38] [INFO ] Computed 97 invariants in 67 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:30:43] [INFO ] Implicit Places using invariants in 4836 ms returned []
[2025-05-30 17:30:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:30:46] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-30 17:30:52] [INFO ] Implicit Places using invariants and state equation in 9763 ms returned []
Implicit Place search using SMT with State Equation took 14608 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2404/2449 places, 4614/4704 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 146608 ms. Remains : 2404/2449 places, 4614/4704 transitions.
RANDOM walk for 40000 steps (8 resets) in 4629 ms. (8 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 649 ms. (61 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 256355 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 1
Probabilistic random walk after 256355 steps, saw 210505 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
[2025-05-30 17:30:57] [INFO ] Invariant cache hit.
[2025-05-30 17:30:57] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1020/1035 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1035 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1369/2404 variables, 73/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2404 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4614/7018 variables, 2404/2501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7018 variables, 6/2507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7018 variables, 0/2507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/7018 variables, 0/2507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7018/7018 variables, and 2507 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2504 ms.
Refiners :[Positive P Invariants (semi-flows): 97/97 constraints, State Equation: 2404/2404 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1020/1035 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1035 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1369/2404 variables, 73/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2404 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4614/7018 variables, 2404/2501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7018 variables, 6/2507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7018 variables, 0/2507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/7018 variables, 0/2507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7018/7018 variables, and 2507 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3293 ms.
Refiners :[Positive P Invariants (semi-flows): 97/97 constraints, State Equation: 2404/2404 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5826ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 388 ms.
Support contains 15 out of 2404 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2404/2404 places, 4614/4614 transitions.
Applied a total of 0 rules in 18568 ms. Remains 2404 /2404 variables (removed 0) and now considering 4614/4614 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18568 ms. Remains : 2404/2404 places, 4614/4614 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2404/2404 places, 4614/4614 transitions.
Applied a total of 0 rules in 18924 ms. Remains 2404 /2404 variables (removed 0) and now considering 4614/4614 (removed 0) transitions.
[2025-05-30 17:31:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:31:46] [INFO ] Implicit Places using invariants in 5065 ms returned []
[2025-05-30 17:31:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:31:49] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-30 17:31:56] [INFO ] Implicit Places using invariants and state equation in 10189 ms returned []
Implicit Place search using SMT with State Equation took 15257 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 17:31:57] [INFO ] Redundant transitions in 562 ms returned []
Running 4611 sub problems to find dead transitions.
[2025-05-30 17:31:57] [INFO ] Invariant cache hit.
[2025-05-30 17:31:57] [INFO ] State equation strengthened by 6 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.
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :6729 after 14138
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 1.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 0.0)
(s55 1.0)
(s56 1.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 1.0)
(s63 0.0)
(s64 1.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 1.0)
(s69 0.0)
(s70 1.0)
(s71 1.0)
(s72 0.0)
(s73 1.0)
(s74 1.0)
(s75 0.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 1.0)
(s90 0.0)
(s91 1.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 0.0)
(s100 1.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 1.0)
(s105 0.0)
(s106 1.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 1.0)
(s114 0.0)
(s115 1.0)
(s116 1.0)
(s117 0.0)
(s118 1.0)
(s119 1.0)
(s120 0.0)
(s121 1.0)
(s122 1.0)
(s123 0.0)
(s124 1.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 1.0)
(s129 0.0)
(s130 1.0)
(s131 1.0)
(s132 0.0)
(s133 1.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 1.0)
(s138 0.0)
(s139 1.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2401 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 4611 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2401/7018 variables, and 91 constraints, problems are : Problem set: 0 solved, 4611 unsolved in 30097 ms.
Refiners :[Positive P Invariants (semi-flows): 91/97 constraints, State Equation: 0/2404 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 4611/2307 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4611 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2401 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 4611 unsolved
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :14138 after 19536
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2401/7018 variables, and 91 constraints, problems are : Problem set: 0 solved, 4611 unsolved in 30094 ms.
Refiners :[Positive P Invariants (semi-flows): 91/97 constraints, State Equation: 0/2404 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 2304/2307 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 72193ms problems are : Problem set: 0 solved, 4611 unsolved
Search for dead transitions found 0 dead transitions in 72212ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106979 ms. Remains : 2404/2404 places, 4614/4614 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 18714 ms. Remains 2404 /2404 variables (removed 0) and now considering 4614/4614 (removed 0) transitions.
Running SMT prover for 1 properties.
[2025-05-30 17:33:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 17:33:28] [INFO ] After 450ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 17:33:29] [INFO ] [Nat]Absence check using 97 positive place invariants in 114 ms returned sat
[2025-05-30 17:33:32] [INFO ] After 3466ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-30 17:33:33] [INFO ] After 3815ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-30 17:33:33] [INFO ] After 4723ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 23934 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-30 17:33:33] [INFO ] Flatten gal took : 230 ms
[2025-05-30 17:33:33] [INFO ] Applying decomposition
[2025-05-30 17:33:34] [INFO ] Flatten gal took : 198 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/graph11719387277899194973.txt' '-o' '/tmp/graph11719387277899194973.bin' '-w' '/tmp/graph11719387277899194973.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11719387277899194973.bin' '-l' '-1' '-v' '-w' '/tmp/graph11719387277899194973.weights' '-q' '0' '-e' '0.001'
[2025-05-30 17:33:35] [INFO ] Decomposing Gal with order
[2025-05-30 17:33:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 17:33:36] [INFO ] Removed a total of 8837 redundant transitions.
[2025-05-30 17:33:36] [INFO ] Flatten gal took : 1137 ms
[2025-05-30 17:33:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 382 labels/synchronizations in 227 ms.
[2025-05-30 17:33:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13074064166885090393.gal : 57 ms
[2025-05-30 17:33:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6781074666460478621.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13074064166885090393.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6781074666460478621.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/ReachabilityCardinality6781074666460478621.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 11
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :11 after 15
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :15 after 19
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :19 after 24
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :24 after 29
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :29 after 189
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :189 after 459
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :459 after 1063
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1063 after 2880
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2880 after 4459
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4459 after 9370
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :9370 after 22220
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :22220 after 38761
Detected timeout of ITS tools.
[2025-05-30 18:03:44] [INFO ] Flatten gal took : 2626 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin249403735968277410
[2025-05-30 18:03:45] [INFO ] Too many transitions (4614) to apply POR reductions. Disabling POR matrices.
[2025-05-30 18:03:46] [INFO ] Applying decomposition
[2025-05-30 18:03:46] [INFO ] Built C files in 1752ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin249403735968277410
Running compilation step : cd /tmp/ltsmin249403735968277410;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-05-30 18:03:48] [INFO ] Flatten gal took : 2094 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/graph12793939969069815462.txt' '-o' '/tmp/graph12793939969069815462.bin' '-w' '/tmp/graph12793939969069815462.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12793939969069815462.bin' '-l' '-1' '-v' '-w' '/tmp/graph12793939969069815462.weights' '-q' '0' '-e' '0.001'
[2025-05-30 18:04:11] [INFO ] Decomposing Gal with order
[2025-05-30 18:04:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 18:04:13] [INFO ] Removed a total of 8750 redundant transitions.
[2025-05-30 18:04:13] [INFO ] Flatten gal took : 1632 ms
[2025-05-30 18:04:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 206 labels/synchronizations in 93 ms.
[2025-05-30 18:04:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14838156707509623448.gal : 54 ms
[2025-05-30 18:04:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4424647938164758304.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14838156707509623448.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4424647938164758304.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/ReachabilityCardinality4424647938164758304.prop.
Compilation finished in 35357 ms.
Running link step : cd /tmp/ltsmin249403735968277410;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 124 ms.
Running LTSmin : cd /tmp/ltsmin249403735968277410;'/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' 'BlocksWorldPT09ReachabilityCardinality202514==true'
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 15
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :15 after 19
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :19 after 24
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :24 after 37
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :37 after 44
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :44 after 72
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :72 after 98
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :98 after 1878

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

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