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

About the Execution of ITS-Tools for DLCround-PT-11b

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

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.7M May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-2025-00
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-2025-01
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-2025-02
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-2025-03
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-2025-04
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-2025-05
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-2025-06
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-2025-07
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-2025-08
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-2025-09
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-2025-10
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-2025-11
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-2025-12
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-2025-13
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-2025-14
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748682270944

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-11b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-05-31 09:04:32] [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-05-31 09:04:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 09:04:32] [INFO ] Load time of PNML (sax parser for PT used): 246 ms
[2025-05-31 09:04:32] [INFO ] Transformed 4375 places.
[2025-05-31 09:04:32] [INFO ] Transformed 6991 transitions.
[2025-05-31 09:04:32] [INFO ] Found NUPN structural information;
[2025-05-31 09:04:32] [INFO ] Parsed PT model containing 4375 places and 6991 transitions and 19673 arcs in 471 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 2204 ms. (18 steps per ms) remains 7/16 properties
FORMULA DLCround-PT-11b-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityFireability-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityFireability-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityFireability-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityFireability-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityFireability-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 749 ms. (53 steps per ms) remains 7/7 properties
[2025-05-31 09:04:33] [INFO ] Flatten gal took : 636 ms
BEST_FIRST walk for 40004 steps (8 resets) in 1050 ms. (38 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 7/7 properties
[2025-05-31 09:04:34] [INFO ] Flatten gal took : 310 ms
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 7/7 properties
[2025-05-31 09:04:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12625814253126525553.gal : 153 ms
[2025-05-31 09:04:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12770183519030014657.prop : 2 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/ReachabilityCardinality12625814253126525553.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12770183519030014657.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
// Phase 1: matrix 6991 rows 4375 cols
[2025-05-31 09:04:34] [INFO ] Computed 244 invariants in 100 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/185 variables, 185/185 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Loading property file /tmp/ReachabilityCardinality12770183519030014657.prop.
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 3770/3955 variables, 202/387 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3955 variables, 3770/4157 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3955 variables, 0/4157 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 420/4375 variables, 42/4199 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4375 variables, 420/4619 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4375/11366 variables, and 4619 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5035 ms.
Refiners :[Domain max(s): 4375/4375 constraints, Positive P Invariants (semi-flows): 244/244 constraints, State Equation: 0/4375 constraints, PredecessorRefiner: 7/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 185/185 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 3770/3955 variables, 202/387 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3955 variables, 3770/4157 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3955 variables, 0/4157 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 420/4375 variables, 42/4199 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4375 variables, 420/4619 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4375/11366 variables, and 4619 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5025 ms.
Refiners :[Domain max(s): 4375/4375 constraints, Positive P Invariants (semi-flows): 244/244 constraints, State Equation: 0/4375 constraints, PredecessorRefiner: 5/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10453ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 185 out of 4375 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4375/4375 places, 6991/6991 transitions.
Graph (trivial) has 3732 edges and 4375 vertex of which 545 / 4375 are part of one of the 53 SCC in 16 ms
Free SCC test removed 492 places
Drop transitions (Empty/Sink Transition effects.) removed 558 transitions
Reduce isomorphic transitions removed 558 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1529 transitions
Trivial Post-agglo rules discarded 1529 transitions
Performed 1529 trivial Post agglomeration. Transition count delta: 1529
Iterating post reduction 0 with 1529 rules applied. Total rules applied 1530 place count 3883 transition count 4904
Reduce places removed 1529 places and 0 transitions.
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 1586 rules applied. Total rules applied 3116 place count 2354 transition count 4847
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 28 rules applied. Total rules applied 3144 place count 2330 transition count 4843
Reduce places removed 2 places and 0 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Iterating post reduction 3 with 62 rules applied. Total rules applied 3206 place count 2328 transition count 4783
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 4 with 60 rules applied. Total rules applied 3266 place count 2268 transition count 4783
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 37 Pre rules applied. Total rules applied 3266 place count 2268 transition count 4746
Deduced a syphon composed of 37 places in 43 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 3340 place count 2231 transition count 4746
Discarding 545 places :
Symmetric choice reduction at 5 with 545 rule applications. Total rules 3885 place count 1686 transition count 4201
Iterating global reduction 5 with 545 rules applied. Total rules applied 4430 place count 1686 transition count 4201
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 10 rules applied. Total rules applied 4440 place count 1686 transition count 4191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4441 place count 1685 transition count 4191
Performed 221 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 221 Pre rules applied. Total rules applied 4441 place count 1685 transition count 3970
Deduced a syphon composed of 221 places in 77 ms
Reduce places removed 221 places and 0 transitions.
Iterating global reduction 7 with 442 rules applied. Total rules applied 4883 place count 1464 transition count 3970
Discarding 35 places :
Symmetric choice reduction at 7 with 35 rule applications. Total rules 4918 place count 1429 transition count 3510
Iterating global reduction 7 with 35 rules applied. Total rules applied 4953 place count 1429 transition count 3510
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 4960 place count 1429 transition count 3503
Performed 360 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 360 places in 2 ms
Reduce places removed 360 places and 0 transitions.
Iterating global reduction 8 with 720 rules applied. Total rules applied 5680 place count 1069 transition count 3138
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 5683 place count 1069 transition count 3135
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 5689 place count 1063 transition count 3045
Iterating global reduction 9 with 6 rules applied. Total rules applied 5695 place count 1063 transition count 3045
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: -529
Deduced a syphon composed of 54 places in 2 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 9 with 108 rules applied. Total rules applied 5803 place count 1009 transition count 3574
Drop transitions (Empty/Sink Transition effects.) removed 41 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 9 with 43 rules applied. Total rules applied 5846 place count 1009 transition count 3531
Renaming transitions due to excessive name length > 1024 char.
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 5850 place count 1005 transition count 3417
Iterating global reduction 10 with 4 rules applied. Total rules applied 5854 place count 1005 transition count 3417
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 5857 place count 1005 transition count 3414
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 5861 place count 1003 transition count 3436
Drop transitions (Redundant composition of simpler transitions.) removed 121 transitions
Redundant transition composition rules discarded 121 transitions
Iterating global reduction 11 with 121 rules applied. Total rules applied 5982 place count 1003 transition count 3315
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 5987 place count 998 transition count 3235
Iterating global reduction 11 with 5 rules applied. Total rules applied 5992 place count 998 transition count 3235
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 5997 place count 998 transition count 3230
Free-agglomeration rule applied 419 times with reduction of 131 identical transitions.
Iterating global reduction 12 with 419 rules applied. Total rules applied 6416 place count 998 transition count 2680
Reduce places removed 419 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 427 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 432 transitions.
Iterating post reduction 12 with 851 rules applied. Total rules applied 7267 place count 579 transition count 2248
Discarding 11 places :
Symmetric choice reduction at 13 with 11 rule applications. Total rules 7278 place count 568 transition count 2195
Iterating global reduction 13 with 11 rules applied. Total rules applied 7289 place count 568 transition count 2195
Drop transitions (Redundant composition of simpler transitions.) removed 71 transitions
Redundant transition composition rules discarded 71 transitions
Iterating global reduction 13 with 71 rules applied. Total rules applied 7360 place count 568 transition count 2124
Discarding 10 places :
Symmetric choice reduction at 13 with 10 rule applications. Total rules 7370 place count 558 transition count 2080
Iterating global reduction 13 with 10 rules applied. Total rules applied 7380 place count 558 transition count 2080
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 7381 place count 558 transition count 2079
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 7382 place count 557 transition count 2079
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 14 with 2 rules applied. Total rules applied 7384 place count 557 transition count 2121
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 14 with 13 rules applied. Total rules applied 7397 place count 555 transition count 2110
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 15 with 18 rules applied. Total rules applied 7415 place count 555 transition count 2092
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 15 with 13 rules applied. Total rules applied 7428 place count 555 transition count 2092
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 7429 place count 555 transition count 2092
Applied a total of 7429 rules in 1659 ms. Remains 555 /4375 variables (removed 3820) and now considering 2092/6991 (removed 4899) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1666 ms. Remains : 555/4375 places, 2092/6991 transitions.
RANDOM walk for 40000 steps (8 resets) in 999 ms. (40 steps per ms) remains 2/7 properties
FORMULA DLCround-PT-11b-ReachabilityFireability-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityFireability-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityFireability-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityFireability-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 2/2 properties
[2025-05-31 09:04:47] [INFO ] Flow matrix only has 1062 transitions (discarded 1030 similar events)
// Phase 1: matrix 1062 rows 555 cols
[2025-05-31 09:04:47] [INFO ] Computed 225 invariants in 8 ms
[2025-05-31 09:04:47] [INFO ] State equation strengthened by 202 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/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 224/299 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 256/555 variables, 174/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1062/1617 variables, 555/780 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1617 variables, 202/982 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1617 variables, 0/982 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1617 variables, 0/982 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1617/1617 variables, and 982 constraints, problems are : Problem set: 0 solved, 2 unsolved in 593 ms.
Refiners :[Positive P Invariants (semi-flows): 225/225 constraints, State Equation: 555/555 constraints, ReadFeed: 202/202 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 224/299 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 09:04:47] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 256/555 variables, 174/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1062/1617 variables, 555/781 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1617 variables, 202/983 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 09:04:48] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1617 variables, 1/984 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1617 variables, 0/984 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1617 variables, 0/984 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1617/1617 variables, and 984 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1353 ms.
Refiners :[Positive P Invariants (semi-flows): 225/225 constraints, State Equation: 555/555 constraints, ReadFeed: 202/202 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2016ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA DLCround-PT-11b-ReachabilityFireability-2025-01 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 72 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=36 )
FORMULA DLCround-PT-11b-ReachabilityFireability-2025-03 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 168 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 17119 ms.

BK_STOP 1748682289364

--------------------
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="DLCround-PT-11b"
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 DLCround-PT-11b, 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 r072-tall-174860067100255"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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