Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.7M
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K 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.1K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 6.2M 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 JoinFreeModules-PT-2000-ReachabilityFireability-2025-00
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-2025-01
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-2025-02
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-2025-03
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-2025-04
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-2025-05
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-2025-06
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-2025-07
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-2025-08
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-2025-09
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-2025-10
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-2025-11
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-2025-12
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-2025-13
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-2025-14
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748852570518

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-2000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-02 08:22:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 08:22:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 08:22:52] [INFO ] Load time of PNML (sax parser for PT used): 494 ms
[2025-06-02 08:22:52] [INFO ] Transformed 10001 places.
[2025-06-02 08:22:52] [INFO ] Transformed 16001 transitions.
[2025-06-02 08:22:52] [INFO ] Parsed PT model containing 10001 places and 16001 transitions and 46002 arcs in 669 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2025-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 08:22:54] [INFO ] Flatten gal took : 915 ms
[2025-06-02 08:22:54] [INFO ] Flatten gal took : 510 ms
RANDOM walk for 43037 steps (8 resets) in 6949 ms. (6 steps per ms) remains 11/11 properties
[2025-06-02 08:22:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12746315009883291963.gal : 155 ms
[2025-06-02 08:22:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14839252219774465664.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/ReachabilityCardinality12746315009883291963.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14839252219774465664.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
BEST_FIRST walk for 40004 steps (8 resets) in 6898 ms. (5 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4898 ms. (8 steps per ms) remains 11/11 properties
Loading property file /tmp/ReachabilityCardinality14839252219774465664.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 4117 ms. (9 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4565 ms. (8 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4215 ms. (9 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5251 ms. (7 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4314 ms. (9 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4117 ms. (9 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3936 ms. (10 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4121 ms. (9 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4126 ms. (9 steps per ms) remains 10/11 properties
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2025-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Probabilistic random walk after 203188 steps, saw 203084 distinct states, run finished after 46179 ms. (steps per millisecond=4 ) properties seen :0
// Phase 1: matrix 16001 rows 10000 cols
[2025-06-02 08:23:57] [INFO ] Computed 2000 invariants in 228 ms
[2025-06-02 08:23:58] [INFO ] State equation strengthened by 2000 read => feed constraints.
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/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 487/610 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 976/1586 variables, 610/732 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1586 variables, 122/854 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1586 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/1586 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1586/26001 variables, and 854 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2720 ms.
Refiners :[Positive P Invariants (semi-flows): 122/2000 constraints, State Equation: 610/10000 constraints, ReadFeed: 122/2000 constraints, PredecessorRefiner: 10/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 487/610 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:01] [INFO ] Deduced a trap composed of 3 places in 336 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:02] [INFO ] Deduced a trap composed of 3 places in 268 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:02] [INFO ] Deduced a trap composed of 3 places in 301 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:02] [INFO ] Deduced a trap composed of 3 places in 308 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:03] [INFO ] Deduced a trap composed of 3 places in 280 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:03] [INFO ] Deduced a trap composed of 3 places in 277 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:03] [INFO ] Deduced a trap composed of 3 places in 277 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:04] [INFO ] Deduced a trap composed of 3 places in 258 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:04] [INFO ] Deduced a trap composed of 3 places in 256 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:04] [INFO ] Deduced a trap composed of 3 places in 252 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:04] [INFO ] Deduced a trap composed of 3 places in 248 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:05] [INFO ] Deduced a trap composed of 3 places in 241 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:05] [INFO ] Deduced a trap composed of 3 places in 244 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:05] [INFO ] Deduced a trap composed of 3 places in 244 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:05] [INFO ] Deduced a trap composed of 3 places in 245 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:06] [INFO ] Deduced a trap composed of 3 places in 238 ms of which 7 ms to minimize.
SMT process timed out in 9706ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 123 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 610 are kept as prefixes of interest. Removing 9390 places using SCC suffix rule.24 ms
Discarding 9390 places :
Also discarding 15024 output transitions
Drop transitions (Output transitions of discarded places.) removed 15024 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 610 transition count 976
Applied a total of 2 rules in 395 ms. Remains 610 /10000 variables (removed 9390) and now considering 976/16001 (removed 15025) transitions.
Running 732 sub problems to find dead transitions.
// Phase 1: matrix 976 rows 610 cols
[2025-06-02 08:24:07] [INFO ] Computed 122 invariants in 9 ms
[2025-06-02 08:24:07] [INFO ] State equation strengthened by 122 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 1 (OVERLAPS) 122/610 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 732 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 Real declared 610/1586 variables, and 122 constraints, problems are : Problem set: 0 solved, 732 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 122/122 constraints, State Equation: 0/610 constraints, ReadFeed: 0/122 constraints, PredecessorRefiner: 732/732 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 732 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 1 (OVERLAPS) 122/610 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 732 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 610/1586 variables, and 122 constraints, problems are : Problem set: 0 solved, 732 unsolved in 20118 ms.
Refiners :[Positive P Invariants (semi-flows): 122/122 constraints, State Equation: 0/610 constraints, ReadFeed: 0/122 constraints, PredecessorRefiner: 0/732 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40318ms problems are : Problem set: 0 solved, 732 unsolved
Search for dead transitions found 0 dead transitions in 40323ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40733 ms. Remains : 610/10000 places, 976/16001 transitions.
RANDOM walk for 42034 steps (8 resets) in 4953 ms. (8 steps per ms) remains 9/10 properties
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 2122 ms. (18 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 990 ms. (40 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 687 ms. (58 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 440 ms. (90 steps per ms) remains 8/9 properties
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2025-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 744 ms. (53 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 509 ms. (78 steps per ms) remains 7/8 properties
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 331 ms. (120 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 432 ms. (92 steps per ms) remains 6/7 properties
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2025-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 321 ms. (124 steps per ms) remains 5/6 properties
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2025-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2025-06-02 08:24:51] [INFO ] Invariant cache hit.
[2025-06-02 08:24:51] [INFO ] State equation strengthened by 122 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 288/360 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 576/936 variables, 360/432 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/936 variables, 72/504 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/936 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/936 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 936/1586 variables, and 504 constraints, problems are : Problem set: 0 solved, 5 unsolved in 388 ms.
Refiners :[Positive P Invariants (semi-flows): 72/122 constraints, State Equation: 360/610 constraints, ReadFeed: 72/122 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/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 288/360 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:51] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:51] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:51] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:52] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:52] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:52] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:52] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:52] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:52] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:52] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:52] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:52] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:52] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:52] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:52] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:52] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:52] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:52] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:52] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:54] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:54] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:54] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:54] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 576/936 variables, 360/477 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/936 variables, 72/549 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/936 variables, 4/553 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:55] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:55] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/936 variables, 3/556 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/936 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:56] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/936 variables, 3/559 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/936 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/936 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 936/1586 variables, and 559 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5746 ms.
Refiners :[Positive P Invariants (semi-flows): 72/122 constraints, State Equation: 360/610 constraints, ReadFeed: 72/122 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6155ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 99725 steps, including 0 resets, run visited all 5 properties in 2036 ms. (steps per millisecond=48 )
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2025-12 FALSE TECHNIQUES PARIKH_WALK
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2025-08 FALSE TECHNIQUES PARIKH_WALK
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2025-06 TRUE TECHNIQUES PARIKH_WALK
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2025-05 FALSE TECHNIQUES PARIKH_WALK
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2025-03 FALSE 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 )
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 2045 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 127484 ms.

BK_STOP 1748852699597

--------------------
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="JoinFreeModules-PT-2000"
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 JoinFreeModules-PT-2000, 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 r114-tall-174876422800479"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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