About the Execution of ITS-Tools for MedleyB-PT-B02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 15305.00 | 0.00 | 0.00 | FTTFFTFTTFTFFTTT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339900439.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-B02, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339900439
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 7.9K Jun 6 09:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Jun 6 09:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 6 09:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 6 09:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 12:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 12:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 12:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 11K Jun 6 09:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Jun 6 09:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Jun 6 09:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 6 09:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:09 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 253K 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-B02-ReachabilityFireability-2025-00
FORMULA_NAME MedleyB-PT-B02-ReachabilityFireability-2025-01
FORMULA_NAME MedleyB-PT-B02-ReachabilityFireability-2025-02
FORMULA_NAME MedleyB-PT-B02-ReachabilityFireability-2025-03
FORMULA_NAME MedleyB-PT-B02-ReachabilityFireability-2025-04
FORMULA_NAME MedleyB-PT-B02-ReachabilityFireability-2025-05
FORMULA_NAME MedleyB-PT-B02-ReachabilityFireability-2025-06
FORMULA_NAME MedleyB-PT-B02-ReachabilityFireability-2025-07
FORMULA_NAME MedleyB-PT-B02-ReachabilityFireability-2025-08
FORMULA_NAME MedleyB-PT-B02-ReachabilityFireability-2025-09
FORMULA_NAME MedleyB-PT-B02-ReachabilityFireability-2025-10
FORMULA_NAME MedleyB-PT-B02-ReachabilityFireability-2025-11
FORMULA_NAME MedleyB-PT-B02-ReachabilityFireability-2025-12
FORMULA_NAME MedleyB-PT-B02-ReachabilityFireability-2025-13
FORMULA_NAME MedleyB-PT-B02-ReachabilityFireability-2025-14
FORMULA_NAME MedleyB-PT-B02-ReachabilityFireability-2025-15
=== Now, execution of the tool begins
BK_START 1749387448669
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-B02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-08 12:57:29] [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 12:57:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 12:57:30] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2025-06-08 12:57:30] [INFO ] Transformed 1227 places.
[2025-06-08 12:57:30] [INFO ] Transformed 1472 transitions.
[2025-06-08 12:57:30] [INFO ] Found NUPN structural information;
[2025-06-08 12:57:30] [INFO ] Parsed PT model containing 1227 places and 1472 transitions and 4160 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2025-06-08 12:57:30] [INFO ] Flatten gal took : 252 ms
RANDOM walk for 40000 steps (516 resets) in 2013 ms. (19 steps per ms) remains 10/16 properties
FORMULA MedleyB-PT-B02-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B02-ReachabilityFireability-2025-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B02-ReachabilityFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B02-ReachabilityFireability-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B02-ReachabilityFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B02-ReachabilityFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-08 12:57:30] [INFO ] Flatten gal took : 150 ms
BEST_FIRST walk for 40004 steps (141 resets) in 558 ms. (71 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (109 resets) in 243 ms. (163 steps per ms) remains 10/10 properties
[2025-06-08 12:57:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7548127184751916477.gal : 90 ms
BEST_FIRST walk for 40002 steps (109 resets) in 114 ms. (347 steps per ms) remains 10/10 properties
[2025-06-08 12:57:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1827629772748863109.prop : 6 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/ReachabilityCardinality7548127184751916477.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1827629772748863109.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 ...328
BEST_FIRST walk for 40004 steps (103 resets) in 417 ms. (95 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (107 resets) in 157 ms. (253 steps per ms) remains 10/10 properties
Loading property file /tmp/ReachabilityCardinality1827629772748863109.prop.
BEST_FIRST walk for 40003 steps (107 resets) in 135 ms. (294 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (106 resets) in 109 ms. (363 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (101 resets) in 89 ms. (444 steps per ms) remains 9/10 properties
FORMULA MedleyB-PT-B02-ReachabilityFireability-2025-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (107 resets) in 135 ms. (294 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (103 resets) in 82 ms. (481 steps per ms) remains 9/9 properties
// Phase 1: matrix 1472 rows 1227 cols
[2025-06-08 12:57:31] [INFO ] Computed 5 invariants in 30 ms
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/109 variables, 109/109 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :7 after 9
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :9 after 15
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :15 after 18
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :18 after 21
Problem MedleyB-PT-B02-ReachabilityFireability-2025-04 is UNSAT
FORMULA MedleyB-PT-B02-ReachabilityFireability-2025-04 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1118/1227 variables, 5/114 constraints. Problems are: Problem set: 1 solved, 8 unsolved
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :21 after 75
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :75 after 94
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :94 after 152
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :152 after 6493
At refinement iteration 3 (INCLUDED_ONLY) 0/1227 variables, 1118/1232 constraints. Problems are: Problem set: 1 solved, 8 unsolved
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :6493 after 121039
At refinement iteration 4 (INCLUDED_ONLY) 0/1227 variables, 0/1232 constraints. Problems are: Problem set: 1 solved, 8 unsolved
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :121039 after 166779
At refinement iteration 5 (OVERLAPS) 1472/2699 variables, 1227/2459 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Reachability property MedleyB-PT-B02-ReachabilityFireability-2025-10 is true.
FORMULA MedleyB-PT-B02-ReachabilityFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,9 properties remain. new max is 8192
At refinement iteration 6 (INCLUDED_ONLY) 0/2699 variables, 0/2459 constraints. Problems are: Problem set: 2 solved, 7 unsolved
SDD size :166779 after 259870
At refinement iteration 7 (OVERLAPS) 0/2699 variables, 0/2459 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2699/2699 variables, and 2459 constraints, problems are : Problem set: 2 solved, 7 unsolved in 2104 ms.
Refiners :[Domain max(s): 1227/1227 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 1227/1227 constraints, PredecessorRefiner: 9/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1150/1227 variables, 5/82 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1227 variables, 1150/1232 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,9 properties remain. new max is 16384
SDD size :259870 after 6.28656e+06
[2025-06-08 12:57:35] [INFO ] Deduced a trap composed of 395 places in 926 ms of which 546 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:57:35] [INFO ] Deduced a trap composed of 395 places in 829 ms of which 371 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:57:36] [INFO ] Deduced a trap composed of 396 places in 601 ms of which 250 ms to minimize.
Problem MedleyB-PT-B02-ReachabilityFireability-2025-13 is UNSAT
FORMULA MedleyB-PT-B02-ReachabilityFireability-2025-13 TRUE TECHNIQUES SMT_REFINEMENT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:57:37] [INFO ] Deduced a trap composed of 395 places in 779 ms of which 322 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:57:38] [INFO ] Deduced a trap composed of 395 places in 606 ms of which 161 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:57:39] [INFO ] Deduced a trap composed of 395 places in 738 ms of which 214 ms to minimize.
SMT process timed out in 7570ms, After SMT, problems are : Problem set: 3 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 55 out of 1227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1227/1227 places, 1472/1472 transitions.
Graph (trivial) has 1095 edges and 1227 vertex of which 67 / 1227 are part of one of the 10 SCC in 6 ms
Free SCC test removed 57 places
Drop transitions (Empty/Sink Transition effects.) removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Graph (complete) has 1660 edges and 1170 vertex of which 1165 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Discarding 5 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 803 transitions
Trivial Post-agglo rules discarded 803 transitions
Performed 803 trivial Post agglomeration. Transition count delta: 803
Iterating post reduction 0 with 805 rules applied. Total rules applied 807 place count 1165 transition count 592
Reduce places removed 803 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 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 1 with 822 rules applied. Total rules applied 1629 place count 362 transition count 573
Reduce places removed 8 places and 0 transitions.
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Iterating post reduction 2 with 52 rules applied. Total rules applied 1681 place count 354 transition count 529
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 3 with 44 rules applied. Total rules applied 1725 place count 310 transition count 529
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 52 Pre rules applied. Total rules applied 1725 place count 310 transition count 477
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 4 with 104 rules applied. Total rules applied 1829 place count 258 transition count 477
Discarding 48 places :
Symmetric choice reduction at 4 with 48 rule applications. Total rules 1877 place count 210 transition count 429
Iterating global reduction 4 with 48 rules applied. Total rules applied 1925 place count 210 transition count 429
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1928 place count 210 transition count 426
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 1941 place count 197 transition count 380
Iterating global reduction 5 with 13 rules applied. Total rules applied 1954 place count 197 transition count 380
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1957 place count 197 transition count 377
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1961 place count 193 transition count 373
Iterating global reduction 6 with 4 rules applied. Total rules applied 1965 place count 193 transition count 373
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1967 place count 191 transition count 371
Iterating global reduction 6 with 2 rules applied. Total rules applied 1969 place count 191 transition count 371
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1971 place count 191 transition count 369
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 30 rules applied. Total rules applied 2001 place count 176 transition count 354
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2005 place count 172 transition count 350
Iterating global reduction 7 with 4 rules applied. Total rules applied 2009 place count 172 transition count 350
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2011 place count 170 transition count 348
Iterating global reduction 7 with 2 rules applied. Total rules applied 2013 place count 170 transition count 348
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2015 place count 168 transition count 346
Iterating global reduction 7 with 2 rules applied. Total rules applied 2017 place count 168 transition count 346
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 2023 place count 165 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2024 place count 165 transition count 354
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 2025 place count 165 transition count 353
Free-agglomeration rule applied 29 times.
Iterating global reduction 8 with 29 rules applied. Total rules applied 2054 place count 165 transition count 324
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 8 with 29 rules applied. Total rules applied 2083 place count 136 transition count 324
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 9 with 18 rules applied. Total rules applied 2101 place count 136 transition count 306
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 2104 place count 136 transition count 306
Applied a total of 2104 rules in 376 ms. Remains 136 /1227 variables (removed 1091) and now considering 306/1472 (removed 1166) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 405 ms. Remains : 136/1227 places, 306/1472 transitions.
RANDOM walk for 40000 steps (2531 resets) in 393 ms. (101 steps per ms) remains 5/6 properties
FORMULA MedleyB-PT-B02-ReachabilityFireability-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (690 resets) in 145 ms. (274 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (523 resets) in 72 ms. (547 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (528 resets) in 56 ms. (701 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (539 resets) in 91 ms. (434 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (520 resets) in 164 ms. (242 steps per ms) remains 5/5 properties
// Phase 1: matrix 306 rows 136 cols
[2025-06-08 12:57:39] [INFO ] Computed 4 invariants in 2 ms
[2025-06-08 12:57:39] [INFO ] State equation strengthened by 85 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/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 68/122 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 306/428 variables, 122/126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 85/211 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 14/442 variables, 14/225 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/442 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 442/442 variables, and 225 constraints, problems are : Problem set: 0 solved, 5 unsolved in 568 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 136/136 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 68/122 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 306/428 variables, 122/126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 85/211 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:57:40] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 24 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 14/442 variables, 14/228 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/442 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/442 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 442/442 variables, and 230 constraints, problems are : Problem set: 0 solved, 5 unsolved in 910 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 136/136 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1523ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 194 ms.
Support contains 54 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 306/306 transitions.
Graph (trivial) has 5 edges and 136 vertex of which 2 / 136 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 place count 134 transition count 303
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 134 transition count 302
Applied a total of 4 rules in 14 ms. Remains 134 /136 variables (removed 2) and now considering 302/306 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 134/136 places, 302/306 transitions.
RANDOM walk for 40000 steps (2495 resets) in 295 ms. (135 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (690 resets) in 104 ms. (380 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (544 resets) in 46 ms. (851 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (541 resets) in 35 ms. (1111 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (533 resets) in 75 ms. (526 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (543 resets) in 40 ms. (975 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 702225 steps, run visited all 5 properties in 1987 ms. (steps per millisecond=353 )
Probabilistic random walk after 702225 steps, saw 141990 distinct states, run finished after 1991 ms. (steps per millisecond=352 ) properties seen :5
FORMULA MedleyB-PT-B02-ReachabilityFireability-2025-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyB-PT-B02-ReachabilityFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyB-PT-B02-ReachabilityFireability-2025-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyB-PT-B02-ReachabilityFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyB-PT-B02-ReachabilityFireability-2025-00 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 13904 ms.
BK_STOP 1749387463974
--------------------
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-B02"
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-B02, 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-174931339900439"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyB-PT-B02.tgz
mv MedleyB-PT-B02 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 '
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 ;