Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r100-smll-174867007800351.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 GPPP-PT-C0100N0000100000, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867007800351
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K 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.0K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K 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 3.8K 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 17 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1 May 29 14:32 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-00
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-01
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-02
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-03
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-04
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-05
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-06
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-07
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-08
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-09
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-10
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-11
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-12
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-13
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-14
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748942704970

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0100N0000100000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-03 09:25:07] [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-03 09:25:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 09:25:07] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2025-06-03 09:25:07] [INFO ] Transformed 33 places.
[2025-06-03 09:25:07] [INFO ] Transformed 22 transitions.
[2025-06-03 09:25:07] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 291 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 45 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40925 steps (12 resets) in 402 ms. (101 steps per ms) remains 6/9 properties
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 361 ms. (110 steps per ms) remains 5/6 properties
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 282 ms. (141 steps per ms) remains 5/5 properties
[2025-06-03 09:25:08] [INFO ] Flatten gal took : 104 ms
[2025-06-03 09:25:08] [INFO ] Flatten gal took : 14 ms
BEST_FIRST walk for 40001 steps (8 resets) in 1283 ms. (31 steps per ms) remains 5/5 properties
[2025-06-03 09:25:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6198860347528375900.gal : 27 ms
[2025-06-03 09:25:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12820459394093582671.prop : 11 ms
BEST_FIRST walk for 40002 steps (8 resets) in 546 ms. (73 steps per ms) remains 5/5 properties
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/ReachabilityCardinality6198860347528375900.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12820459394093582671.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 ...329
Loading property file /tmp/ReachabilityCardinality12820459394093582671.prop.
An unexpected exception occurred : Overflow error when converting initial marking. Please recompile libDDD with larger DDD::val_t definition.
ITS-tools command line returned an error code 1
[2025-06-03 09:25:08] [INFO ] Flatten gal took : 19 ms
[2025-06-03 09:25:08] [INFO ] Applying decomposition
[2025-06-03 09:25:08] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15374157986033275283.txt' '-o' '/tmp/graph15374157986033275283.bin' '-w' '/tmp/graph15374157986033275283.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15374157986033275283.bin' '-l' '-1' '-v' '-w' '/tmp/graph15374157986033275283.weights' '-q' '0' '-e' '0.001'
[2025-06-03 09:25:09] [INFO ] Decomposing Gal with order
[2025-06-03 09:25:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 09:25:09] [INFO ] Removed a total of 1 redundant transitions.
BEST_FIRST walk for 40003 steps (8 resets) in 2548 ms. (15 steps per ms) remains 5/5 properties
[2025-06-03 09:25:09] [INFO ] Flatten gal took : 208 ms
// Phase 1: matrix 22 rows 33 cols
[2025-06-03 09:25:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-03 09:25:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality610922242526208037.gal : 4 ms
[2025-06-03 09:25:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6450051583159727665.prop : 3 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/ReachabilityCardinality610922242526208037.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6450051583159727665.prop' '--nowitness'
[2025-06-03 09:25:09] [INFO ] Computed 12 invariants in 16 ms

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 ...306
Loading property file /tmp/ReachabilityCardinality6450051583159727665.prop.
An unexpected exception occurred : Overflow error when converting initial marking. Please recompile libDDD with larger DDD::val_t definition.
ITS-tools command line returned an error code 1
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-07 is UNSAT
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-07 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 6/12 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-00 is UNSAT
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-06 FALSE TECHNIQUES SMT_REFINEMENT
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-08 is UNSAT
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-08 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 22/55 variables, 33/45 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/45 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/55 variables, 0/45 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 45 constraints, problems are : Problem set: 3 solved, 2 unsolved in 401 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 3/6 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/33 variables, 3/9 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 33/55 variables, and 12 constraints, problems are : Problem set: 3 solved, 2 unsolved in 2113 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/33 constraints, PredecessorRefiner: 0/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2614ms problems are : Problem set: 3 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 10 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
[2025-06-03 09:25:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/33 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem TDEAD19 is UNSAT
At refinement iteration 6 (OVERLAPS) 22/55 variables, 33/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 45 constraints, problems are : Problem set: 1 solved, 20 unsolved in 588 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 20 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 2/33 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 3/12 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 22/55 variables, 33/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 20/65 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/55 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/55 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 65 constraints, problems are : Problem set: 1 solved, 20 unsolved in 9279 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 20/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9879ms problems are : Problem set: 1 solved, 20 unsolved
Search for dead transitions found 1 dead transitions in 9881ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 33/33 places, 21/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9916 ms. Remains : 33/33 places, 21/22 transitions.
RANDOM walk for 40949 steps (12 resets) in 72 ms. (560 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 212 ms. (187 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1380465 steps, run timeout after 3001 ms. (steps per millisecond=460 ) properties seen :0 out of 2
Probabilistic random walk after 1380465 steps, saw 224313 distinct states, run finished after 3009 ms. (steps per millisecond=458 ) properties seen :0
// Phase 1: matrix 21 rows 33 cols
[2025-06-03 09:25:25] [INFO ] Computed 13 invariants in 3 ms
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/30 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/33 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 21/54 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/54 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 46 constraints, problems are : Problem set: 0 solved, 2 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 2/2 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/30 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/33 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-09 is UNSAT
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-09 FALSE TECHNIQUES SMT_REFINEMENT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 33/54 variables, and 13 constraints, problems are : Problem set: 1 solved, 1 unsolved in 9722 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/33 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9942ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 26 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 33/33 places, 21/21 transitions.
RANDOM walk for 40425 steps (12 resets) in 32 ms. (1225 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 197 ms. (202 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2809933 steps, run timeout after 3001 ms. (steps per millisecond=936 ) properties seen :0 out of 1
Probabilistic random walk after 2809933 steps, saw 419867 distinct states, run finished after 3001 ms. (steps per millisecond=936 ) properties seen :0
[2025-06-03 09:25:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 6/32 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/33 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 21/54 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/54 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 46 constraints, problems are : Problem set: 0 solved, 1 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 6/32 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-14 is UNSAT
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-2025-14 FALSE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 32/54 variables, and 12 constraints, problems are : Problem set: 1 solved, 0 unsolved in 2615 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/5 constraints, State Equation: 0/33 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2743ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 33605 ms.

BK_STOP 1748942740892

--------------------
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="GPPP-PT-C0100N0000100000"
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 GPPP-PT-C0100N0000100000, 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 r100-smll-174867007800351"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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