About the Execution of ITS-Tools for RingSingleMessageInMbox-PT-d0m160
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4549.384 | 1238242.00 | 1273796.00 | 4077.10 | 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 158 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r334-tall-171679079500053.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is RingSingleMessageInMbox-PT-d0m160, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r334-tall-171679079500053
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 23:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 12 23:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 23:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 12 23:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 64K 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 RingSingleMessageInMbox-PT-d0m160-UpperBounds-00
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-01
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-02
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-03
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-04
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-05
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-06
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-07
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-08
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-09
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-10
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-11
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-12
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-13
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-14
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716792865244
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d0m160
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-27 06:54:26] [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-27 06:54:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 06:54:26] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2024-05-27 06:54:26] [INFO ] Transformed 385 places.
[2024-05-27 06:54:26] [INFO ] Transformed 59 transitions.
[2024-05-27 06:54:26] [INFO ] Parsed PT model containing 385 places and 59 transitions and 236 arcs in 152 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 329 places in 1 ms
Reduce places removed 329 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[1, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[1, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 59 rows 56 cols
[2024-05-27 06:54:26] [INFO ] Computed 5 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 0, 0] Max Struct:[1, 1, 12, 1, 223]
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (2177 resets) in 33 ms. (294 steps per ms)
BEST_FIRST walk for 40002 steps (3763 resets) in 49 ms. (800 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 0, 2] Max Struct:[1, 12, 1, 223]
[2024-05-27 06:54:26] [INFO ] Invariant cache hit.
[2024-05-27 06:54:26] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-27 06:54:26] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-27 06:54:26] [INFO ] [Real]Absence check using state equation in 35 ms returned unsat
[2024-05-27 06:54:26] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-27 06:54:26] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned unsat
[2024-05-27 06:54:26] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-27 06:54:26] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-27 06:54:26] [INFO ] [Real]Absence check using state equation in 21 ms returned unsat
[2024-05-27 06:54:26] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-27 06:54:26] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-27 06:54:26] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-27 06:54:26] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-27 06:54:26] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-27 06:54:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 06:54:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-27 06:54:27] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 06:54:27] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-27 06:54:27] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-27 06:54:27] [INFO ] Computed and/alt/rep : 18/36/18 causal constraints (skipped 40 transitions) in 8 ms.
[2024-05-27 06:54:27] [INFO ] Added : 1 causal constraints over 1 iterations in 23 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 0, 2] Max Struct:[0, 1, 0, 223]
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[223]
Support contains 1 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 59/59 transitions.
Graph (complete) has 148 edges and 56 vertex of which 53 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 53 transition count 56
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 11 place count 46 transition count 47
Iterating global reduction 1 with 7 rules applied. Total rules applied 18 place count 46 transition count 47
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 45 transition count 46
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 45 transition count 46
Applied a total of 20 rules in 27 ms. Remains 45 /56 variables (removed 11) and now considering 46/59 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 45/56 places, 46/59 transitions.
// Phase 1: matrix 46 rows 45 cols
[2024-05-27 06:54:27] [INFO ] Computed 4 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[223]
RANDOM walk for 1000000 steps (217105 resets) in 702 ms. (1422 steps per ms)
BEST_FIRST walk for 1000001 steps (93131 resets) in 317 ms. (3144 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[223]
[2024-05-27 06:54:28] [INFO ] Invariant cache hit.
[2024-05-27 06:54:28] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-27 06:54:28] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 7 ms returned sat
[2024-05-27 06:54:28] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-27 06:54:28] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-27 06:54:28] [INFO ] [Real]Added 18 Read/Feed constraints in 2 ms returned sat
[2024-05-27 06:54:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 06:54:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-27 06:54:28] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 06:54:28] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-27 06:54:28] [INFO ] [Nat]Added 18 Read/Feed constraints in 5 ms returned sat
[2024-05-27 06:54:28] [INFO ] Computed and/alt/rep : 11/26/11 causal constraints (skipped 34 transitions) in 5 ms.
[2024-05-27 06:54:28] [INFO ] Added : 1 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[223]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[223]
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 46/46 transitions.
Applied a total of 0 rules in 6 ms. Remains 45 /45 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 45/45 places, 46/46 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 46/46 transitions.
Applied a total of 0 rules in 5 ms. Remains 45 /45 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2024-05-27 06:54:28] [INFO ] Invariant cache hit.
[2024-05-27 06:54:28] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-27 06:54:28] [INFO ] Invariant cache hit.
[2024-05-27 06:54:28] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-27 06:54:28] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-05-27 06:54:28] [INFO ] Redundant transitions in 1 ms returned []
Running 45 sub problems to find dead transitions.
[2024-05-27 06:54:28] [INFO ] Invariant cache hit.
[2024-05-27 06:54:28] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 45 unsolved
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD43 is UNSAT
At refinement iteration 5 (OVERLAPS) 46/91 variables, 45/49 constraints. Problems are: Problem set: 5 solved, 40 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 18/67 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/67 constraints. Problems are: Problem set: 5 solved, 40 unsolved
[2024-05-27 06:54:29] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 8 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/91 variables, 1/68 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 0/68 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 0/91 variables, 0/68 constraints. Problems are: Problem set: 5 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 68 constraints, problems are : Problem set: 5 solved, 40 unsolved in 769 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 45/45 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 5 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 4/45 variables, 3/4 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 1/5 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 46/91 variables, 45/50 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 18/68 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 40/108 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 0/108 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 0/91 variables, 0/108 constraints. Problems are: Problem set: 5 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 108 constraints, problems are : Problem set: 5 solved, 40 unsolved in 854 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 45/45 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 40/45 constraints, Known Traps: 1/1 constraints]
After SMT, in 1674ms problems are : Problem set: 5 solved, 40 unsolved
Search for dead transitions found 5 dead transitions in 1682ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 45/45 places, 41/46 transitions.
Graph (complete) has 110 edges and 45 vertex of which 41 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 41 /45 variables (removed 4) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 41 cols
[2024-05-27 06:54:30] [INFO ] Computed 3 invariants in 1 ms
[2024-05-27 06:54:30] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-27 06:54:30] [INFO ] Invariant cache hit.
[2024-05-27 06:54:30] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-27 06:54:30] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 41/45 places, 41/46 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1932 ms. Remains : 41/45 places, 41/46 transitions.
[2024-05-27 06:54:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[223]
RANDOM walk for 1000000 steps (216989 resets) in 461 ms. (2164 steps per ms)
BEST_FIRST walk for 1000000 steps (94138 resets) in 252 ms. (3952 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[223]
[2024-05-27 06:54:30] [INFO ] Invariant cache hit.
[2024-05-27 06:54:30] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 06:54:31] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-27 06:54:31] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-27 06:54:31] [INFO ] [Real]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-27 06:54:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 06:54:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 06:54:31] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-27 06:54:31] [INFO ] [Nat]Added 16 Read/Feed constraints in 1 ms returned sat
[2024-05-27 06:54:31] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 30 transitions) in 2 ms.
[2024-05-27 06:54:31] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[223]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[223]
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 41/41 places, 41/41 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-05-27 06:54:31] [INFO ] Invariant cache hit.
[2024-05-27 06:54:31] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-27 06:54:31] [INFO ] Invariant cache hit.
[2024-05-27 06:54:31] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-27 06:54:31] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-05-27 06:54:31] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2024-05-27 06:54:31] [INFO ] Invariant cache hit.
[2024-05-27 06:54:31] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 41/82 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/82 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 60 constraints, problems are : Problem set: 0 solved, 40 unsolved in 551 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 41/82 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 40/100 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/82 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 100 constraints, problems are : Problem set: 0 solved, 40 unsolved in 762 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1334ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1335ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1436 ms. Remains : 41/41 places, 41/41 transitions.
[2024-05-27 06:54:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[223]
RANDOM walk for 1000000 steps (217642 resets) in 458 ms. (2178 steps per ms)
BEST_FIRST walk for 1000001 steps (93593 resets) in 241 ms. (4132 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[223]
[2024-05-27 06:54:33] [INFO ] Invariant cache hit.
[2024-05-27 06:54:33] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-27 06:54:33] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-27 06:54:33] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-27 06:54:33] [INFO ] [Real]Added 16 Read/Feed constraints in 1 ms returned sat
[2024-05-27 06:54:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 06:54:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 06:54:33] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-27 06:54:33] [INFO ] [Nat]Added 16 Read/Feed constraints in 5 ms returned sat
[2024-05-27 06:54:33] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 30 transitions) in 2 ms.
[2024-05-27 06:54:33] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[223]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[223]
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 3 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 41/41 places, 41/41 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 3 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-05-27 06:54:33] [INFO ] Invariant cache hit.
[2024-05-27 06:54:33] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-27 06:54:33] [INFO ] Invariant cache hit.
[2024-05-27 06:54:33] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-27 06:54:33] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-05-27 06:54:33] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2024-05-27 06:54:33] [INFO ] Invariant cache hit.
[2024-05-27 06:54:33] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 41/82 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/82 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 60 constraints, problems are : Problem set: 0 solved, 40 unsolved in 439 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 41/82 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 40/100 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/82 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 100 constraints, problems are : Problem set: 0 solved, 40 unsolved in 665 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1140ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1140ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1257 ms. Remains : 41/41 places, 41/41 transitions.
RANDOM walk for 40000 steps (8641 resets) in 554 ms. (72 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3692 resets) in 203 ms. (196 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3701 resets) in 227 ms. (175 steps per ms) remains 2/2 properties
[2024-05-27 06:54:34] [INFO ] Flatten gal took : 38 ms
[2024-05-27 06:54:34] [INFO ] Flatten gal took : 10 ms
[2024-05-27 06:54:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12740862148393140865.gal : 5 ms
[2024-05-27 06:54:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2828907446222562223.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12740862148393140865.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2828907446222562223.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality2828907446222562223.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 32
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :32 after 64
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :64 after 160
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :160 after 312
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :312 after 622
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :622 after 1242
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1242 after 2482
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2482 after 4938
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4938 after 9801
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :9801 after 2.45495e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.45495e+06 after 9.6945e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :9.6945e+06 after 2.22931e+07
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.22931e+07 after 4.04902e+07
Interrupted probabilistic random walk after 4222798 steps, run timeout after 3001 ms. (steps per millisecond=1407 ) properties seen :1 out of 2
Probabilistic random walk after 4222798 steps, saw 1609863 distinct states, run finished after 3004 ms. (steps per millisecond=1405 ) properties seen :1
[2024-05-27 06:54:37] [INFO ] Invariant cache hit.
[2024-05-27 06:54:37] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/32 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 81/82 variables, and 42 constraints, problems are : Problem set: 1 solved, 0 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 0/3 constraints, State Equation: 40/41 constraints, ReadFeed: 2/16 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 71ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[4] Max Struct:[223]
Starting property specific reduction for RingSingleMessageInMbox-PT-d0m160-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[223]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[223]
[2024-05-27 06:54:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[223]
RANDOM walk for 10000 steps (2167 resets) in 8 ms. (1111 steps per ms)
BEST_FIRST walk for 10001 steps (930 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[223]
[2024-05-27 06:54:38] [INFO ] Invariant cache hit.
[2024-05-27 06:54:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 06:54:38] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-27 06:54:38] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-27 06:54:38] [INFO ] [Real]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-27 06:54:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 06:54:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 06:54:38] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-27 06:54:38] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-27 06:54:38] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 30 transitions) in 3 ms.
[2024-05-27 06:54:38] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[223]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[223]
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 4 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 41/41 places, 41/41 transitions.
[2024-05-27 06:54:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[223]
RANDOM walk for 1000000 steps (216943 resets) in 477 ms. (2092 steps per ms)
BEST_FIRST walk for 1000001 steps (93352 resets) in 244 ms. (4081 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[223]
[2024-05-27 06:54:38] [INFO ] Invariant cache hit.
[2024-05-27 06:54:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 06:54:38] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-27 06:54:38] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-27 06:54:38] [INFO ] [Real]Added 16 Read/Feed constraints in 4 ms returned sat
[2024-05-27 06:54:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 06:54:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 06:54:38] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-27 06:54:38] [INFO ] [Nat]Added 16 Read/Feed constraints in 1 ms returned sat
[2024-05-27 06:54:38] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 30 transitions) in 2 ms.
[2024-05-27 06:54:38] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[223]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[223]
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 4 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 41/41 places, 41/41 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 3 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-05-27 06:54:39] [INFO ] Invariant cache hit.
[2024-05-27 06:54:39] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-27 06:54:39] [INFO ] Invariant cache hit.
[2024-05-27 06:54:39] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-27 06:54:39] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-05-27 06:54:39] [INFO ] Redundant transitions in 1 ms returned []
Running 40 sub problems to find dead transitions.
[2024-05-27 06:54:39] [INFO ] Invariant cache hit.
[2024-05-27 06:54:39] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 41/82 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/82 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 60 constraints, problems are : Problem set: 0 solved, 40 unsolved in 470 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 41/82 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 40/100 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/82 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 100 constraints, problems are : Problem set: 0 solved, 40 unsolved in 638 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1128ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1129ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1215 ms. Remains : 41/41 places, 41/41 transitions.
[2024-05-27 06:54:40] [INFO ] Flatten gal took : 10 ms
[2024-05-27 06:54:40] [INFO ] Flatten gal took : 6 ms
RANDOM walk for 40000 steps (8713 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
[2024-05-27 06:54:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4337918393062872207.gal : 5 ms
[2024-05-27 06:54:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7076491058452528709.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4337918393062872207.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7076491058452528709.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality7076491058452528709.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 32
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :32 after 64
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :64 after 160
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :160 after 312
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :312 after 622
BEST_FIRST walk for 40003 steps (3726 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :622 after 1242
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1242 after 2482
BEST_FIRST walk for 40003 steps (3804 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2482 after 4938
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4938 after 9801
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :9801 after 2.45495e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.45495e+06 after 9.6945e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :9.6945e+06 after 2.22931e+07
Interrupted probabilistic random walk after 4393998 steps, run timeout after 3001 ms. (steps per millisecond=1464 ) properties seen :1 out of 2
Probabilistic random walk after 4393998 steps, saw 1674272 distinct states, run finished after 3001 ms. (steps per millisecond=1464 ) properties seen :1
[2024-05-27 06:54:43] [INFO ] Invariant cache hit.
[2024-05-27 06:54:43] [INFO ] State equation strengthened by 16 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.22931e+07 after 4.04902e+07
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/32 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 81/82 variables, and 42 constraints, problems are : Problem set: 1 solved, 0 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 0/3 constraints, State Equation: 40/41 constraints, ReadFeed: 2/16 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 63ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[4] Max Struct:[223]
Ending property specific reduction for RingSingleMessageInMbox-PT-d0m160-UpperBounds-15 in 5381 ms.
[2024-05-27 06:54:43] [INFO ] Flatten gal took : 5 ms
[2024-05-27 06:54:43] [INFO ] Applying decomposition
[2024-05-27 06:54:43] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7901750112499485186.txt' '-o' '/tmp/graph7901750112499485186.bin' '-w' '/tmp/graph7901750112499485186.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7901750112499485186.bin' '-l' '-1' '-v' '-w' '/tmp/graph7901750112499485186.weights' '-q' '0' '-e' '0.001'
[2024-05-27 06:54:43] [INFO ] Decomposing Gal with order
[2024-05-27 06:54:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 06:54:43] [INFO ] Removed a total of 31 redundant transitions.
[2024-05-27 06:54:43] [INFO ] Flatten gal took : 29 ms
[2024-05-27 06:54:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 3 ms.
[2024-05-27 06:54:43] [INFO ] Time to serialize gal into /tmp/UpperBounds7435794294687457038.gal : 2 ms
[2024-05-27 06:54:43] [INFO ] Time to serialize properties into /tmp/UpperBounds15393496928821566562.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/UpperBounds7435794294687457038.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15393496928821566562.prop' '--nowitness'
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 ...284
Loading property file /tmp/UpperBounds15393496928821566562.prop.
Detected timeout of ITS tools.
[2024-05-27 07:14:48] [INFO ] Flatten gal took : 8 ms
[2024-05-27 07:14:48] [INFO ] Time to serialize gal into /tmp/UpperBounds10163967385870383677.gal : 2 ms
[2024-05-27 07:14:48] [INFO ] Time to serialize properties into /tmp/UpperBounds5021534202365091814.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds10163967385870383677.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5021534202365091814.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds5021534202365091814.prop.
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,1.66091e+08,14.606,263892,2,29895,5,1.01468e+06,6,0,207,933075,0
Total reachable state count : 166090970
Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 158
Bounds property RingSingleMessageInMbox-PT-d0m160-UpperBounds-15 :0 <= l363 <= 158
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-15 158 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
RingSingleMessageInMbox-PT-d0m160-UpperBounds-15,0,14.6664,263892,1,0,7,1.01468e+06,9,1,432,933075,4
Total runtime 1237134 ms.
BK_STOP 1716794103486
--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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="RingSingleMessageInMbox-PT-d0m160"
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 RingSingleMessageInMbox-PT-d0m160, 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 r334-tall-171679079500053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RingSingleMessageInMbox-PT-d0m160.tgz
mv RingSingleMessageInMbox-PT-d0m160 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 '
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 ;