fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r002-tall-174853728800214
Last Updated
June 24, 2025

About the Execution of ITS-Tools for Anderson-PT-12

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 3600000.00 0.00 0.00 ??TTTTTTFTTTTTFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853728800214.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 Anderson-PT-12, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853728800214
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K 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 139K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14: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.1M 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 Anderson-PT-12-ReachabilityCardinality-2023-01
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2024-08
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2024-12
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2025-00
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2025-02
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2025-03
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2025-04
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2025-05
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2025-06
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2025-07
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2025-09
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2025-10
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2025-11
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2025-13
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2025-14
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748555534993

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-05-29 21:52:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-29 21:52:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 21:52:16] [INFO ] Load time of PNML (sax parser for PT used): 219 ms
[2025-05-29 21:52:16] [INFO ] Transformed 889 places.
[2025-05-29 21:52:16] [INFO ] Transformed 4152 transitions.
[2025-05-29 21:52:16] [INFO ] Found NUPN structural information;
[2025-05-29 21:52:16] [INFO ] Parsed PT model containing 889 places and 4152 transitions and 16080 arcs in 330 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
FORMULA Anderson-PT-12-ReachabilityCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-ReachabilityCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2958 ms. (13 steps per ms) remains 9/13 properties
FORMULA Anderson-PT-12-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-12-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-12-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-12-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 598 ms. (66 steps per ms) remains 9/9 properties
[2025-05-29 21:52:17] [INFO ] Flatten gal took : 563 ms
BEST_FIRST walk for 40004 steps (8 resets) in 310 ms. (128 steps per ms) remains 8/9 properties
FORMULA Anderson-PT-12-ReachabilityCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (8 resets) in 411 ms. (97 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 340 ms. (117 steps per ms) remains 8/8 properties
[2025-05-29 21:52:18] [INFO ] Flatten gal took : 411 ms
BEST_FIRST walk for 40002 steps (8 resets) in 766 ms. (52 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 312 ms. (127 steps per ms) remains 8/8 properties
[2025-05-29 21:52:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4523677058664824642.gal : 144 ms
[2025-05-29 21:52:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16510046431327538597.prop : 5 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/ReachabilityCardinality4523677058664824642.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16510046431327538597.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (8 resets) in 186 ms. (213 steps per ms) remains 7/8 properties
FORMULA Anderson-PT-12-ReachabilityCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK

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 354 ms. (112 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 310 ms. (128 steps per ms) remains 7/7 properties
// Phase 1: matrix 4152 rows 889 cols
[2025-05-29 21:52:18] [INFO ] Computed 27 invariants in 107 ms
[2025-05-29 21:52:18] [INFO ] State equation strengthened by 132 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Loading property file /tmp/ReachabilityCardinality16510046431327538597.prop.
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/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 715/870 variables, 13/168 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/870 variables, 715/883 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/870 variables, 1/884 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/870 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :8 after 9
At refinement iteration 6 (OVERLAPS) 19/889 variables, 13/897 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :9 after 13
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :13 after 50
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :50 after 63
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :63 after 73
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :73 after 328
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :328 after 534
At refinement iteration 7 (INCLUDED_ONLY) 0/889 variables, 19/916 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :534 after 3610
At refinement iteration 8 (INCLUDED_ONLY) 0/889 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SMT process timed out in 5278ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 155 out of 889 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 889/889 places, 4152/4152 transitions.
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 78 Pre rules applied. Total rules applied 0 place count 889 transition count 4074
Deduced a syphon composed of 78 places in 4 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 0 with 156 rules applied. Total rules applied 156 place count 811 transition count 4074
Discarding 207 places :
Symmetric choice reduction at 0 with 207 rule applications. Total rules 363 place count 604 transition count 1469
Iterating global reduction 0 with 207 rules applied. Total rules applied 570 place count 604 transition count 1469
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 0 with 50 rules applied. Total rules applied 620 place count 579 transition count 1444
Applied a total of 620 rules in 306 ms. Remains 579 /889 variables (removed 310) and now considering 1444/4152 (removed 2708) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 323 ms. Remains : 579/889 places, 1444/4152 transitions.
RANDOM walk for 40000 steps (8 resets) in 446 ms. (89 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 247 ms. (161 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 211 ms. (188 steps per ms) remains 6/7 properties
FORMULA Anderson-PT-12-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 203 ms. (196 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 247 ms. (161 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 197 ms. (202 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 93 ms. (425 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 157 ms. (253 steps per ms) remains 6/6 properties
// Phase 1: matrix 1444 rows 579 cols
[2025-05-29 21:52:24] [INFO ] Computed 27 invariants in 17 ms
[2025-05-29 21:52:24] [INFO ] State equation strengthened by 132 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/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 408/560 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/560 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 19/579 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1444/2023 variables, 579/606 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2023 variables, 132/738 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :3610 after 9038
At refinement iteration 8 (INCLUDED_ONLY) 0/2023 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/2023 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2023/2023 variables, and 738 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2639 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 579/579 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 6/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem Anderson-PT-12-ReachabilityCardinality-2025-09 is UNSAT
FORMULA Anderson-PT-12-ReachabilityCardinality-2025-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 408/560 variables, 13/13 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 1/14 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/560 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 19/579 variables, 13/27 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:52:29] [INFO ] Deduced a trap composed of 62 places in 582 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:52:29] [INFO ] Deduced a trap composed of 67 places in 657 ms of which 71 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 2/29 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:52:30] [INFO ] Deduced a trap composed of 101 places in 436 ms of which 100 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 1/30 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1444/2023 variables, 579/609 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2023 variables, 132/741 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2023 variables, 2/743 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2023 variables, 0/743 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/2023 variables, 0/743 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2023/2023 variables, and 743 constraints, problems are : Problem set: 1 solved, 5 unsolved in 7926 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 579/579 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 6/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10643ms problems are : Problem set: 1 solved, 5 unsolved
FORMULA Anderson-PT-12-ReachabilityCardinality-2025-07 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 1326 ms.
Support contains 126 out of 579 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 579/579 places, 1444/1444 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 579 transition count 1440
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 575 transition count 1440
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 14 place count 569 transition count 1302
Iterating global reduction 0 with 6 rules applied. Total rules applied 20 place count 569 transition count 1302
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 34 place count 562 transition count 1295
Applied a total of 34 rules in 85 ms. Remains 562 /579 variables (removed 17) and now considering 1295/1444 (removed 149) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 562/579 places, 1295/1444 transitions.
RANDOM walk for 40000 steps (8 resets) in 318 ms. (125 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 265 ms. (150 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 239 ms. (166 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 166 ms. (239 steps per ms) remains 4/4 properties
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :9038 after 60038
Interrupted probabilistic random walk after 397167 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :0 out of 4
Probabilistic random walk after 397167 steps, saw 306300 distinct states, run finished after 3006 ms. (steps per millisecond=132 ) properties seen :0
// Phase 1: matrix 1295 rows 562 cols
[2025-05-29 21:52:40] [INFO ] Computed 27 invariants in 11 ms
[2025-05-29 21:52:40] [INFO ] State equation strengthened by 132 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/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 424/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/550 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 12/562 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1295/1857 variables, 562/589 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1857 variables, 132/721 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1857 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/1857 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1857/1857 variables, and 721 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1998 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 562/562 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 424/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/550 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 12/562 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1295/1857 variables, 562/589 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1857 variables, 132/721 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1857 variables, 1/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:52:44] [INFO ] Deduced a trap composed of 67 places in 325 ms of which 61 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1857 variables, 1/723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1857 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1857 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1857/1857 variables, and 723 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3711 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 562/562 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5789ms problems are : Problem set: 0 solved, 4 unsolved
FORMULA Anderson-PT-12-ReachabilityCardinality-2025-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 800 ms.
Support contains 95 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 1295/1295 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 562 transition count 1292
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 559 transition count 1292
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 13 place count 552 transition count 1131
Iterating global reduction 0 with 7 rules applied. Total rules applied 20 place count 552 transition count 1131
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 38 place count 543 transition count 1122
Applied a total of 38 rules in 51 ms. Remains 543 /562 variables (removed 19) and now considering 1122/1295 (removed 173) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 543/562 places, 1122/1295 transitions.
RANDOM walk for 40000 steps (8 resets) in 251 ms. (158 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 214 ms. (186 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 280 ms. (142 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 123 ms. (322 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 340997 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :0 out of 3
Probabilistic random walk after 340997 steps, saw 263251 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
// Phase 1: matrix 1122 rows 543 cols
[2025-05-29 21:52:50] [INFO ] Computed 27 invariants in 7 ms
[2025-05-29 21:52:50] [INFO ] State equation strengthened by 132 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 436/531 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 12/543 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1122/1665 variables, 543/570 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1665 variables, 132/702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1665 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1665 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1665/1665 variables, and 702 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1542 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 543/543 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 436/531 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 12/543 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1122/1665 variables, 543/570 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1665 variables, 132/702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1665 variables, 1/703 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1665 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1665 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1665/1665 variables, and 703 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2005 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 543/543 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3581ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 128 ms.
Support contains 95 out of 543 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 543/543 places, 1122/1122 transitions.
Applied a total of 0 rules in 22 ms. Remains 543 /543 variables (removed 0) and now considering 1122/1122 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 543/543 places, 1122/1122 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 543/543 places, 1122/1122 transitions.
Applied a total of 0 rules in 20 ms. Remains 543 /543 variables (removed 0) and now considering 1122/1122 (removed 0) transitions.
[2025-05-29 21:52:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:52:55] [INFO ] Implicit Places using invariants in 988 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1000 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 542/543 places, 1122/1122 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 542 transition count 1037
Reduce places removed 85 places and 0 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 1 with 108 rules applied. Total rules applied 193 place count 457 transition count 1014
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 216 place count 434 transition count 1014
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 3 with 17 rules applied. Total rules applied 233 place count 434 transition count 997
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 250 place count 417 transition count 997
Applied a total of 250 rules in 48 ms. Remains 417 /542 variables (removed 125) and now considering 997/1122 (removed 125) transitions.
// Phase 1: matrix 997 rows 417 cols
[2025-05-29 21:52:55] [INFO ] Computed 26 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:52:55] [INFO ] Implicit Places using invariants in 696 ms returned []
[2025-05-29 21:52:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:52:56] [INFO ] State equation strengthened by 132 read => feed constraints.
[2025-05-29 21:52:59] [INFO ] Implicit Places using invariants and state equation in 3292 ms returned []
Implicit Place search using SMT with State Equation took 4015 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 417/543 places, 997/1122 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5085 ms. Remains : 417/543 places, 997/1122 transitions.
RANDOM walk for 40000 steps (8 resets) in 165 ms. (240 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 194 ms. (205 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 149 ms. (266 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 2/3 properties
FORMULA Anderson-PT-12-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2025-05-29 21:52:59] [INFO ] Invariant cache hit.
[2025-05-29 21:52:59] [INFO ] State equation strengthened by 132 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 320/406 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 11/417 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 997/1414 variables, 417/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1414 variables, 132/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1414 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1414 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1414/1414 variables, and 575 constraints, problems are : Problem set: 0 solved, 2 unsolved in 695 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 417/417 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 320/406 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 11/417 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:00] [INFO ] Deduced a trap composed of 69 places in 251 ms of which 48 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 997/1414 variables, 417/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1414 variables, 132/576 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1414 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1414 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1414/1414 variables, and 576 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1679 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 417/417 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2404ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 44 ms.
Support contains 86 out of 417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 997/997 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 417 transition count 996
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 416 transition count 995
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 415 transition count 995
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 4 place count 415 transition count 993
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 8 place count 413 transition count 993
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 10 place count 411 transition count 947
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 411 transition count 947
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 409 transition count 945
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 409 transition count 944
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 408 transition count 944
Applied a total of 18 rules in 72 ms. Remains 408 /417 variables (removed 9) and now considering 944/997 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 408/417 places, 944/997 transitions.
RANDOM walk for 40000 steps (8 resets) in 195 ms. (204 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 417442 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :0 out of 2
Probabilistic random walk after 417442 steps, saw 318752 distinct states, run finished after 3001 ms. (steps per millisecond=139 ) properties seen :0
// Phase 1: matrix 944 rows 408 cols
[2025-05-29 21:53:05] [INFO ] Computed 26 invariants in 6 ms
[2025-05-29 21:53:05] [INFO ] State equation strengthened by 132 read => feed constraints.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 311/397 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 11/408 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 944/1352 variables, 408/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1352 variables, 132/566 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1352 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1352 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1352/1352 variables, and 566 constraints, problems are : Problem set: 0 solved, 2 unsolved in 560 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 408/408 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 311/397 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 11/408 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 944/1352 variables, 408/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1352 variables, 132/566 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:06] [INFO ] Deduced a trap composed of 51 places in 237 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:06] [INFO ] Deduced a trap composed of 48 places in 265 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:07] [INFO ] Deduced a trap composed of 67 places in 249 ms of which 46 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1352 variables, 3/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1352 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1352 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1352/1352 variables, and 569 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1753 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 408/408 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2334ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 84 ms.
Support contains 86 out of 408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 408/408 places, 944/944 transitions.
Applied a total of 0 rules in 13 ms. Remains 408 /408 variables (removed 0) and now considering 944/944 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 408/408 places, 944/944 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 408/408 places, 944/944 transitions.
Applied a total of 0 rules in 12 ms. Remains 408 /408 variables (removed 0) and now considering 944/944 (removed 0) transitions.
[2025-05-29 21:53:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:53:08] [INFO ] Implicit Places using invariants in 406 ms returned []
[2025-05-29 21:53:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:53:08] [INFO ] State equation strengthened by 132 read => feed constraints.
[2025-05-29 21:53:11] [INFO ] Implicit Places using invariants and state equation in 3943 ms returned []
Implicit Place search using SMT with State Equation took 4360 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:53:12] [INFO ] Redundant transitions in 75 ms returned []
Running 932 sub problems to find dead transitions.
[2025-05-29 21:53:12] [INFO ] Invariant cache hit.
[2025-05-29 21:53:12] [INFO ] State equation strengthened by 132 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SDD proceeding with computation,8 properties remain. new max is 32768
SDD size :60038 after 379282
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 932 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 932 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:19] [INFO ] Deduced a trap composed of 48 places in 223 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:19] [INFO ] Deduced a trap composed of 50 places in 235 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:20] [INFO ] Deduced a trap composed of 48 places in 209 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:20] [INFO ] Deduced a trap composed of 51 places in 219 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:22] [INFO ] Deduced a trap composed of 53 places in 219 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:22] [INFO ] Deduced a trap composed of 52 places in 214 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:22] [INFO ] Deduced a trap composed of 55 places in 210 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:23] [INFO ] Deduced a trap composed of 47 places in 247 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:23] [INFO ] Deduced a trap composed of 54 places in 238 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:24] [INFO ] Deduced a trap composed of 55 places in 220 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:24] [INFO ] Deduced a trap composed of 54 places in 247 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:24] [INFO ] Deduced a trap composed of 57 places in 212 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:25] [INFO ] Deduced a trap composed of 53 places in 230 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:25] [INFO ] Deduced a trap composed of 56 places in 238 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:26] [INFO ] Deduced a trap composed of 55 places in 219 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:26] [INFO ] Deduced a trap composed of 49 places in 206 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:26] [INFO ] Deduced a trap composed of 63 places in 226 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:26] [INFO ] Deduced a trap composed of 60 places in 222 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:27] [INFO ] Deduced a trap composed of 58 places in 231 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:27] [INFO ] Deduced a trap composed of 51 places in 234 ms of which 43 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 932 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:31] [INFO ] Deduced a trap composed of 51 places in 236 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:32] [INFO ] Deduced a trap composed of 53 places in 242 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:32] [INFO ] Deduced a trap composed of 51 places in 226 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:33] [INFO ] Deduced a trap composed of 55 places in 251 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:35] [INFO ] Deduced a trap composed of 53 places in 241 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:35] [INFO ] Deduced a trap composed of 51 places in 227 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:35] [INFO ] Deduced a trap composed of 55 places in 237 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:36] [INFO ] Deduced a trap composed of 49 places in 235 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:37] [INFO ] Deduced a trap composed of 70 places in 249 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:38] [INFO ] Deduced a trap composed of 58 places in 228 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:38] [INFO ] Deduced a trap composed of 54 places in 236 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:39] [INFO ] Deduced a trap composed of 53 places in 214 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:39] [INFO ] Deduced a trap composed of 65 places in 246 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:41] [INFO ] Deduced a trap composed of 55 places in 216 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:53:41] [INFO ] Deduced a trap composed of 54 places in 236 ms of which 48 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 932 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 408/1352 variables, and 61 constraints, problems are : Problem set: 0 solved, 932 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/408 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 932/932 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 932 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 932 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 932 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 35/61 constraints. Problems are: Problem set: 0 solved, 932 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 408/1352 variables, and 61 constraints, problems are : Problem set: 0 solved, 932 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/408 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/932 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60539ms problems are : Problem set: 0 solved, 932 unsolved
Search for dead transitions found 0 dead transitions in 60544ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65002 ms. Remains : 408/408 places, 944/944 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 111 Pre rules applied. Total rules applied 0 place count 408 transition count 833
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 0 with 222 rules applied. Total rules applied 222 place count 297 transition count 833
Applied a total of 222 rules in 15 ms. Remains 297 /408 variables (removed 111) and now considering 833/944 (removed 111) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 833 rows 297 cols
[2025-05-29 21:54:12] [INFO ] Computed 26 invariants in 10 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-29 21:54:12] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-29 21:54:12] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-05-29 21:54:12] [INFO ] [Nat]Absence check using 14 positive and 12 generalized place invariants in 15 ms returned sat
[2025-05-29 21:54:13] [INFO ] After 481ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-29 21:54:13] [INFO ] After 590ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-29 21:54:13] [INFO ] After 817ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-05-29 21:54:13] [INFO ] Flatten gal took : 28 ms
[2025-05-29 21:54:13] [INFO ] Flatten gal took : 43 ms
[2025-05-29 21:54:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10759862915604824407.gal : 26 ms
[2025-05-29 21:54:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3744618287741398213.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/ReachabilityCardinality10759862915604824407.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3744618287741398213.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/ReachabilityCardinality3744618287741398213.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 11
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :11 after 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 34
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :34 after 40
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :40 after 59
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :59 after 133
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :133 after 436
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :436 after 705
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :705 after 2251
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2251 after 7010
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :7010 after 17082
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :17082 after 48538
Detected timeout of ITS tools.
[2025-05-29 21:54:28] [INFO ] Flatten gal took : 26 ms
[2025-05-29 21:54:28] [INFO ] Applying decomposition
[2025-05-29 21:54:28] [INFO ] Flatten gal took : 26 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/graph13046992564759829988.txt' '-o' '/tmp/graph13046992564759829988.bin' '-w' '/tmp/graph13046992564759829988.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13046992564759829988.bin' '-l' '-1' '-v' '-w' '/tmp/graph13046992564759829988.weights' '-q' '0' '-e' '0.001'
[2025-05-29 21:54:29] [INFO ] Decomposing Gal with order
[2025-05-29 21:54:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 21:54:29] [INFO ] Removed a total of 1609 redundant transitions.
[2025-05-29 21:54:29] [INFO ] Flatten gal took : 156 ms
[2025-05-29 21:54:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 293 labels/synchronizations in 57 ms.
[2025-05-29 21:54:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11622082392220935308.gal : 18 ms
[2025-05-29 21:54:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14173566815107833073.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11622082392220935308.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14173566815107833073.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality14173566815107833073.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :11 after 17904
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :17904 after 1.26539e+07
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 31882 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-29 21:54:44] [INFO ] Flatten gal took : 135 ms
[2025-05-29 21:54:44] [INFO ] Applying decomposition
[2025-05-29 21:54:44] [INFO ] Flatten gal took : 136 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/graph180183933019558524.txt' '-o' '/tmp/graph180183933019558524.bin' '-w' '/tmp/graph180183933019558524.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph180183933019558524.bin' '-l' '-1' '-v' '-w' '/tmp/graph180183933019558524.weights' '-q' '0' '-e' '0.001'
[2025-05-29 21:54:45] [INFO ] Decomposing Gal with order
[2025-05-29 21:54:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 21:54:45] [INFO ] Removed a total of 7572 redundant transitions.
[2025-05-29 21:54:45] [INFO ] Flatten gal took : 425 ms
[2025-05-29 21:54:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 653 labels/synchronizations in 113 ms.
[2025-05-29 21:54:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality109800229095065820.gal : 21 ms
[2025-05-29 21:54:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10926264445720677492.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/ReachabilityCardinality109800229095065820.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10926264445720677492.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality10926264445720677492.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :2 after 3
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :3 after 5
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :10 after 45
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :45 after 80
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :80 after 211
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :211 after 496
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :496 after 951
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :951 after 90912
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :90912 after 1.85255e+08
Detected timeout of ITS tools.
[2025-05-29 22:24:46] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4215603572958151616
[2025-05-29 22:24:46] [INFO ] Applying decomposition
[2025-05-29 22:24:46] [INFO ] Flatten gal took : 25 ms
[2025-05-29 22:24:46] [INFO ] Computing symmetric may disable matrix : 944 transitions.
[2025-05-29 22:24:46] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 22:24:46] [INFO ] Computing symmetric may enable matrix : 944 transitions.
[2025-05-29 22:24:46] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12813697368667536234.txt' '-o' '/tmp/graph12813697368667536234.bin' '-w' '/tmp/graph12813697368667536234.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12813697368667536234.bin' '-l' '-1' '-v' '-w' '/tmp/graph12813697368667536234.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:24:46] [INFO ] Decomposing Gal with order
[2025-05-29 22:24:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:24:46] [INFO ] Removed a total of 1675 redundant transitions.
[2025-05-29 22:24:47] [INFO ] Flatten gal took : 59 ms
[2025-05-29 22:24:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 356 labels/synchronizations in 23 ms.
[2025-05-29 22:24:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality683475577612732492.gal : 10 ms
[2025-05-29 22:24:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1927205524193441582.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/ReachabilityCardinality683475577612732492.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1927205524193441582.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
[2025-05-29 22:24:47] [INFO ] Computing Do-Not-Accords matrix : 944 transitions.
[2025-05-29 22:24:47] [INFO ] Computation of Completed DNA matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 22:24:47] [INFO ] Built C files in 442ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4215603572958151616
Running compilation step : cd /tmp/ltsmin4215603572958151616;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Loading property file /tmp/ReachabilityCardinality1927205524193441582.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :10 after 20
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :20 after 226
Compilation finished in 3013 ms.
Running link step : cd /tmp/ltsmin4215603572958151616;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin4215603572958151616;'/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' 'AndersonPT12ReachabilityCardinality202301==true'
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :226 after 1.31786e+06
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin4215603572958151616;'/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' 'AndersonPT12ReachabilityCardinality202301==true'
Running LTSmin : cd /tmp/ltsmin4215603572958151616;'/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' 'AndersonPT12ReachabilityCardinality202408==true'

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="Anderson-PT-12"
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 Anderson-PT-12, 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 r002-tall-174853728800214"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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