Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.7M
-rw-r--r-- 1 mcc users 6.5K Jun 6 09:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 6 09:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 6 09:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Jun 6 09:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 6 12:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 12:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 12:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 12:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 8.9K Jun 6 09:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Jun 6 09:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Jun 6 09:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 6 09:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:12 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 3.4M 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-B07-ReachabilityFireability-2025-00
FORMULA_NAME MedleyB-PT-B07-ReachabilityFireability-2025-01
FORMULA_NAME MedleyB-PT-B07-ReachabilityFireability-2025-02
FORMULA_NAME MedleyB-PT-B07-ReachabilityFireability-2025-03
FORMULA_NAME MedleyB-PT-B07-ReachabilityFireability-2025-04
FORMULA_NAME MedleyB-PT-B07-ReachabilityFireability-2025-05
FORMULA_NAME MedleyB-PT-B07-ReachabilityFireability-2025-06
FORMULA_NAME MedleyB-PT-B07-ReachabilityFireability-2025-07
FORMULA_NAME MedleyB-PT-B07-ReachabilityFireability-2025-08
FORMULA_NAME MedleyB-PT-B07-ReachabilityFireability-2025-09
FORMULA_NAME MedleyB-PT-B07-ReachabilityFireability-2025-10
FORMULA_NAME MedleyB-PT-B07-ReachabilityFireability-2025-11
FORMULA_NAME MedleyB-PT-B07-ReachabilityFireability-2025-12
FORMULA_NAME MedleyB-PT-B07-ReachabilityFireability-2025-13
FORMULA_NAME MedleyB-PT-B07-ReachabilityFireability-2025-14
FORMULA_NAME MedleyB-PT-B07-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1749397355835

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-B07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-08 15:42:37] [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 15:42:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 15:42:37] [INFO ] Load time of PNML (sax parser for PT used): 419 ms
[2025-06-08 15:42:37] [INFO ] Transformed 2133 places.
[2025-06-08 15:42:37] [INFO ] Transformed 6753 transitions.
[2025-06-08 15:42:37] [INFO ] Found NUPN structural information;
[2025-06-08 15:42:37] [INFO ] Parsed PT model containing 2133 places and 6753 transitions and 67789 arcs in 563 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (307 resets) in 2390 ms. (16 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 95 ms. (41 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 73 ms. (54 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 117 ms. (33 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 66 ms. (59 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 156 ms. (25 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 68 ms. (58 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
[2025-06-08 15:42:39] [INFO ] Flatten gal took : 1166 ms
[2025-06-08 15:42:40] [INFO ] Flatten gal took : 448 ms
[2025-06-08 15:42:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10341951877995597931.gal : 306 ms
[2025-06-08 15:42:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11445408704356665416.prop : 13 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/ReachabilityCardinality10341951877995597931.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11445408704356665416.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
Interrupted probabilistic random walk after 86763 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 16
Probabilistic random walk after 86763 steps, saw 22269 distinct states, run finished after 3006 ms. (steps per millisecond=28 ) properties seen :0
// Phase 1: matrix 6753 rows 2133 cols
[2025-06-08 15:42:42] [INFO ] Computed 8 invariants in 152 ms
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Loading property file /tmp/ReachabilityCardinality11445408704356665416.prop.
Excessive predecessor constraint size, skipping predecessor.
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/117 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem MedleyB-PT-B07-ReachabilityFireability-2025-01 is UNSAT
FORMULA MedleyB-PT-B07-ReachabilityFireability-2025-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyB-PT-B07-ReachabilityFireability-2025-13 is UNSAT
FORMULA MedleyB-PT-B07-ReachabilityFireability-2025-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 2016/2133 variables, 8/125 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2133 variables, 2016/2141 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2133 variables, 0/2141 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 6753/8886 variables, 2133/4274 constraints. Problems are: Problem set: 2 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8886/8886 variables, and 4274 constraints, problems are : Problem set: 2 solved, 14 unsolved in 5088 ms.
Refiners :[Domain max(s): 2133/2133 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 2133/2133 constraints, PredecessorRefiner: 16/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 14 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 111/111 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/111 constraints. Problems are: Problem set: 2 solved, 14 unsolved
Problem MedleyB-PT-B07-ReachabilityFireability-2025-07 is UNSAT
FORMULA MedleyB-PT-B07-ReachabilityFireability-2025-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem MedleyB-PT-B07-ReachabilityFireability-2025-10 is UNSAT
FORMULA MedleyB-PT-B07-ReachabilityFireability-2025-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 2003/2114 variables, 7/118 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2114 variables, 2003/2121 constraints. Problems are: Problem set: 4 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 15:42:51] [INFO ] Deduced a trap composed of 400 places in 1766 ms of which 48 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2114 variables, 1/2122 constraints. Problems are: Problem set: 4 solved, 12 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2114/8886 variables, and 2122 constraints, problems are : Problem set: 4 solved, 12 unsolved in 5027 ms.
Refiners :[Domain max(s): 2114/2133 constraints, Positive P Invariants (semi-flows): 7/8 constraints, State Equation: 0/2133 constraints, PredecessorRefiner: 10/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10654ms problems are : Problem set: 4 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 76 out of 2133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2133/2133 places, 6753/6753 transitions.
Graph (trivial) has 1995 edges and 2133 vertex of which 131 / 2133 are part of one of the 20 SCC in 8 ms
Free SCC test removed 111 places
Drop transitions (Empty/Sink Transition effects.) removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Graph (complete) has 3335 edges and 2022 vertex of which 2008 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.41 ms
Discarding 14 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1479 transitions
Trivial Post-agglo rules discarded 1479 transitions
Performed 1479 trivial Post agglomeration. Transition count delta: 1479
Iterating post reduction 0 with 1486 rules applied. Total rules applied 1488 place count 2008 transition count 5116
Reduce places removed 1479 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 1523 rules applied. Total rules applied 3011 place count 529 transition count 5072
Reduce places removed 20 places and 0 transitions.
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Iterating post reduction 2 with 61 rules applied. Total rules applied 3072 place count 509 transition count 5031
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 45 rules applied. Total rules applied 3117 place count 468 transition count 5027
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 70 Pre rules applied. Total rules applied 3117 place count 468 transition count 4957
Deduced a syphon composed of 70 places in 3 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 4 with 140 rules applied. Total rules applied 3257 place count 398 transition count 4957
Discarding 84 places :
Symmetric choice reduction at 4 with 84 rule applications. Total rules 3341 place count 314 transition count 4873
Iterating global reduction 4 with 84 rules applied. Total rules applied 3425 place count 314 transition count 4873
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3425 place count 314 transition count 4872
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3427 place count 313 transition count 4872
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 3458 place count 282 transition count 4828
Iterating global reduction 4 with 31 rules applied. Total rules applied 3489 place count 282 transition count 4828
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 3494 place count 282 transition count 4823
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 3506 place count 270 transition count 4811
Iterating global reduction 5 with 12 rules applied. Total rules applied 3518 place count 270 transition count 4811
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 3528 place count 260 transition count 4801
Iterating global reduction 5 with 10 rules applied. Total rules applied 3538 place count 260 transition count 4801
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 3547 place count 260 transition count 4792
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 5 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 3591 place count 238 transition count 4770
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3592 place count 238 transition count 4769
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 3599 place count 231 transition count 4762
Iterating global reduction 7 with 7 rules applied. Total rules applied 3606 place count 231 transition count 4762
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 3613 place count 224 transition count 4755
Iterating global reduction 7 with 7 rules applied. Total rules applied 3620 place count 224 transition count 4755
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 3627 place count 217 transition count 4748
Iterating global reduction 7 with 7 rules applied. Total rules applied 3634 place count 217 transition count 4748
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 20 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 3640 place count 214 transition count 4763
Free-agglomeration rule applied 60 times.
Iterating global reduction 7 with 60 rules applied. Total rules applied 3700 place count 214 transition count 4703
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 7 with 60 rules applied. Total rules applied 3760 place count 154 transition count 4703
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 3767 place count 147 transition count 4696
Iterating global reduction 8 with 7 rules applied. Total rules applied 3774 place count 147 transition count 4696
Drop transitions (Redundant composition of simpler transitions.) removed 126 transitions
Redundant transition composition rules discarded 126 transitions
Iterating global reduction 8 with 126 rules applied. Total rules applied 3900 place count 147 transition count 4570
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3902 place count 146 transition count 4575
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 3903 place count 146 transition count 4574
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3904 place count 145 transition count 4574
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 3912 place count 145 transition count 4574
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 3915 place count 145 transition count 4571
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 3916 place count 145 transition count 4571
Applied a total of 3916 rules in 2853 ms. Remains 145 /2133 variables (removed 1988) and now considering 4571/6753 (removed 2182) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2860 ms. Remains : 145/2133 places, 4571/6753 transitions.
RANDOM walk for 40000 steps (1421 resets) in 1595 ms. (25 steps per ms) remains 11/12 properties
FORMULA MedleyB-PT-B07-ReachabilityFireability-2025-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (151 resets) in 165 ms. (240 steps per ms) remains 10/11 properties
FORMULA MedleyB-PT-B07-ReachabilityFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (158 resets) in 95 ms. (416 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (122 resets) in 131 ms. (303 steps per ms) remains 9/10 properties
FORMULA MedleyB-PT-B07-ReachabilityFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (159 resets) in 575 ms. (69 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 8/9 properties
FORMULA MedleyB-PT-B07-ReachabilityFireability-2025-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 333 ms. (119 steps per ms) remains 7/8 properties
FORMULA MedleyB-PT-B07-ReachabilityFireability-2025-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (155 resets) in 81 ms. (487 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (159 resets) in 80 ms. (493 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (164 resets) in 111 ms. (357 steps per ms) remains 6/7 properties
FORMULA MedleyB-PT-B07-ReachabilityFireability-2025-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (165 resets) in 113 ms. (350 steps per ms) remains 5/6 properties
FORMULA MedleyB-PT-B07-ReachabilityFireability-2025-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (153 resets) in 91 ms. (434 steps per ms) remains 5/5 properties
// Phase 1: matrix 4571 rows 145 cols
[2025-06-08 15:42:56] [INFO ] Computed 8 invariants in 41 ms
[2025-06-08 15:42:56] [INFO ] State equation strengthened by 50 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/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 88/144 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/145 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 4571/4716 variables, 145/153 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4716 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4716 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/4716 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4716/4716 variables, and 203 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1601 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 145/145 constraints, ReadFeed: 50/50 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/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 88/144 variables, 7/7 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 15:43:00] [INFO ] Deduced a trap composed of 35 places in 1527 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :7 after 10
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :10 after 14
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :14 after 20
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :20 after 22
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :22 after 245
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :245 after 5620
[2025-06-08 15:43:01] [INFO ] Deduced a trap composed of 30 places in 1405 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :5620 after 37184
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :37184 after 38398
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :38398 after 39690
[2025-06-08 15:43:02] [INFO ] Deduced a trap composed of 37 places in 1324 ms of which 22 ms to minimize.
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :39690 after 141188
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1/145 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,16 properties remain. new max is 16384
SDD size :141188 after 759388
At refinement iteration 6 (OVERLAPS) 4571/4716 variables, 145/156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4716 variables, 50/206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4716 variables, 4/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4716 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/4716 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4716/4716 variables, and 210 constraints, problems are : Problem set: 0 solved, 5 unsolved in 7844 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 145/145 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9576ms problems are : Problem set: 0 solved, 5 unsolved
FORMULA MedleyB-PT-B07-ReachabilityFireability-2025-15 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B07-ReachabilityFireability-2025-09 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B07-ReachabilityFireability-2025-02 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B07-ReachabilityFireability-2025-04 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
FORMULA MedleyB-PT-B07-ReachabilityFireability-2025-08 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 62 ms.
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 29360 ms.

BK_STOP 1749397386445

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-B07"
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-B07, 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-174931340000479"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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