fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r086-smll-174860102300311
Last Updated
June 24, 2025

About the Execution of ITS-Tools for FireWire-PT-09

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

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 194K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K 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.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 100K 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 FireWire-PT-09-ReachabilityFireability-2025-00
FORMULA_NAME FireWire-PT-09-ReachabilityFireability-2025-01
FORMULA_NAME FireWire-PT-09-ReachabilityFireability-2025-02
FORMULA_NAME FireWire-PT-09-ReachabilityFireability-2025-03
FORMULA_NAME FireWire-PT-09-ReachabilityFireability-2025-04
FORMULA_NAME FireWire-PT-09-ReachabilityFireability-2025-05
FORMULA_NAME FireWire-PT-09-ReachabilityFireability-2025-06
FORMULA_NAME FireWire-PT-09-ReachabilityFireability-2025-07
FORMULA_NAME FireWire-PT-09-ReachabilityFireability-2025-08
FORMULA_NAME FireWire-PT-09-ReachabilityFireability-2025-09
FORMULA_NAME FireWire-PT-09-ReachabilityFireability-2025-10
FORMULA_NAME FireWire-PT-09-ReachabilityFireability-2025-11
FORMULA_NAME FireWire-PT-09-ReachabilityFireability-2025-12
FORMULA_NAME FireWire-PT-09-ReachabilityFireability-2025-13
FORMULA_NAME FireWire-PT-09-ReachabilityFireability-2025-14
FORMULA_NAME FireWire-PT-09-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748858820331

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-02 10:07:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 10:07:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 10:07:03] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2025-06-02 10:07:03] [INFO ] Transformed 130 places.
[2025-06-02 10:07:03] [INFO ] Transformed 408 transitions.
[2025-06-02 10:07:03] [INFO ] Found NUPN structural information;
[2025-06-02 10:07:03] [INFO ] Parsed PT model containing 130 places and 408 transitions and 1525 arcs in 461 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
[2025-06-02 10:07:04] [INFO ] Flatten gal took : 314 ms
RANDOM walk for 40000 steps (2204 resets) in 3833 ms. (10 steps per ms) remains 13/16 properties
FORMULA FireWire-PT-09-ReachabilityFireability-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-09-ReachabilityFireability-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-09-ReachabilityFireability-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-02 10:07:04] [INFO ] Flatten gal took : 161 ms
[2025-06-02 10:07:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5670046062562982780.gal : 93 ms
BEST_FIRST walk for 40003 steps (605 resets) in 711 ms. (56 steps per ms) remains 13/13 properties
[2025-06-02 10:07:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17136226655558689945.prop : 24 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/ReachabilityCardinality5670046062562982780.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17136226655558689945.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/ReachabilityCardinality17136226655558689945.prop.
BEST_FIRST walk for 40004 steps (91 resets) in 907 ms. (44 steps per ms) remains 13/13 properties
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :6 after 7
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :7 after 12
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :12 after 17
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :17 after 22
BEST_FIRST walk for 40004 steps (611 resets) in 186 ms. (213 steps per ms) remains 13/13 properties
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :22 after 32
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :32 after 173
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :173 after 475
BEST_FIRST walk for 40001 steps (587 resets) in 341 ms. (116 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (80 resets) in 139 ms. (285 steps per ms) remains 11/13 properties
FORMULA FireWire-PT-09-ReachabilityFireability-2025-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-ReachabilityFireability-2025-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD proceeding with computation,13 properties remain. new max is 1024
SDD size :475 after 830
BEST_FIRST walk for 40004 steps (11 resets) in 204 ms. (195 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (9 resets) in 157 ms. (253 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (12 resets) in 182 ms. (218 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (9 resets) in 555 ms. (71 steps per ms) remains 11/11 properties
SDD proceeding with computation,13 properties remain. new max is 2048
SDD size :830 after 8980
BEST_FIRST walk for 40004 steps (8 resets) in 357 ms. (111 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (13 resets) in 292 ms. (136 steps per ms) remains 11/11 properties
[2025-06-02 10:07:06] [INFO ] Flow matrix only has 320 transitions (discarded 32 similar events)
// Phase 1: matrix 320 rows 130 cols
[2025-06-02 10:07:06] [INFO ] Computed 8 invariants in 19 ms
[2025-06-02 10:07:06] [INFO ] State equation strengthened by 45 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,13 properties remain. new max is 4096
SDD size :8980 after 13212
Problem FireWire-PT-09-ReachabilityFireability-2025-05 is UNSAT
FORMULA FireWire-PT-09-ReachabilityFireability-2025-05 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 1/91 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/91 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Problem FireWire-PT-09-ReachabilityFireability-2025-00 is UNSAT
FORMULA FireWire-PT-09-ReachabilityFireability-2025-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-09-ReachabilityFireability-2025-01 is UNSAT
FORMULA FireWire-PT-09-ReachabilityFireability-2025-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-09-ReachabilityFireability-2025-06 is UNSAT
FORMULA FireWire-PT-09-ReachabilityFireability-2025-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-09-ReachabilityFireability-2025-09 is UNSAT
FORMULA FireWire-PT-09-ReachabilityFireability-2025-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-09-ReachabilityFireability-2025-10 is UNSAT
FORMULA FireWire-PT-09-ReachabilityFireability-2025-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 40/130 variables, 7/98 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 40/138 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/138 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 319/449 variables, 130/268 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 44/312 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 0/312 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/450 variables, 1/313 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/450 variables, 0/313 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/450 variables, 0/313 constraints. Problems are: Problem set: 6 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 313 constraints, problems are : Problem set: 6 solved, 5 unsolved in 1142 ms.
Refiners :[Domain max(s): 130/130 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 130/130 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 10/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 47/47 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/47 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 79/126 variables, 7/54 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 79/133 constraints. Problems are: Problem set: 6 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,13 properties remain. new max is 8192
SDD size :13212 after 62497
[2025-06-02 10:07:08] [INFO ] Deduced a trap composed of 42 places in 415 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:07:08] [INFO ] Deduced a trap composed of 36 places in 246 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:07:08] [INFO ] Deduced a trap composed of 22 places in 213 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 3/136 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/136 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/128 variables, 1/137 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 2/139 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/139 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 319/447 variables, 128/267 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 44/311 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 3/314 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/447 variables, 0/314 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 2/449 variables, 2/316 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/449 variables, 2/318 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/449 variables, 0/318 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 1/450 variables, 1/319 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/450 variables, 0/319 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/450 variables, 0/319 constraints. Problems are: Problem set: 6 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 450/450 variables, and 319 constraints, problems are : Problem set: 6 solved, 5 unsolved in 3777 ms.
Refiners :[Domain max(s): 130/130 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 130/130 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5102ms problems are : Problem set: 6 solved, 5 unsolved
FORMULA FireWire-PT-09-ReachabilityFireability-2025-08 FALSE TECHNIQUES PARIKH_WALK
SDD proceeding with computation,13 properties remain. new max is 16384
SDD size :62497 after 801099
Parikh walk visited 1 properties in 3248 ms.
Support contains 46 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 352/352 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 130 transition count 349
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 128 transition count 345
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 128 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 128 transition count 344
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 128 transition count 338
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 128 transition count 340
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 18 place count 127 transition count 338
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 127 transition count 336
Applied a total of 20 rules in 179 ms. Remains 127 /130 variables (removed 3) and now considering 336/352 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 127/130 places, 336/352 transitions.
RANDOM walk for 40000 steps (2240 resets) in 415 ms. (96 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (599 resets) in 148 ms. (268 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (581 resets) in 272 ms. (146 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (69 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (11 resets) in 233 ms. (170 steps per ms) remains 4/4 properties
Invariant property FireWire-PT-09-ReachabilityFireability-2025-13 does not hold.
Interrupted probabilistic random walk after 407687 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :1 out of 4
Probabilistic random walk after 407687 steps, saw 98612 distinct states, run finished after 3010 ms. (steps per millisecond=135 ) properties seen :1
FORMULA FireWire-PT-09-ReachabilityFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2025-06-02 10:07:18] [INFO ] Flow matrix only has 313 transitions (discarded 23 similar events)
// Phase 1: matrix 313 rows 127 cols
[2025-06-02 10:07:18] [INFO ] Computed 8 invariants in 4 ms
[2025-06-02 10:07:18] [INFO ] State equation strengthened by 46 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/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 85/118 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/125 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 313/438 variables, 125/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 46/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/440 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/440 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 181 constraints, problems are : Problem set: 0 solved, 3 unsolved in 542 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 127/127 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 3/2 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 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 85/118 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:07:19] [INFO ] Deduced a trap composed of 22 places in 249 ms of which 33 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 7/125 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:07:19] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:07:19] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 313/438 variables, 125/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 46/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/440 variables, 2/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/440 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/440 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 186 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1848 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 127/127 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2445ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 366 ms.
Support contains 33 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 336/336 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 335
Applied a total of 2 rules in 37 ms. Remains 126 /127 variables (removed 1) and now considering 335/336 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 126/127 places, 335/336 transitions.
RANDOM walk for 40000 steps (2175 resets) in 373 ms. (106 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (560 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (580 resets) in 219 ms. (181 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (85 resets) in 74 ms. (533 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 791930 steps, run timeout after 3001 ms. (steps per millisecond=263 ) properties seen :0 out of 3
Probabilistic random walk after 791930 steps, saw 175867 distinct states, run finished after 3001 ms. (steps per millisecond=263 ) properties seen :0
[2025-06-02 10:07:24] [INFO ] Flow matrix only has 312 transitions (discarded 23 similar events)
// Phase 1: matrix 312 rows 126 cols
[2025-06-02 10:07:24] [INFO ] Computed 8 invariants in 3 ms
[2025-06-02 10:07:24] [INFO ] State equation strengthened by 46 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/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 85/118 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/124 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 312/436 variables, 124/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 46/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/438 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/438 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 180 constraints, problems are : Problem set: 0 solved, 3 unsolved in 392 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 3/2 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 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 85/118 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:07:25] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:07:25] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:07:25] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/124 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:07:25] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 312/436 variables, 124/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 46/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/436 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/436 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/438 variables, 2/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/438 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/438 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 438/438 variables, and 186 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1353 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1784ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 274 ms.
Support contains 33 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 335/335 transitions.
Applied a total of 0 rules in 23 ms. Remains 126 /126 variables (removed 0) and now considering 335/335 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 126/126 places, 335/335 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 335/335 transitions.
Applied a total of 0 rules in 13 ms. Remains 126 /126 variables (removed 0) and now considering 335/335 (removed 0) transitions.
[2025-06-02 10:07:26] [INFO ] Flow matrix only has 312 transitions (discarded 23 similar events)
[2025-06-02 10:07:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:07:26] [INFO ] Implicit Places using invariants in 520 ms returned []
[2025-06-02 10:07:27] [INFO ] Flow matrix only has 312 transitions (discarded 23 similar events)
[2025-06-02 10:07:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:07:27] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-02 10:07:27] [INFO ] Implicit Places using invariants and state equation in 364 ms returned [13, 39]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 924 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 124/126 places, 335/335 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 124 transition count 334
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 123 transition count 334
Applied a total of 2 rules in 35 ms. Remains 123 /124 variables (removed 1) and now considering 334/335 (removed 1) transitions.
[2025-06-02 10:07:27] [INFO ] Flow matrix only has 311 transitions (discarded 23 similar events)
// Phase 1: matrix 311 rows 123 cols
[2025-06-02 10:07:27] [INFO ] Computed 6 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:07:27] [INFO ] Implicit Places using invariants in 136 ms returned []
[2025-06-02 10:07:27] [INFO ] Flow matrix only has 311 transitions (discarded 23 similar events)
[2025-06-02 10:07:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:07:27] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-02 10:07:27] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 123/126 places, 334/335 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1465 ms. Remains : 123/126 places, 334/335 transitions.
RANDOM walk for 40000 steps (2253 resets) in 250 ms. (159 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (600 resets) in 116 ms. (341 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (536 resets) in 258 ms. (154 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (67 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
Reachability property FireWire-PT-09-ReachabilityFireability-2025-12 is true.
Reachability property FireWire-PT-09-ReachabilityFireability-2025-11 is true.
Interrupted probabilistic random walk after 703688 steps, run timeout after 3001 ms. (steps per millisecond=234 ) properties seen :0 out of 3
Probabilistic random walk after 703688 steps, saw 152207 distinct states, run finished after 3001 ms. (steps per millisecond=234 ) properties seen :0
[2025-06-02 10:07:31] [INFO ] Flow matrix only has 311 transitions (discarded 23 similar events)
[2025-06-02 10:07:31] [INFO ] Invariant cache hit.
[2025-06-02 10:07:31] [INFO ] State equation strengthened by 46 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/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 83/116 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 4/120 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 311/431 variables, 120/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/431 variables, 46/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/431 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3/434 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/434 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 175 constraints, problems are : Problem set: 0 solved, 3 unsolved in 329 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 123/123 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 3/2 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/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 83/116 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:07:31] [INFO ] Deduced a trap composed of 22 places in 191 ms of which 26 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 4/120 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:07:31] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:07:31] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 311/431 variables, 120/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 46/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 3/434 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/434 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/434 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 180 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1129 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 123/123 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1476ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 893 ms.
Support contains 33 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 334/334 transitions.
Applied a total of 0 rules in 15 ms. Remains 123 /123 variables (removed 0) and now considering 334/334 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 123/123 places, 334/334 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 334/334 transitions.
Applied a total of 0 rules in 18 ms. Remains 123 /123 variables (removed 0) and now considering 334/334 (removed 0) transitions.
[2025-06-02 10:07:33] [INFO ] Flow matrix only has 311 transitions (discarded 23 similar events)
[2025-06-02 10:07:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:07:33] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-06-02 10:07:33] [INFO ] Flow matrix only has 311 transitions (discarded 23 similar events)
[2025-06-02 10:07:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:07:33] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-02 10:07:33] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 10:07:33] [INFO ] Redundant transitions in 25 ms returned []
Running 333 sub problems to find dead transitions.
[2025-06-02 10:07:33] [INFO ] Flow matrix only has 311 transitions (discarded 23 similar events)
[2025-06-02 10:07:33] [INFO ] Invariant cache hit.
[2025-06-02 10:07:33] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:07:38] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:07:38] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:07:38] [INFO ] Deduced a trap composed of 35 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-02 10:07:38] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:07:39] [INFO ] Deduced a trap composed of 22 places in 218 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:07:40] [INFO ] Deduced a trap composed of 22 places in 170 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Invariant property FireWire-PT-09-ReachabilityFireability-2025-08 does not hold.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (OVERLAPS) 311/434 variables, 123/135 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 46/181 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Reachability property FireWire-PT-09-ReachabilityFireability-2025-04 is true.
FORMULA FireWire-PT-09-ReachabilityFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
At refinement iteration 7 (OVERLAPS) 0/434 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 333 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 181 constraints, problems are : Problem set: 0 solved, 333 unsolved in 29895 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 123/123 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 333 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Reachability property FireWire-PT-09-ReachabilityFireability-2025-03 is true.
FORMULA FireWire-PT-09-ReachabilityFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property FireWire-PT-09-ReachabilityFireability-2025-02 is true.
FORMULA FireWire-PT-09-ReachabilityFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :801099 after 3.20274e+06
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (OVERLAPS) 311/434 variables, 123/135 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 46/181 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 333/514 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:08:19] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:08:23] [INFO ] Deduced a trap composed of 17 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-02 10:08:24] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 3/517 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/434 variables, and 517 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 123/123 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60164ms problems are : Problem set: 0 solved, 333 unsolved
Search for dead transitions found 0 dead transitions in 60168ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60599 ms. Remains : 123/123 places, 334/334 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 91229 ms.

BK_STOP 1748858914304

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-09"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is FireWire-PT-09, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r086-smll-174860102300311"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-09.tgz
mv FireWire-PT-09 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;