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

About the Execution of ITS-Tools for MedleyB-PT-B09

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

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931340000495.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 MedleyB-PT-B09, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931340000495
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 7.1K Jun 6 09:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Jun 6 09:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 6 09:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 6 09:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 6 12:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 6 12:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 12:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 12:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 6.5K Jun 6 09:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Jun 6 09:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 6 09:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Jun 6 09:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 11M Jun 5 20:08 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 MedleyB-PT-B09-ReachabilityFireability-2025-00
FORMULA_NAME MedleyB-PT-B09-ReachabilityFireability-2025-01
FORMULA_NAME MedleyB-PT-B09-ReachabilityFireability-2025-02
FORMULA_NAME MedleyB-PT-B09-ReachabilityFireability-2025-03
FORMULA_NAME MedleyB-PT-B09-ReachabilityFireability-2025-04
FORMULA_NAME MedleyB-PT-B09-ReachabilityFireability-2025-05
FORMULA_NAME MedleyB-PT-B09-ReachabilityFireability-2025-06
FORMULA_NAME MedleyB-PT-B09-ReachabilityFireability-2025-07
FORMULA_NAME MedleyB-PT-B09-ReachabilityFireability-2025-08
FORMULA_NAME MedleyB-PT-B09-ReachabilityFireability-2025-09
FORMULA_NAME MedleyB-PT-B09-ReachabilityFireability-2025-10
FORMULA_NAME MedleyB-PT-B09-ReachabilityFireability-2025-11
FORMULA_NAME MedleyB-PT-B09-ReachabilityFireability-2025-12
FORMULA_NAME MedleyB-PT-B09-ReachabilityFireability-2025-13
FORMULA_NAME MedleyB-PT-B09-ReachabilityFireability-2025-14
FORMULA_NAME MedleyB-PT-B09-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1749402186948

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-08 17:03:08] [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-08 17:03:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 17:03:08] [INFO ] Load time of PNML (sax parser for PT used): 672 ms
[2025-06-08 17:03:09] [INFO ] Transformed 2435 places.
[2025-06-08 17:03:09] [INFO ] Transformed 15948 transitions.
[2025-06-08 17:03:09] [INFO ] Found NUPN structural information;
[2025-06-08 17:03:09] [INFO ] Parsed PT model containing 2435 places and 15948 transitions and 219484 arcs in 934 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (272 resets) in 2700 ms. (14 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 332 ms. (12 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 847 ms. (4 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 75 ms. (52 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 109 ms. (36 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
[2025-06-08 17:03:13] [INFO ] Flatten gal took : 2385 ms
Interrupted probabilistic random walk after 30725 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :0 out of 16
Probabilistic random walk after 30725 steps, saw 11437 distinct states, run finished after 3012 ms. (steps per millisecond=10 ) properties seen :0
// Phase 1: matrix 15948 rows 2435 cols
[2025-06-08 17:03:14] [INFO ] Flatten gal took : 1196 ms
[2025-06-08 17:03:15] [INFO ] Computed 9 invariants in 605 ms
[2025-06-08 17:03:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16553031521982050579.gal : 360 ms
[2025-06-08 17:03:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10168874794772032877.prop : 9 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/ReachabilityCardinality16553031521982050579.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10168874794772032877.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 ...330
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem MedleyB-PT-B09-ReachabilityFireability-2025-04 is UNSAT
FORMULA MedleyB-PT-B09-ReachabilityFireability-2025-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyB-PT-B09-ReachabilityFireability-2025-09 is UNSAT
FORMULA MedleyB-PT-B09-ReachabilityFireability-2025-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyB-PT-B09-ReachabilityFireability-2025-11 is UNSAT
FORMULA MedleyB-PT-B09-ReachabilityFireability-2025-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 2330/2435 variables, 9/114 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2435 variables, 2330/2444 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2435 variables, 0/2444 constraints. Problems are: Problem set: 3 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 18383/18383 variables, and 4879 constraints, problems are : Problem set: 3 solved, 13 unsolved in 5049 ms.
Refiners :[Domain max(s): 2435/2435 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 2435/2435 constraints, PredecessorRefiner: 16/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 13 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 87/87 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/87 constraints. Problems are: Problem set: 3 solved, 13 unsolved
Problem MedleyB-PT-B09-ReachabilityFireability-2025-01 is UNSAT
FORMULA MedleyB-PT-B09-ReachabilityFireability-2025-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 2348/2435 variables, 9/96 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2435 variables, 2348/2444 constraints. Problems are: Problem set: 4 solved, 12 unsolved
Loading property file /tmp/ReachabilityCardinality10168874794772032877.prop.
At refinement iteration 4 (INCLUDED_ONLY) 0/2435 variables, 0/2444 constraints. Problems are: Problem set: 4 solved, 12 unsolved
SMT process timed out in 11062ms, After SMT, problems are : Problem set: 4 solved, 12 unsolved
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 79 out of 2435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2435/2435 places, 15948/15948 transitions.
Graph (trivial) has 2166 edges and 2435 vertex of which 143 / 2435 are part of one of the 23 SCC in 13 ms
Free SCC test removed 120 places
Drop transitions (Empty/Sink Transition effects.) removed 155 transitions
Reduce isomorphic transitions removed 155 transitions.
Graph (complete) has 3994 edges and 2315 vertex of which 2299 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.72 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1635 transitions
Trivial Post-agglo rules discarded 1635 transitions
Performed 1635 trivial Post agglomeration. Transition count delta: 1635
Iterating post reduction 0 with 1643 rules applied. Total rules applied 1645 place count 2299 transition count 14142
Reduce places removed 1635 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 1658 rules applied. Total rules applied 3303 place count 664 transition count 14119
Reduce places removed 11 places and 0 transitions.
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Iterating post reduction 2 with 66 rules applied. Total rules applied 3369 place count 653 transition count 14064
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 3 with 55 rules applied. Total rules applied 3424 place count 598 transition count 14064
Performed 136 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 136 Pre rules applied. Total rules applied 3424 place count 598 transition count 13928
Deduced a syphon composed of 136 places in 24 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 4 with 272 rules applied. Total rules applied 3696 place count 462 transition count 13928
Discarding 132 places :
Symmetric choice reduction at 4 with 132 rule applications. Total rules 3828 place count 330 transition count 13796
Iterating global reduction 4 with 132 rules applied. Total rules applied 3960 place count 330 transition count 13796
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 3982 place count 330 transition count 13774
Discarding 40 places :
Symmetric choice reduction at 5 with 40 rule applications. Total rules 4022 place count 290 transition count 13733
Iterating global reduction 5 with 40 rules applied. Total rules applied 4062 place count 290 transition count 13733
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 4070 place count 290 transition count 13725
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 4087 place count 273 transition count 13704
Iterating global reduction 6 with 17 rules applied. Total rules applied 4104 place count 273 transition count 13704
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 4117 place count 260 transition count 13691
Iterating global reduction 6 with 13 rules applied. Total rules applied 4130 place count 260 transition count 13691
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 4142 place count 260 transition count 13679
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 5 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 4178 place count 242 transition count 13661
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 4186 place count 234 transition count 13653
Iterating global reduction 7 with 8 rules applied. Total rules applied 4194 place count 234 transition count 13653
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 4202 place count 226 transition count 13645
Iterating global reduction 7 with 8 rules applied. Total rules applied 4210 place count 226 transition count 13645
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 4217 place count 219 transition count 13638
Iterating global reduction 7 with 7 rules applied. Total rules applied 4224 place count 219 transition count 13638
Performed 10 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 4244 place count 209 transition count 13650
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 4245 place count 209 transition count 13649
Free-agglomeration rule applied 14 times.
Iterating global reduction 7 with 14 rules applied. Total rules applied 4259 place count 209 transition count 13635
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 4273 place count 195 transition count 13635
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 4276 place count 195 transition count 13632
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 4279 place count 195 transition count 13629
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 4282 place count 192 transition count 13629
Partial Free-agglomeration rule applied 19 times.
Drop transitions (Partial Free agglomeration) removed 19 transitions
Iterating global reduction 9 with 19 rules applied. Total rules applied 4301 place count 192 transition count 13629
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 4304 place count 192 transition count 13626
Applied a total of 4304 rules in 6494 ms. Remains 192 /2435 variables (removed 2243) and now considering 13626/15948 (removed 2322) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6505 ms. Remains : 192/2435 places, 13626/15948 transitions.
RANDOM walk for 40000 steps (1009 resets) in 2408 ms. (16 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (111 resets) in 721 ms. (55 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (111 resets) in 222 ms. (179 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (113 resets) in 509 ms. (78 steps per ms) remains 11/12 properties
FORMULA MedleyB-PT-B09-ReachabilityFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (110 resets) in 323 ms. (123 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (112 resets) in 219 ms. (181 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (116 resets) in 372 ms. (107 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (109 resets) in 279 ms. (142 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (113 resets) in 341 ms. (116 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (112 resets) in 232 ms. (171 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (113 resets) in 575 ms. (69 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (114 resets) in 553 ms. (72 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (112 resets) in 362 ms. (110 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 92711 steps, run timeout after 6001 ms. (steps per millisecond=15 ) properties seen :0 out of 11
Probabilistic random walk after 92711 steps, saw 22570 distinct states, run finished after 6017 ms. (steps per millisecond=15 ) properties seen :0
// Phase 1: matrix 13626 rows 192 cols
[2025-06-08 17:03:40] [INFO ] Computed 9 invariants in 240 ms
[2025-06-08 17:03:41] [INFO ] State equation strengthened by 188 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 114/192 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 13626/13818 variables, 192/201 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13818 variables, 188/389 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13818 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/13818 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13818/13818 variables, and 389 constraints, problems are : Problem set: 0 solved, 11 unsolved in 24696 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 192/192 constraints, ReadFeed: 188/188 constraints, PredecessorRefiner: 11/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 114/192 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 13626/13818 variables, 192/201 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13818 variables, 188/389 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13818 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/13818 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13818/13818 variables, and 389 constraints, problems are : Problem set: 0 solved, 11 unsolved in 39002 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 192/192 constraints, ReadFeed: 188/188 constraints, PredecessorRefiner: 11/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65196ms problems are : Problem set: 0 solved, 11 unsolved
FORMULA MedleyB-PT-B09-ReachabilityFireability-2025-00 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B09-ReachabilityFireability-2025-03 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B09-ReachabilityFireability-2025-05 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B09-ReachabilityFireability-2025-07 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B09-ReachabilityFireability-2025-13 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B09-ReachabilityFireability-2025-15 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 6 properties in 4679 ms.
Support contains 51 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 13626/13626 transitions.
Graph (trivial) has 95 edges and 192 vertex of which 8 / 192 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 188 transition count 13610
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 180 transition count 13610
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 17 place count 180 transition count 13607
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 177 transition count 13607
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 175 transition count 13605
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 175 transition count 13605
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 173 transition count 13600
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 173 transition count 13600
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 172 transition count 13599
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 172 transition count 13599
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 4 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 59 place count 159 transition count 13583
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 73 place count 159 transition count 13569
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 86 place count 146 transition count 13555
Iterating global reduction 3 with 13 rules applied. Total rules applied 99 place count 146 transition count 13555
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 101 place count 144 transition count 13553
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 144 transition count 13553
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 105 place count 144 transition count 13551
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 106 place count 143 transition count 13550
Iterating global reduction 4 with 1 rules applied. Total rules applied 107 place count 143 transition count 13550
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 115 place count 143 transition count 13542
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 120 place count 143 transition count 13537
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 122 place count 141 transition count 13533
Iterating global reduction 5 with 2 rules applied. Total rules applied 124 place count 141 transition count 13533
Free-agglomeration rule applied 51 times.
Iterating global reduction 5 with 51 rules applied. Total rules applied 175 place count 141 transition count 13482
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 5 with 51 rules applied. Total rules applied 226 place count 90 transition count 13482
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 227 place count 89 transition count 13480
Iterating global reduction 6 with 1 rules applied. Total rules applied 228 place count 89 transition count 13480
Drop transitions (Redundant composition of simpler transitions.) removed 251 transitions
Redundant transition composition rules discarded 251 transitions
Iterating global reduction 6 with 251 rules applied. Total rules applied 479 place count 89 transition count 13229
Applied a total of 479 rules in 7012 ms. Remains 89 /192 variables (removed 103) and now considering 13229/13626 (removed 397) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7025 ms. Remains : 89/192 places, 13229/13626 transitions.
RANDOM walk for 40000 steps (1659 resets) in 2562 ms. (15 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 317 ms. (125 steps per ms) remains 4/5 properties
FORMULA MedleyB-PT-B09-ReachabilityFireability-2025-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (162 resets) in 437 ms. (91 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 412 ms. (96 steps per ms) remains 3/4 properties
FORMULA MedleyB-PT-B09-ReachabilityFireability-2025-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 331 ms. (120 steps per ms) remains 2/3 properties
FORMULA MedleyB-PT-B09-ReachabilityFireability-2025-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 644 ms. (62 steps per ms) remains 1/2 properties
FORMULA MedleyB-PT-B09-ReachabilityFireability-2025-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 13229 rows 89 cols
[2025-06-08 17:04:58] [INFO ] Computed 9 invariants in 87 ms
[2025-06-08 17:04:59] [INFO ] State equation strengthened by 30 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/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/88 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13229/13318 variables, 89/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13318 variables, 30/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13318 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13318 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13318/13318 variables, and 128 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6316 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 89/89 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/88 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :10 after 11
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :11 after 19
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :19 after 25
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :25 after 44
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :44 after 348
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :348 after 6824
At refinement iteration 5 (OVERLAPS) 13229/13318 variables, 89/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13318 variables, 30/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13318 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :6824 after 460177
At refinement iteration 8 (OVERLAPS) 0/13318 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13318/13318 variables, and 128 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7313 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 89/89 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13831ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 110 ms.
Support contains 39 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 13229/13229 transitions.
Free-agglomeration rule applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 89 transition count 13217
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 24 place count 77 transition count 13217
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :460177 after 484504
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :484504 after 1.66101e+06
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :1.66101e+06 after 1.74556e+06
SDD proceeding with computation,16 properties remain. new max is 16384
SDD size :1.74556e+06 after 8.82688e+06
Applied a total of 24 rules in 13225 ms. Remains 77 /89 variables (removed 12) and now considering 13217/13229 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13225 ms. Remains : 77/89 places, 13217/13229 transitions.
SDD proceeding with computation,16 properties remain. new max is 32768
SDD size :8.82688e+06 after 1.2099e+08
RANDOM walk for 40000 steps (1649 resets) in 2432 ms. (16 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (177 resets) in 342 ms. (116 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 242 steps, run visited all 1 properties in 10 ms. (steps per millisecond=24 )
Probabilistic random walk after 242 steps, saw 228 distinct states, run finished after 14 ms. (steps per millisecond=17 ) properties seen :1
FORMULA MedleyB-PT-B09-ReachabilityFireability-2025-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
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 138734 ms.

BK_STOP 1749402327021

--------------------
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="MedleyB-PT-B09"
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 MedleyB-PT-B09, 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 r254-tall-174931340000495"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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