Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r156-tall-174881253600237.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 PhilosophersDyn-PT-03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881253600237
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 904K
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 117K 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 5.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 195K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 32K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 195K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 87K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748891553824

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-PT-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-02 19:12:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 19:12:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 19:12:35] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2025-06-02 19:12:35] [INFO ] Transformed 30 places.
[2025-06-02 19:12:35] [INFO ] Transformed 84 transitions.
[2025-06-02 19:12:35] [INFO ] Parsed PT model containing 30 places and 84 transitions and 564 arcs in 142 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Reduction of identical properties reduced properties to check from 16 to 11
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 19:12:35] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2025-06-02 19:12:35] [INFO ] Computed 11 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0] Max Struct:[3, 3, 14, 3, 1, 1, 1, 1, 2, 1, 1]
FORMULA PhilosophersDyn-PT-03-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (1415 resets) in 48 ms. (204 steps per ms)
FORMULA PhilosophersDyn-PT-03-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (768 resets) in 48 ms. (612 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 3, 1] Max Struct:[3, 14, 2]
[2025-06-02 19:12:35] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
[2025-06-02 19:12:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 19:12:35] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-02 19:12:35] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-02 19:12:35] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-06-02 19:12:35] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-02 19:12:35] [INFO ] [Real]Added 36 Read/Feed constraints in 14 ms returned sat
[2025-06-02 19:12:35] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 12 ms.
[2025-06-02 19:12:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 19:12:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 19:12:35] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-02 19:12:35] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-02 19:12:35] [INFO ] [Nat]Added 36 Read/Feed constraints in 6 ms returned sat
[2025-06-02 19:12:35] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 9 ms.
[2025-06-02 19:12:35] [INFO ] Added : 6 causal constraints over 2 iterations in 34 ms. Result :sat
Minimization took 22 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 19:12:35] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 19:12:35] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 19:12:35] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 19:12:35] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2, 3, 1] Max Struct:[3, 3, 1]
FORMULA PhilosophersDyn-PT-03-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-02 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[3]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 81/81 transitions.
Applied a total of 0 rules in 12 ms. Remains 30 /30 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Running 78 sub problems to find dead transitions.
[2025-06-02 19:12:35] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
[2025-06-02 19:12:35] [INFO ] Invariant cache hit.
[2025-06-02 19:12:35] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Problem TDEAD12 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 8/8 constraints. Problems are: Problem set: 12 solved, 66 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 3/11 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 57/87 variables, 30/41 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 36/77 constraints. Problems are: Problem set: 30 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:12:36] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:12:36] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 2/79 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/79 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/87 variables, 0/79 constraints. Problems are: Problem set: 30 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 79 constraints, problems are : Problem set: 30 solved, 48 unsolved in 1448 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 30 solved, 48 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 8/8 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 3/11 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 2/13 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 57/87 variables, 30/43 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 36/79 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 48/127 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/127 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 0/87 variables, 0/127 constraints. Problems are: Problem set: 30 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 127 constraints, problems are : Problem set: 30 solved, 48 unsolved in 1767 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 48/78 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3310ms problems are : Problem set: 30 solved, 48 unsolved
Search for dead transitions found 30 dead transitions in 3320ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 30 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 30/30 places, 51/81 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3350 ms. Remains : 30/30 places, 51/81 transitions.
// Phase 1: matrix 51 rows 30 cols
[2025-06-02 19:12:39] [INFO ] Computed 11 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[3]
RANDOM walk for 1000000 steps (143194 resets) in 1349 ms. (740 steps per ms)
BEST_FIRST walk for 1000001 steps (38415 resets) in 517 ms. (1930 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[3]
[2025-06-02 19:12:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 19:12:41] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 19:12:41] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 19:12:41] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-02 19:12:41] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-02 19:12:41] [INFO ] [Real]Added 30 Read/Feed constraints in 5 ms returned sat
[2025-06-02 19:12:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 19:12:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 19:12:41] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2025-06-02 19:12:41] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-02 19:12:41] [INFO ] [Nat]Added 30 Read/Feed constraints in 6 ms returned sat
[2025-06-02 19:12:41] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 3 ms.
[2025-06-02 19:12:41] [INFO ] Added : 6 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[3]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 30/30 places, 51/51 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2025-06-02 19:12:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:12:41] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-02 19:12:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:12:41] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-02 19:12:41] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 19:12:41] [INFO ] Redundant transitions in 0 ms returned []
Running 48 sub problems to find dead transitions.
[2025-06-02 19:12:41] [INFO ] Invariant cache hit.
[2025-06-02 19:12:41] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 51/81 variables, 30/41 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 30/71 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:12:41] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 72 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1142 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:12:42] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 51/81 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 30/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 48/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/81 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 121 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1561 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2724ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2725ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2911 ms. Remains : 30/30 places, 51/51 transitions.
RANDOM walk for 40000 steps (5714 resets) in 636 ms. (62 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1513 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1488 resets) in 136 ms. (291 steps per ms) remains 2/2 properties
Probably explored full state space saw : 325 states, properties seen :0
Probabilistic random walk after 1090 steps, saw 325 distinct states, run finished after 18 ms. (steps per millisecond=60 ) properties seen :0
Explored full state space saw : 325 states, properties seen :0
Exhaustive walk after 1090 steps, saw 325 distinct states, run finished after 7 ms. (steps per millisecond=155 ) properties seen :0
[2025-06-02 19:12:45] [INFO ] Flatten gal took : 43 ms
[2025-06-02 19:12:45] [INFO ] Flatten gal took : 11 ms
[2025-06-02 19:12:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3257745305160221874.gal : 5 ms
[2025-06-02 19:12:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3403609838086512167.prop : 0 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/ReachabilityCardinality3257745305160221874.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3403609838086512167.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA PhilosophersDyn-PT-03-UpperBounds-07 2 TECHNIQUES REACHABILITY_MIN
FORMULA PhilosophersDyn-PT-03-UpperBounds-01 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 10974 ms.

BK_STOP 1748891566029

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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 UpperBounds -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="PhilosophersDyn-PT-03"
export BK_EXAMINATION="UpperBounds"
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 PhilosophersDyn-PT-03, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r156-tall-174881253600237"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-03.tgz
mv PhilosophersDyn-PT-03 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;