Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r119-tall-174876430200292.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 JoinFreeModules-PT-1000, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r119-tall-174876430200292
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 3.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

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1748767830891

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=JoinFreeModules-PT-1000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
QuasiLiveness PT
Running Version 202505121319
[2025-06-01 08:50:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2025-06-01 08:50:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 08:50:32] [INFO ] Load time of PNML (sax parser for PT used): 298 ms
[2025-06-01 08:50:32] [INFO ] Transformed 5001 places.
[2025-06-01 08:50:32] [INFO ] Transformed 8001 transitions.
[2025-06-01 08:50:32] [INFO ] Parsed PT model containing 5001 places and 8001 transitions and 23002 arcs in 439 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 5001/5001 places, 8001/8001 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5000 transition count 8001
Applied a total of 1 rules in 164 ms. Remains 5000 /5001 variables (removed 1) and now considering 8001/8001 (removed 0) transitions.
Running 6000 sub problems to find dead transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2025-06-01 08:50:32] [INFO ] Computed 1000 invariants in 63 ms
[2025-06-01 08:50:33] [INFO ] State equation strengthened by 1000 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4000/13001 variables, and 0 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 20149 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1000 constraints, State Equation: 0/5000 constraints, ReadFeed: 0/1000 constraints, PredecessorRefiner: 6000/6000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6000 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4000/13001 variables, and 0 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 20072 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1000 constraints, State Equation: 0/5000 constraints, ReadFeed: 0/1000 constraints, PredecessorRefiner: 0/6000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44519ms problems are : Problem set: 0 solved, 6000 unsolved
Search for dead transitions found 0 dead transitions in 44568ms
[2025-06-01 08:51:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 08:51:18] [INFO ] Implicit Places using invariants in 1122 ms returned []
[2025-06-01 08:51:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 08:51:21] [INFO ] State equation strengthened by 1000 read => feed constraints.
[2025-06-01 08:51:22] [INFO ] Implicit Places using invariants and state equation in 3651 ms returned []
Implicit Place search using SMT with State Equation took 4786 ms to find 0 implicit places.
Running 6000 sub problems to find dead transitions.
[2025-06-01 08:51:22] [INFO ] Invariant cache hit.
[2025-06-01 08:51:22] [INFO ] State equation strengthened by 1000 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4000/13001 variables, and 0 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1000 constraints, State Equation: 0/5000 constraints, ReadFeed: 0/1000 constraints, PredecessorRefiner: 6000/6000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6000 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4000/13001 variables, and 0 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1000 constraints, State Equation: 0/5000 constraints, ReadFeed: 0/1000 constraints, PredecessorRefiner: 0/6000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64151ms problems are : Problem set: 0 solved, 6000 unsolved
Search for dead transitions found 0 dead transitions in 64163ms
Starting structural reductions in LIVENESS mode, iteration 1 : 5000/5001 places, 8001/8001 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 113773 ms. Remains : 5000/5001 places, 8001/8001 transitions.
Discarding 4000 transitions out of 8001. Remains 4001
Initial state reduction rules removed 1 formulas.
RANDOM walk for 41063 steps (8 resets) in 3106 ms. (13 steps per ms) remains 3923/4000 properties
BEST_FIRST walk for 124 steps (0 resets) in 19 ms. (6 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 18 ms. (6 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 17 ms. (6 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 17 ms. (6 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 21 ms. (5 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 17 ms. (6 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 19 ms. (6 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 15 ms. (7 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 16 ms. (7 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 17 ms. (6 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 13 ms. (8 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 13 ms. (8 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 17 ms. (6 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3923/3923 properties
[2025-06-01 08:52:27] [INFO ] Flatten gal took : 395 ms
BEST_FIRST walk for 124 steps (0 resets) in 13 ms. (8 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 17 ms. (6 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 13 ms. (8 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 15 ms. (7 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 15 ms. (7 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 20 ms. (5 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 19 ms. (6 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 13 ms. (8 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 15 ms. (7 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 18 ms. (6 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 17 ms. (6 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 19 ms. (6 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 19 ms. (6 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 13 ms. (8 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 11 ms. (10 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 11 ms. (10 steps per ms) remains 3923/3923 properties
BEST_FIRST walk for 124 steps (0 resets) in 13 ms. (8 steps per ms) remains 3923/3923 properties
[2025-06-01 08:52:27] [INFO ] Flatten gal took : 322 ms
[2025-06-01 08:52:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality491721738350386858.gal : 115 ms
[2025-06-01 08:52:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2088231883001902342.prop : 20 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/ReachabilityCardinality491721738350386858.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2088231883001902342.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality2088231883001902342.prop.
Probabilistic random walk after 9005 steps, saw 9002 distinct states, run finished after 3001 ms. (steps per millisecond=3 ) properties seen :973
[2025-06-01 08:52:30] [INFO ] Invariant cache hit.
[2025-06-01 08:52:30] [INFO ] State equation strengthened by 1000 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s3 4.0)
(s4 5.0)
(s5 5.0)
(s8 4.0)
(s9 5.0)
(s10 5.0)
(s13 4.0)
(s14 5.0)
(s15 5.0)
(s18 4.0)
(s19 5.0)
(s20 5.0)
(s23 4.0)
(s24 5.0)
(s25 5.0)
(s28 4.0)
(s29 5.0)
(s30 5.0)
(s33 4.0)
(s34 5.0)
(s35 5.0)
(s40 5.0)
(s43 4.0)
(s44 5.0)
(s45 5.0)
(s48 4.0)
(s49 5.0)
(s50 5.0)
(s53 4.0)
(s54 5.0)
(s55 5.0)
(s58 4.0)
(s59 5.0)
(s60 5.0)
(s63 4.0)
(s64 5.0)
(s65 5.0)
(s68 4.0)
(s69 5.0)
(s70 5.0)
(s73 4.0)
(s74 5.0)
(s75 5.0)
(s78 4.0)
(s79 5.0)
(s80 5.0)
(s83 4.0)
(s84 5.0)
(s85 5.0)
(s88 4.0)
(s89 5.0)
(s90 5.0)
(s93 4.0)
(s94 5.0)
(s95 5.0)
(s100 5.0)
(s103 4.0)
(s104 5.0)
(s105 5.0)
(s108 4.0)
(s109 5.0)
(s110 5.0)
(s113 4.0)
(s114 5.0)
(s115 5.0)
(s118 4.0)
(s119 5.0)
(s120 5.0)
(s123 4.0)
(s124 5.0)
(s125 5.0)
(s128 4.0)
(s129 5.0)
(s130 5.0)
(s135 5.0)
(s138 4.0)
(s139 5.0)
(s140 5.0)
(s143 4.0)
(s144 5.0)
(s145 5.0)
(s148 4.0)
(s149 5.0)
(s150 5.0)
(s153 4.0)
(s154 5.0)
(s155 5.0)
(s158 4.0)
(s159 5.0)
(s160 5.0)
(s163 4.0)
(s164 5.0)
(s165 5.0)
(s168 4.0)
(s169 5.0)
(s170 5.0)
(s175 5.0)
(s178 4.0)
(s179 5.0)
(s180 5.0)
(s183 4.0)
(s184 5.0)
(s185 5.0)
(s188 4.0)
(s189 5.0)
(s190 5.0)
(s193 4.0)
(s194 5.0)
(s195 5.0)
(s198 4.0)
(s199 5.0)
(s200 5.0)
(s203 4.0)
(s204 5.0)
(s205 5.0)
(s208 4.0)
(s209 5.0)
(s210 5.0)
(s213 4.0)
(s214 5.0)
(s215 5.0)
(s218 4.0)
(s219 5.0)
(s220 5.0)
(s223 4.0)
(s224 5.0)
(s225 5.0)
(s228 4.0)
(s229 5.0)
(s230 5.0)
(s233 4.0)
(s234 5.0)
(s235 5.0)
(s238 4.0)
(s239 5.0)
(s240 5.0)
(s243 4.0)
(s244 5.0)
(s245 5.0)
(s248 4.0)
(s249 5.0)
(s250 5.0)
(s253 4.0)
(s254 5.0)
(s255 5.0)
(s258 4.0)
(s259 5.0)
(s260 5.0)
(s263 4.0)
(s264 5.0)
(s265 5.0)
(s268 4.0)
(s269 5.0)
(s270 5.0)
(s273 4.0)
(s274 5.0)
(s275 5.0)
(s278 4.0)
(s279 5.0)
(s280 5.0)
(s283 4.0)
(s284 5.0)
(s285 5.0)
(s288 4.0)
(s289 5.0)
(s290 5.0)
(s293 4.0)
(s294 5.0)
(s295 5.0)
(s298 4.0)
(s299 5.0)
(s300 5.0)
(s303 4.0)
(s304 5.0)
(s305 5.0)
(s308 4.0)
(s309 5.0)
(s310 5.0)
(s313 4.0)
(s314 5.0)
(s315 5.0)
(s318 4.0)
(s319 5.0)
(s320 5.0)
(s323 4.0)
(s324 5.0)
(s325 5.0)
(s328 4.0)
(s329 5.0)
(s330 5.0)
(s333 4.0)
(s334 5.0)
(s335 5.0)
(s338 4.0)
(s339 5.0)
(s340 5.0)
(s343 4.0)
(s344 5.0)
(s345 5.0)
(s348 4.0)
(s349 5.0)
(s350 5.0)
(s353 4.0)
(s354 5.0)
(s355 5.0)
(s358 4.0)
(s359 5.0)
(s360 5.0)
(s363 4.0)
(s364 5.0)
(s365 5.0)
(s368 4.0)
(s369 5.0)
(s370 5.0)
(s373 4.0)
(s374 5.0)
(s375 5.0)
(s378 4.0)
(s379 5.0)
(s380 5.0)
(s383 4.0)
(s384 5.0)
(s385 5.0)
(s388 4.0)
(s389 5.0)
(s390 5.0)
(s393 4.0)
(s394 5.0)
(s395 5.0)
(s398 4.0)
(s399 5.0)
(s400 5.0)
(s403 4.0)
(s404 5.0)
(s405 5.0)
(s408 4.0)
(s409 5.0)
(s410 5.0)
(s413 4.0)
(s414 5.0)
(s415 5.0)
(s418 4.0)
(s419 5.0)
(s420 5.0)
(s423 4.0)
(s424 5.0)
(s425 5.0)
(s428 4.0)
(s429 5.0)
(s430 5.0)
(s433 4.0)
(s434 5.0)
(s435 5.0)
(s438 4.0)
(s439 5.0)
(s440 5.0)
(s443 4.0)
(s444 5.0)
(s445 5.0)
(s448 4.0)
(s449 5.0)
(s450 5.0)
(s453 4.0)
(s454 5.0)
(s455 5.0)
(s458 4.0)
(s459 5.0)
(s460 5.0)
(s463 4.0)
(s464 5.0)
(s465 5.0)
(s468 4.0)
(s469 5.0)
(s470 5.0)
(s473 4.0)
(s474 5.0)
(s475 5.0)
(s478 4.0)
(s479 5.0)
(s480 5.0)
(s483 4.0)
(s484 5.0)
(s485 5.0)
(s488 4.0)
(s489 5.0)
(s490 5.0)
(s493 4.0)
(s494 5.0)
(s495 5.0)
(s498 4.0)
(s499 5.0)
(s500 5.0)
(s503 4.0)
(s504 5.0)
(s505 5.0)
(s508 4.0)
(s509 5.0)
(s510 5.0)
(s513 4.0)
(s514 5.0)
(s515 5.0)
(s518 4.0)
(s519 5.0)
(s520 5.0)
(s523 4.0)
(s524 5.0)
(s525 5.0)
(s528 4.0)
(s529 5.0)
(s530 5.0)
(s533 4.0)
(s534 5.0)
(s535 5.0)
(s538 4.0)
(s539 5.0)
(s540 5.0)
(s543 4.0)
(s544 5.0)
(s545 5.0)
(s548 4.0)
(s549 5.0)
(s550 5.0)
(s553 4.0)
(s554 5.0)
(s555 5.0)
(s558 4.0)
(s559 5.0)
(s560 5.0)
(s563 4.0)
(s564 5.0)
(s565 5.0)
(s568 4.0)
(s569 5.0)
(s570 5.0)
(s573 4.0)
(s574 5.0)
(s575 5.0)
(s578 4.0)
(s579 5.0)
(s580 5.0)
(s583 4.0)
(s584 5.0)
(s585 5.0)
(s588 4.0)
(s589 5.0)
(s590 5.0)
(s593 4.0)
(s594 5.0)
(s595 5.0)
(s598 4.0)
(s599 5.0)
(s600 5.0)
(s603 4.0)
(s604 5.0)
(s605 5.0)
(s608 4.0)
(s609 5.0)
(s610 5.0)
(s613 4.0)
(s614 5.0)
(s615 5.0)
(s618 4.0)
(s619 5.0)
(s620 5.0)
(s623 4.0)
(s624 5.0)
(s625 5.0)
(s628 4.0)
(s629 5.0)
(s630 5.0)
(s633 4.0)
(s634 5.0)
(s635 5.0)
(s638 4.0)
(s639 5.0)
(s640 5.0)
(s643 4.0)
(s644 5.0)
(s645 5.0)
(s648 4.0)
(s649 5.0)
(s650 5.0)
(s653 4.0)
(s654 5.0)
(s655 5.0)
(s658 4.0)
(s659 5.0)
(s660 5.0)
(s663 4.0)
(s664 5.0)
(s665 5.0)
(s668 4.0)
(s669 5.0)
(s670 5.0)
(s673 4.0)
(s674 5.0)
(s675 5.0)
(s678 4.0)
(s679 5.0)
(s680 5.0)
(s683 4.0)
(s684 5.0)
(s685 5.0)
(s688 4.0)
(s689 5.0)
(s690 5.0)
(s693 4.0)
(s694 5.0)
(s695 5.0)
(s698 4.0)
(s699 5.0)
(s700 5.0)
(s703 4.0)
(s704 5.0)
(s705 5.0)
(s708 4.0)
(s709 5.0)
(s710 5.0)
(s713 4.0)
(s714 5.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2950/13001 variables, and 0 constraints, problems are : Problem set: 0 solved, 2950 unsolved in 5051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1000 constraints, State Equation: 0/5000 constraints, ReadFeed: 0/1000 constraints, PredecessorRefiner: 2950/2950 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2950 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2950/13001 variables, and 0 constraints, problems are : Problem set: 0 solved, 2950 unsolved in 5043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1000 constraints, State Equation: 0/5000 constraints, ReadFeed: 0/1000 constraints, PredecessorRefiner: 0/2950 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12089ms problems are : Problem set: 0 solved, 2950 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2950 out of 5000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5000 transition count 8000
Applied a total of 1 rules in 352 ms. Remains 5000 /5000 variables (removed 0) and now considering 8000/8001 (removed 1) transitions.
Running 6000 sub problems to find dead transitions.
// Phase 1: matrix 8000 rows 5000 cols
[2025-06-01 08:52:43] [INFO ] Computed 1000 invariants in 33 ms
[2025-06-01 08:52:43] [INFO ] State equation strengthened by 1000 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Reachability property qltransition_3 is true.
SDD proceeding with computation,3922 properties remain. new max is 2
SDD size :1 after 8
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4000/13000 variables, and 0 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 20068 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1000 constraints, State Equation: 0/5000 constraints, ReadFeed: 0/1000 constraints, PredecessorRefiner: 6000/6000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6000 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
SDD proceeding with computation,3922 properties remain. new max is 4
SDD size :8 after 17
Reachability property qltransition_1 is true.
SDD proceeding with computation,3921 properties remain. new max is 4
SDD size :17 after 39
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4000/13000 variables, and 0 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 20078 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1000 constraints, State Equation: 0/5000 constraints, ReadFeed: 0/1000 constraints, PredecessorRefiner: 0/6000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44646ms problems are : Problem set: 0 solved, 6000 unsolved
Search for dead transitions found 0 dead transitions in 44662ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45027 ms. Remains : 5000/5000 places, 8000/8001 transitions.
SDD proceeding with computation,3921 properties remain. new max is 8
SDD size :39 after 69
SDD proceeding with computation,3921 properties remain. new max is 16
SDD size :69 after 144
RANDOM walk for 2309655 steps (4 resets) in 120068 ms. (19 steps per ms) remains 1068/2949 properties
BEST_FIRST walk for 4004 steps (0 resets) in 306 ms. (13 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 266 ms. (14 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 243 ms. (16 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 245 ms. (16 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 243 ms. (16 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 285 ms. (14 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 246 ms. (16 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 242 ms. (16 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 242 ms. (16 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 244 ms. (16 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 239 ms. (16 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 237 ms. (16 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 244 ms. (16 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 275 ms. (14 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 335 ms. (11 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 284 ms. (14 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 238 ms. (16 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 276 ms. (14 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 275 ms. (14 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 238 ms. (16 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 237 ms. (16 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 238 ms. (16 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 264 ms. (15 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 241 ms. (16 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 238 ms. (16 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 240 ms. (16 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 240 ms. (16 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 242 ms. (16 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 218 ms. (18 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 211 ms. (18 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 245 ms. (16 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 275 ms. (14 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 237 ms. (16 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 243 ms. (16 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 246 ms. (16 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 244 ms. (16 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 246 ms. (16 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 248 ms. (16 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 224 ms. (17 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 305 ms. (13 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 236 ms. (16 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 243 ms. (16 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 240 ms. (16 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 242 ms. (16 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 264 ms. (15 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 267 ms. (14 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 234 ms. (17 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 252 ms. (15 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 237 ms. (16 steps per ms) remains 1068/1068 properties
BEST_FIRST walk for 4004 steps (0 resets) in 239 ms. (16 steps per ms) remains 1068/1068 properties
[2025-06-01 08:54:01] [INFO ] Invariant cache hit.
[2025-06-01 08:54:01] [INFO ] State equation strengthened by 1000 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
SDD proceeding with computation,3921 properties remain. new max is 32
SDD size :144 after 359
SDD proceeding with computation,3921 properties remain. new max is 64
SDD size :359 after 1052
SDD proceeding with computation,3921 properties remain. new max is 128
SDD size :1052 after 3479
At refinement iteration 0 (INCLUDED_ONLY) 0/1068 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1068 unsolved
SMT process timed out in 45782ms, After SMT, problems are : Problem set: 0 solved, 1068 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1068 out of 5000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5000/5000 places, 8000/8000 transitions.
Graph (complete) has 12000 edges and 5000 vertex of which 3320 are kept as prefixes of interest. Removing 1680 places using SCC suffix rule.6 ms
Discarding 1680 places :
Also discarding 2688 output transitions
Drop transitions (Output transitions of discarded places.) removed 2688 transitions
Applied a total of 1 rules in 204 ms. Remains 3320 /5000 variables (removed 1680) and now considering 5312/8000 (removed 2688) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 3320/5000 places, 5312/8000 transitions.
SDD proceeding with computation,3921 properties remain. new max is 256
SDD size :3479 after 12466
SDD proceeding with computation,3921 properties remain. new max is 512
SDD size :12466 after 46904
RANDOM walk for 3449305 steps (8 resets) in 120094 ms. (28 steps per ms) remains 120/1068 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1580 ms. (25 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1661 ms. (24 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1520 ms. (26 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1526 ms. (26 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1448 ms. (27 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1586 ms. (25 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1586 ms. (25 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1482 ms. (26 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1554 ms. (25 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1551 ms. (25 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1436 ms. (27 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1509 ms. (26 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1540 ms. (25 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1469 ms. (27 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1638 ms. (24 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1586 ms. (25 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1548 ms. (25 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1566 ms. (25 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1494 ms. (26 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1519 ms. (26 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1485 ms. (26 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1543 ms. (25 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1470 ms. (27 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1573 ms. (25 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1551 ms. (25 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1519 ms. (26 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1450 ms. (27 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1587 ms. (25 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1509 ms. (26 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1516 ms. (26 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1458 ms. (27 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1511 ms. (26 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1508 ms. (26 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1507 ms. (26 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1539 ms. (25 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1415 ms. (28 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1517 ms. (26 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1394 ms. (28 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1535 ms. (26 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1585 ms. (25 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1495 ms. (26 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1567 ms. (25 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1574 ms. (25 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1518 ms. (26 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1546 ms. (25 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1508 ms. (26 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1506 ms. (26 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1546 ms. (25 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1552 ms. (25 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1585 ms. (25 steps per ms) remains 120/120 properties
// Phase 1: matrix 5312 rows 3320 cols
[2025-06-01 08:55:40] [INFO ] Computed 664 invariants in 17 ms
[2025-06-01 08:55:40] [INFO ] State equation strengthened by 664 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 455/575 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:41] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:41] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:41] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:41] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:41] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:41] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:41] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:41] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:41] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:41] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:41] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:41] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:42] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:42] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:42] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:42] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:42] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:42] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:42] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:42] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/575 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:42] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:42] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:42] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:42] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:42] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:42] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:43] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:43] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:43] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:43] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:43] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:43] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:43] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:43] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:43] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:43] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:43] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:43] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:43] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:43] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/575 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:44] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:44] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:44] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:45] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:45] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:55:45] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/575 variables, 6/161 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/575 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 920/1495 variables, 575/736 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1495 variables, 115/851 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1495 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 120 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/1495 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1495/8632 variables, and 851 constraints, problems are : Problem set: 0 solved, 120 unsolved in 27206 ms.
Refiners :[Positive P Invariants (semi-flows): 115/664 constraints, State Equation: 575/3320 constraints, ReadFeed: 115/664 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 455/575 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/575 variables, 46/161 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:56:07] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:56:07] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:56:07] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:56:08] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:56:08] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:56:08] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:56:08] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:56:08] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:56:08] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:56:08] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:56:08] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:56:08] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:56:08] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:56:08] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:56:08] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:56:08] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:56:08] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:56:08] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:56:08] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/575 variables, 19/180 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/575 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 920/1495 variables, 575/755 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1495 variables, 115/870 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1495 variables, 120/990 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:56:15] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:56:15] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:56:15] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:56:15] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:56:15] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:56:15] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:56:17] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:56:17] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:56:18] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:56:20] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1495 variables, 10/1000 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1495 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/1495 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1495/8632 variables, and 1000 constraints, problems are : Problem set: 0 solved, 120 unsolved in 62975 ms.
Refiners :[Positive P Invariants (semi-flows): 115/664 constraints, State Equation: 575/3320 constraints, ReadFeed: 115/664 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 75/75 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 90281ms problems are : Problem set: 0 solved, 120 unsolved
Fused 120 Parikh solutions to 18 different solutions.
SDD proceeding with computation,3921 properties remain. new max is 1024
SDD size :46904 after 181061
Parikh walk visited 119 properties in 122007 ms.
Support contains 1 out of 3320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3320/3320 places, 5312/5312 transitions.
Graph (complete) has 7968 edges and 3320 vertex of which 5 are kept as prefixes of interest. Removing 3315 places using SCC suffix rule.1 ms
Discarding 3315 places :
Also discarding 5304 output transitions
Drop transitions (Output transitions of discarded places.) removed 5304 transitions
Applied a total of 1 rules in 7 ms. Remains 5 /3320 variables (removed 3315) and now considering 8/5312 (removed 5304) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 5/3320 places, 8/5312 transitions.
RANDOM walk for 10050 steps (0 resets) in 5 ms. (1675 steps per ms) remains 0/1 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query QuasiLiveness after proving 4001 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK PARIKH_WALK DECISION_DIAGRAMS COLLATERAL_PROCESSING TOPOLOGICAL INITIAL_STATE
Total runtime 520451 ms.

BK_STOP 1748768352615

--------------------
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
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="JoinFreeModules-PT-1000"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 JoinFreeModules-PT-1000, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r119-tall-174876430200292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-1000.tgz
mv JoinFreeModules-PT-1000 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;