PRISM

Benchmark
Model:resource-gathering v.2 (MDP)
Parameter(s)B = 1300, GOLD_TO_COLLECT = 100, GEM_TO_COLLECT = 100
Property:expsteps (exp-steps)
Invocation (specific)
./fix-syntax ./prism --javamaxmem 11g resource-gathering.pm resource-gathering.prctl --property expsteps -const B=1300,GOLD_TO_COLLECT=100,GEM_TO_COLLECT=100 -hybrid
Select best engine
Execution
Walltime:52.386215925216675s
Return code:0
Relative Error:5.8081603920028655e-06
Log
PRISM
=====

Version: 4.4.dev
Date: Tue Dec 11 01:17:20 CET 2018
Hostname: qcomp2019
Memory limits: cudd=1g, java(heap)=1g
Command line: prism --javamaxmem 11g resource-gathering.pm_fixed resource-gathering.prctl_fixed --property expsteps -const 'B=1300,GOLD_TO_COLLECT=100,GEM_TO_COLLECT=100' -hybrid

Parsing model file "resource-gathering.pm_fixed"...

Parsing properties file "resource-gathering.prctl_fixed"...

3 properties:
(1) "expgold": R{"rew_gold"}max=? [ C<=B ]
(2) "expsteps": R{"time_reward"}min=? [ F "success" ]
(3) "prgoldgem": Pmax=? [ F<=B "success" ]

Type:        MDP
Modules:     robot goldcounter gemcounter 
Variables:   gold gem attacked x y required_gold required_gem 

---------------------------------------------------------------------

Model checking: "expsteps": R{"time_reward"}min=? [ F "success" ]
Model constants: GOLD_TO_COLLECT=100,GEM_TO_COLLECT=100,B=1300

Building model...
Model constants: GOLD_TO_COLLECT=100,GEM_TO_COLLECT=100,B=1300

Computing reachable states...

Reachability (BFS): 1215 iterations in 0.81 seconds (average 0.000667, setup 0.00)

Time for model construction: 0.792 seconds.

Type:        MDP
States:      958894 (1 initial)
Transitions: 3325526
Choices:     3080702

Transition matrix: 898 nodes (4 terminal), 3325526 minterms, vars: 23r/23c/4nd

Prob0A: 1203 iterations in 1.17 seconds (average 0.000973, setup 0.00)

Prob1E: 1204 iterations in 1.23 seconds (average 0.001025, setup 0.00)

Warning: PRISM hasn't checked for zero-reward loops.
Your minimum rewards may be too low...

goal = 94, inf = 0, maybe = 958800

Computing remaining rewards...
Switching engine since hybrid engine does yet support this computation...
Engine: Sparse

Building sparse matrix (transitions)... [n=958894, nc=3080400, nnz=3325200, k=4] [53.5 MB]
Building sparse matrix (transition rewards)... [n=958894, nc=3080400, nnz=0, k=4] [15.4 MB]
Creating vector for state rewards... [7.3 MB]
Creating vector for inf... [7.3 MB]
Allocating iteration vectors... [2 x 7.3 MB]
TOTAL: [98.1 MB]

Starting iterations...
Iteration 141: max relative diff=0.007092, 5.01 sec so far
Iteration 281: max relative diff=0.003559, 10.03 sec so far
Iteration 421: max relative diff=0.002375, 15.03 sec so far
Iteration 562: max relative diff=0.001779, 20.04 sec so far
Iteration 704: max relative diff=0.001420, 25.06 sec so far
Iteration 847: max relative diff=0.001181, 30.07 sec so far
Iteration 992: max relative diff=0.001008, 35.08 sec so far
Iteration 1139: max relative diff=0.000878, 40.09 sec so far
Iteration 1290: max relative diff=0.000443, 45.11 sec so far

Iterative method: 1369 iterations in 48.45 seconds (average 0.034848, setup 0.74)

Value in the initial state: 1292.5850850074933

Time for model checking: 50.86 seconds.

Result: 1292.5850850074933 (value in the initial state)


Overall running time: 52.186 seconds.

---------------------------------------------------------------------

Note: There was 1 warning during computation.