Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446200045.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
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 r516-tajo-171654446200045
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 860K
-rw-r--r-- 1 mcc users 13K Apr 11 14:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K Apr 11 14:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 11 14:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 122K Apr 11 14:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 35K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 14:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Apr 11 14:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 35K Apr 11 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 202K Apr 11 14:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 87K May 18 16:43 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

here is the order used to build the result vector(from text 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 1717247835156

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-PT-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:17:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 13:17:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:17:17] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-06-01 13:17:17] [INFO ] Transformed 30 places.
[2024-06-01 13:17:17] [INFO ] Transformed 84 transitions.
[2024-06-01 13:17:17] [INFO ] Parsed PT model containing 30 places and 84 transitions and 564 arcs in 243 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Reduction of identical properties reduced properties to check from 16 to 12
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 13:17:17] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2024-06-01 13:17:17] [INFO ] Computed 11 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[3, 3, 3, 3, 3, 1, +inf, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (1429 resets) in 86 ms. (114 steps per ms)
FORMULA PhilosophersDyn-PT-03-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
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-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-11 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-06 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-02 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (994 resets) in 64 ms. (461 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 1] Max Struct:[3, 3, +inf]
[2024-06-01 13:17:17] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
[2024-06-01 13:17:17] [INFO ] Invariant cache hit.
[2024-06-01 13:17:17] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-06-01 13:17:17] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 6 ms returned sat
[2024-06-01 13:17:17] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-06-01 13:17:17] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-01 13:17:17] [INFO ] [Real]Added 36 Read/Feed constraints in 10 ms returned sat
[2024-06-01 13:17:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:17:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 13:17:17] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 13:17:17] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-06-01 13:17:17] [INFO ] [Nat]Added 36 Read/Feed constraints in 9 ms returned sat
[2024-06-01 13:17:17] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 14 ms.
[2024-06-01 13:17:18] [INFO ] Added : 0 causal constraints over 0 iterations in 31 ms. Result :sat
Minimization took 28 ms.
[2024-06-01 13:17:18] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 13:17:18] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 13:17:18] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-06-01 13:17:18] [INFO ] [Real]Added 36 Read/Feed constraints in 7 ms returned sat
[2024-06-01 13:17:18] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 20 ms.
[2024-06-01 13:17:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:17:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-01 13:17:18] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 13:17:18] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 13:17:18] [INFO ] [Nat]Added 36 Read/Feed constraints in 13 ms returned sat
[2024-06-01 13:17:18] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 12 ms.
[2024-06-01 13:17:18] [INFO ] Added : 6 causal constraints over 2 iterations in 37 ms. Result :sat
Minimization took 25 ms.
[2024-06-01 13:17:18] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-01 13:17:18] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 13:17:18] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 13:17:18] [INFO ] [Real]Added 36 Read/Feed constraints in 6 ms returned sat
[2024-06-01 13:17:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:17:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 13:17:18] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-01 13:17:18] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 13:17:18] [INFO ] [Nat]Added 36 Read/Feed constraints in 7 ms returned sat
[2024-06-01 13:17:18] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 12 ms.
[2024-06-01 13:17:18] [INFO ] Added : 5 causal constraints over 3 iterations in 31 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 1] Max Struct:[3, 3, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 1] Max Struct:[3, 3, +inf]
Support contains 7 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 17 ms. Remains 30 /30 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Running 78 sub problems to find dead transitions.
[2024-06-01 13:17:18] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
[2024-06-01 13:17:18] [INFO ] Invariant cache hit.
[2024-06-01 13:17:18] [INFO ] State equation strengthened by 36 read => feed constraints.
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
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/77 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 0/87 variables, 0/77 constraints. Problems are: Problem set: 30 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 77 constraints, problems are : Problem set: 30 solved, 48 unsolved in 769 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: 0/0 constraints]
Escalating to Integer solving :Problem set: 30 solved, 48 unsolved
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, 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
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 48/125 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/125 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/87 variables, 0/125 constraints. Problems are: Problem set: 30 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 125 constraints, problems are : Problem set: 30 solved, 48 unsolved in 1172 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: 0/0 constraints]
After SMT, in 2102ms problems are : Problem set: 30 solved, 48 unsolved
Search for dead transitions found 30 dead transitions in 2121ms
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 8 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 2169 ms. Remains : 30/30 places, 51/81 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 51 rows 30 cols
[2024-06-01 13:17:20] [INFO ] Computed 11 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 1] Max Struct:[3, 3, +inf]
RANDOM walk for 1000000 steps (143206 resets) in 1536 ms. (650 steps per ms)
BEST_FIRST walk for 3000001 steps (104166 resets) in 1335 ms. (2245 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 1] Max Struct:[3, 3, +inf]
[2024-06-01 13:17:23] [INFO ] Invariant cache hit.
[2024-06-01 13:17:23] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 13:17:23] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-01 13:17:23] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 13:17:23] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-06-01 13:17:23] [INFO ] [Real]Added 30 Read/Feed constraints in 4 ms returned sat
[2024-06-01 13:17:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:17:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 13:17:23] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2024-06-01 13:17:23] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-06-01 13:17:23] [INFO ] [Nat]Added 30 Read/Feed constraints in 7 ms returned sat
[2024-06-01 13:17:23] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 4 ms.
[2024-06-01 13:17:23] [INFO ] Added : 3 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 21 ms.
[2024-06-01 13:17:23] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 13:17:23] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 7 ms returned sat
[2024-06-01 13:17:23] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 13:17:23] [INFO ] [Real]Added 30 Read/Feed constraints in 4 ms returned sat
[2024-06-01 13:17:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:17:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 13:17:23] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-01 13:17:23] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 13:17:23] [INFO ] [Nat]Added 30 Read/Feed constraints in 6 ms returned sat
[2024-06-01 13:17:23] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 4 ms.
[2024-06-01 13:17:23] [INFO ] Added : 6 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 19 ms.
[2024-06-01 13:17:24] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 13:17:24] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-01 13:17:24] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 13:17:24] [INFO ] [Real]Added 30 Read/Feed constraints in 4 ms returned sat
[2024-06-01 13:17:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:17:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 13:17:24] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-01 13:17:24] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 13:17:24] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2024-06-01 13:17:24] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 5 ms.
[2024-06-01 13:17:24] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 8 ms to minimize.
[2024-06-01 13:17:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-06-01 13:17:24] [INFO ] Added : 6 causal constraints over 2 iterations in 89 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 1] Max Struct:[3, 3, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 1] Max Struct:[3, 3, +inf]
Support contains 7 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 4 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 4 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.
[2024-06-01 13:17:24] [INFO ] Invariant cache hit.
[2024-06-01 13:17:24] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-01 13:17:24] [INFO ] Invariant cache hit.
[2024-06-01 13:17:24] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-06-01 13:17:24] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-06-01 13:17:24] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2024-06-01 13:17:24] [INFO ] Invariant cache hit.
[2024-06-01 13:17:24] [INFO ] State equation strengthened by 30 read => feed constraints.
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
[2024-06-01 13:17:24] [INFO ] Deduced a trap composed of 14 places in 28 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 722 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]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
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
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 51/81 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 30/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 48/120 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 13:17:25] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 13:17:25] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 0/81 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 122 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: 3/3 constraints]
After SMT, in 1891ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1893ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2066 ms. Remains : 30/30 places, 51/51 transitions.
When looking for a positive semi flow solution, solver replied unsat
RANDOM walk for 40000 steps (5753 resets) in 1465 ms. (27 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1425 resets) in 194 ms. (205 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1394 resets) in 170 ms. (233 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1517 resets) in 125 ms. (317 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1576 resets) in 131 ms. (303 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1256 resets) in 162 ms. (245 steps per ms) remains 5/5 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 9 ms. (steps per millisecond=121 ) properties seen :0
FORMULA PhilosophersDyn-PT-03-UpperBounds-10 1 TECHNIQUES REACHABILITY_MIN
FORMULA PhilosophersDyn-PT-03-UpperBounds-05 2 TECHNIQUES REACHABILITY_MIN
FORMULA PhilosophersDyn-PT-03-UpperBounds-07 2 TECHNIQUES REACHABILITY_MIN
FORMULA PhilosophersDyn-PT-03-UpperBounds-03 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 3 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 10101 ms.
ITS solved all properties within timeout

BK_STOP 1717247847222

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
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 r516-tajo-171654446200045"
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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;