fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r508-tall-171654351300293
Last Updated
July 7, 2024

About the Execution of LTSMin+red for Murphy-PT-D1N010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
533.819 9985.00 20134.00 58.00 19 2 1 2 1 3 21 1 19 21 21 21 2 2 21 19 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.r508-tall-171654351300293.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 ltsminxred
Input is Murphy-PT-D1N010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654351300293
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 8.4K Apr 11 23:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 11 23:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 11 22:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 11 22:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 6 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 6 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 6 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 6 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 11 23:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 23:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 23:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 11 23:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 6 10:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 6 10:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 7.6K 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 Murphy-PT-D1N010-UpperBounds-00
FORMULA_NAME Murphy-PT-D1N010-UpperBounds-01
FORMULA_NAME Murphy-PT-D1N010-UpperBounds-02
FORMULA_NAME Murphy-PT-D1N010-UpperBounds-03
FORMULA_NAME Murphy-PT-D1N010-UpperBounds-04
FORMULA_NAME Murphy-PT-D1N010-UpperBounds-05
FORMULA_NAME Murphy-PT-D1N010-UpperBounds-06
FORMULA_NAME Murphy-PT-D1N010-UpperBounds-07
FORMULA_NAME Murphy-PT-D1N010-UpperBounds-08
FORMULA_NAME Murphy-PT-D1N010-UpperBounds-09
FORMULA_NAME Murphy-PT-D1N010-UpperBounds-10
FORMULA_NAME Murphy-PT-D1N010-UpperBounds-11
FORMULA_NAME Murphy-PT-D1N010-UpperBounds-12
FORMULA_NAME Murphy-PT-D1N010-UpperBounds-13
FORMULA_NAME Murphy-PT-D1N010-UpperBounds-14
FORMULA_NAME Murphy-PT-D1N010-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717235856192

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D1N010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 09:57:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 09:57:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 09:57:37] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2024-06-01 09:57:37] [INFO ] Transformed 12 places.
[2024-06-01 09:57:37] [INFO ] Transformed 14 transitions.
[2024-06-01 09:57:37] [INFO ] Parsed PT model containing 12 places and 14 transitions and 54 arcs in 128 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 9
Current structural bounds on expressions (Initially) : Max Seen:[10, 0, 0, 0, 3, 1, 10, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[10, 0, 0, 0, 3, 1, 10, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 14 rows 12 cols
[2024-06-01 09:57:37] [INFO ] Computed 3 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10, 0, 0, 0, 3, 1, 10, 1, 1] Max Struct:[22, +inf, +inf, +inf, +inf, 22, 22, 22, 22]
RANDOM walk for 10000 steps (2 resets) in 23 ms. (416 steps per ms)
BEST_FIRST walk for 90009 steps (18 resets) in 70 ms. (1267 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15, 2, 1, 1, 3, 21, 16, 21, 21] Max Struct:[22, +inf, +inf, +inf, +inf, 22, 22, 22, 22]
[2024-06-01 09:57:37] [INFO ] Invariant cache hit.
[2024-06-01 09:57:37] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 09:57:37] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 09:57:37] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 09:57:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:57:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 09:57:37] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 09:57:38] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 09:57:38] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2024-06-01 09:57:38] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 09:57:38] [INFO ] Added : 1 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 10 ms.
[2024-06-01 09:57:38] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 3 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 09:57:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:57:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-06-01 09:57:38] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 09:57:38] [INFO ] Added : 2 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 09:57:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 09:57:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:57:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-06-01 09:57:38] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 09:57:38] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 3 ms.
[2024-06-01 09:57:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-01 09:57:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:57:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2024-06-01 09:57:38] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 09:57:38] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 3 ms.
[2024-06-01 09:57:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 09:57:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:57:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2024-06-01 09:57:38] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 09:57:38] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 09:57:38] [INFO ] [Real]Absence check using 2 positive place invariants in 20 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 09:57:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:57:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Nat]Absence check using state equation in 5 ms returned unsat
[2024-06-01 09:57:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Real]Added 4 Read/Feed constraints in 0 ms returned sat
[2024-06-01 09:57:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:57:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-06-01 09:57:38] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 17 ms to minimize.
[2024-06-01 09:57:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-06-01 09:57:38] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 09:57:38] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 09:57:38] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 09:57:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:57:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Nat]Absence check using state equation in 8 ms returned unsat
[2024-06-01 09:57:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 09:57:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:57:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 09:57:38] [INFO ] [Nat]Absence check using state equation in 7 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[15, 2, 1, 1, 3, 21, 16, 21, 21] Max Struct:[22, +inf, +inf, +inf, +inf, 21, 22, 21, 21]
FORMULA Murphy-PT-D1N010-UpperBounds-11 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D1N010-UpperBounds-10 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D1N010-UpperBounds-09 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D1N010-UpperBounds-14 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D1N010-UpperBounds-06 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[17, 2, 1, 1, 3, 19] Max Struct:[22, +inf, +inf, +inf, +inf, 22]
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 9 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Running 8 sub problems to find dead transitions.
[2024-06-01 09:57:38] [INFO ] Invariant cache hit.
[2024-06-01 09:57:38] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 14/24 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 2/26 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/26 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 19 constraints, problems are : Problem set: 0 solved, 8 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 14/24 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 2/26 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/26 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/26 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 27 constraints, problems are : Problem set: 0 solved, 8 unsolved in 266 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 424ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 431ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 458 ms. Remains : 12/12 places, 14/14 transitions.
Found an invariant !
This invariant on transitions {7=1, 9=1, 13=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {6=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :[11, 2, 1, 1, 3, 16]
Current structural bounds on expressions (after cover walk) : Max Seen:[17, 2, 1, 1, 3, 19] Max Struct:[22, +inf, +inf, +inf, +inf, 22]
[2024-06-01 09:57:39] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[17, 2, 1, 1, 3, 19] Max Struct:[22, +inf, +inf, +inf, +inf, 22]
RANDOM walk for 1000000 steps (2 resets) in 410 ms. (2433 steps per ms)
BEST_FIRST walk for 6000005 steps (12 resets) in 1452 ms. (4129 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[19, 2, 1, 1, 3, 19] Max Struct:[22, +inf, +inf, +inf, +inf, 22]
[2024-06-01 09:57:41] [INFO ] Invariant cache hit.
[2024-06-01 09:57:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 09:57:41] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 09:57:41] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 09:57:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:57:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 09:57:41] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 09:57:41] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-06-01 09:57:41] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 09:57:41] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-06-01 09:57:41] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 09:57:41] [INFO ] Added : 1 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 09:57:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 09:57:41] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 09:57:41] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 09:57:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:57:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 09:57:41] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 09:57:41] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 09:57:41] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-06-01 09:57:41] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 09:57:41] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 4 ms.
[2024-06-01 09:57:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 09:57:41] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 09:57:41] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 09:57:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:57:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 09:57:41] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 09:57:41] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-06-01 09:57:41] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2024-06-01 09:57:41] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 09:57:41] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2024-06-01 09:57:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 09:57:41] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 09:57:41] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 09:57:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:57:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 09:57:41] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 09:57:41] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-06-01 09:57:41] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-06-01 09:57:41] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 09:57:41] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2024-06-01 09:57:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 09:57:41] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 09:57:41] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 09:57:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:57:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 09:57:41] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 09:57:41] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-06-01 09:57:41] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2024-06-01 09:57:41] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 09:57:41] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2024-06-01 09:57:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 09:57:41] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 09:57:41] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 09:57:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:57:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 09:57:41] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 09:57:41] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 09:57:41] [INFO ] [Nat]Added 4 Read/Feed constraints in 10 ms returned sat
[2024-06-01 09:57:41] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 09:57:41] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[19, 2, 1, 1, 3, 19] Max Struct:[22, +inf, +inf, +inf, +inf, 22]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[19, 2, 1, 1, 3, 19] Max Struct:[22, +inf, +inf, +inf, +inf, 22]
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 12/12 places, 14/14 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2024-06-01 09:57:41] [INFO ] Invariant cache hit.
[2024-06-01 09:57:41] [INFO ] Implicit Places using invariants in 31 ms returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 10/12 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 36 ms. Remains : 10/12 places, 14/14 transitions.
Found an invariant !
This invariant on transitions {7=1, 9=1, 13=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {6=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :[15, 2, 1, 1, 3, 12]
Current structural bounds on expressions (after cover walk) : Max Seen:[19, 2, 1, 1, 3, 19] Max Struct:[22, +inf, +inf, +inf, +inf, 22]
// Phase 1: matrix 14 rows 10 cols
[2024-06-01 09:57:41] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[19, 2, 1, 1, 3, 19] Max Struct:[22, +inf, +inf, +inf, +inf, 22]
RANDOM walk for 1000001 steps (2 resets) in 344 ms. (2898 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 1236 ms. (4850 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[19, 2, 1, 1, 3, 19] Max Struct:[22, +inf, +inf, +inf, +inf, 22]
[2024-06-01 09:57:43] [INFO ] Invariant cache hit.
[2024-06-01 09:57:43] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 09:57:43] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 09:57:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:57:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 09:57:43] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-06-01 09:57:43] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 09:57:43] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2024-06-01 09:57:43] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 09:57:43] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 8 ms.
[2024-06-01 09:57:43] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 09:57:43] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 09:57:43] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-06-01 09:57:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:57:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 09:57:43] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-06-01 09:57:43] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-06-01 09:57:43] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 09:57:43] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2024-06-01 09:57:43] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 09:57:43] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 09:57:43] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-06-01 09:57:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:57:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 09:57:43] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-06-01 09:57:43] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-06-01 09:57:43] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 09:57:43] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2024-06-01 09:57:43] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 09:57:43] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 09:57:43] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-06-01 09:57:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:57:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 09:57:43] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-06-01 09:57:43] [INFO ] [Nat]Added 4 Read/Feed constraints in 0 ms returned sat
[2024-06-01 09:57:43] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 09:57:43] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2024-06-01 09:57:43] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 09:57:43] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 09:57:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:57:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 09:57:43] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-06-01 09:57:43] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-06-01 09:57:43] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 09:57:43] [INFO ] Added : 3 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 4 ms.
[2024-06-01 09:57:43] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 09:57:43] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 09:57:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:57:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 09:57:43] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 09:57:43] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-06-01 09:57:43] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 09:57:43] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[19, 2, 1, 1, 3, 19] Max Struct:[22, +inf, +inf, +inf, +inf, 22]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[19, 2, 1, 1, 3, 19] Max Struct:[22, +inf, +inf, +inf, +inf, 22]
Support contains 6 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 10/10 places, 14/14 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2024-06-01 09:57:43] [INFO ] Invariant cache hit.
[2024-06-01 09:57:43] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 09:57:43] [INFO ] Invariant cache hit.
[2024-06-01 09:57:43] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 09:57:43] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-06-01 09:57:43] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-06-01 09:57:43] [INFO ] Invariant cache hit.
[2024-06-01 09:57:43] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 2/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 14/22 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/24 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 15 constraints, problems are : Problem set: 0 solved, 8 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 2/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 14/22 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/24 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/24 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 23 constraints, problems are : Problem set: 0 solved, 8 unsolved in 89 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 175ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 176ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 223 ms. Remains : 10/10 places, 14/14 transitions.
Found an invariant !
This invariant on transitions {7=1, 9=1, 13=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {6=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :[14, 2, 1, 1, 3, 15]
Current structural bounds on expressions (after cover walk) : Max Seen:[19, 2, 1, 1, 3, 19] Max Struct:[22, +inf, +inf, +inf, +inf, 22]
RANDOM walk for 40009 steps (8 resets) in 767 ms. (52 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 143 ms. (277 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 110 ms. (360 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (8 resets) in 107 ms. (370 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 8/8 properties
Probably explored full state space saw : 39780 states, properties seen :0
Probabilistic random walk after 307764 steps, saw 39780 distinct states, run finished after 814 ms. (steps per millisecond=378 ) properties seen :0
Explored full state space saw : 39780 states, properties seen :0
Exhaustive walk after 307764 steps, saw 39780 distinct states, run finished after 616 ms. (steps per millisecond=499 ) properties seen :0
FORMULA Murphy-PT-D1N010-UpperBounds-15 19 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-PT-D1N010-UpperBounds-08 19 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-PT-D1N010-UpperBounds-05 3 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-PT-D1N010-UpperBounds-07 1 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-PT-D1N010-UpperBounds-04 1 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-PT-D1N010-UpperBounds-02 1 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-PT-D1N010-UpperBounds-03 2 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-PT-D1N010-UpperBounds-12 2 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-PT-D1N010-UpperBounds-13 2 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-PT-D1N010-UpperBounds-01 2 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-PT-D1N010-UpperBounds-00 19 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 6 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 8675 ms.
ITS solved all properties within timeout

BK_STOP 1717235866177

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Murphy-PT-D1N010"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Murphy-PT-D1N010, 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 r508-tall-171654351300293"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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