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.r290-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 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 r290-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 1716902980399

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 202405141337
[2024-05-28 13:29:41] [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]
[2024-05-28 13:29:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 13:29:41] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2024-05-28 13:29:41] [INFO ] Transformed 30 places.
[2024-05-28 13:29:41] [INFO ] Transformed 84 transitions.
[2024-05-28 13:29:41] [INFO ] Parsed PT model containing 30 places and 84 transitions and 564 arcs in 161 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 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-05-28 13:29:41] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2024-05-28 13:29:41] [INFO ] Computed 11 invariants in 9 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 (1450 resets) in 53 ms. (185 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 30002 steps (977 resets) in 46 ms. (638 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 1] Max Struct:[3, 3, +inf]
[2024-05-28 13:29:42] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
[2024-05-28 13:29:42] [INFO ] Invariant cache hit.
[2024-05-28 13:29:42] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-28 13:29:42] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 13:29:42] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-28 13:29:42] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-28 13:29:42] [INFO ] [Real]Added 36 Read/Feed constraints in 8 ms returned sat
[2024-05-28 13:29:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:29:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-28 13:29:42] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-28 13:29:42] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-28 13:29:42] [INFO ] [Nat]Added 36 Read/Feed constraints in 6 ms returned sat
[2024-05-28 13:29:42] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 14 ms.
[2024-05-28 13:29:42] [INFO ] Added : 0 causal constraints over 0 iterations in 26 ms. Result :sat
Minimization took 21 ms.
[2024-05-28 13:29:42] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-28 13:29:42] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-28 13:29:42] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-28 13:29:42] [INFO ] [Real]Added 36 Read/Feed constraints in 4 ms returned sat
[2024-05-28 13:29:42] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 12 ms.
[2024-05-28 13:29:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:29:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-28 13:29:42] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-28 13:29:42] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-28 13:29:42] [INFO ] [Nat]Added 36 Read/Feed constraints in 10 ms returned sat
[2024-05-28 13:29:42] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 10 ms.
[2024-05-28 13:29:42] [INFO ] Added : 6 causal constraints over 2 iterations in 31 ms. Result :sat
Minimization took 23 ms.
[2024-05-28 13:29:42] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-28 13:29:42] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 13:29:42] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-28 13:29:42] [INFO ] [Real]Added 36 Read/Feed constraints in 4 ms returned sat
[2024-05-28 13:29:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:29:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-28 13:29:42] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-28 13:29:42] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-28 13:29:42] [INFO ] [Nat]Added 36 Read/Feed constraints in 4 ms returned sat
[2024-05-28 13:29:42] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 6 ms.
[2024-05-28 13:29:42] [INFO ] Added : 5 causal constraints over 3 iterations in 26 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 13 ms. Remains 30 /30 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Running 78 sub problems to find dead transitions.
[2024-05-28 13:29:42] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
[2024-05-28 13:29:42] [INFO ] Invariant cache hit.
[2024-05-28 13:29:42] [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 639 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 889 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 1642ms problems are : Problem set: 30 solved, 48 unsolved
Search for dead transitions found 30 dead transitions in 1656ms
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 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 1689 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-05-28 13:29:44] [INFO ] Computed 11 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 1] Max Struct:[3, 3, +inf]
RANDOM walk for 1000000 steps (143225 resets) in 1365 ms. (732 steps per ms)
BEST_FIRST walk for 3000002 steps (104254 resets) in 1592 ms. (1883 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 1] Max Struct:[3, 3, +inf]
[2024-05-28 13:29:47] [INFO ] Invariant cache hit.
[2024-05-28 13:29:47] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 13:29:47] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-28 13:29:47] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-28 13:29:47] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-28 13:29:47] [INFO ] [Real]Added 30 Read/Feed constraints in 4 ms returned sat
[2024-05-28 13:29:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:29:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 13:29:47] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-28 13:29:47] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-28 13:29:47] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2024-05-28 13:29:47] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 5 ms.
[2024-05-28 13:29:47] [INFO ] Added : 3 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 17 ms.
[2024-05-28 13:29:47] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 13:29:47] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-28 13:29:47] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-28 13:29:47] [INFO ] [Real]Added 30 Read/Feed constraints in 3 ms returned sat
[2024-05-28 13:29:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:29:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 13:29:47] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-28 13:29:47] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-28 13:29:47] [INFO ] [Nat]Added 30 Read/Feed constraints in 5 ms returned sat
[2024-05-28 13:29:47] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 4 ms.
[2024-05-28 13:29:47] [INFO ] Added : 6 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 16 ms.
[2024-05-28 13:29:47] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 13:29:47] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 5 ms returned sat
[2024-05-28 13:29:47] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-28 13:29:47] [INFO ] [Real]Added 30 Read/Feed constraints in 5 ms returned sat
[2024-05-28 13:29:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:29:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 13:29:47] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-28 13:29:47] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-28 13:29:47] [INFO ] [Nat]Added 30 Read/Feed constraints in 6 ms returned sat
[2024-05-28 13:29:47] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 4 ms.
[2024-05-28 13:29:47] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 6 ms to minimize.
[2024-05-28 13:29:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2024-05-28 13:29:47] [INFO ] Added : 6 causal constraints over 2 iterations in 96 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, 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 3 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-05-28 13:29:48] [INFO ] Invariant cache hit.
[2024-05-28 13:29:48] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-28 13:29:48] [INFO ] Invariant cache hit.
[2024-05-28 13:29:48] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-28 13:29:48] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2024-05-28 13:29:48] [INFO ] Redundant transitions in 0 ms returned []
Running 48 sub problems to find dead transitions.
[2024-05-28 13:29:48] [INFO ] Invariant cache hit.
[2024-05-28 13:29:48] [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-05-28 13:29:48] [INFO ] Deduced a trap composed of 14 places in 52 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 1169 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-05-28 13:29:49] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-28 13:29:50] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 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 1704 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 2947ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2948ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3067 ms. Remains : 30/30 places, 51/51 transitions.
When looking for a positive semi flow solution, solver replied unsat
RANDOM walk for 40000 steps (5745 resets) in 1374 ms. (29 steps per ms) remains 5/5 properties
[2024-05-28 13:29:51] [INFO ] Flatten gal took : 79 ms
[2024-05-28 13:29:51] [INFO ] Flatten gal took : 26 ms
BEST_FIRST walk for 40003 steps (1373 resets) in 295 ms. (135 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1406 resets) in 152 ms. (261 steps per ms) remains 5/5 properties
[2024-05-28 13:29:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17894814381004820693.gal : 18 ms
[2024-05-28 13:29:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2249918935029445559.prop : 1 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17894814381004820693.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2249918935029445559.prop' '--nowitness' '--gen-order' 'FOLLOW'

BEST_FIRST walk for 40002 steps (1524 resets) in 132 ms. (300 steps per ms) remains 5/5 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (1523 resets) in 106 ms. (373 steps per ms) remains 5/5 properties
Loading property file /tmp/ReachabilityCardinality2249918935029445559.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 11
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :11 after 40
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :40 after 58
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :58 after 102
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,325,0.039625,4336,2,498,10,2221,11,0,185,1731,0
Total reachable state count : 325
BEST_FIRST walk for 40002 steps (1247 resets) in 107 ms. (370 steps per ms) remains 5/5 properties

Verifying 5 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,0,0.040425,4336,1,0,10,2221,11,0,191,1731,0
Invariant property MIN0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.041037,4644,1,0,10,2221,11,0,196,1731,0
Reachability property MAX1 does not hold.
No reachable states exhibit your property : MAX1

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,0,0.041538,4644,1,0,10,2221,11,0,201,1731,0
Invariant property MIN1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,0,0.04205,4644,1,0,10,2221,11,0,206,1731,0
Invariant property MIN2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,0,0.042284,4644,1,0,10,2221,11,0,206,1731,0
Probably explored full state space saw : 325 states, properties seen :0
ITS tools runner thread asked to quit. Dying gracefully.
Probabilistic random walk after 1090 steps, saw 325 distinct states, run finished after 19 ms. (steps per millisecond=57 ) 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 10207 ms.

BK_STOP 1716902991913

--------------------
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
+ 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//../itstools/bin//..//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//../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-5568"
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 r290-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 ;